ppxscal/embedding_network huggingface dataset:
An Optimal Index Reshuffle Algorithm for Multidimensional Arrays and Its Applications for Parallel Architectures
Authors: Chris H. Q. Ding
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Reshuffling elements of a multidimensional array according to an index operation traditionally requires an auxiliary buffer of the same size as the original array. Here, we describe a new in-place algorithm using vacancy tracking cycles with minimum memory access which eliminates the buffer array and the related copy-back, speeding up the reshuffle significantly for large arrays. The algorithm can be parallelized using a multithread approach on shared-memory multiprocessor computers. On distributed-memory multiprocessor computers, the index reshuffle of distributed multidimensional arrays amounts to a remapping of processor domains and is carried out using the in-place local algorithm combined with a global exchange algorithm. Implementation and test results on CRAY T3E and IBM SP indicate the effectiveness of the algorithm.
Affine-Invariant Recognition of Gray-Scale Characters Using Global Affine Transformation Correlation
Authors: Toru Wakahara, Yoshimasa Kimura, Akira Tomono
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

This paper describes a new, promising technique of gray-scale character recognition that offers both noise tolerance and affine-invariance. The key ideas are twofold. First is the use of normalized cross-correlation as a matching measure to realize noise tolerance. Second is the application of global affine transformation (GAT) to the input image so as to achieve affine-invariant correlation with the target image. In particular, optimal GAT is efficiently determined by the successive iteration method using topographic features of gray-scale images as matching constraints. We demonstrate the high matching ability of the proposed GAT correlation method using gray-scale images of numerals subjected to random Gaussian noise and a wide range of affine transformation. Moreover, extensive recognition experiments show that the achieved recognition rate of 94.3 percent against rotation within 30 degrees, scale change within 30 percent, and translation within 20 percent of the character width along with random Gaussian noise is sufficiently high compared to the 42.8 percent offered by simple correlation.
Remarks on Gr&ouml;bner basis for ideals under composition
Authors: Wang Mingsheng, Liu Zhuojun
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Let K[x1,&hellip;,xn]be a polynomial ring over a field K in variables x1,&hellip;,xn, and K[y1,&hellip;,ym] be a polynomial ring over a field K in variables y1,&hellip;,ym. m &nge; n. Let &THgr; = (&thgr;1,&hellip;,&thgr;n) be an ordered n-tuple of non-constant polynomials in K[y1,&hellip;,ym]. For any finite set F of K[x1,&hellip;,xn], let F o &THgr; be the set obtained from F by replacing xi; by &thgr;i, thus for any F e K[x1,&hellip;,xn], Fo&THgr; e K[y1,&hellip;,ym]. With the above notations, Hong's main theorem [9] and the main theorem of [6] are generalized to general cases with some new proofs.
System Deadlocks
Authors: E. G. Coffman, M. Elphick, A. Shoshani
Venue: ACM Computing Surveys (CSUR) (1971)

A problem of increasing importance in the design of large multiprogramming systems is the, so-called, deadlock or deadly-embrace problem. In this article we survey the work that has been done on the treatment of deadlocks from both the theoretical and practical points of view.
Kava - a powerful and portable reflective Java (poster session)
Authors: Ian S. Welch, Robert J. Stroud
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Kava is a powerful and portable reflective Java that uses byte code rewriting to implement behavioural reflection. In our poster we briefly overview the Kava system, give an example of its use, and contrast it with simple byte code rewriting. More details about Kava are available from http://www.cs.ncl .ac.uk /research/dependability/reflection.
Metrics based asset assessment
Authors: Andreas Schmietendorf, Reiner Dumke, Erik Foltin
Venue: ACM SIGSOFT Software Engineering Notes (2000)

The re-use of software components during the software development is considered to be an important factor to improve the quality and productivity and thus to reduce the time to market of the final product. In this paper we will present a proposal for a description model for re-usable components. We will also present the results of case studies concerned with both telecom specific and ,,generic" IT-components. These components have been examined using the description model and a further set of (empirical) criterions. Based on the results a model concept for the empirical assessment of JavaBeans, which is currently under development, is presented..
Blend recognition algorithm and applications
Authors: Sashikumar Venkataraman, Milind Sohoni
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

This paper reports an algorithm for the automatic recognition of blends from Boundary Representation (B-rep) solid models. The algorithm also deduces the sequence in which the blends got created in the model, and thereby helps in understanding the design intent of the model. This algorithm has been implemented as a blend recognition module of a Feature Recognition library. The novelty of the blend recognizer lies in the recognition of blends that occur in different configurations and complex blend networks. The paper also discusses various applications of blend recognition and suppression.
Considerations for future programming language standards activities
Authors: John A. N. Lee
Venue: Communications of the ACM (1977)

This paper reviews the current state of programming language standards activities with respect to the anomalies which exist between the various published and proposed standards for Fortran, Cobol, PL/I, and Basic. Proposals are made for the inclusion of formalisms within future standards and the extension of the standards to include additional items such as error conditions and documentation.
Implementing Multidestination Worms in Switch-Based Parallel Systems: Architectural Alternatives and Their Impact
Authors: Rajeev Sivaram, Craig B. Stunkel, Dhabaleswar K. Panda
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Multidestination message passing has been proposed as an attractive mechanism for efficiently implementing multicast and other collective operations on direct networks. However, applying this mechanism to switch-based parallel systems is nontrivial. In this paper, we propose alternative switch architectures with differing buffer organizations to implement multidestination worms on switch-based parallel systems. First, we discuss issues related to such implementation (deadlock-freedom, replication mechanisms, header encoding, and routing). Next, we demonstrate how an existing central-buffer-based switch architecture supporting unicast message passing can be enhanced to accommodate multidestination message passing. Similarly, implementing multidestination worms on an input-buffer-based switch architecture is discussed, and two architectural alternatives are presented that reduce the wiring complexity in a practical switch implementation. The central-buffer-based and input-buffer-based implementations are evaluated against each other, as well as against the corresponding software-based schemes. Simulation experiments under a range of traffic (multiple multicast, bimodal, varying degree of multicast, and message length) and system size are used for evaluation. The study demonstrates the superiority of the central-buffer-based switch architecture. It also indicates that under bimodal traffic the central-buffer-based hardware multicast implementation affects background unicast traffic less adversely compared to a software-based multicast implementation. These results show that multidestination message passing can be applied easily and effectively to switch-based parallel systems to deliver good multicast and collective communication performance.
The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations
Authors: Sartaj Sahni
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

We show how a multiprocessor computer interconnected by a partitioned optical passive stars network (POPS) can simulate hypercube and mesh-connected computers. POPS algorithms for data sum, prefix sum, rank, adjacent sum, consecutive sum, concentrate, distribute, and generalize are also developed. These fundamental operations form the building blocks of parallel algorithms for many applications.
Comparison of synonym handling and bucket organization methods
Authors: P. Quittner, S. Csóka, S. Halász, D. Kotsis, K. Várnai
Venue: Communications of the ACM (1981)

A theoretical description of the access times required in open addressing and external chaining is given. Values are calculated for different record and bucket sizes and load factors, and the corresponding values for the two methods are compared. Practical guidelines for determining bucket sizes and load factors are presented. It is proved that open addressing is almost always superior to external chaining and the optimal bucket size is between 1 and 4.
Design of Operations Management Internships Across Organizations--Learning OM by Doing OM
Authors: Marc J. F. Wouters, Karel H. van Donselaar
Venue: Interfaces (2000)

To teach operations management (OM), we had students work full time in companies, analyzing problems and developing solutions. Fifteen students worked in different companies but on related OM topics, and we created many opportunities for them to exchange knowledge, ideas, and experiences. We organized the project around supply chains in the electrical installation industry and in the pharmaceutical industry and involved manufacturers, wholesalers, and installers or pharmacists. It was important to keep the complexity of the analyses manageable, to stimulate information exchange between the companies, and to separate analysis from negotiation over the sharing of benefits. The Supply-Chain Logistics and Information Management (SLIM) project was valuable for students and for university staff, and it helped the companies to develop and implement improvements in their supply chains.
Ultracomputers
Authors: Jacob T. Schwartz
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

A class of parallel processors potentially involving thousands of individual processing elements is described. The architecture is based on the perfect shuffle connection and has two favorable characteristics: (1) Each processor communicates with a fixed number of other processors. (2) Important communication functions can be accomplished in time proportional to the logarithm of the number of processors. A number of basic algorithms for these &ldquo;ultracomputers&rdquo; are presented, and physical design considerations are discussed in a preliminary fashion.
Chain or Shackles: Understanding What Drives Supply-Chain Performance
Authors: Kamalini Ramdas, Robert E. Spekman
Venue: Interfaces (2000)

We relate an array of factors that embody current practice and thinking in supply-chain management with supply-chain performance. We measured supply-chain performance using a set of variables that capture the impact of supply-chain management on systemwide revenues and costs. We classified supply chains based on the products they support as inherently functional or inherently innovative. They differ in practices used and thinking. High performers among innovative-product supply chains use practices that enhance revenues more than high performers among functional product supply chains. They are more likely to engage in supply-chain management to enhance revenues. Finally, we found that the practices and reasons for engaging in supply-chain management that distinguish high performers from low performers are different for functional-and innovative-product supply chains.
Modules, abstract types, and distributed versioning
Authors: Peter Sewell
Venue: ACM SIGPLAN Notices (2001)

In a wide-area distributed system it is often impractical to synchronise software updates, so one must deal with many coexisting versions. We study static typing support for modular wide-area programming, modelling separate compilation/linking and execution of programs that interact along typed channels. Interaction may involve communication of values of abstract types; we provide the developer with fine-grain versioning control of these types to support interoperation of old and new code. The system makes use of a second-class module system with singleton kinds; we give a novel operational semantics for separate compilation/linking and execution and prove soundness.
Completion Energies and Scale
Authors: Eitan Sharon, Achi Brandt, Ronen Basri
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

The detection of smooth curves in images and their completion over gaps are two important problems in perceptual grouping. In this study, we examine the notion of completion energy of curve elements, showing, and exploiting its intrinsic dependence on length and width scales. We introduce a fast method for computing the most likely completion between two elements, by developing novel analytic approximations and a fast numerical procedure for computing the curve of least energy. We then use our newly developed energies to find the most likely completions in images through a generalized summation of induction fields. This is done through multiscale procedures, i.e., separate processing at different scales with some interscale interactions. Such procedures allow the summation of all induction fields to be done in a total of only $O(N \log N)$ operations, where $N$ is the number of pixels in the image. More important, such procedures yield a more realistic dependence of the induction field on the length and width scales: The field of a long element is very different from the sum of the fields of its composing short segments.
On beyond registers: wait-free readable objects
Authors: Maurice Herlihy
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

Leslie Lamport was the first to pose many of the fundamental questions about synchronization that drive much of our community's research, even today. In this paper, we revisit some of Lamport's classic questions in a modern context. In particular, we consider some of the implications Prepared for Leslie Lamport's birthday celebration at PODC 2001.
Practical multi-candidate election system
Authors: Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Guillaume Poupard
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

The aim of electronic voting schemes is to provide a set of protocols that allow voters to cast ballots while a group of authorities collect the votes and output the final tally. In this paper we describe a practical multi-candidate election scheme that guarantees privacy of voters, public verifiability, and robustness against a coalition of malicious authorities. Furthermore, we address the problem of receipt-freeness and incoercibility of voters. Our new scheme is based on the Paillier cryptosystem and on some related zero-knowledge proof techniques. The voting schemes are very practical and can be efficiently implemented in a real system.
The pointer assertion logic engine
Authors: Anders Møller, Michael I. Schwartzbach
Venue: ACM SIGPLAN Notices (2001)

We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were restricted to simple special cases such as lists or trees. Even so, our current implementation is as fast as the previous specialized tools. Programs are annotated with partial specifications expressed in Pointer Assertion Logic, a new notation for expressing properties of the program store. We work in the logical tradition by encoding the programs and partial specifications as formulas in monadic second-order logic. Validity of these formulas is checked by the MONA tool, which also can provide explicit counterexamples to invalid formulas. To make verification decidable, the technique requires explicit loop and function call invariants. In return, the technique is highly modular: every statement of a given program is analyzed only once. The main target applications are safety-critical data-type algorithms, where the cost of annotating a program with invariants is justified by the value of being able to automatically verify complex properties of the program.
Fault analysis in networks with concurrent error detection properties
Authors: C. Bolchini, F. Salice, D. Sciuto
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The design of Self-Checking circuits through output encoding finds a bottleneck in the realization of the network so that each fault produces only errors detectable by the adopted code. An analysis of an expected TSC network is proposed, based on the application of the weighted observability approach. The aim is the verification of the SC property of the encoded circuit (TSC fault simulation) and identification of critical areas for a consequent manipulation to achieve a complete fault coverage.
The size-change principle for program termination
Authors: Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram
Venue: ACM SIGPLAN Notices (2001)

The "size-change termination" principle for a first-order functional language with well-founded data is: a program terminates on all inputs if every infinite call sequence (following program control flow) would cause an infinite descent in some data values.Size-change analysis is based only on local approximations to parameter size changes derivable from program syntax. The set of infinite call sequences that follow program flow and can be recognized as causing infinite descent is an omega;-regular set, representable by a B uuml;chi automaton. Algorithms for such automata can be used to decide size-change termination. We also give a direct algorithm operating on "size-change graphs" (without the passage to automata).Compared to other results in the literature, termination analysis based on the size-change principle is surprisingly simple and general: lexical orders (also called lexicographic orders), indirect function calls and permuted arguments (descent that is not in-situ) are all handled automatically and without special treatment, with no need for manually supplied argument orders, or theorem-proving methods not certain to terminate at analysis time.We establish the problem's intrinsic complexity. This turns out to be surprisingly high, complete for PSPACE, in spite of the simplicity of the principle. PSPACE hardness is proved by a reduction from Boolean program termination. An ineresting consequence: the same hardness result applies to many other analyses found in the termination and quasitermination literature.
Coding clinical laboratory data for automatic storage and retrieval
Authors: Leonard D. Gross
Venue: Communications of the ACM (1963)

A series of clinical laboratory codes have been developed to accept and store urinalysis, blood chemistry, and hematology test results for automatic data processing. The codes, although constructed as part of a computerized hospital simulation, have been able to handle the results of every laboratory test that they have encountered. The unique feature of these codes is that they can accept conventionally recorded qualitative as well as quantitative test results. Consequently, clinical test results need not be arbitrarily stratified, standardized, or altered in any way to be coded. This paper describes how the codes were developed and presents a listing of the urinalysis codes. Five criteria used in developing the codes are outlined and the problem of multiple-synonymous terminology is discussed. A solution to the problem is described. Flexible, computer-produced, composite laboratory reports are also discussed, along with reproduction of such a report. The paper concludes that even though many problems remain unsolved, the next ten years could witness the emergence of a practical automated information system in the laboratory.
On arithmetic expressions and trees
Authors: R. R. Redziejowski
Venue: Communications of the ACM (1969)

A description is given of how a tree representing the evaluation of an arithmetic expression can be drawn in such a way that the number of accumulators needed for the computation can be represented in a straightforward manner. This representation reduces the choice of the best order of computation to a specific problem under the theory of graphs. An algorithm to solve this problem is presented.
Accuracy measures for evaluating computer pointing devices
Authors: I. Scott MacKenzie, Tatu Kauppinen, Miika Silfverberg
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

In view of the difficulties in evaluating computer pointing devices across different tasks within dynamic and complex systems, new performance measures are needed. This paper proposes seven new accuracy measures to elicit (sometimes subtle) differences among devices in precision pointing tasks. The measures are target re-entry, task axis crossing, movement direction change, orthogonal direction change, movement variability, movement error, and movement offset. Unlike movement time, error rate, and throughput, which are based on a single measurement per trial, the new measures capture aspects of movement behaviour during a trial. The theoretical basis and computational techniques for the measures are described, with examples given. An evaluation with four pointing devices was conducted to validate the measures. A causal relationship to pointing device efficiency (viz. throughput) was found, as was an ability to discriminate among devices in situations where differences did not otherwise appear. Implications for pointing device research are discussed.
Applicability of Software Validation Techniques to Scientific Programs
Authors: W. E. Howden
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

Error analysis involves the examination of a collection of programs whose errors are known. Each error is analyzed and validation techniques which would discover the error are identified. The errors that were present in version five of a package of Fortran scientific subroutines and then later corrected in version six were analyzed. An integrated collection of static and dynamic analysis methods would have discovered the errors in version five before its release. An integrated approach to validation and the effectiveness of individual methods are discussed.