ppxscal/embedding_network huggingface dataset:
An Effective Implementation of Surface Tension Using the Marker and Cell Method for Axisymmetric and Planar Flows
Authors: Norberto Mangiavacchi, Antonio Castelo, Murilo F. Tomé, José A. Cuminato, Maria Luísa Bambozzi de Oliveira, Sean McKee
Venue: SIAM Journal on Scientific Computing (2005)

This work presents a method for simulating axisymmetric and planar free-surface flows dominated by surface tension forces. The surface tension effects are incorporated into the free surface boundary conditions through the computation of the capillary pressure. The required curvature is evaluated by fitting a least squares curve to the free surface using the tracking markers in the cell and in its close neighbors. To avoid short wavelength perturbations on the free surface, a mass-conserving local four-point stencil filter is employed. This filter is an extension of the trapezoidal subgrid undulations removal (TSUR) method. The TSUR technique consists of modifying the positions of two ``internal'' markers of the four-point stencil in such a way that the surface length and the curvature are minimized, while still preserving the volume. The computation of the curvature is modified at cells adjacent to solid boundaries in order to apply contact angle boundary conditions. To identify neighboring cells efficiently, an implementation is effected through a dual representation of the cell data: in addition to a matrix representation, a list structure is also employed which permits the representation of specific groups of cells and associated data. This technique was implemented in the GENSMAC code, and it has been proved to be robust. The code is shown to produce accurate results when compared with exact solutions of selected fluid dynamical problems involving surface tension. Additionally, it is demonstrated that the method is applicable to complex free-surface flows, such as containers filling, splashing drops, and bursting bubbles.
Towards enabling peer-to-peer Grids: Research Articles
Authors: Geoffrey Fox, Shrideep Pallickara, Xi Rao
Venue: Concurrency and Computation: Practice Experience (2005)

In this paper we propose a peer-to-peer (P2P) Grid comprising resources such as relatively static clients, high-end resources and a dynamic collection of multiple P2P subsystems. We investigate the architecture of the messaging and event service that will support such a hybrid environment. We designed a distributed publish&ndash;subscribe system NaradaBrokering for XML-specified messages. NaradaBrokering provides support for centralized, distributed and P2P (via JXTA) interactions. Here we investigate and present our strategy for the integration of JXTA into NaradaBrokering. The resultant system naturally scales with multiple Peer Groups linked by NaradaBrokering. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Spherical Harmonic Descriptor for Gray-Level Image Similarity Matching
Authors: Zhi-yong Zhang, Zhi-geng Pan, Ming min Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, we present a new spherical harmonics-based descriptor for matching the shape similarity between two gray-level images. We describe the properties of this descriptor and show how it can be applied to match the shape similarity between two gray-level images. The advantages of this descriptor are two-fold: First, spherical harmonic descriptor is invariant to rotation. Second, spherical harmonic descriptor is a 3D descriptor, which in turn makes comparing two gray-level images more efficient
PMAC: An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks
Authors: Tao Zheng, Sridhar Radhakrishnan, Venkatesh Sarangan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

We propose a novel adaptive MAC protocol for wireless sensor networks. In existingprotocols such as SMAC, the sensor nodes are put to sleep periodically to save energy. As the duty cycle is fixed in such protocols, the network throughput can degrade under heavy traffic, while under light loads, unwanted energy consumption can occur. In the proposed Pattern-MAC (PMAC) protocol, instead of having fixed sleepwakeups, the sleep-wakeup schedules of the sensor nodes are adaptively determined. The schedules are decided based on a node's own traffic and that of its neighbors. Our analytical and experimental results show that in comparison to SMAC, PMAC achieves more power savings under light loads, and higher throughput under heavier traffic loads. Furthermore, unlike SMAC, only the sensor nodes involved in communication wake up frequently in PMAC and hence energy is conserved in other sensor nodes.
A Secure and Efficient Voter-Controlled Anonymous Election Scheme
Authors: Thomas E. Carroll, Daniel Grosu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

We propose an electronic voting (e-voting) scheme that combines user-centric mix networks with voter-verifiable receipts. Unlike traditional mixnet-based e-voting schemes, our scheme empowers voters; the voters themselves decide the degree of anonymity required. Voters requiring a greater degree of anonymity obtain it by performing several protocol iterations. The proposed scheme utilizes incoercible, voter-verifiable receipts. It is robust as no reasonable-sized coalition can interfere with the correct operation. Finally, it is efficient as the number of transmitted messages increases linearly with the number of voters.
Fingerprint Enhancement Based on Edge-Directed Diffusion
Authors: Xie Meihua, Wang Zhengming
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper puts forward a new edge-directed forward and backward anisotropic diffusion model for texture enhancement and edge sharpening of image. Since forward and backward diffusion cannot hold flow-like edges, and coherence enhancement diffusion cannot sharpen edges, our new model gets a new diffusivity, which combine the merits of these two methods. The new model adapts an image structure tensor like coherence enhancement diffusion for edge orientation, and defines eigenvalues based on edge orientation such that the new tensor has positive diffusivity in edge direction and negative diffusivity in gradient direction. Both theory analysis and numerical results show that the new model has better enhancement result than coherence enhancing diffusion and forward and backward diffusion.
On some self-dual codes and unimodular lattices in dimension 48
Authors: Masaaki Harada, Masaaki Kitazume, Akihiro Munemasa, Boris Venkov
Venue: European Journal of Combinatorics (2005)

In this paper, binary extremal self-dual codes of length 48 and extremal unimodular lattices in dimension 48 are studied through their shadows and neighbors. We relate an extremal singly even self-dual [48, 24, 10] code whose shadow has minimum weight 4 to an extremal doubly even self-dual [48, 24, 12] code. It is also shown that an extremal odd unimodular lattice in dimension 48 whose shadow has minimum norm 2 relates to an extremal even unimodular lattice. Extremal singly even self-dual [48, 24, 10] codes with shadows of minimum weight 8 and extremal odd unimodular lattice in dimension 48 with shadows of minimum norm 4 are investigated.
Interoperability of CABRI services and biochemical pathways databases: Conference Reviews
Authors: Paolo Romano, Ottavia Aresu, Maria Assunta Manniello, Barbara Parodi
Venue: Comparative and Functional Genomics (2004)

Common Access to Biological Resources and Information (CABRI) service is a &lsquo;one-stop-shop&rsquo; for materials that are collected by a number of European culture collections that engage themselves in a quality service for the scientific community by adhering to Quality Guidelines for the management of resources and related information. It includes collections' catalogues that can be searched in an SRS implementation. A simple search facility, including a synonym search and a shopping cart, is also available. Within the European Biological Resource Centres Network (EBRCN) project, an extension and improvement of the catalogues' information is under way. This includes adding links to bibliographic databanks and sequence databases. Revision of &lsquo;in-house&rsquo; controlled vocabularies used by data annotators is under way, in order to improve the setting up of external links, and new links to biochemical pathways databases are being set up for some of the catalogues. Copyright &copy; 2004 John Wiley & Sons, Ltd.
On Silicon-Based Speed Path Identification
Authors: Leonard Lee, Li-C. Wang, Praveen Parvathala, T. M. Mak
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

Speed path identification is an indispensable step for pushing the design timing wall and for developing the final speed binning strategy in production test. For complex high-performance designs, pre-silicon timing tools have so far not been able to deliver satisfactory results in predicting the actual speed limiting paths on the silicon. The actual speed paths are mostly uncovered through test and silicon debug, where tremendous manual effort is involved. This paper presents a novel approach as the first step for automating the speed path identification process. Our approach is silicon-based, meaning that timing information is extracted through testing of silicon sample chips. We call this step silicon learning. Based on silicon learning, we present an iterative flow for speed path identification. Experimental results are presented to explain the new methodologies and to demonstrate the effectiveness of our techniques.
Adaptive Multi-path On-Demand Routing in Mobile Ad Hoc Networks
Authors: Wajahat Mateen, Saqib Raza, Zartash A. Uzmi, Shahab Baqai
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

We present AMOR, a new scheme for on-demand routing in wireless ad hoc networks. In ad hoc networks, mobile nodes are connected to each other such that the connection pattern changes dynamically with the mobility of nodes. Therefore, classical table driven routing algorithms necessitate updated network state information to be periodically disseminated, and incur significant costs in terms of network utilization, memory, and associated update-processing. In contrast, on-demand routing algorithms do not maintain pre-computed routes and real time route discovery ensues when data traffic needs to be transmitted between a source-destination pair. AMOR employs a modified version of the Dynamic Source Routing protocol to discover multiple node-disjoint paths between a source-destination pair. A key feature of AMOR is that instead of computing minimum-hop paths, it computes paths such that a measure of the 'transmission reliability', namely ETX, between the source-destination pair is optimized. Furthermore, AMOR employs a real time loading algorithm that optimally load balances traffic across multiple paths. The control traffic overhead in AMOR is comparable to that of single-path on-demand protocols. We present analytical throughput results in a simplified AMOR model of a network of multi-radio nodes. We also conduct simulation experiments to study the throughput performance of the AMOR scheme in a network of single-radio nodes. Our results show that AMOR outperforms the traditional Dynamic Source Routing algorithm.
Using information retrieval techniques for supporting data mining
Authors: Ioannis N. Kouris, Christos H. Makris, Athanasios K. Tsakalidis
Venue: Data Knowledge Engineering (2005)

The classic two-stepped approach of the Apriori algorithm and its descendants, which consisted of finding all large itemsets and then using these itemsets to generate all association rules has worked well for certain categories of data. Nevertheless for many other data types this approach shows highly degraded performance and proves rather inefficient.We argue that we need to search all the search space of candidate itemsets but rather let the database unveil its secrets as the customers use it. We propose a system that does not merely scan all possible combinations of the itemsets, but rather acts like a search engine specifically implemented for making recommendations to the customers using techniques borrowed from Information Retrieval.
Integrated Scheduling of Production and Distribution Operations
Authors: Zhi-Long Chen, George L. Vairaktarakis
Venue: Management Science (2005)

Motivated by applications in the computer and food catering service industries, we study an integrated scheduling model of production and distribution operations. In this model, a set of jobs (i.e., customer orders) are first processed in a processing facility (e.g., manufacturing plant or service center) and then delivered to the customers directly without intermediate inventory. The problem is to find a joint schedule of production and distribution such that an objective function that takes into account both customer service level and total distribution cost is optimized. Customer service level is measured by a function of the times when the jobs are delivered to the customers. The distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment. We study two classes of problems under this integrated scheduling model. In the first class of problems, customer service is measured by the average time when the jobs are delivered to the customers; in the second class, customer service is measured by the maximum time when the jobs are delivered to the customers. Two machine configurations in the processing facility--single machine and parallel machine--are considered. For each of the problems studied, we provide an efficient exact algorithm, or a proof of intractability accompanied by a heuristic algorithm with worst-case and asymptotic performance analysis. Computational experiments demonstrate that the heuristics developed are capable of generating near-optimal solutions. We also investigate the possible benefit of using the proposed integrated model relative to a sequential model where production and distribution operations are scheduled sequentially and separately. Computational tests show that in many cases a significant benefit can be achieved by integration.
Pseudo-Line Arrangements: Duality, Algorithms, and Applications
Authors: Pankaj K. Agarwal, Micha Sharir
Venue: SIAM Journal on Computing (2005)

A finite collection of x-monotone unbounded Jordan curves in the plane is called a family of pseudo-lines if every pair of curves intersect in at most one point, and the two curves cross each other there. Let L be such a collection of n pseudo-lines, and let P be a set of m points in $\reals^2$. Extending a result of Goodman [Discrete Math., 32 (1980), pp. 27--35], we define a duality transform that maps L to a set L* of points in $\reals^2$ and P to a set P* of (x-monotone) pseudo-lines in $\reals^2$, so that the incidence and the "above-below" relations between the points and the pseudo-lines are preserved. We present an efficient algorithm for computing the dual arrangement {\eus A}$(P^*)$ under an appropriate model of computation. We also present a dynamic data structure for reporting, in $O(m^\eps + k)$ time, all k points of P that lie below a query arc, which is either a circular arc or a portion of the graph of a polynomial of fixed degree. This result is needed for computing the dual arrangement for certain classes of pseudo-lines arising in several applications, but is also interesting in its own right. We present a few applications of our dual arrangement algorithm, such as computing incidences between points and pseudo-lines and computing a subset of faces in a pseudo-line arrangement.Next, we present an efficient algorithm for cutting a set of circles into arcs so that every pair of arcs intersect in at most one point, i.e., the resulting arcs constitute a collection of pseudo-segments. By combining this algorithm with our algorithm for computing the dual arrangement of pseudo-lines, we obtain efficient algorithms for several problems involving arrangements of circles or circular arcs, such as reporting or counting incidences between points and circles and computing a set of marked faces in arrangements of circles.
A Model-Driven Performance Analysis Framework for Distributed, Performance-Sensitive Software Systems
Authors: Swapna S. Gokhale, Aniruddha Gokhale, Jeffrey Gray
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

Large-scale, distributed, performance-sensitive software (DPSS) systems from the basis of mission- and often safetycritical applications. DPSS systems comprise of many independent artifacts, such as network/bus interconnects, many coordinated local and remote endsystems, and multiple layers of software. DPSS systems demand multiple, simultaneous predictable performance requirements such as end-to-end latencies, throughput, reliability and security, while also requiring the ability to control and adapt operating characteristics for applications with respect to such features as time, quantity of information, and quality of service (QoS) properties including predictability, controllability, and adaptability of operating characteristics for applications with respect to such features as time, quantity of information, accuracy, confidence and synchronization. All these issues become highly volatile in large-scale DPSS systems due to the dynamic interplay of the many interconnected parts that are often constructed from smaller parts.
Approximate string matching with ordered q-grams
Authors: E. Sutinen, J. Tarhio
Venue: Nordic Journal of Computing (2004)

Approximate string matching with k differences is considered. Filtration of the text is a widely adopted technique to reduce the text area processed by dynamic programming. We present sublinear filtration algorithms based on the locations of q-grams in the pattern. Samples of q-grams are drawn from the text at fixed periods, and only if consecutive samples appear in the pattern approximately in the same configuration, the text area is examined with dynamic programming. The algorithm LEQ searches for exact occurrences of the pattern q-grams, whereas the algorithm LAQ searches for approximate occurrences of them. In addition, a static variation of LEQ is presented. The focus of the paper is on combinatorial properties of the sampling approach.
Programming C#
Authors: Jesse Liberty
Venue:  (2005)

Programming C#, the top selling book on Microsoft's high-performance C# programming language, is now in its fourth edition. Aimed at experienced programmers and web developers, this comprehensive guide focuses on the features and programming patterns that are new to C#, and fundamental to the programming of web services and web applications on Microsoft's .NET platform.
Modeling and rendering viscous liquids: Research Articles
Authors: Kevin Steele, David Cline, Parris K. Egbert, Jonathan Dinerstein
Venue: Computer Animation and Virtual Worlds (2004)

We present a particle-based algorithm for modeling highly viscous liquids. Using a numerical time-integration of particle acceleration and velocity, we apply external forces to particles and use a convenient organization, the adhesion matrix, to represent forces between different types of liquids and objects. Viscosity is handled by performing a momentum exchange between particle pairs such that momentum is conserved. Volume is maintained by iteratively adjusting particle positions after each time step. We use a two-tiered approach to time stepping that allows particle positions to be updated many times per frame while expensive operations, such as calculating viscosity and adhesion, are done only a few times per frame. The liquid is rendered using an implicit surface polygonization algorithm, and we present an implicit function that convolves the liquid surface with a Gaussian function, yielding a smooth liquid skin. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Fine grain performance evaluation of e-commerce sites
Authors: Mauro Andreolini, Michele Colajanni, Riccardo Lancellotti, Francesca Mazzoni
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

E-commerce sites are still a reference for the Web technology in terms of complexity and performance requirements, including availability and scalability. In this paper we show that a coarse grain analysis, that is used in most performance studies, may lead to incomplete or false deductions about the behavior of the hardware and software components supporting e-commerce sites. Through a fine grain performance evaluation of a medium size e-commerce site, we find some interesting results that demonstrate the importance of an analysis approach that is carried out at the software function level with the combination of distribution oriented metrics instead of average values.
Capturing and viewing media on the treo 650 smartphone and tungsten T5 handheld
Authors: Keith Saft
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Today digital photographs and videos are everywhere: on our computers, on our cell phones, on our PDAs. As palmOne releases new smartphones and handheld devices, we continually look for ways to make the experience of capturing, viewing, managing and sharing photos and videos easier, more enjoyable, and more integral to the overall user experience. This paper discusses the release of the latest version of the palmOne media applications for the Treo 650 and Tungsten T5. It steps through the 9-month development process and highlights many of the 'transparent' interactions that make the software compelling and simple to use.
Collaboration, conflict and control: report on the 4th workshop on open source software engineering
Authors: Joseph Feller, Brian Fitzgerald, Scott Hissam, Karim Lakhani
Venue: ACM SIGSOFT Software Engineering Notes (2005)

Building on the success of the first three workshops in the series, which were held at ICSE 2001 (Toronto), ICSE 2002 (Orlando) and ICSE 2003 (Portland), the 4th Workshop on Open Source Software Engineering, ("Collaboration, Conflict and Control") brought together researchers and practitioners for the purpose of discussing the platforms and tools, techniques and processes, and the organizational structures that are used to support and sustain communication, collaboration and conflict resolution within and between open source software communities.
Efficient Creation and Incremental Maintenance of the HOPI Index for Complex XML Document Collections
Authors: Ralf Schenkel, Anja Theobald, Gerhard Weikum
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

The HOPI index, a connection index for XML documents based on the concept of a 2-hop cover, provides space- and time-efficient reachability tests along the ancestor, descendant, and link axes to support path expressions with wildcards in XML search engines. This paper presents enhanced algorithms for building HOPI, shows how to augment the index with distance information, and discusses incremental index maintenance. Our experiments show substantial improvements over the existing divide-and-conquer algorithm for index creation, low space overhead for including distance information in the index, and efficient updates.