ppxscal/embedding_network huggingface dataset:
The Influence of Concurrent Process Duplication on the Performance of Parallel Applications Executing on COWs
Authors: Michael Hobbs, Andrzej Goscinski
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

The benefits gained from utilizing Clusters of Workstations (COWs) as architectures for parallel processing are well known with such systems being a common sight throughout many organizations. COWs are able to present users and application programmers with a considerable computational resource for a relatively low cost. Unfortunately, the software currently used to support the application programmer in the development and execution of their parallel programs is often limited and lacks transparency. The initialization stage of a parallel program can prove critical in obtaining good performance and engaging programmers, especially as the number of parallel processes increases. The focus of this paper is to present a unique process instantiation service that allows a set of parallel child processes to be concurrently duplicated across a COW through the use of group process migration and group communication services. The importance and impact that this process duplication service has on some common parallel applications is presented and detailed.
Evaluating Software Deployment Languages and Schema
Authors: Richard S. Hall, Dennis M. Heimbigner, Alexander L. Wolf
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Software distribution is evolving from a physical media approach to one where it is practical and advantageous to leverage the connectivity of networks. Network distribution of software systems provides timeliness and continuity of evolution not possible with physical media distribution methods. To support network-based software distribution, companies and organizations such as Microsoft, Marimba, and the Desktop Management Task Force (DMTF) are strengthening their efforts to package software systems in a way that is conducive to network distribution and management. The result of these efforts has led to the creation of software description languages and schema such as the Open Software Description format created by Microsoft and Marimba and the Management Information Format created by DMTF. While these efforts are steps in the right direction, they do not address deployment issues in a complete and systematic fashion. The contribution of this paper is to evaluate these leading software description technologies.
Language Features for Process Interaction and Access Control
Authors: James R. McGraw
Venue:  (1977)

NO SUPPLIED
An empirical study on retrieval models for different document genres: patents and newspaper articles
Authors: Makoto Iwayama, Atsushi Fujii, Noriko Kando, Yuzo Marukawa
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Reflecting the rapid growth in the utilization of large test collections for information retrieval since the 1990s, extensive comparative experiments have been performed to explore the effectiveness of various retrieval models. However, most collections were intended for retrieving newspaper articles and technical abstracts. In this paper, we describe the process of producing a test collection for patent retrieval, the NTCIR-3 Patent Retrieval Collection, which includes two years of Japanese patent applications and 31 topics produced by professional patent searchers. We also report experimental results obtained by using this collection to re-examine the effectiveness of existing retrieval models in the context of patent retrieval. The relative superiority among existing retrieval models did not significantly differ depending on the document genre, that is, patents and newspaper articles. Issues related to patent retrieval are also discussed.
Matrix-Matrix Multiplication on Heterogeneous Platforms
Authors: Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous networks of workstations, and collections of heterogeneous clusters. Intuitively, the problem is to load balance the work with different-speed resources while minimizing the communication volume. We formally state this problem and prove its NP-completeness. Next, we introduce a (polynomial) column-based heuristic, which turns out to be very satisfactory: we derive a theoretical performance guarantee for the heuristic, and we assess its practical usefulness through MPI experiments.
The rationale for software wrapping
Authors: H. M. Sneed
Venue: Proceedings of the International Conference on Software Maintenance (1997)

The pressure to replace legacy software systems is growing. It is becoming increasingly difficult to fulfil the requirements of a heterogeneous, distributed business world with centralized, monolithic host-based software systems. The author considers software wrapping where old code is left in its native environment and is connected to the new object-oriented software by an API or a CORBA type interface. It is possible to define business objects on the client side while using existing mainframe batch programs and online transactions on the server side as methods.
Semi-Regular Mesh Extraction from Volumes
Authors: Zoe J Wood
Venue:  (2000)

We present a novel method to extract iso-surfaces from distance volumes. It generates high quality semi-regular multiresolution meshes of arbitrary topology. Our technique proceeds in two stages. First, a very coarse mesh with guaranteed topology is extracted. Subsequently an iterative multi-scale force-based solver refines the initial mesh into a semi-regular mesh with geometrically adaptive sampling rate and good aspect ratio triangles. The coarse mesh extraction is performed using a new approach we call surface wavefront propagation. Given a source voxel of the iso-surface, a set of discrete iso-distance rings are rapidly built and connected while respecting the topology of the iso-surface implied by the data. Subsequent multi-scale refinement is driven by a simple force-based solver designed to combine good iso-surface fit and high quality sampling through reparameterization. In contrast to the Marching Cubes technique our output meshes adapt gracefully to the iso-surface geometry, have a natural multiresolution structure and good aspect ratio triangles, as demonstrated with a number of examples.
Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers
Authors: Zhe Wu, Benjamin W. Wah
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper, we present improved strategies in DLM-99-SAT to escape from traps and to select proper parameter sets to use when applied to solve some difficult but satisfiable SAT problems. One of the main issues in DLM-99-SAT is that it has a large number of tune-able parameters, making it difficult to determine the best parameters to use when given a new instance. To this end, we propose a set of performance metrics and a set of rules using these metrics that determine at run time the best parameters to use for a specific instance. Our experimental results show that these rules are able to select the most suitable parameter set for each instance with very little overhead. Finally, we verify the performance of DLM-99-SAT by solving some benchmarks in SATLIB and some of the most difficult but satisfiable DIMACS SAT problems, including par32-1-c to par32-4-c and hanoi4-simple.
Dead Timestamp Identification in Stampede
Authors: Nissim Harel, Hasnain A. Mandviwala, Kath Knobe, Umakishore Ramachandran
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Stampede is a parallel programming system to support computationally demanding applications including interactive vision, speech and multimedia collaboration. The system alleviates concerns such as communication, synchronization,and buffer management in programming such real-time stream-oriented applications. Threads are loosely connected by channels that hold timestamped data items. There are two performance concerns when programming with Stampede. The first is space, namely, ensuring that memory is not wasted on items that are not fully processed. The second is time, namely, ensuring that processing resource is not wasted on a timestamp that is not fully processed. In this paper we introduce a single unifying framework, dead timestamp identification, that addresses both the space and time concerns simultaneously. Dead timestamps on a channel represent garbage. Dead timestamps at athread represent computations that need not be performed. This framework has been implemented in the Stampede system. Experimental results showing the space advantage ofthis framework are presented. Using a color-based people tracker application, we show that the space advantage can be significant (up to 40%) compared to the previous garbage collection techniques in Stampede.
Dictionary of Photography and Digital Imaging: The Essential Reference for the Modern Photographer
Authors: Tom Ang
Venue:  (2002)

:Here is the most up-to-date, comprehensive, and authoritative reference guide available in the rapidly developing and constantly expanding area of digital imaging. Easily accessible for the amateur, yet technical and detailed enough for a professional photographer, this reference features over 2,100 in-depth entries and is packed with cross-references, multiple levels of word entry, and dozens of sidebars offering additional explanations and useful information. For aspiring photographers, graphic artists, professional photographers, and anyone else concerned with capturing images and using digital technology to scan, manipulate, and publish them, The Dictionary of Photography and Digital Imaging is an essential addition to the bookshelf. About the author Tom Ang has worked as a technical editor and picture editor on numerous magazines. His own photography -- both digital and traditional -- has been widely exhibited. The author of The Tao of Photography and Silver Pixels, he is a senior lecturer at the University of Westminster. Mr. Ang lives in London.
OODB Indexing by Class-Division
Authors: Sridhar Ramaswamy, Paris C. Kanellakis
Venue:  (1995)

Indexing a class hierarchy, in order to efficiently search or update the objects of a class according to a (range of) value(s) of an attribute, impacts OODB performance heavily. For this indexing problem, most systems use the class hierarchy index (CH) technique of [. Kim Dale .] implemented using B+-trees. Other techniques, such as those of [. Low Ooi , hcC-tree , CG-tree .], can lead to improved average-case performance but involve the implementation of new data-structures. As a special form of external dynamic two-dimensional range searching, this OODB indexing problem is solvable within reasonable worst-case bounds [. pods93 .]. Based on this insight, we have developed a technique, called indexing by class-division (CD), which we believe can be used as a practical alternative to CH. We present an optimized implementation and experimental validation of CD''s average-case performance. The main advantages of the CD technique are: (1) CD is an extension of CH that provides a significant speed-up over CH for a wide spectrum of range queries---this speed-up is at least linear in the number of classes queried for uniform data and larger otherwise; and (2) CD queries, updates and concurrent use are implementable using existing B+-tree technology. The basic idea of class-division involves a time-space tradeoff and CD requires some space and update overhead in comparison to CH. In practice, this overhead is a small factor (2 to 3) and, in worst-case, is bounded by the depth of the hierarchy and the logarithm of its size.
Robust software via agent-based redundancy
Authors: Michael N. Huhns, Vance T. Holderfield, Rosa Laura Zavala Gutierrez
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes how multiagent systems can be used to achieve robust software. The paper develops the hypothesis that robust software can be achieved through redundancy, where agents that have different algorithms but similar responsibilities provide the redundancy. Wrapping conventional algorithms with a minimal set of agent capabilities, which we specify, produces the agents. We show that the same wrapper can be used for a variety of algorithms. We describe our initial experiments in verifying our hypothesis and present results that demonstrate an improvement in robustness due to redundancy.
Efficient Algorithms for Protein Sequence Design and the Analysis of Certain Evolutionary Fitness Landscapes
Authors: Jon Kleinberg
Venue:  (1998)

Protein sequence design is a natural inverse problem to protein structure prediction: given a target structure in three dimensions, we wish to design an amino acid sequence that is likely fold to it. A model of Sun, Brem, Chan, and Dill casts this problem as an optimization on a space of sequences of hydrophobic (H) and polar (P) monomers; the goal is to find a sequence which achieves a dense hydrophobic core with few solvent-exposed hydrophobic residues. Sun et al. developed a heuristic method to search the space of sequences, without a guarantee of optimality or near-optimality; Hart subsequently raised the computational tractability of constructing an optimal sequence in this model as an open question. Here we resolve this question by providing an efficient algorithm to construct optimal sequences; our algorithm has a polynomial running time, and performs very efficiently in practice. We illustrate the implementation of our method on structures drawn from the Protein Data Bank. We also consider extensions of the model to larger amino acid alphabets, as a way to overcome the limitations of the binary H/P alphabet. We show that for a natural class of arbitrarily large alphabets, it remains possible to design optimal sequences efficiently. Finally, we analyze some of the consequences of this sequence design model for the study of evolutionary fitness landscapes. A given target structure may have many sequences that are optimal in the model of Sun et al.; following a notion raised by the work of J. Maynard Smith, we can ask whether these optimal sequences are ``connected'''' by successive point mutations. We provide a polynomial-time algorithm to decide this connectedness property, relative to a given target structure. We develop the algorithm by first solving an analogous problem expressed in terms of submodular functions, a fundamental object of study in combinatorial optimization.
An Engine for the 3D Visualization of Program Information
Authors: Steven P. Reiss
Venue:  (1995)

We have a project currently underway that attempts to use 3D workstations to provide insight into programs, their structure and their execution, through the use of a variety of user-definable displays. We offer a variety of different presentation styles and utilize a variety of different layout methods and heuristics. This paper describes the underlying engine that we have developed to support this range of presentations.
Time-Domain Simulation of Variational Interconnect Models
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The interconnect parameter variations are more significant in the nanometer regime due to the increase in relative tolerances for upcoming integration technologies. As several variability studies indicate the significant role of the interconnect on system performance, the analysis of linear models is extremely crucial. Contrary to devices, the extreme case scenarios do not apply for context-dependent interconnect necessitating statistical analysis frameworks. A previously proposed approach to represent interconnect models in terms of global interconnect parameters is highly required in such frameworks. In this paper, we present efficient ways of simulating these variational interconnect models in the presence of nonlinear devices. We demonstrate our methodology by incorporating variational interconnect models into transistor-level simulation with accurate nonlinear device models.
Script: a communication abstraction mechanism
Authors: Nissim Francez, Brent Hailpern
Venue: ACM SIGOPS Operating Systems Review (1985)

In this paper, we introduce a new abstraction mechanism, called a script, which hides the low-level details that implement patterns of communication. A script localizes the communication between a set of roles (formal processes), to which actual processes enroll in order to participate in the action of the script. The paper discusses the addition of scripts to the languages CSP and Ada, as well as to a shared-variable language with monitors.
Collapsing partial combinatory algebras
Authors: Inge Bethke, Jan W Klop
Venue:  (1995)

Partial combinatory algebras occur regularly in the literature as a framework for an abstract formulation of computation theory or recursion theory. In this paper we develop some general theory concerning homomorphic images (or collapses) of pca''s, obtained by identification of elements in a pca. We establish several facts concerning final collapses (maximal identification of elements). `En passant'' we find another example of a pca that cannot be extended to a total one.
F-TRIA01: A Fast Bipolar Transimpedance Amplifier
Authors: Ayachi Mohsen
Venue: Analog Integrated Circuits and Signal Processing (2003)

This paper describes a new transimpedance amplifier for fast current pulses delivered by high energy particle detectors. The choice of a bipolar technology allowed a 100&Omega; low input impedance and a rise time down to 1 nS. The fully differential current mode architecture provides an excellent linearity and a large versatility as for its transimpedance, bandwidth and power consumption.
Minimal Forward Checking with Backmarking and Conflict-Directed Backjumping
Authors: A. C. M. Kwan, E. P. K. Tsang
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Recently Dent and Mercer have introduced an algorithm called minimal forward checking (MFC) which always performs no worse than forward checking (FC) in terms of number of compatibility checks and node expanded given the same variable and value orderings. In this paper we describe an algorithm which extends MFC with backmarking and conflict-directed backtracking. The new algorithm has a smaller space complexity' than MFC. Experiments were conducted to compare it with MFC and some regular FC based algorithms. The results show that the new algorithm always performs at least as good as its "non-lazy" counterpart. It outperforms MFC on average and its edge over MFC is particularly clear for problems near to phase transitions. Interestingly, the minimum width variable ordering heuristic appears to be a better choice than the fail-first heuristic for the new algorithm in many occasions, particularly for sparsely constrainedproblems.
Problem Analysis for the Biological Systems Information Carriers Models Design
Authors: Alexandr P. Kamyshanov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Problems of our days accepted models for data transmit processes in biological systems are dicussed. In these models created by biologists synthesised protein molecules are defined as information carriers. Such approach puts on difficult problems for physicists, chemists and information theory researchers.According physical and chemical models protein molecules synthesis processes are realizing in condition of the interacting atoms, molecules and surrounding them particulars chaotic heat move. Chemical principles confirm that interaction between atoms and molecules are possible by contact of their definite structured electron covers. Modern quantum physic cann't determinate three-dimension structures nor for the atoms nor for the complex molecules electron covers.These model disadjustments put on the problems for information theory researchers. Their attempts to consider proteins molecules as information carriers cause seriouse difficulties. Great obstacles appear for the model design of the reliable, high informatical and noiseprotecting data transmit process in biological systems.
Selective Partial Access to a Database
Authors: Richard W. Conway, David Strip
Venue:  (1976)

NO SUPPLIED
On the contributions of Helena Rasiowa to mathematical logic
Authors: J. M. Font
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Summarizes the central aspects of the contributions of Helena Rasiowa (1917-1994) to the more traditional or classical part of Mathematical Logic. One could reasonably argue that all her original research properly belongs to Mathematical Logic, more precisely to the sub-field of Algebraic Logic. As a natural consequence of her previous work on non-classical logics, in the seventies she began to study several logics motivated by computational questions, but still the spirit of her original contributions retained the same algebraic flavour. Even the introductory book (1973) bears this mark: it contains elementary set theory with special attention to ordered sets, mathematical logic, and abstract algebra.
A New Cache Directory Scheme
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper proposes a new directory scheme with a balanced binary-tree structure that dynamically changes with current data sharing. It is scalable in allowing an unlimited number of caches to share the same data block, and can carry out coherence operations quickly, i.e., in logarithmic time. This scheme is especially appropriate for update-oriented coherence protocols where the sharing structure is preserved across writes. We demonstrate how the tree directories handle cache addition (a cache acquiring a data block copy) and cache deletion (a cache surrendering a data block copy due to its local block replacement), and present their respective time complexities. It can be shown that this kind of tree structure is an asymptotically optimal directory scheme for scalable architectures, carrying out all cache operations in minimum possible time.
Optimal Routing for Distributed Computing Systems with Data Replication
Authors: P. Y. Chang, D. J. Chen
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

In a Distributed Computing System (DCS), data files are often replicated several copies and stored on different computers to improve reliability and availability. The particular program and the data files required for its execution may thus be placed on different nodes. Successfully executing the program, however, often requires the access of data files from remote machines. Thus, the program execution time is affected by the constraint of communication capacity. Optimal routing thus becomes an important research goal. If data are not replicated, the problem of optimal routing is essentially a multi-commodity flow problem and can be solved by linear programming technique. When the data are replicated, the program can read the data from any replicas. Reads from replicas on different nodes will results in different transmission time. An exhaustive approach could of course find the optimal solution. However, this approach has a high computation price. In this paper, we propose a method that can effectively decide the optimal traffic routing. Examples are provided to demonstrate the applicability of the proposed algorithm. Results obtained from the proposed algorithm are encouraging.