ppxscal/embedding_network huggingface dataset:
Towards the logic defect diagnosis for partial-scan designs
Authors: Shi-Yu Huang
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Logical defect diagnosis is a critical yet challenging process in VLSI manufacturing. It involves the identification of the defect spots in a logic IC that fails testing. In the last decade, algorithms for diagnosis have progressed significantly and the results are showing promise for full -scan designs. In this paper, we will first review several classical algorithms such as fault dictionary based analysis and effect cause analysis. Then, we discuss several diagnosis algorithms borrowed from the design debugging techniques. These algorithms do not require a pre-determined fault model, and thus, are more flexible and applicable to ICs in which the defects do not behave like common stuck-at or bridging faults. Finally, we will probe the possibility of extending these algorithms to designs with only partial-scan support.
A video-based rendering acceleration algorithm for interactive walkthroughs
Authors: Andrew Wilson, Ming C. Lin, Boon-Lock Yeo, Minerva Yeung, Dinesh Manocha
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

We present a new approach for faster rendering of large synthetic environments using video-based representations. We decompose the large environment into cells and pre-compute video based impostors using MPEG compression to represent sets of objects that are far from each cell. At runtime, we decode the MPEG streams and use rendering algorithms that provide nearly constant-time random access to any frame. The resulting system has been implemented and used for an interactive walkthrough of a model of a house with 260,000 polygons and realistic lighting and textures. It is able to render this model at 16 frames per second (an eightfold improvement over simpler algorithms) on average on a Pentium II PC with an off-the-shelf graphics card.
Fault detection for linear analog circuits using current injection
Authors: J. Velasco-Medina, T. Calin, M. Nicolaidis
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

A new test technique for linear analog circuits which employs current injection as input test stimulus is described. Our investigations have shown that current transitions resulting from a current injected on internal test points are significantly different for the fault free and faulty circuits. This can be used for fault detection purposes. In fact, the current injection as test input stimulus represents a powerfull alternative to the test approaches based on conventional voltage input stimulus. The new approach allows to improve the testability of various faults, which are difficult to detect or are untestable when using voltage-based test stimulus. In addition the technique has significant advantages for BIST testing purposes. The technique is illustrated by means of a modern opamp circuit and by considering catastrophic and gate-oxide-short (GOS) faults.
Teaching using off-the shelf on-line materials
Authors: Carl Alphonce, Debra Burhans, Helene Kershner, Barbara Sherman, Deborah Walters, Erica Eddy, Gloria Melara, Pete DePasquale, J. Philip East, Fred Springsteel, Kurt F. Lauckner
Venue: ACM SIGCSE Bulletin (2001)

The use of off-the-shelf on-line materials presents several challenges. In this session panelists report on their experiences in evaluating, installing and using such materials. Both positive and negative aspects of such use are discussed. The aim of the session is to provide useful information to those considering using (and those already using) on-line materials in their teaching. The session presents information in three mini-presentations, followed by a general discussion session.
Time studies as a tool for (computer science) education research
Authors: Anna Sandström, Mats Daniels
Venue: Proceedings of the Australasian conference on Computing education (2000)

Computer Science Education Research is often done in a very local setting and findings are difficult to transfer to other institutions. There are however several factors that speak in favor of expanding the research to an international scale, one is the wide spread of use of English and another is that the components taught are similar. Time is an important factor in studying how students learn and a suggestion is made on how to go forward to create a tool for performing time studies. Important issues concerning obtaining high quality data as well as some aspects of what it means to study are addressed.
Multiprogram scheduling: parts 3 and 4. scheduling algorithm and external constraints
Authors: E. F. Codd
Venue: Communications of the ACM (1960)

The scheduling algorithm examines the programs to be scheduled one by one and places their component rectangles in the corresponding load diagrams according to a set of placement rules.
Maximum likelihood estimation for filtering thresholds
Authors: Yi Zhang, Jamie Callan
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Information filtering systems based on statistical retrieval models usually compute a numeric score indicating how well each document matches each profile. Documents with scores above profile-specificdissemination thresholdsare delivered.An optimal dissemination threshold is one that maximizes a given utility function based on the distributions of the scores of relevant and non-relevant documents. The parameters of the distribution can be estimated using relevance information, but relevance information obtained while filtering isbiased. This paper presents a new method of adjusting dissemination thresholds that explicitly models and compensates for this bias. The new algorithm, which is based on the Maximum Likelihood principle, jointly estimates the parameters of the density distributions for relevant and non-relevant documents and the ratio of the relevant document in the corpus. Experiments with TREC-8 and TREC-9 Filtering Track data demonstrate the effectiveness of the algorithm.
Two-Transitive Parallelisms
Authors: Norman L. Johnson
Venue: Designs, Codes and Cryptography (2001)

In this article, the parallelisms which admit doubly transitive groups are completely classified as the two regular parallelisms in PG(3,2).
SoC integration of reusable baseband bluetooth IP
Authors: Torbjörn Grahm, Barry Clark
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

This presentation will give a list of design criteria an ASIC Design house need to look in the process of deciding to take the complex Bluetooth specification and implement everything from scratch or to integrate reusable Intellectual Property for integration into their SoC.The presentation also include experience from a typical embedded development project where reusable Bluetooth Baseband Intellectual Property both for HW and SW is used with the Bluetooth Technology from Ericsson as example. This pper is a compressed summary.
Garbage collection for virtual memory computer systems
Authors: H. D. Baecker
Venue: Communications of the ACM (1972)

In list processing there is typically a growing demand for space during program execution. This paper examines the practical implications of this growth within a virtual memory computer system, proposes two new garbage collection techniques for virtual memory systems, and compares them with traditional methods by discussion and by simulation.
Functional programming in C++
Authors: Brian McNamara, Yannis Smaragdakis
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

This paper describes FC++: a rich library supporting functional programming in C++. Prior approaches to encoding higher order functions in C++ have suffered with respect to polymorphic functions from either lack of expressiveness or high complexity. In contrast, FC++ offers full and concise support for higher-order polymorphic functions through a novel use of C++ type inference.Another new element in FC++ is that it implements a subtype polymorphism policy for functions, in addition to the more common parametric polymorphism facilities. Subtype polymorphism is common in object oriented languages and ensures that functions in FC++ fit well within the C++ object model.Apart from these conceptual differences, FC++ is also an improvement in technical terms over previous efforts in the literature. Our function objects are reference-counted and can be aliased without needing to be copied, resulting in an efficient implementation. The reference-counting mechanism is also exported to the user as a general-purpose replacement of native C++ pointers. Finally, we supply a number of useful functional operators (a large part of the Haskell Standard Prelude) to facilitate programming with FC++. The end result is a library that is usable and efficient, while requiring no extensions to the base C++ language.
Social navigation of food recipes
Authors: Martin Svensson, Kristina Höök, Jarmo Laaksolahti, Annika Waern
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

The term Social Navigation captures every-day behaviour used to find information, people, and places - namely through watching, following, and talking to people. We discuss how to design information spaces to allow for social navigation. We applied our ideas in a recipe recommendation system. In a follow-up user study, subjects state that social navigation adds value to the service: it provides for social affordance, and it helps turning a space into a social place. The study also reveals some unresolved design issues, such as the snowball effect where more and more users follow each other down the wrong path, and privacy issues.
Cellular arrays for the solution of graph problems
Authors: K. N. Levitt, W. H. Kautz
Venue: Communications of the ACM (1972)

A cellular array is a two-dimensional, checkerboard type interconnection of identical modules (or cells), where each cell contains a few bits of memory and a small amount of combinational logic, and communicates mainly with its immediate neighbors in the array. The chief computational advantage offered by cellular arrays is the improvement in speed achieved by virtue of the possibilities for parallel processing. In this paper it is shown that cellular arrays are inherently well suited for the solution of many graph problems. For example, the adjacency matrix of a graph is easily mapped onto an array; each matrix element is stored in one cell of the array, and typical row and column operations are readily implemented by simple cell logic. A major challenge in the effective use of cellular arrays for the solution of graph problems is the determination of algorithms that exploit the possibilities for parallelism, especially for problems whose solutions appear to be inherently serial. In particular, several parallelized algorithms are presented for the solution of certain spanning tree, distance, and path problems, with direct applications to wire routing, PERT chart analysis, and the analysis of many types of networks. These algorithms exhibit a computation time that in many cases grows at a rate not exceeding log2 n, where n is the number of nodes in the graph. Straightforward cellular implementations of the well-known serial algorithms for these problems require about n steps, and noncellular implementations require from n2 to n3 steps.
Bessel functions of integral order and complex argument
Authors: Marion C. Gray
Venue: Communications of the ACM (1961)

The FORTRAN II source language [1, 2] places rather severe restrictions on the form a subscript may take, primarily because of the manner in which indices are incremented in iterative loops. In the process of constructing a compiler for a medium-sized (8008-word memory) computer which will accept the FORTRAN II source language, it became clear that the &ldquo;recursive address calculation&rdquo; scheme, as used in the FORTRAN compilers to minimize object-program running time, was probably not the best one to use. This system, described in some detail by Samelson and Bauer [3], requires that the subscript expression be a linear function of the subscripting variable. The alternative, which requires complete evaluation of the &ldquo;storage mapping function&rdquo;, is usually rejected because of the time required for the object program to perform the necessary address calculation.
Models supporting the network management organization
Authors: L. J. G. T. van Hemmen
Venue: International Journal of Network Management (2000)

Organizations rely heavily on their communication networks to realize their primary objectives. Models and theories for the support of the management control and maintenance of these networks are only formulated from a technical point of view and there has been little fundamental research on organizational aspects of this subject. There are, however, some models in the literature that describe an organization to realize network management. Five models are reflected in this article and are compared to each other using some key success factors for network management. Copyright &copy; 2000 John Wiley Sons, Ltd.
A sequential detailed router for huge grid graphs
Authors: A. Hetzel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Sequential routing algorithms using maze-running are very suitable for general Over-the-Cell-Routing but suffer often from the high memory or runtime requirements of the underlying path search routine. A new algorithm for this subproblem is presented that computes shortest paths in a rectangular grid with respect to euclidean distance. It achieves performance and memory requirements similar to fast line-search algorithms while still being optimal. An additional application for the computation of minimal rip-up sets will be presented. Computational results are shown for a detailed router based on these algorithms that is used for the design of high performance CMOS processors at IBM.
How does radical collocation help a team succeed?
Authors: Stephanie Teasley, Lisa Covi, M. S. Krishnan, Judith S. Olson
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

Companies are experimenting with putting teams into warrooms, hoping for some productivity enhancement. We conducted a field study of six such teams, tracking their activity, attitudes, use of technology and productivity. Teams in these warrooms showed a doubling of productivity. Why? Among other things, teams had easy access to each other for both coordination of their work and for learning, and the work artifacts they posted on the walls remained visible to all. These results imply that if we are to truly support remote teams, we should provide constant awareness and easy transitions in and out of spontaneous meetings.
Performance of rollback recovery systems under intermittent failures
Authors: E. Gelenbe, D. Derochette
Venue: Communications of the ACM (1978)

A mathematical model of a transaction-oriented system under intermittent failures is proposed. The system is assumed to operate with a checkpointing and rollback/recovery method to ensure reliable information processing. The model is used to derive the principal performance measures, including availability, response time, and the system saturation point.
Expressing and enforcing distributed resource sharing agreements
Authors: Tao Zhao, Vijay Karamcheti
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Advances in computing and networking technology, and an explosion in information sources has resulted in a growing number of distributed systems being constructed out of resources contributed by multiple sources. Use of such resources is typically governed by sharing agreements between owning principals, which limit both who can access a resource and in what quantity. Despite their increasing importance, existing resource management infrastructures offer only limited support for the expression and enforcement of sharing agreements, typically restricting themselves to identifying compatible resources. In this paper, we present a novel approach building on the concepts of tickets and currencies to express resource sharing agreements in an abstract, dynamic, and uniform fashion. We also formulate the allocation problem of enforcing these agreements as a linear-programming model, automatically factoring the transitive availability of resources via chained agreements. A case study modeling resource sharing among ISP-level web proxies shows the benefits of enforcing transitive agreements: worst-case waiting times of clients accessing these proxies improves by up to two orders of magnitude.
Security Kernel validation in practice
Authors: Jonathan K. Millen
Venue: Communications of the ACM (1976)

A security kernel is a software and hardware mechanism that enforces access controls within a computer system. The correctness of a security kernel on a PDP-11/45 is being proved. This paper describes the technique used to carry out the first step of the proof: validating a formal specification of the program with respect to axioms for a secure system.
The first course in computer science needs a mathematics corequisite
Authors: Anthony Ralston
Venue: Communications of the ACM (1984)

First-year computer science students need to know and use a considerable amount of mathematics. A corequired course in discrete mathematics is a good solution.
Prettyprinting
Authors: Dereck C. Oppen
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

An algorithm for prettyprinting is given. For an input stream of length n and an output device with linewidth m, the algorithm requires time O(n) and space O(m). The algorithm is described in terms of two parallel processes: the first scans the input stream to determine the space required to print logical blocks of tokens; the second uses this information to decide where to break lines of text; the two processes communicate by means of a buffer of size O(m). The algorithm does not wait for the entire stream to be input, but begins printing as soon as it has received a full line of input. The algorithm is easily implemented.
Parallel processor scheduling with delay constraints
Authors: Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose a partial order on the jobs, and both communication and precedence delays impose relative timing constraints on dependent jobs. The combination of these two types of timing constraints naturally models the instruction scheduling problem that occurs during software compilation for state-of-the-art VLIW (Very Long Instruction Word) processors and multiprocessor parallel machines. We present the first known polynomial-time algorithm for the case where the precedence constraint graph is a forest of in-trees (or a forest of out-trees), the number of machines m is fixed, and the delays (which are a function of both the job pair and the machines on which they run) are bounded by a constant D. Our algorithm relies on a new structural theorem for scheduling jobs with arbitrary precedence constraints. Given an instance with many independent dags, the theorem shows how to convert, in linear time, a schedule S for only the largest dags into a complete schedule that is either optimal or has the same makespan as S.
The Complexity of Optimal Small Policies
Authors: Martin Mundhenk
Venue: Mathematics of Operations Research (2000)

We investigate the complexity of problems concerned with partially-observable Markov decision processes which are run for a finite number of steps under small policies. The calculation of the expected sum of rewards of a process under a small policy is shown to be complete for the complexity class PP, a class which lies intermediate between NP and PSPACE. Optimal small policy computation is shown to be complete for NP PP. The latter contrasts results of Papadimitriou and Tsitsiklis (Papadimitriou and Tsitsiklis 1987), who showed that this problem is PSPACE-complete, if no assumptions about the representability of the policy are made, and that it is P-complete for fully-observable processes.
Impact of fairness on Internet performance
Authors: Thomas Bonald, Laurent Massoulié
Venue: ACM SIGMETRICS Performance Evaluation Review (2001)

We discuss the relevance of fairness as a design objective for congestion control mechanisms in the Internet. Specifically, we consider a backbone network shared by a dynamic number of short-lived flows, and study the impact of bandwidth sharing on network performance. In particular, we prove that for a broad class of fair bandwidth allocations, the total number of flows in progress remains finite if the load of every link is less than one. We also show that provided the bandwidth allocation is "sufficiently" fair, performance is optimal in the sense that the throughput of the flows is mainly determined by their access rate. Neither property is guaranteed with unfair bandwidth allocations, when priority is given to one class of flow with respect to another. This suggests current proposals for a differentiated services Internet may lead to suboptimal utilization of network resources.
Performance Evaluation of Conservative Algorithms in Parallel Simulation Languages
Authors: Rajive L. Bagrodia, Mineo Takai
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Parallel discrete event simulation with conservative synchronization algorithms has been used as a high performance alternative to sequential simulation. In this paper, we examine the performance of a set of parallel conservative algorithms that have been implemented in the Maisie parallel simulation language. The algorithms include the asynchronous null message algorithm, the synchronous conditional event algorithm, and a new hybrid algorithm called Accelerated Null Message that combines features from the preceding algorithms. The performance of the algorithms is compared using the Ideal Simulation Protocol. This protocol provides a tight lower bound on the execution time of a simulation model on a given architecture and serves as a useful base to compare the synchronization overheads of the different algorithms. The performance of the algorithms is compared as a function of various model characteristics that include model connectivity, computation granularity, load balance, and lookahead.
Implementation of the substring test by hashing
Authors: Malcolm C. Harrison
Venue: Communications of the ACM (1971)

In a paper in the November 1970 Communications of the ACM, V.Y. Lum introduced a technique of file indexing named combined indices. This technique permitted decreased retrieval time at the cost of increased storage space. This paper examines combined indices under conditions of file usage with different fractions of retrieval and update. Tradeoff curves are developed to show minimal cost of file usage by grouping various partially combined indices.