ppxscal/embedding_network huggingface dataset:
General language translation schemata
Authors: Peter Zilahy Ingerman
Venue: Communications of the ACM (1962)

In the past Backus Normal Form (BNF) has been defined only informally; however, a formal recognition definition has been evolved.
An Online Algorithm for Improving Performance in Navigation
Authors: Avrim Blum, Prasad Chalasani
Venue: SIAM Journal on Computing (2000)

We consider the following scenario. A point robot is placed at some start location s in a 2-dimensional scene containing oriented rectangular obstacles. The robot must repeatedly travel back and forth between s and a second location t in the scene. The robot knows the coordinates of s and t but initially knows nothing about the positions or sizes of the obstacles. It can only determine the obstacles' locations by bumping into them. We would like an intelligent strategy for the robot so that its trips between s and t both are relatively fast initially and improve as more trips are taken and more information is gathered.In this paper we describe an algorithm for this problem with the following guarantee: in the first $k \leq n$ trips, the average distance per trip is at most $O(\sqrt{n/k})$ times the length of the shortest s-t path in the scene, where n is the Euclidean distance between s and t. We also show a matching lower bound for deterministic strategies. These results generalize known bounds on the one-trip problem. Our algorithm is based on a novel method for making an optimal trade-off between search effort and the goodness of the path found. We improve this algorithm to a "smooth" variant having the property that for every $i \leq n,$ the robot's ith trip length is $O(\sqrt{n/i})$ times the shortest s-t path length.A key idea of this paper is a method for analyzing obstacle scenes using a tree structure that can be defined based on the positions of the obstacles.
A computer program for analysis of variance for a 2-level factorial design
Authors: Catherine Britton, I. F. Wagner
Venue: Communications of the ACM (1963)

Although many computer programs exist for handling analysis of variance, most of them employ the conventional methods described in statistics books for finding the sums of squares.
Switch-level fault coverage analysis for switch-capacitor systems
Authors: S. Mir, A. Rueda, D. Vázquez, J. L. Huertas
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

An approach to test optimization in switched-capacitor systems based on fault simulation at switch-level is presented in this paper. The advantage of fault simulation at this granularity level is that it facilitates test integration as early as possible in the design of these systems. Due to their mixed-signal nature, both catastrophic and parametric faults must indeed be considered for test optimization. Adequate switch-level fault models are presented. Test stimuli and test measures can be selected as a function of fault coverage. The impact of design parameters such as switch resistance on fault coverage is studied and design parts of poor testability are located.
Analysis of the availability of computer systems using computer-aided algebra
Authors: Rahul Chattergy, Udo W. Pooch
Venue: Communications of the ACM (1978)

Analytical results, related to the availability of a computer system constructed of unreliable processors, are presented in this paper. These results are obtained by using various computer-aided algebraic manipulation techniques. A major purpose of this paper is to demonstrate that the difficulties of obtaining analytical solutions to Markov processes can be considerably reduced by the application of symbol manipulation programs. Since many physical systems can be modeled by Markov and semi-Markov processes, the potential range of application of these techniques is much wider than the problem of availability analyzed here.
Multiple behavior module synthesis based on selective groupings
Authors: J.-H. Yi, H. Choi, I.-C. Park, S. H. Hwang, C.-M. Kyung
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper, we present an approach to synthesize multiple behavior modules. Given n DFGs to be implemented, the previous methods scheduled each of them sequentially, and implemented them as a single module. Though the method is appropriate for sharing the functional units, it ignored the following two aspects: 1) different interconnection patterns among DFGs can increase the interconnection area and delay of the critical path, 2) the sequential scheduling of DFGs has a difficulty in considering the effects on the other DFGs not scheduled yet. We show an efficient way to solve the problems using a selective grouping method and the extensions of the traditional scheduling methods. The experimentation reveals that the result obtained by the proposed method is better to reduce interconnection area and to meet the timing constraints than those obtained by the previous methods.
Organization of invalidation reports for energy-efficient cache invalidation in mobile environments
Authors: Kian-Lee Tan
Venue: Mobile Networks and Applications (2001)

In a wireless environment, mobile clients often cache frequently accessed data to reduce contention on the limited wireless bandwidth. However, it is difficult for clients to ascertain the validity of their cache content because of their frequent disconnection. One promising cache invalidation approach is the Bit-Sequences scheme that organizes invalidation reports as a set of binary bit sequences with an associated set of timestamps. The report is periodically broadcast by the server to clients listening to the communication channel. While the approach has been shown to be effective, it is not energy efficient as clients are expected to examine the entire invalidation report. In this paper, we examine the Bit-Sequences method and study different organizations of the invalidation report to facilitate clients to selectively tune to the portion of the report that are of interest to them. This allows the clients to minimize the power consumption when invalidating their cache content. We conducted extensive studies based on a simulation model. Our study shows that, compared to the Bit-Sequences approach, the proposed schemes are not only equally effectively in salvaging the cache content but are more efficient in energy utilization.
Detection of three-dimensional patterns of atoms in chemical structures
Authors: Arthur M. Lesk
Venue: Communications of the ACM (1979)

An algorithm for detecting occurrences of a three-dimensional pattern of objects within a larger structure is presented. The search technique presented uses the geometric structure of the pattern to define characteristics demanded of candidates for matching. This is useful in cases where the properties of each atom, considered individually, do not adequately limit the number of sets of possible matchings. Several applications of this technique in the field of chemistry are: (1) in pharmacology: searching for a common constellation of atoms in molecules possessing similar biological activities; (2) in X-ray crystallography: fitting a structure or a structural fragment to a set of peaks in the electron-density distribution of a Fourier map; (3) in chemical documentation: retrieving from a file the structures containing specified substructures.
Vertebral stress of a cervical spine model under dynamic load
Authors: Ali M. Sadegh, Abraham Tchako
Venue: Technology and Health Care (2000)

The objective of this study is to develop cervical spine models that predict the stresses in each vertebra by taking account of the biodynamic characteristics of the neck. The loads and the moments at the head point (Occipital Condyle) used for the models were determined by the rigid body dynamic response of the head due to G-z acceleration. The experimental data used were collected from the biodynamic responses of human volunteers during an acceleration in the z direction on the drop tower facility at Armstrong Laboratory at Wright Patterson Air Force Base (WPAFB). Three finite element models were developed: an elastic local model, viscoelastic local model and complete viscoelastic model. I-DEAS software was used to create the solid models, the loadings and the boundary conditions. Then, ABAQUS finite element software was employed to solve the models, and thus the stresses on each vertebral level were determined. Beam elements with different properties were employed to simulate the ligaments, articular facets and muscles. The complete viscoelastic model was subjected to 11 cases of loadings ranging from 8 G-z to 20 G-z accelerations. The von Mises and Maximum Principal stress fields, which are good indicators of bone failure, were calculated for all the cases. The results indicated that the maximum stress in all cases increased as the magnitude of the acceleration increased. The stresses in the 10 to 12 G-z cases were comfortably below the injury threshold level. The majority of the maximum stresses occurred in C6 and C4 regions.
Correspondence with Cumulative Similiarity Transforms
Authors: Trevor Darrell, Michele Covell
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

A local image transform based on cumulative similarity measures is defined and is shown to enable efficient correspondence and tracking near occluding boundaries. Unlike traditional methods, this transform allows correspondences to be found when the only contrast present is the occluding boundary itself and when the sign of contrast along the boundary is possibly reversed. The transform is based on the idea of a cumulative similarity measure which characterizes the shape of local image homogeneity; both the value of an image at a particular point and the shape of the region with locally similar and connected values is captured. This representation is insensitive to structure beyond an occluding boundary but is sensitive to the shape of the boundary itself, which is often an important cue. We show results comparing this method to traditional least-squares and robust correspondence matching.
Discovering information flow suing high dimensional conceptual space
Authors: Dawei Song, Peter Bruza
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

This paper presents an informational inference mechanism realized via the use of a high dimensional conceptual space. More specifically, we claim to have operationalized important aspects of Grdenforss recent three-level cognitive model. The connectionist level is primed with the Hyperspace Analogue to Language (HAL) algorithm which produces vector representations for use at the conceptual level. We show how inference at the symbolic level can be implemented by employing Barwise and Seligmans theory of information flow. This article also features heuristics for enhancing HAL-based representations via the use of quality properties, determining concept inclusion and computing concept composition. The worth of these heuristics in underpinning informational inference are demonstrated via a series of experiments. These experiments, though small in scale, show that informational inference proposed in this article has a very different character to the semantic associations produced by the Minkowski distance metric and concept similarity computed via the cosine coefficient. In short, informational inference generally uncovers concepts that are carried, or, in some cases, implied by another concept, (or combination of concepts).
Computing Orthogonal Drawings with the Minimum Number of Bends
Authors: Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
Venue: IEEE Transactions on Computers (2000)

We describe a branch-and-bound algorithm for computing an orthogonal grid drawing with the minimum number of bends of a biconnected planar graph. Such an algorithm is based on an efficient enumeration schema of the embeddings of a planar graph and on several new methods for computing lower bounds of the number of bends. We experiment with such algorithm on a large test suite and compare the results with the state-of-the-art. The experiments show the feasibility of the approach and also its limitations. Further, the experiments show how minimizing the number of bends has positive effects on other quality measures of the effectiveness of the drawing. We also present a new method for dealing with vertices of degree larger than four.
Efficient and tumble similar set retrieval
Authors: Aristides Gionis, Dimitrios Gunopulos, Nick Koudas
Venue: ACM SIGMOD Record (2001)

Set value attributes are a concise and natural way to model complex data sets. Modern Object Relational systems support set value attributes and allow various query capabilities on them. In this paper we initiate a formal study of indexing techniques for set value attributes based on similarity, for suitably defined notions of similarity between sets. Such techniques are necessary in modern applications such as recommendations through collaborative filtering and automated advertising. Our techniques are probabilistic and approximate in nature. As a design principle we create structures that make use of well known and widely used data structuring techniques, as a means to ease integration with existing infrastructure. We show how the problem of indexing a collection of sets based on similarity can be reduced to the problem of indexing suitably encoded (in a way that preserves similarity) binary vectors in Hamming space thus, reducing the problem to one of similarity query processing in Hamming space. Then, we introduce and analyze two data structure primitives that we use in cooperation to perform similarity query processing in a Hamming space. We show how the resulting indexing technique can be optimized for properties of interest by formulating constraint optimization problems based on the space one is willing to devote for indexing. Finally we present experimental results from a prototype implementation of our techniques using real life datasets exploring the accuracy and efficiency of our overall approach as well as the quality of our solutions to problems related to the optimization of the indexing scheme.
Still another use for FORTRAN II chaining
Authors: P. H. Arnold
Venue: Communications of the ACM (1965)

This is to report a further use of the FORTRAN II Chain System. We, at Sandia, have modified the Chain subroutine to allow for picking up chains from the disk instead of a chain tape. The major change was the addition of a job identification to each chain system, thus allowing for different chain jobs with the same chain number to be available from the disk at any time.
On coordination reduction and sentence analysis
Authors: Stanley R. Petrick, Paul M. Postal, Peter S. Rosenbaum
Venue: Communications of the ACM (1969)

A class of coordination phenomena in natural languages is considered within the framework of transformational theory. To account for these phenomena it is proposed that certain machinery be added to the syntactic component of a transformational grammar. This machinery includes certain rule schemata, the conditions under which they are to be applied, and conditions determining the sequence of subtrees on which they are to be performed. A solution to the syntactic analysis problem for this class of grammars is outlined. Precise specification of both the generative procedure of this paper and its inverse is given in the form of LISP function definitions.
Programming by questionnaire: an effective way to use decision tables
Authors: David W. Low
Venue: Communications of the ACM (1973)

Programming by questionnaire combines aspects of decision table programming and general purpose programming by using decision tables to construct an application program through the selection of certain source statements from a predefined file. It is proposed that programming by questionnaire is a useful compromise between general and special purpose programming for a significant class of large scale problems. The elements of the approach are discussed and an existing application is described.
Network assisted power control for wireless data
Authors: David Goodman, Narayan Mandayam
Venue: Mobile Networks and Applications (2001)

The cellular telephone success story prompts the wireless communications community to turn its attention to other information services, many of them in the category of &ldquo;wireless data&rdquo; communications. One lesson of cellular telephone network operation is that effective power control is essential to promote system quality and efficiency. In recent we have applied microeconomic theories to power control taking into account motions of utility and pricing. Our earlier work has shown that this new approach to power control for wireless data performs better than traditional techniques applied for voice signals. However, the operating points of such a strategy result in an unfair equilibrium in that users operate with unequal signal-to-interface ratios. Further, the power control algorithms required to achieve such operating points are more complex than the simple signal-to-interference ratio balancing algorithms for voice,. In this paper, we introduce a new concept, Network Assisted Power Control (NAPC) that maximizes utilities for users while maintaining equal signal-to-interference ratios for all users. The power control algorithm is easily implemented via signal-to-interference ratio balancing with the assistance of the network that broadcasts the common signal-to-interference ratio target.
Type-safe cast: (functional pearl)
Authors: Stephanie Weirich
Venue: ACM SIGPLAN Notices (2000)

In a language with non-parametric or ad-hoc polymorphism, it is possible to determine the identity of a type variable at run-time. With this facility, we can write a function to convert a term from one abstract type to another, if the two hidden types are identical. However, the naive implementation of this function requires that the term be destructed and rebuilt. In this paper, we show how to eliminate this overhead using higher-order type abstraction. We demonstrate this solution in two frameworks for ad-hoc polymorphism: intensional type analysis and type classes.
Discrete Kinetic Schemes for Multidimensional Systems of Conservation Laws
Authors: Denise Aregba-Driollet, Roberto Natalini
Venue: SIAM Journal on Numerical Analysis (2000)

We present here some numerical schemes for general multidimensional systems of conservation laws based on a class of discrete kinetic approximations, which includes the relaxation schemes by S. Jin and Z. Xin. These schemes have a simple formulation even in the multidimensional case and do not need the solution of the local Riemann problems. For these approximations we give a suitable multidimensional generalization of the Whitham's stability subcharacteristic condition. In the scalar multidimensional case we establish the rigorous convergence of the approximated solutions to the unique entropy solution of the equilibrium Cauchy problem.
A weighted buddy method for dynamic storage allocation
Authors: Kenneth K. Shen, James L. Peterson
Venue: Communications of the ACM (1974)

An extension of the buddy method, called the weighted buddy method, for dynamic storage allocation is presented. The weighted buddy method allows block sizes of 2k and 3&middot;2k, whereas the original buddy method allowed only block sizes of 2k. This extension is achieved at an additional cost of only two bits per block. Simulation results are presented which compare this method with the buddy method. These results indicate that, for a uniform request distribution, the buddy system has less total memory fragmentation than the weighted buddy algorithm. However, the total fragmentation is smaller for the weighted buddy method when the requests are for exponentially distributed block sizes.
Construction of fair surfaces over irregular meshes
Authors: Geir Westgaard, Horst Nowacki
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

This paper describes the process of constructing a fair, open or closed C1 surface over a given irregular curve mesh. The input to the surface construction consists of point and/or curve data which are individually marked to be interpolated or approximated and are arranged according to an arbitrary irregular curve mesh topology. The surface constructed from these data will minimize flexibly chosen fairness criteria. The set of available fairness criteria is able to measure surface characteristics related to curvature, variation of curvature and higher order surface derivatives based on integral functionals of quadratic form derived from the second, third and higher order parametric derivatives of the surface. The choice is based on the desired shape character. The construction of the surface begins with a midpoint refinement decomposition of the irregular mesh into aggregates of patch complexes in which the only remaining type of building block is the quadrilateral B&eacute;zier patch of degrees 4 by 4. The fairing process may be applied regionally or to the entire surface. The fair surface is built up either in a single global step or iteratively in a three stage local process, successively accounting for vertex, edge curve and patch interior continuity and fairness requirements. This surface fairing process will be illustrated by two main examples, a benchmark test performed on a topological cube, resulting in many varieties of fair shapes for a closed body, and a practical application to a ship hull surface for a modern container ship, which is subdivided into several local fairing regions with suitable transition pieces. The examples will demonstrate the capability of the fairing approach of contending with irregular mesh topologies, dealing with multiple regions, applying global and local fairing processes and will illustrate the influence of the choice of criteria upon the character of the resulting shapes.
Context-specific Bayesian clustering for gene expression data
Authors: Yoseph Barash, Nir Friedman
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

The recent growth in genomic data and measurement of genome-wide expression patterns allows to examine gene regulation by transcription factors using computational tools. In this work, we present a class of mathematical models that help in understanding the connections between transcription factors and functional classes of genes based on genetic and genomic data. These models represent the joint distribution of transcription factor binding sites and of expression levels of a gene in a single model. Learning a combined probability model of binding sites and expression patterns enables us to improve the clustering of the genes based on the discovery of putative binding sites and to detect which binding sites and experiments best characterize a cluster. To learn such models from data, we introduce a new search method that rapidly learns a model according to a Bayesian score. We evaluate our method on synthetic data as well as on real data and analyze the biological insights it provides.
Diagnosis Method Using &Delta;IDDQ Probabilistic Signatures: Theory and Results
Authors: Claude Thibeault
Venue: Journal of Electronic Testing: Theory and Applications (2000)

This paper presents a diagnostic method based on differential I_DDQ probabilistic signatures, inspired by telecommunications systems. The method and its unique features are described. Then, results from an IC monitor containing controllable faults show the capability of the method to diagnose actual activated faults, despite a strong experimental current standard variation. These results validate previous simulation procedures, which are applied to quantify effects not covered by the monitor experiment, that is, the effect of the load of a bridged node and the effect of the bridge resistance value. These experimental and simulation results reveal the robustness of the proposed diagnosis method, that has identified and located every single fault considered so far.