ppxscal/embedding_network huggingface dataset:
Scalable algorithms for adaptive statistical designs
Authors: Robert Oehmke, Janis Hardwick, Quentin F. Stout
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning algorithms for a stochastic environment, and we focus on the problem of optimally assigning patients to treatments in clinical trials. While adaptive designs have significant ethical and cost advantages, they are rarely utilized because of the complexity of optimizing and analyzing them. Computational challenges include massive memory requirements, few calculations per memory access, and multiply-nested loops with dynamic indices. We analyze the effects of various parallelization options, and while standard approaches do not work well, with effort an efficient, highly scalable program can be developed. This allows us to solve problems thousands of times more complex than those solved previously, which helps make adaptive designs pratical. Further, our work applies to many other problems involing neighbor recurrences, uch as generalized string matching.
An introductory problem in symbol manipulation for the student
Authors: Robert F. Rosin
Venue: Communications of the ACM (1960)

One objective of the course on Introduction to Digital Computers given by B. A. Galler at the University of Michigan is to equip the students with some knowledge of the techniques of automatic programming and to indicate some of the problems involved in such work. The final problem assigned in the course consists of a program to be written in some compiler language which involves symbol manipulation, automatic programming, etc. With the hope others in the computing field will find it of interest, an example of a final problem in this course is given here.
Interactive consulting via natural language
Authors: Stuart C. Shapiro, Stanley C. Kwasny
Venue: Communications of the ACM (1975)

Interactive programming systems often contain help commands to give the programmer on-line instruction regarding the use of the various systems commands. It is argued that it would be relatively easy to make these help commands significantly more helpful by having them accept requests in natural language. As a demonstration, Weizenbaum's ELIZA program has been provided with a script that turns it into a natural language system consultant.
Synchronous collaborative systems project
Authors: Heather Craven
Venue: Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges (2001)

There are many multi-user or collaborative computing systems and applications being used today, but little is known in regards to evaluating their usability. As a research assistant, I have focused on extending usability inspection techniques for multi-user systems. To do so, I helped to revise heuristics (rules of thumb) and validate them through use, while searching for and recording collaborative problems that can be analyzed and used in further experimental work.
Java a virtual statistical laboratory
Authors: Edward R. Jones
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

The primary goal of the virtual statistics lab is to improve a student's intuitive understanding of random phenomena and how statistical methods aid in interpreting them. This is being implemented using interactive statistical games designed around historical problems in probability and statistics. This paper describes the rationale, design and implementation of this on line statistics laboratory. Through experimentation and testing, it was decided that the best environment for implementing this online lab was through the use of java applets and server-side java servlets. Servlets are used to maintain a history of student interactions with the system and to stimulate student interest.
Spelling correction in user interfaces
Authors: Ivor Durham, David A. Lamb, James B. Saxe
Venue: Communications of the ACM (1983)

The feasibility of providing a spelling corrector as a part of interactive user interfaces is demonstrated. The issues involved in using spelling correction in a user interface are examined, and a simple correction algorithm is described. The results of an experiment in which the corrector is incorporated into a heavily used interactive program are described. More than one quarter of the errors made by users during the experiment were corrected using the simple mechanisms presented here. From this we have concluded that there are considerable benefits and few obstacles to providing a spelling corrector in almost any interactive user interface.
In support of student pair-programming
Authors: Laurie Williams, Richard L. Upchurch
Venue: ACM SIGCSE Bulletin (2001)

Industry, particularly those following the eXtreme Programming (XP) methodology [2], has popularized the use of pair-programming. The pair-programming model has also been found to be beneficial for student programmers. Initial quantitative and qualitative results, which will be discussed in this paper, demonstrate that the use of pair-programming in the computer science classroom enhances student learning and satisfaction and reduces the frustration common among students. Additionally, the use of pair-programming relieves the burden on the educators because students no longer view the teaching staff as their sole form of technical information. We explore the nature of pair-programming, then examine the ways such a practice may enhance teaching and learning in computer science education.
Applying the dependability paradigm to computer security
Authors: Catherine Meadows
Venue: Proceedings of the 1995 workshop on New security paradigms (1995)

Dependability is that property of a computer system such that reliance can justifiably be place on the service it delivers [Lap94]. In this paper we contrast the way different ways faults are handled in the dependability paradigm with the way they are handled in the current paradigms for secure systems design. We show how the current security paradigm is generally restricted to a subset of the types of approaches used in dependability, largely concentrating on fault prevention and removal while neglecting fault tolerance and forecast, and argue that this paradigm is fast becoming obsolete. We discuss the implications of extending the security paradigm to cover the full range of options covered by dependability. In particular, we develop a rough outline of a fault model for security and show how it could be applied to better our understanding of the place of both fault tolerance and fault forecast in computer security.
Oracle-based checking of untrusted software
Authors: George C. Necula, S. P. Rahul
Venue: ACM SIGPLAN Notices (2001)

We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higherorder logic program, the proof checker is replaced by a nondeterministic higher-order logic interpreter and the proof by an oracle implemented as a stream of bits that resolve the nondeterministic interpretation choices. In this setting, Proof-Carrying Code allows the receiver of the code the luxury of using nondeterminism in constructing a simple yet powerful checking procedure.This oracle-based variant of PCC is able to adapt quite naturally to situations when the property being checked is simple or there is a fairly directed search procedure for it. As an example, we demonstrate that if PCC is used to verify type safety of assembly language programs compiled from Java source programs, the oracles that are needed are on the average just 12% of the size of the code, which represents an improvement of a factor of 30 over previous syntactic representations of PCC proofs.
New complexity bounds for cylindrical decompositions of sub-pfaffian sets
Authors: Savvas Pericleous, Nicolai Vorobjov
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Tarski-Seidenberg principle plays a key role in many applications and algorithm of computer algebra. Moreover it is constructive, and some very efficient quantifier elimination algorithms appeared recently. However, Tarski-Seidenberg principle is wrong for first-order theories involving some real analytic functions (e.g. an exponential function). In this case a weaker statement is sometimes true, a possibility to eliminate one sort of quantifiers (either &forall; or &exist;). We construct a new algorithm for a cylindrical cell decomposition of a closed cube In &nsub; Rn compatible with a semianalytic subset S &nsub; In, defined by Pfaffian functions. In particular the algorithm is able to eliminate one sort of quantifiers from a first-order formula. The complexity bound of the algorithm is doubly exponential in n2.
Threaded code
Authors: James R. Bell
Venue: Communications of the ACM (1973)

The concept of &ldquo;threaded code&rdquo; is presented as an alternative to machine language code. Hardware and software realizations of it are given. In software it is realized as interpretive code not needing an interpreter. Extensions and optimizations are mentioned.
Functional scan chain testing
Authors: D. Chang, M. T.-C. Lee, K.-T. Cheng, M. Marek-Sadowska
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Functional scan chains are scan chains that have scan paths through a circuit's functional logic and flip-flops. Establishing functional scan paths by test point insertion (TPI) has been shown to be an effective technique to reduce the scan overhead. However once the scan chain is allowed to go through functional logic, the traditional alternating test sequence is no longer enough to ensure the correctness of the scan chain. We identify the faults that affect the functional scan chain, and show a methodology to find tests for these faults. Our results have the number of undetected faults at only 0.006% of the total number of faults, or 0.022% of the faults affecting the scan chain.
Inconsistencies in SURE Models: Computational Aspects
Authors: Erricos J. Kontoghiorghes
Venue: Computational Economics (2000)

The solution of the SURE model with singular variance-covariance matrix results in redundancies and possibly inconsistencies among the observations of the model. A numerical procedure is proposed and investigated that generates a consistent model from an inconsistent one. The use of SVD has been used to compute the various factorizations arising in the solution of the SURE model when treated as a generalized linear least squares problem.
Tree-structured programs
Authors: Eberhard Wegner
Venue: Communications of the ACM (1973)

With this note I hope to bridge the gap between the adherents of structured programming and the devotees of the unrestricted goto. I describe a style of programming which combines the advantages of structured programming with nearly all the power of the jump.
Digital certificates: a survey of revocation methods
Authors: Petra Wohlmacher
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Digital certificates form a basis that allows entities to trust each other. Due to different constraints, a certificate is only valid within a specific period of time. Coming from several threats, there are important reasons why its validity must be terminated sooner than assigned and thus, the certificate needs to be revoked. This paper provides a classification of revocation methods and gives an overview of the main methods like CRL, CRS, CRT, and OCSP. If and in which way a revocation method is suited must be analyzed in accordance to their purpose.
The Recognition of Human Movement Using Temporal Templates
Authors: Aaron F. Bobick, James W. Davis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

A new view-based approach to the representation and recognition of human movement is presented. The basis of the representation is a temporal template¿a static vector-image where the vector value at each point is a function of the motion properties at the corresponding spatial location in an image sequence. Using aerobics exercises as a test domain, we explore the representational power of a simple, two component version of the templates: The first value is a binary value indicating the presence of motion and the second value is a function of the recency of motion in a sequence. We then develop a recognition method matching temporal templates against stored instances of views of known actions. The method automatically performs temporal segmentation, is invariant to linear changes in speed, and runs in real-time on standard platforms.
Content integration for e-business
Authors: Michael Stonebraker, Joseph M. Hellerstein
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

We define the problem of content integration for E-Business, and show how it differs in fundamental ways from traditional issues surrounding data integration, application integration, data warehousing and OLTP. Content integration includes catalog integration as a special case, but encompasses a broader set of applications and challenges. We explore the characteristics of content integration and required services for any solution. In addition, we explore architectural alternatives and discuss the use of XML in this arena.
On Lion's counter example for Gotlieb's method for the construction of school timetables
Authors: Graham Smith, Ian M. Sefton
Venue: Communications of the ACM (1974)

The timetable problem is an essentially discrete problem. Although the discrete problem may have no feasible solution, there may exist a solution to the equivalent continuous problem. An example, is given, for which the nondiscrete solution can be interpreted as a set of timetables, differing from week to week, which together satisfy the long-term requirements of the timetable problem.
Performance-constrained hierarchical pipelining for behaviors, loops, and operations
Authors: Smita Bakshi, Daniel D. Gajski
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2001)

Behavioral specifications of DSP systems generally contain a number of nested loops. In order to obtain high date rates for such systems, it is necessary to pipeline the system within the behavior, within the loop bodies, and also within the operations. In order to hierarchically pipeline a performance-constrained system, an important step consists of distributing the performance constraint among the loops in such a manner that the constraint is satisfied and design cost is minimized. This paper presents an algorithm for propagating constraints and hierarchically pipelining a given throughput-constrained system. Along with pipelining, the algorithm schedules the operations within the loop bodies and selects components for them, with the aim of minimizing cost while satisfying the constraint propagated to the loop body. Results demonstrate the necessity of pipelining across the three granularity levels in order to obtain high performance designs. They also demonstrate the feasibility and quality of our approach, the indicate that it may be efficiently used for synthesizing or estimating within system-level design.
Inhabiting space: remarks on the production of place by urban 'tribes'
Authors: Alan J. Munro
Venue: ACM SIGGROUP Bulletin (2000)

We wish to look at the ways in which we use 'places' in our everyday lives. We wish particularly to look at a certain type of place, which we think may provide some insights into the ways in which we can create places and spaces of different types in the virtual world, making them as enduring or as ephemeral as we might wish. Particularly, we will look at the ways in which different communities can overlap in a given space.
Hierarchical characterization of analog integrated CMOS circuits
Authors: J. Ecküller, M. Gröpl, H. Gräb
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a new method for hierarchical characterization of analog integrated circuits. For each circuit class, a fundamental set of performances is defined and extracted topology independently. A circuit being characterized is decomposed in general subcircuits. Sizing rules of these topology independent subcircuits are included into the characterization by functional constraints. In this way, bad circuit sizing is detected and located.
PocketLinux Gives Jabber Its First Hand(held)
Authors: Doc Searls
Venue: Linux Journal (2001)

The "Next Bang" prophecy fulfilled.
Teaching abstraction explicitly (poster session)
Authors: Herman Koppelman
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

When one has to learn programming one has to learn a programming language, but also the concept of abstraction. Learning abstraction is not a logical consequence of learning a programming language. Moreover, it can be doubted whether novice programmers naturally tend to use abstraction. So, our approach is to teach abstraction explicitly to novices. We show that even for simple problems it makes sense to look for levels of abstraction in the problem definition and subsequently to design programs that reflect explicitly those levels of abstraction.We will discuss the way it works on the basis of a simple example.
Experiences with tutored video instruction for introductory programming courses
Authors: Richard Anderson, Martin Dickey, Hal Perkins
Venue: ACM SIGCSE Bulletin (2001)

In this paper we describe our experiences of exporting our introductory programming courses to community colleges. We used Tutored Video Instruction (TVI) as the mode of instruction where recorded versions of our lectures were shown to groups of students with local instructors periodically stopping the lecture for questions and discussion. We have offered a total of 16 sections of TVI courses, 11 were of our first quarter programming course (CSE142), and 5 were of our second quarter programming course (CSE 143). The courses were offered at seven institutions. Approximately 180 students completed the courses.We identify factors which contributed positively and negatively to the use of TVI for introductory programming courses. The two most important changes to our TVI program based on these experiences will the use of studio produced lectures and the abandonment of centralized course administration.
Dynamic Establishment and Termination of Real-Time Message Streams in Dual-Bus Networks
Authors: Ching-Chih Han, Chao-Ju Hou, Kar Sun Tsoi, Sean Ho
Venue: IEEE Transactions on Computers (2000)

Several medium access control (MAC) schemes have been developed for dual-bus networks such as DQDB [8], Fasnet [10], CRMA [12], and Simple [9]. However, how to guarantee the timely delivery of isochronous (real-time) messages with hard deadline constraints is one of the open issues yet to be solved. In [5], we laid a formal basis for allocating prearbitrated slots to isochronous message streams in dual-bus networks and devised a slot allocation scheme to statically establish a set of isochronous message streams at system initialization. In this paper, we complement our work in [5] and propose, with the necessary theoretical base established, a dynamic message stream setup and tear-down scheme for dual-bus networks. The resulting channel establishment and termination procedures are simple and can be easily implemented in dual-bus networks.
A scalable cross-platform infrastructure for application performance tuning using hardware counters
Authors: S. Browne, J. Dongarra, N. Garner, K. London, P. Mucci
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

The purpose of the PAPI project is to specify a standard API for accessing hardware performance counters available on most modern microprocessors. These counters exist as a small set of registers that count &ldquo;events&rdquo;, which are occurrences of specific signals and states related to the processor's function. Monitoring these events facilitates correlation between the structure of source/object code and the efficiency of the mapping of that code to the underlying architecture. This correlation has a variety of uses in performance analysis and tuning. The PAPI project has proposed a standard set of hardware events and a standard cross-platform library interface to the underlying counter hardware. The PAPI library has been or is in the process of being implemented on all major HPC platforms. The PAPI project is developing end-user tools for dynamically selecting and displaying hardware counter performance data. PAPI support is also being incorporated into a number of third-party tools.
Operating system performance
Authors: W. C. Lynch
Venue: Communications of the ACM (1972)

An overview of the current and future positions with respect to operating system performance is given. While a great deal of information and a large number of models for subsystems have been developed, gaps still exist in our knowledge. Because of the severe interactions between the various subsystems of an operating system, an overall model of the total system must be developed to be able to analyze and design the performance aspects of an operating system Although such total system designs are exceptional today, it is projected that they will become increasingly more common and necessary in the near future. Such a design philosophy will clearly have a severe impact on the way we go about modularizing operating and computer systems.
A scalable, robust network for parallel computing
Authors: Peter Cappello, Dimitros Mourloukos
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, eager scheduling, and space-based coordination. The object-oriented API is simple, compact, and cleanly separates application logic from the logic that supports interprocess communication and fault tolerance. Computations, of course, run to completion in the presence of computational hosts that join and leave the ongoing computation. Such hosts, or producers, use task caching and prefetching to overlap computation with interprocessor communication. To break a potential task server bottleneck, a network of task servers is presented. Even though task servers are envisioned as reliable, the self-organizing, scalable network of n servers, described as a sibling-connected fat tree, tolerates a sequence of n &mdash; 1 server failures. Tasks are distributed throughout the server network via a simple &ldquo;diffusion&rdquo; process. CX is intended as a test bed for research on automated silent auctions, reputation services, authentication services, and bonding services. CX also provides a test bed for algorithm research into network-based parallel computation.
Copying cyclic list structures in linear time using bounded workspace
Authors: David A. Fisher
Venue: Communications of the ACM (1975)

A bounded workspace copying algorithm for arbitrary list structures is given. This algorithm operates in linear time and does not require tag bits. The best previous bounded workspace copying algorithms achieved n2 time without tag bits and n log n time with one tag. The only restriction on the algorithm given here is that the copy must be placed into a contiguous section of memory. The method is applicable to fixed or variable size nodes.