ppxscal/embedding_network huggingface dataset:
Nanometer Technology Effects on Fault Models for IC Testing
Authors: Robert C. Aiken
Venue: Computer (1999)

The introduction of nanometer technologies into the imperfect manufacturing process of ICs presents new challenges for identifying defects that creep into some fabricated chips. Defects are unpredictable in both location and effect, and the processes that cause them include a wide range of variables. These defects can take a variety of forms, from localized spot defects-typically extra or missing material caused by particles-to defects affecting much larger areas, such as reduced capacitance caused by inadequate implantation. To simplify the identification of defective circuits, this infinite defect space is approximated by a finite set of faults. Faults are deterministic, discrete changes in circuit behavior. They are often considered localized within a circuit (for example, when a particular gate is broken) and can also be thought of as transformations that change the Boolean function implemented by a circuit. Research into fault models has generated new methods for extending them from the gate level to the presynthesized register-transfer-level (RTL) and behavioral code. Chip designers can use simple models-such as stuck-at faults-to find a wide variety of defects. Nanometer technologies will require innovative delay fault models and techniques to extend the life of test methods like IDDQ.
Programming language impacts on learning
Authors: J. A. Drew Hamilton,  Jr., Jeanne L. Murtagh, Richard G. Zoller
Venue: ACM SIGAda Ada Letters (2000)

What programming language should be taught in an introductory computer science course? Studies and experiences at West Point provide some insight into these questions. This paper reports the statistical results obtained from a side-by-side comparison of Pascal and Ada. The unique nature of our institution provided the opportunity to isolate and study causal factors, and allowed us to follow the experimental and control groups through graduation.We conducted a side by side comparison of the use of Pascal, which was specifically designed for instructional purposes, and Ada in an introductory course. The experiment demonstrated that students were much more successful in Ada than in Pascal, and led to the revision of the Academy core curriculum to use Ada 95 in our introductory computer science class. This paper discusses the details of our comparison, citing specific examples to illustrate a rational basis for evaluating programming language features.
Equivalences among aggregate queries with negation
Authors: Sara Cohen, Werner Nutt, Yehoshua Sagiv
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

Query equivalence is investigated for disjunctive aggregate queries with negated subgoals, constants and comparisons. A full characterization of equivalence is given for the aggregation functions count, max, sum, prod, top2 and parity. A related problem is that of determining, for a given natural number N, whether two given queries are equivalent over all databases with at most N constants. We call this problem bounded equivalence. A complete characterization of decidability of bounded equivalence is given. In particular, it is shown that this problem is decidable for all the above aggregation functions as well as for cntd (count distinct), stdev (standard deviation), median and avg. For quasilinear queries (i.e., queries in which predicates that occur positively are not repeated) it is shown that equivalence can be decided in polynomial time for the aggregation functions count, max, sum, prod, top2, parity, and avg. A similar result holds for cntd provided that a few additional conditions hold. The results are couched in terms of abstract characteristics of aggregation functions, and new proof techniques are used. Finally, the results presented also imply that equivalence, under bag-set semantics, is decidable for nonaggregate queries with negation.
Conservative garbage collection for general memory allocators
Authors: Gustavo Rodriguez-Rivera
Venue: ACM SIGPLAN Notices (2001)

This paper explains a technique that integrates conservative garbage collection on top of general memory allocators. This is possible by using two data structures named malloc-tables and jump-tables that are computed at garbage collection time to map pointers to beginning of objects and their sizes. This paper describes malloc-tables and jump-tables, an implementation of a malloc/jump-table based conservative garbage collector for Doug Lea's memory allocator, and experimental results that compare this implementation with Boehm-Demers-Weiser GC, a state-of-the-art conservative garbage collector.
Cell selection from technology libraries for minimizing power
Authors: Yumin Zhang, Xiaobo Sharon Hu, Danny Z. Chen
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper we present a new library-oriented cell selection approach to minimize power consumption of combinational circuits. Our unified Mixed Integer Linear-Programming (MILP) formulation selects library cells with different gate sizes, supply voltages and threshold voltages simultaneously during technology mapping. Experimental results on bench-marks mapped to an industrial library show that our technique achieves 19% more power saving in less CPU time comparing with other approaches.
Structural digital signature for image authentication: an incidental distortion resistant scheme
Authors: Chun-Shien Lu, Hong-Yuan Mark Liao
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

The existing digital data authentication methods are able to detect tampered regions, but are too fragile to resist incidental distortions. This paper will present a new digital signature scheme for image authentication by making use of image content (in the wavelet domain). Based on this concept, a structural digital signature (SDS) is constructed. SDS is a signature that can be used to judge whether an incoming modification is incidental or malicious. When the structure of an SDS is maintained near-complete, we classify the incoming modification as incidental; otherwise, it is malicious. Many incidental manipulations, which cannot be tolerated in previous digital signature or fragile watermarking methods, can now survive under the proposed scheme.
A bandwidth analysis of reliable multicast transport protocols
Authors: Christian Maihöfer
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

Multicast is an efficient communication technique to save bandwidth for group communication purposes. A number of protocols have been proposed in the past to provide a reliable multicast service. Briefly classified, they can be distinguished into sender-initiated, receiver-initiated and tree-based approaches. In this paper, an analytical bandwidth evaluation of generic reliable multicast protocols is presented. Of particular importance are new classes with aggregated acknowledgments. In contrast to other approaches, these classes provide reliability not only in case of message loss but also in case of node failures. Our analysis is based on a realistic system model, including data packet and control packet loss, asynchronous local clocks and imperfect scope-limited local groups. Our results show that hierarchical approaches are superior. They provide higher throughput as well as lower bandwidth consumption. Relating to protocols with aggregated acknowledgments, the analysis shows only little additional bandwidth overhead and therefore high throughput rates.
The Activity of a Variable and Its Relation to Decision Trees
Authors: B. E. Moret, M. Thomason and R. C. Gonzalez
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

The construction of sequential testing procedures from functions of discrete arguments is a common problem in switching theory, software engineering, pattern recognition, and management. The concept of the activity of an argument is introduced, and a theorem is proved which relates it to the expected testing cost of the most general type of decision trees. This result is then extended to trees constructed from relations on finite sets and to decision procedures with cycles. These results are used, in turn, as the basis for a fast heuristic selection rule for constructing testing procedures. Finally, some bounds on the performance of the selection rule are developed.
A scan conversion algorithm with reduced storage requirements
Authors: B. W. Jordan,  Jr., R. C. Barrett
Venue: Communications of the ACM (1973)

Most graphics systems using a raster scan output device (CRT or hardcopy) maintain a display file in the XY or random scan format. Scan converters, hardware or software, must be provided to translate the picture description from the XY format to the raster format. Published scan conversion algorithms which are fast will reserve a buffer area large enough to accommodate the entire screen. On the other hand, those which use a small buffer area are slow because they require multiple passes through the XY display file. The scan conversion algorithm described here uses a linked list data structure to process the lines of the drawing in strips corresponding to groups of scan lines. A relatively small primary memory buffer area is used to accumulate the binary image for a group of scan lines. When this portion of the drawing has been plotted, the buffer is reused for the next portion. Because of the list processing procedures used, only a single pass through the XY display file is required when generating the binary image and only a slight increase in execution time over the fully buffered core results. Results show that storage requirements can be reduced by more than 80 percent while causing less than a 10 percent increase in execution time.
A work-optimal CGM algorithm for the LIS problem
Authors: Garcia Thierry, Myoupo Jean-Frédéric, Semé David
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

This paper presents a work-optimal CGM algorithm that solves the Longest Increasing Subsequence Problem. It can be implemented in the CGM with P processors in O(N2 &divide;P) time and O(P) communication steps. It is the first CGM algorithm for this problem and it is work-optimal since the sequential algorithm has a complexity of O(N2).
Optimal starting values for Newton-Raphson calculation of x1 2
Authors: David G. Moursund
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.
Cache invalidation scheme for mobile computing systems with real-time data
Authors: Joe Chun-Hung Yuen, Edward Chan, Kam-Yiu Lam, H. W. Leung
Venue: ACM SIGMOD Record (2000)

In this paper, we propose a cache invalidation scheme called Invalidation by Absolute Validity Interval (IAVI) for mobile computing systems. In IAVI, we define an absolute validity interval (AVI), for each data item based on its dynamic property such as the update interval. A mobile client can verify the validity of a cached item by comparing the last update time and its AVI. A cached item is invalidated if the current time is greater than the last update time plus its AVI. With this self-invalidation mechanism, the IAVI scheme uses the invalidation report to inform the mobile clients about changes in AVIs rather than the update event of the data items. As a result, the size of the invalidation report can be reduced significantly. Through extensive simulation experiments, we have found that the performance of the IVAI scheme is significantly better than other methods such as bit sequence and timestamp.
Separating repeats in DNA sequence assembly
Authors: John Kececioglu, Jun Ju
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

One of the key open problems in large-scale DNA sequence assembly is the correct reconstruction of sequences that contain repeats. A long repeat can confound a sequence assembler into falsely overlaying fragments that sample its copies, effectively compressing out the repeat in the reconstructed sequence. We call the task of correcting this compression by separating the overlaid fragments into the distinct copies they sample, the repeat separation problem. We present a rigorous formulation of repeat separation in the general setting without prior knowledge of consensus sequences of repeats or their number of copies. Our formulation decomposes the task into a series of four subproblems, and we design probabilistic tests or combinatorial algorithms that solve each subproblem. The core subproblem separates repeats using the so-called k-median problem in combinatorial optimization, which we solve using integer linear-programming. Experiments with an implementation show we can separate fragments that are overlaid at 10 times the coverage with very few mistakes in a few seconds of computation, even when the sequencing error rate and the error rate between copies are identical. To our knowledge this is the first rigorous and fully general approach to separating repeats that directly addresses the problem.
Active Mixers for Direct Conversion Receivers with 0.35-\bimum BiCMOS
Authors: Kalle Kivekäs, Aarno Pärssinen, Kari Halonen
Venue: Analog Integrated Circuits and Signal Processing (2001)

In this paper, the design requirements of different mixers for direct conversion receivers are discussed. Special attention has been paid into the detection of amplitude-modulated RF signal envelope. Three active mixers have been implemented to investigate the discussed requirements by using a 0.35-&mu;m, 25-GHz BiCMOS technology. The same process allows an objective comparison between the different topologies. The mixers are designed for a single 2.7 V supply, and specified for low power consumption. Different topologies are compared by their spurious free dynamic ranges (SFDR) with respect to their individual power consumption. Also, their performance were measured at different LO power levels and supply voltages. The results show insignificant differences between the topologies in low voltage applications.
An algorithm for exhaustive generation of building floor plans
Authors: Per Galle
Venue: Communications of the ACM (1981)

The combinatorial complexity of most floor plan design problems makes it practically impossible to obtain a systematic knowledge of possible solutions using pencil and paper. The objective of this paper is to contribute to the development of computer methods providing such knowledge for the designer. The paper describes an algorithm which generates all possible rectangular plans on modular grids with congruent cells, subject to constraints on total area, room areas, wall lengths, room adjacencies, and room orientations. To make room sizes regular and limit the solution set only such grids are used which minimize the number of cells in the smallest room. The description is sufficiently detailed to serve as a basis for programming. Test results for a Pascal implementation of the algorithm are reported. Realistic problems of up to ten rooms have been solved in modest lengths of computer time. The results indicate that the approach of exhaustive generation may prove to be more fruitful than generally assumed.
A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'
Authors: Li Sheng, Jie Wu
Venue: IEEE Transactions on Computers (2000)

In [1], Libeskind-Hadas provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithms. In this short note, we show a simpler proof of the tight lower bound.
Glossary for Partial Evaluation and Related Topics
Authors: Torben æ. Mogensen (Ed.)
Venue: Higher-Order and Symbolic Computation (2000)

Most areas of research or work use their own set of words and phrases and gives specific technical meaning to terms that in everyday speech may mean something less specific or something else entirely. The area of partial evaluation and program transformation is no different, which may make it hard for the uninitiated to grasp some parts of technical papers or discussions. This list of words and terms is intended as a help to people new in the subject area, but may also be of help to experienced researchers, as different research groups tend to develop different terminology.
Universal computer-oriented language
Authors: W. B. Dobrusky, T. B. Steel
Venue: Communications of the ACM (1961)

The basic idea of UNCOL Universal Computer-Oriented Language&mdash;is to introduce a language between problem-oriented languages, POLs, and machine languages, MLs. This third level consists of a single language, UNCOL, which has the character of a generalized machine-line language.
Using event segmentation to improve indexing of consumer photographs
Authors: Amanda Stent, Alexander Loui
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Automatic albuming --- the automatic organization of photographs, either as an end in itself or for use in other applications -- is an application that promises to be of great assistance to photographers. Relatively sophisticated image content analysis techniques have been used for image indexing, organization and retrieval. In this paper, we describe a method of organizing photographs into events using spoken photograph captions. The results of this process can be used to improve image indexing and retrieval.
Computer typesetting of ALGOL
Authors: L. von Sydow
Venue: Communications of the ACM (1967)

An application of computer-aided typesetting is introduced. A working method is described for publishing ALGOL by computerized translation from Hardware into Reference representation, computerized planning of typographical layout and computerized control of a typesetting machine. The point is made that experts in science, technology, and programming are guaranteed a correct ALGOL documentation without spending valuable time and power on typographic considerations and proofreading.
Towards a two-dimensional separation of concerns (poster session)
Authors: Constantinos A. Constantinides, Tzilla Elrad
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

As the size and requirements of software systems increase, their design has reached a complexity that requires software engineers to revisit the principle of separation of concerns [5]. Traditional software organization has been performed along some form of functional decomposition. Different paradigms and languages support the implementation, and composition of sub-parts into whole systems through the availability of some modular unit of functionality (component). In essence, traditional software decomposition and current programming languages have been mutually supportive [4]. At the same time, separation of concerns can only be beneficial if the different concerns can be effectively composed to produce the overall system. The OOP paradigm seems to work well only if the problem to be solved can be described with relatively simple interfaces among objects. Unfortunately, this is not the case when we move from sequential programming to concurrent programming where the component interaction violates simple object interfaces. One of the reasons behind this is the inherent structure of today's software systems that conceptually does not lead itself to a safe decomposition. As a result, the benefits associated with OOP no longer hold. Component interactions limit reuse and make it difficult to validate the design and correctness of software systems. Reengineering of these systems is needed in order to meet future changes in requirements. This component interaction is based on a number of properties that affect the semantics or the performance of the system and do not localize well in one modular unit, but tend to cut-across groups of components resulting in a &ldquo;code tangling&rdquo; [4]. Example cross-cutting properties (or aspects) include synchronization, scheduling, and fault tolerance. This code tangling destroys modularity, making the source code difficult to develop and difficult to understand. It also limits reuse, making the source code difficult to evolve. It further makes programs more error prone. In essence, it destroys the quality of the software. In [1] the authors refer to these phenomena as &ldquo;composition anomalies&rdquo;. This composition anomaly requires a shift in the methodologies used to separate concerns. In conjunction with modular composition, adaptability and reuse remain major issues to be considered while building complex software systems. Aspect-Oriented Programming (AOP) [4] is an emerging methodology that addresses components and aspects at the analysis and design phase of the software life-cycle, using mechanisms to compose them at the implementation level with a growing number of different technologies.
Computer graphics comes of age: an interview with Andries Van Dam
Authors: Andries Van Dam
Venue: Communications of the ACM (1984)

Andries van Dam describes major advances in computer graphics over the past 25 years and discusses future directions.
Semidefinite Programming Techniques for Reduced Order Systems with Guaranteed Stability Margins
Authors: Belinda B. King, Ekkehard W. Sachs
Venue: Computational Optimization and Applications (2000)

In this paper, the compensator based reduced order control design framework of Burns and King (J. Vibrations and Control, vol. 4, pp. 297&ndash;323, 1998) is modified to yield low order systems with guaranteed stability margins. This result is achieved through use of a logarithmic barrier function. In addition, a reduced basis method is formulated in which the compensator equations are approximated on uneven grids&semi; guaranteed stability margins are also included. The methods are tested numerically on a one dimensional, nonlinear, damped, hyperbolic structural control problem. Examples are provided to illustrate differences between systems designed by both reduced basis methods.
An introduction to Java3D (tutorial presentation)
Authors: Genevieve Orr
Venue: Journal of Computing Sciences in Colleges (2001)

Java3D is a top-down approach for building 3D interactive programs which run in a web browser or as stand-alone applications. Built on top of the Java programming language, it uses a scene graph hierarchy as the basic structure. Various geometrical representations, animation/interaction, lighting, texture, collision detection, and sound are supported. Java3D offers an alternative approach to teaching the traditional first semester computer graphics course. Typically such courses cover basic low level algorithms such as line drawing and clipping which can take a significant amount of time to learn, implement, and integrate into a full rendering system. As a result, students gain little or no experience actually building real 3D applications. Java3D can change this. Students who are already well versed in Java can quickly begin writing fun interactive 3D applications, thus providing context and motivation for later understanding the low level algorithms. Java3D is also a natural choice since Java itself is being adopted as the first computer language in more and more colleges. It has the added advantage that it is freely available and can run on a standard pc. This workshop will present an overview of the Java3D scene-graph hierarchy. Classes for building shapes, textures, and lighting, as well as for creating behaviors will be described. Many sample programs will also be presented.