ppxscal/embedding_network huggingface dataset:
A formal specification of Java class loading
Authors: Zhenyu Qian, Allen Goldberg, Alessandro Coglio
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

The Java Virtual Machine (JVM) has a novel and powerful mechanism to support lazy, dynamic class loading according to user-definable policies. Class loading directly impacts type safety, on which the security of Java applications is based. Conceptual bugs in the loading mechanism were found in earlier versions of the JVM that lead to type violations. A deeper understanding of the class loading mechanism, through such means as formal analysis, will improve our confidence that no additional bugs are present.The work presented in this paper provides a formal specification of (the relevant aspects of) class loading in the JVM and proves its type safety. Our approach to proving type safety is different from the usual ones since classes are dynamically loaded and full type information may not be statically available. In addition, we propose an improvement in the interaction between class loading and bytecode verification, which is cleaner and enables lazier loading.
Collaborative virtual environments - what next?
Authors: Ivan Tomek
Venue: ACM SIGGROUP Bulletin (2000)

As work becomes increasingly geographically dispersed over time zones and cultures, new types of environments are needed that make collaboration in these conditions more productive and more enjoyable. In this contribution, we list some of the issues that we have tentatively identified and that we used to conclude that Collaborative Virtual Environments are ideally suited for this purpose. We then very briefly describe a working CVE framework that we have developed to address the issues that we have raised. The main point of the paper is an admission of the ad hoc nature of our work and a plea for the development of solid understanding of collaborative work in the area of software development that could be used to construct a realistically grounded collaborative environment.
Software testing in the computer science curriculum -- a holistic approach
Authors: Edward L. Jones
Venue: Proceedings of the Australasian conference on Computing education (2000)

Although testing accounts for 50% of the cost of software, it receives little treatment in most curricula. This paper presents some approaches to giving all students multiple, incremental exposures to software testing throughout the curriculum. A unifying framework is presented which identifies a minimal set of test experiences, skills and concepts students should accumulate. The holistic approach combines common test experiences in core courses, an elective course in software testing, and volunteer participation in a test laboratory.
A language independent macro processor
Authors: William M. Waite
Venue: Communications of the ACM (1967)

The problem of obtaining starting values for the Newton-Raphson calculation of &radic;x on a digital computer is considered. It is shown that the conventionally used best uniform approximations to &radic;x do not provide optimal starting values. The problem of obtaining optimal starting values is stated, and several basic results are proved. A table of optimal polynomial starting values is given.
Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
Authors: Holger Scheel, Stefan Scholtes
Venue: Mathematics of Operations Research (2000)

We study mathematical programs with complementarity constraints. Several stationarity concepts, based on a piecewise smooth formulation, are presented and compared. The concepts are related to stationarity conditions for certain smooth programs as well as to stationarity concepts for a nonsmooth exact penalty function. Further, we present Fiacco-McCormick type second order optimality conditions and an extension of the stability results of Robinson and Kojima to mathematical programs with complementarity constraints.
Configuration management for multi-agent systems
Authors: Joseph A. Giampapa, Octavio H. Juarez-Espinosa, Katia P. Sycara
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

As heterogeneous distributed systems, multi-agent systems present some challenging configuration management issues. There are the problems of knowing how to allocate agents to computers, launch them on remote hosts, and once the agents have been launched, how to monitor their runtime status so as to manage computing resources effectively.In this paper, we present the RETSINA Configuration Manager, \emph{RECoMa}. We describe its architecture, how it uses agent infrastructure such as service discovery, to assist the multi-agent system administrator in allocating, launching, and monitoring a heterogeneous distributed agent system in a distributed and networked computing environment.\footnote{The authors would like to acknowledge the significant contributions of Matthew W. Easterday in his earlier and exhaustive implementations of configuration management programs and CM design proposals. This research has been sponsored in part by DARPA Grant F-30602-98-2-0138 and the Office of Naval Research Grant N-00014-96-16-1-1222.}
Reducing the retrieval time of scatter storage techniques
Authors: Richard P. Brent
Venue: Communications of the ACM (1973)

A new method for entering and retrieving information in a hash table is described. The method is intended to be efficient if most entries are looked up several times. The expected number of probes to look up an entry, predicted theoretically and verified by Monte Carlo experiments, is considerably less than for other comparable methods if the table is nearly full. An example of a possible Fortran implementation is given.
Abstract data types and the development of data structures
Authors: John Guttag
Venue: Communications of the ACM (1977)

Abstract data types can play a significant role in the development of software that is reliable, efficient, and flexible. This paper presents and discusses the application of an algebraic technique for the specification of abstract data types. Among the examples presented is a top-down development of a symbol table for a block structured language; a discussion of the proof of its correctness is given. The paper also contains a brief discussion of the problems involved in constructing algebraic specifications that are both consistent and complete.
Multiplexing of slow peripherals
Authors: C. Abraham, G. N. Lance, T. Pearcey
Venue: Communications of the ACM (1966)

The philosophy of a monitor which allows slow output devices to be multiplexed is presented.
Automatic Analysis of Facial Expressions: The State of the Art
Authors: Maja Pantic, Leon J. M. Rothkrantz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Humans detect and interpret faces and facial expressions in a scene with little or no effort. Still, development of an automated system that accomplishes this task is rather difficult. There are several related problems: detection of an image segment as a face, extraction of the facial expression information, and classification of the expression (e.g., in emotion categories). A system that performs these operations accurately and in real time would form a big step in achieving a human-like interaction between man and machine. This paper surveys the past work in solving these problems. The capability of the human visual system with respect to these problems is discussed, too. It is meant to serve as an ultimate goal and a guide for determining recommendations for development of an automatic facial expression analyzer.
Restructuring logic representations with easily detectable simple disjunctive decompositions
Authors: H. Sawada, S. Yamashita, A. Nagoya
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced variable. This paper presents that many simple disjunctive decompositions can be found easily by detecting symmetric variables or checking variable cofactors. We also propose an algorithm that constructs a new logic representation for a simple disjunctive decomposition by assigning constant values to variables in the original representation. The algorithm enables us to apply the decomposition with keeping good structures of the original representation. We have performed experiments to restructure fanout free cones of multi-level logic circuits, and obtained better results than when not restructuring them.
Community search assistant
Authors: Natalie S. Glance
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

This paper describes a new software agent, the community search assistant, which recommends related searches to users of search engines. The community search assistant enables communities of users to search in a collaborative fashion. All queries submitted by the community are stored in the form of a graph. Links are made between queries that are found to be related. Users can peruse the network of related queries in an ordered way: following a path from a first cousin, to a second cousin to a third cousin, etc. to a set of search results. The first key idea behind the use of query graphs is that the determination of relatedness depends on the documents returned by the queries, not on the actual terms in the queries themselves. The second key idea is that the construction of the query graph transforms single user usage of information networks (e.g. search) into collaborative usage: all users can tap into the knowledge base of queries submitted by others.
Balanced lines, halving triangles, and the generalized lower bound theorem
Authors: Micha Sharir, Emo Welzl
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

A recent result by Pach and Pinchasi on so-called balanced lines of a finite two-colored point set in the plane is related to other facts on halving triangles in 3-space and to a special case of the Generalized Lower Bound Theorem for convex polytopes.
Identifying fixations and saccades in eye-tracking protocols
Authors: Dario D. Salvucci, Joseph H. Goldberg
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

The process of fixation identification&mdash;separating and labeling fixations and saccades in eye-tracking protocols&mdash;is an essential part of eye-movement data analysis and can have a dramatic impact on higher-level analyses. However, algorithms for performing fixation identification are often described informally and rarely compared in a meaningful way. In this paper we propose a taxonomy of fixation identification algorithms that classifies algorithms in terms of how they utilize spatial and temporal information in eye-tracking protocols. Using this taxonomy, we describe five algorithms that are representative of different classes in the taxonomy and are based on commonly employed techniques. We then evaluate and compare these algorithms with respect to a number of qualitative characteristics. The results of these comparisons offer interesting implications for the use of the various algorithms in future work.
Steiner points in tree metrics don't (really) help
Authors: Anupam Gupta
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Consider an edge-weighted tree T = (V, E, w : E &rarrtl; R+), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V\R are colored black (and called the Steiner nodes). The shortest-path distance according to the edge-weights defines a metric dT on the vertex set V. We now ask the following question: Is it possible to define another weighted tree T* = (R, E*, w* : E* &rarrtl; R+), this time on just the red vertices so that the shortest-path metric dT* induced by T* on the vertices in R is &ldquo;close&rdquo; to the metric dT restricted to the red vertices? I.e., does there exist a weighted tree T* = (R, E*, c*) and a (small) constant &agr; such that dT(u, v) &le; dT* (u, v) &le; &agr; dT(u, v) for any two red vertices u, v &isin; R? We answer this question in the affirmative, and give a linear time algorithm to obtain a tree T* with &agr; &le; 8. We also give two applications of this result: an upper bound, in which we show that emulating multicasts using unicasts can be almost as good as general multicasts for certain performance measures; and a lower bound, in which we give a simple combinatorial proof of the fact that the metric generated by a graph of girthg must suffer a distortion of at least &OHgr;(g) when approximated by a tree.
A parallel block algorithm for exact triangularization of rectangular matrices
Authors: Jean-Guillaume Dumas, Jean-Louis Roch
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

A new block algorithm for triangularization of regular or singular matrices with dimension m &times; n is proposed. Taking benefit of fast block multiplication algorithms, it achieves the best known sequential complexity &Ogr;(mw-1n) for any sizes and any rank. Moreover, the block strategy enables to improve locality with respect to previous algorithms as exhibited by practical performances.
A multiuser computation facility for education and research
Authors: Jack B. Dennis
Venue: Communications of the ACM (1964)

Present-day computing facilities are limited in their value for scientific research by inability to interact strongly with users. The full power of a research computing instrument should be available at many terminals that give each user the ability to generate, correct and operate any procedure he wishes, either simple or complex. Implementation is described for a small-scale multiuser computer system that permits several users to work independently with the machine, and to obtain satisfactory response using typewriter communication.
Augmenting paper to enhance community information sharing
Authors: Antonietta Grasso, Alain Karsenty, Marco Susani
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

Paper is traditionally considered as a major gap between the physical and electronic worlds, especially after the many attempts that have failed to attain a completely digital world. Paper based artifacts have many affordances that people want to continue to exploit. The work presented here is part of the Campiello project. It describes how the existing paper artifacts in use during the visits to cultural and tourist towns as well as artefacts used for local communities can be extended in order to become a bridge instead of a barrier to the richness of the digital world. After an introduction that describes the Campiello system and the principles that have driven its functionality, a complete design and the current implementation is presented. Finally, we discuss Paper Interface issues and survey the existing approaches in the field.
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography
Authors: Martin A. Fischler, Robert C. Bolles
Venue: Communications of the ACM (1981)

A new paradigm, Random Sample Consensus (RANSAC), for fitting a model to experimental data is introduced. RANSAC is capable of interpreting/smoothing data containing a significant percentage of gross errors, and is thus ideally suited for applications in automated image analysis where interpretation is based on the data provided by error-prone feature detectors. A major portion of this paper describes the application of RANSAC to the Location Determination Problem (LDP): Given an image depicting a set of landmarks with known locations, determine that point in space from which the image was obtained. In response to a RANSAC requirement, new results are derived on the minimum number of landmarks needed to obtain a solution, and algorithms are presented for computing these minimum-landmark solutions in closed form. These results provide the basis for an automatic system that can solve the LDP under difficult viewing
Approximate symmetry detection for reverse engineering
Authors: B. I. Mills, F. C. Langbein, A. D. Marshall, R. R. Martin
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

The authors are developing an automated reverse engineering system for reconstructing the shape of simple mechanical parts. B-rep models are created by fitting surfaces to point clouds obtained by scanning an object using a 3D laser scanner. The resulting models, although valid, are often not suitable for purposes such as redesign because expected regularities and constraints are not present. This information is lost because each face of the model is determined independently. A global approach is required, in particular one that is capable of finding symmetries originally present. This paper describes a practical algorithm for finding global symmetries in suitable B-rep models built from planes, spheres, cylinders, cones and tori. It has been implemented and used to determine approximate symmetries of models with up to about 200 vertices in reasonable time. The time performance of the algorithm in the worst case is bounded by O(n 3.5 log4 n), and a justification is given that on common engineering objects it takes about O(n2 log4 n), making it a practical tool for use in a reverse engineering package. Details of the algorithm are given, along with some results from a number of illustrative test runs.
Improved fast integer sorting in linear space
Authors: Yijie Han
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We present improved fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in linear space in &Ogr;(n log log n log log log n) time. This improves the &Ogr;(n(log log n)3/2) time bound given in [6]. When the n integers in {0,1,&hellip;, m - 1} to be sorted satisfying log m &gne;(log n)2+&isin;, 0 < &isin; < 1, the time complexity for sorting can be further reduced to &Ogr;(n log log n). These results are obtained by applying signature sorting on our previous result[6].
Test volume and application time reduction through scan chain concealment
Authors: Ismet Bayraktaroglu, Alex Orailoglu
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

A test pattern compression scheme is proposed in order to reduce test data volume and application time. The number of scan chains that can be supported by an ATE is significantly increased by utilizing an on-chip decompressor. The functionality of the ATE is kept intact by moving the decompression task to the circuit under test. While the number of virtual scan chains visible to the ATE is kept small, the number of internal scan chains driven by the decompressed pattern sequence can be sinificantly increased.
Rapid software prototyping in molecular modeling using the biochemical algorithms library (BALL)
Authors: N. P. Boghossian, O. Kohlbacher, H. P. Lenhof
Venue: Journal of Experimental Algorithmics (JEA) (2000)

In the next century, virtual laboratories will play a key role in biotechnology. Computer experiments will not only replace some of the time-consuming and expensive real-world experiments, but they will also provide insights that cannot be obtained using "wet" experiments. The field that deals with the modeling of atoms, molecules, and their reactions is called Molecular Modeling. The advent of Life Sciences gave rise to numerous new developments in this area. However, the implementation of new simulation tools is extremely time-consuming. This is mainly due to the large amount of supporting code that is required in addition to the code necessary to implement the new idea. The only way to reduce the development time is to reuse reliable code, preferably using object-oriented approaches. We have designed and implemented BALL, the first object-oriented application framework for rapid prototyping in Molecular Modeling. By the use of the composite design pattern and polymorphism we were able to model the multitude of complex biochemical concepts in a well-structured and comprehensible class hierarchy, the BALL kernel classes. The isomorphism between the biochemical structures and the kernel classes leads to an intuitive interface. Since BALL was designed for rapid software prototyping, ease of use, extensibility, and robustness were our principal design goals. Besides the kernel classes, BALL provides fundamental components for import/export of data in various file formats, Molecular Mechanics simulations, three-dimensional visualization, and more complex ones like a numerical solver for the Poisson-Boltzmann equation.
Further evidence for the analysis of algorithms for the zero-one programming problem
Authors: L. G. Proll
Venue: Communications of the ACM (1971)

The purpose of this note is to report computational experience additional to that recently summarized by Gue et al., with two algorithms for the zero-one linear programming problem. An error in Gue's paper is corrected. The utility of one of the algorithms as a suboptimizer is indicated.
Computers in group theory: a survey
Authors: John J. Cannon
Venue: Communications of the ACM (1969)

Computers are being applied to an increasingly diverse range of problems in group theory. The most important areas of application at present are coset enumeration, sub-group lattices, automorphism groups of finite groups, character tables, and commutator calculus. Group theory programs range from simple combinatorial or numerical programs to large symbol manipulation systems. In this survey the more important algorithms in use are described and contrasted, and results which have been obtained using existing programs are indicated. An extensive bibliography is included.
Understanding class hierarchies using concept analysis
Authors: Gregor Snelting, Frank Tip
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

A new method is presented for analyzing and reengineering class hierarchies. In our approach, a class hierarchy is processed along with a set of applications that use it, and a fine-grained analysis of the access and subtype relationships between objects, variables, and class members is performed. The result of this analysis is again a class hierarchy, which is guaranteed to be behaviorally equivalent to the original hierarchy, but in which each object only contains the members that are required. Our method is semantically well-founded in concept analysis: the new class hierarchy is a minimal and maximally factorized concept lattice that reflects the access and subtype relationships between variables, objects and class members. The method is primarily intended as a tool for finding imperfections in the design of class hierarchies, and can be used as the basis for tools that largely automate the process of reengineering such hierachies. The method can also be used as a space-optimizing source-to-source transformation that removes redundant fields from objects. A prototype implementation for Java has been constructed, and used to conduct several case studies. Our results demonstrate that the method can provide valuable insights into the usage of a class hierarchy in a specific context, and lead to useful restructuring proposals.
Performance results of the simplex algorithm for a set of real-world linear programming models
Authors: Edward H. McCall
Venue: Communications of the ACM (1982)

This paper provides performance results using the SPERRY UNIVAC 1100 Series linear programming product FMPS to solve a set of 16 real-world linear programming problems. As such, this paper provides a data point for the actual performance of a commercial simplex algorithm on real-world linear programming problems and shows that the simplex algorithm is a linear time algorithm in actual performance. Correlations and performance relationships not previously available are also provided.