ppxscal/embedding_network huggingface dataset:
The Compilation of Loop Induction Expressions
Authors: Richard L. Sites
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1979)

In an optimizing compiler, it is often desirable to compile subscript expressions such as Abase-2 + I*2 so that the value of the expression is available in a register and is simply incremented whenever I is incremented, thus avoiding the multiplication inside the loop. This change is effected by a standard optimization called strength reduction. Program loops often contain several such expressions stemming perhaps from references to operands A(I), A(I+1), B(I), and C(K,J,I,L). Under what circumstances can we do better than keeping four addresses in four separate registers or temporaries? A general technique is presented which minimizes the number of registers needed to hold such values, while simultaneously minimizing the amount of computation inside the loop. In the above collection, it is possible to use as few as two registers for the four I-dependent values.
New directions: a value-sensitive design approach to augmented reality
Authors: Batya Friedman, Peter H. Kahn,  Jr.
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

In this position paper we bring a new approach &mdash; Value-Sensitive Design &mdash; to understanding the value implications of augmented reality. We examine seven values: psychological well-being, physical well-being, privacy, deception, informed consent, ownership and property, and trust. In addition, we briefly describe our work where we apply a Value-Sensitive Design approach to augmented reality of the natural world.
32-bit CPU design with the 'AS888/'AS890
Authors: Frank Laczko, Bob Myers, Richard Nawrocki
Venue: ACM SIGMICRO Newsletter (1986)

Microprogramming and bit slice technology have made possible the development of powerful systems using flexible instructions sets and wide address/data buses to access more than one gigaword of physical main memory. This section discusses one design approach to such a system, using 'AS888 bit slice and 'AS890 microsequencer components.
The &ldquo;worm&rdquo; programs&mdash;early experience with a distributed computation
Authors: John F. Shoch, Jon A. Hupp
Venue: Communications of the ACM (1982)

The &ldquo;worm&rdquo; programs were an experiment in the development of distributed computations: programs that span machine boundaries and also replicate themselves in idle machines. A &ldquo;worm&rdquo; is composed of multiple &ldquo;segments,&rdquo; each running on a different machine. The underlying worm maintenance mechanisms are responsible for maintaining the worm&mdash;finding free machines when needed and replicating the program for each additional segment. These techniques were successfully used to support several real applications, ranging from a simple multimachine test program to a more sophisticated real-time animation system harnessing multiple machines.
Progressive acyclic digraphs&mdash;a tool for database integrity
Authors: Wilfred J. Hansen
Venue: Communications of the ACM (1979)

A progressive acyclic diagraph (PAD) algorithm accepts are requests and maintains a graph in an acyclic state. When a request creates a cycle, nodes are &ldquo;detached&rdquo; until the new arc can be entered acyclically. This process is important in certain areas of database implementation in which there are constraints on the permissible sequences of actions. Two PAD algorithms are presented; one uses a simple path matrix representation and the other uses a list with an &ldquo;artificial gradient.&rdquo; Experiments suggest that for large N the second is considerably faster, though both are asymptotically O(NR), where N is the number of nodes and R is the expected number of nodes reachable along paths from any given node.
Numerical Simulations of a Two-Layer Quasi-Geostrophic Equation of the Ocean
Authors: T. Tachim Medjo
Venue: SIAM Journal on Numerical Analysis (2000)

Our object in this article is to present some numerical schemes for a two-layer quasi-geostrophic model of the ocean and to study the stability of these schemes. We prove the unconditional stability of our numerical schemes. Numerical results from a wind-driven two-layer quasi-geostrophic model of the ocean using these schemes are also presented.
Scanning datapaths: a fast and effective partial scan selection technique
Authors: M. L. Flottes, R. Pires, B. Rouzeyre, L. Volpe
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper, we present a method for quickly identifying the scan path chain of datapaths. The originality of the method resides in working with both RT and gate-level level descriptions of circuits. The proposed technique results in a very significant reduction on the CPU time required for scan path selection. We investigate also some directions for the incorporation of partial scan methodology within High Level Synthesis for Testability.
PLEXUS&mdash;an on-line system for modeling neural networks
Authors: J. C. Dill, D. L. Randall, I. Richer
Venue: Communications of the ACM (1968)

A description is presented of PLEXUS, a system which enables a user to construct and specify a neural network, to analyze the output data produced by the network, and to store and retrieve networks and data from a library. The system, operated entirely from a digital display unit, interacts directly with the user and permits easy and rapid transitions between the various phases of the modeling process. PLEXUS is designed to complement neurophysiological research so that the systematic development of neural models can be coordinated with experimental work. PLEXUS networks are built up from components representing individual neurons, external stimuli, and interconnecting fibers, each component being of a relatively detailed nature. Provision is also made for the use of experimental data as input to a network. Convenient means for specification and modification of a network and extensive error-checking capabilities are provided. Data resulting from the simulation of a network may be analyzed by a variety of techniques ranging from examinations of the gross characteristics of the data to the determination of detailed statistical properties.
Selective private function evaluation with applications to private statistics
Authors: Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

Motivated by the application of private statistical analysis of large databases, we consider the problem of selective private function evaluation (SPFE). In this problem, a client interacts with one or more servers holding copies of a database x = x1, &hellip; , xn in order to compute f(xi1, &hellip; , xim), for some function f and indices i = i1, &hellip; , im chosen by the client. Ideally, the client must learn nothing more about the database than f(xi, &hellip; , xim), and the servers should learn nothing. Generic solutions for this problem, based on standard techniques for secure function evaluation, incur communication complexity that is at least linear in n, making them prohibitive for large databases even when f in relatively simple and m is small. We present various approaches for constructing sublinear-communication SPFE protocols, both for the general problem and for special cases of interest. Our solutions not only offer sublinear communication complexity, but are also practical in many scenarios.
Effective eye-gaze input into Windows
Authors: Chris Lankford
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

The Eye-gaze Response Interface Computer Aid (ERICA) is a computer system developed at the University of Virginia that tracks eye movement. To allow true integration into the Windows environment, an effective methodology for performing the full range of mouse actions and for typing with the eye needed to be constructed. With the methods described in this paper, individuals can reliably perform all actions of the mouse and the keyboard with their eye.
Teaching information systems management: an interactive case approach that is portfolio oriented
Authors: N. Faye Angel,  Ph.D.
Venue: Journal of Computing Sciences in Colleges (2001)

Although this paper focuses on a course in information systems management, the approach that is discussed can be generalized to most theoretically driven courses. Having taken classes that are highly theoretical, such as those in information systems development and management, the author has frequently been left with a void at the completion of the class. That void stemmed from not being able to manipulate the situations that arise when applying theory. Comprehensive case studies allow the students to experiment with and apply systems theories. However, a static case does not provide students with the interaction with users that they need once they hit the &ldquo;real world.&rdquo; To this end, an interactive element is added to the cases where the professor assumes the roles of several users. Not only are problem-solving abilities stimulated, students must develop other attributes, such as dependability and perseverance, that are highly valued in the work world. The completed project provides students with an impressive portfolio event that can promote their employability.
An efficient data structure for the simulation event set
Authors: W. R. Franta, Kurt Maly
Venue: Communications of the ACM (1977)

Recently algorithms have been presented for the realization of event scheduling routines suitable for general purpose discrete event simulation systems. Several exhibited a performance superior to that of commonly used simple linked list algorithms. In this paper a new event scheduling algorithm is presented which improves on two aspects of the best of the previously published algorithms. First, the new algorithm's performance is quite insensitive to skewed distributions, and second, its worst-case complexity is O(&radic;n), where n is the number of events in the set. Furthermore, tests conducted to estimate the average complexity showed it to be nearly independent of n.
Activating &ldquo;black boxes&rdquo; instead of opening &ldquo;zipper&rdquo; - a method of teaching novices basic CS concepts
Authors: Bruria Haberman, Yifat Ben-David Kolikant
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

In this paper we implement and evaluate of a unique instructional method for teaching basic concepts in computer science. This method is based on introducing a new concept through activating "black boxes" that demonstrate the properties of the concept and its role in the computing process. We used the "black box"-based instructional method to teach basic concepts of computation to novice high-school students. Later we conducted research aimed at assessing the effectiveness of this method on novice students' perceptions of basic concepts in computation. Research results indicated that students who learned according to the "black box"-based approach gained a better understanding of the basic computational model, compared to students who learned according to the traditional "zipper" approach.
Using an isolated network laboratory to teach advanced networks and security
Authors: John M. D. Hill, Curtis A. Carver,  Jr., Jeffrey W. Humphries, Udo W. Pooch
Venue: ACM SIGCSE Bulletin (2001)

This paper discusses the use of an isolated network laboratory to teach computer security using persistent cooperative groups and an active learning approach. Computer security and computer security education are areas of increasing importance as computer systems become more interconnected. When offered, undergraduate and graduate computer security courses are routinely taught using a traditional lecture format. If the course includes a class project, the class project is limited in scope and constitutes a relatively small portion of the student's grade. This paper examines a different approach in which the class project is the dominant factor in the student's grade. The students work in persistent cooperative teams as either a black or gold team. Black teams attempt to break into other black team computers or attack the gold team. The gold team operates Windows NT, LINUX, and Solaris-based servers and attempts to defend their servers and role-play system administrators. The entire exercise takes place in an isolated lab so as to separate student class activities from the rest of the departmental intranet. Four years of experience running the class with this format suggests that the use of persistent cooperative groups and active learning are effective approaches for teaching network security and are preferred over a lecture-based course.
Order-n correction for regular languages
Authors: Robert A. Wagner
Venue: Communications of the ACM (1974)

A method is presented for calculating a string B, belonging to a given regular language L, which is &ldquo;nearest&rdquo; (in number of edit operations) to a given input string &agr;. B is viewed as a reasonable &ldquo;correction&rdquo; for the possibly erroneous string &agr;, where &agr; was originally intended to be a string of L. The calculation of B by the method presented requires time proportional to |&agr;|, the number of characters in &agr;. The method should find applications in information retrieval, artificial intelligence, and spelling correction systems.
Admissibility of Control Operators for Solution Families to Volterra Integral Equations
Authors: Michael Jung
Venue: SIAM Journal on Control and Optimization (2000)

We reduce the admissibility of finite-dimensional control operators for an evolution system (satisfying certain mild regularity conditions) to that for a semigroup control system, for which there are plenty of results available in the literature. One such necessary and sufficient condition is the Carleson measure criterion. We prove this condition explicitly for evolution systems without the regularity assumption mentioned above. We also look at some examples which show that our respective hypotheses are necessary.
Computer laboratories for the theory of computing course
Authors: Laura A. Sanchis
Venue: Journal of Computing Sciences in Colleges (2001)

We describe, a set of structured laboratories designed for the theory of computing course. These laboratories include various types of exercises, including the writing of programs which perform tasks related to the concepts studied in class, as well as more traditional theory problems done with the aid of interactive computer programs.
CS1: where is visual basic?
Authors: James Harris
Venue: Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference (2000)

This paper attempts to study the dichotomy that exists between the acceptance of Visual Basic in the programming community and rejection of Visual Basic in the academic community. The study looks at the position of Visual Basic the academic and business communities and looks at the factors leading to the reluctance of academia to accept Visual Basic as a viable language for CS1 and CS2 classes and gives arguments as to why it should be considered.
On-line Algorithm for Blind Signal Extraction of Arbitrarily Distributed, but Temporally Correlated Sources Using Second Order Statistics
Authors: Andrzej Cichocki, Ruck Thawonmas
Venue: Neural Processing Letters (2000)

Most of the algorithms for blind separation/extraction and independent component analysis (ICA) can not separate mixtures of sources with extremely low kurtosis or colored Gaussian sources. Moreover, to separate mixtures of super- and sub-Gaussian signals, it is necessary to use adaptive (time-variable) or switching nonlinearities which are controlled via computationally intensive measures, such as estimation of the sign of kurtosis of extracted signals. In this paper, we develop a very simple neural network model and an efficient on-line adaptive algorithm that sequentially extract temporally correlated sources with arbitrary distributions, including colored Gaussian sources and sources with extremely low values (or even zero) of kurtosis. The validity and performance of the algorithm have been confirmed by extensive computer simulation experiments.
Cardinal relations between regions with a broad boundary
Authors: Serafino Cicerone, Paolino Di Felice
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

Despite the innovative relevance of the results about spatial relations today available, the expressiveness of spatial query languages needs to be pushed further significantly in order to cope with the complexity of spatial entities. In particular, more research is necessary in order to support queries against data with uncertainty. In connection with cardinal directions, the best method today available is the Boolean, 3 &times; 3 direction-relation matrix proposed very recently by Goyal and Egenhofer. Our paper extends such a method to the case of regions with a broad boundary by introducing a 4-value, 5 &times; 5 direction-relation matrix. Furthermore, the present contribution studies the notion of consistency for a direction-relation matrix and proposes a set of conditions which are necessary and sufficient for assessing consistency.
A general method of systematic interval computation for numerical integration of initial value problems
Authors: W. C. Martin, K. C. Paulson, L. Sashkin
Venue: Communications of the ACM (1966)

A procedure is given for continuously computing and monitoring the step size to be used by a self-starting, pth-order numerical integration method to solve an initial value problem. The procedure uses an estimate of the truncation error to calculate the step size.
A semantic-based execution model for multilevel secure workflows
Authors: Vijayalakshmi Atluri, Wei-Kuang Huang, Elisa Bertino
Venue: Journal of Computer Security (2000)

Workflow management systems (WFMS) support the modeling and coordinated execution of processes within an organization. To coordinate the execution of the various activities (or tasks) in a workflow, task dependencies are specified among them. As advances in workflow management take place, they are also required to support security. In a multilevel secure (MLS) workflow, tasks may belong to different security levels. Ensuring the dependencies from the tasks at higher security levels to those at lower security levels (high-to-low dependencies) may compromise security. In this paper, we consider such MLS workflows and show how they can be executed in a secure and correct manner. Our approach is based on semantic classification of the task dependencies that examines the source of the task dependencies. We classify the high-to-low dependencies in several ways colon; conflicting versus conflict-free, result-independent versus result-dependent, strong versus weak, and abortive versus non-abortive. We propose algorithms to automatically redesign the workflow and demonstrate that only a small subset among all the types of high-to-low dependencies requires to be executed by trusted subjects and all other types can be executed without compromising security. The solutions proposed in this paper are directly applicable to another relevant area of research - execution of multilevel transactions in multilevel secure databases since the atomicity requirements and other semantic requirements can be modeled as a workflow. When compared to the research in this area, our work (1) is more general in the sense that it can model several other types of dependencies thereby allowing one to specify relaxed atomicity requirements and (2) is capable of automatically redesigning a workflow without requiring any human intervention by eliminating some cycles among task dependencies, which helps to attain higher degree of atomicity.
Analysis of future event set algorithms for discrete event simulation
Authors: William M. McCormack, Robert G. Sargent
Venue: Communications of the ACM (1981)

New analytical and empirical results for the performance of future event set algorithms in discrete event simulation are presented. These results provide a clear insight to the factors affecting algorithm performance, permit evaluation of the hold model, and determine the best algorithm(s) to use. The analytical results include a classification of distributions for efficient insertion scanning of a linear structure. In addition, it is shown that when more than one distribution is present, there is generally an increase in the probability that new insertions will have smaller times than those in the future event set. Twelve algorithms, including most of those recently proposed, were empirically evaluated using primarily simulation models. Of the twelve tested, four performed well, three performed fairly, and five performed poorly.
Geometric algorithms for the analysis of 2D-electrophoresis gels
Authors: Alon Efrat, Frank Hoffman, Klaus Kriegel, Christof Schultz, Carola Wenk
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

In proteomics 2-dimensional gel electrophoresis (2-DE) is a separation technique for proteins. The resulting protein spots can be identified by either using picking robots and subsequent mass spectrometry or by visual cross inspection of a new gel image with an already analyzed master gel. Difficulties especially arise from inherent noise and irregular geometric distortions in 2-DE images. Aiming at the automated analysis of large series of 2-DE images, or at the even more difficult interlaboratory gel comparisons, the bottleneck is to solve the two most basic algorithmic problems with high quality: Identifying protein spots and computing a matching between two images. For the development of the analysis software CAROL at Freie Universit&auml;t Berlin we have reconsidered these two problems and obtained new solutions which rely on methods from computational geometry. Their novelties are: 1. Spot detection is also possible for complex regions formed by several &ldquo;merged&rdquo; (usually saturated) spots; 2. User-defined landmarks are not necessary for the matching. Furthermore, images for comparison are allowed to represent different parts of the entire protein pattern, which only partially &ldquo;overlap&rdquo;. The implementation is done in a client server architecture to allow queries via the Internet. We also discuss and point at related theoretical questions in computational geometry.
A comparing study of technology mapping for FPGA
Authors: H.-G. Martin, W. Rosenstiel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper investigates some design flows to obtain final designs on Xilinx XC4000 FPGAs. The examples generated by high level synthesis were mapped including placement and routing. This reveals that the common criteria of area optimal or delay-optimal circuits should be enlarged by routability and computing time.
A genealogy of control structures
Authors: Henry F. Ledgard, Michael Marcotty
Venue: Communications of the ACM (1975)

The issue of program control structures has had a history of heated controversy. To put this issue on a solid footing, this paper reviews numerous theoretical results on control structures and explores their practical implications. The classic result of B&ouml;hm and Jacopini on the theoretical completeness of if-then-else and while-do is discussed. Several recent ideas on control structures are then explored. These include a review of various other control structures, results on time/space limitations, and theorems relating the relative power of control structures under several notions of equivalence. In conclusion, the impact of theoretical results on the practicing programmer and the importance of one-in, one-out control structures as operational abstractions are discussed. It is argued further that there is insufficient evidence to warrant more than if-then-else, while-do, and their variants.