ppxscal/embedding_network huggingface dataset:
A cyber-icebreaker for an effective virtual group?
Authors: Tony Clear, Mats Daniels
Venue: ACM SIGCSE Bulletin (2001)

This paper reports selected results from the most recent of a series of international collaborative trials between students at Auckland University of Technology and Uppsala University. The trials require students to work together in virtual groups, comprising students from each institution, to perform a common task. The topic of this paper is how to form and sustain more effective virtual groups. In this trial a cyber-icebreaker task has been introduced and its contribution to group effectiveness is explored. Some conclusions are drawn pinpointing the strengths and weaknesses of this trial design, and some insights into effective design of electronic collaborative learning groups are gained.
A practical clock tree synthesis for semi-synchronous circuits
Authors: M. Toyonaga, K. Kurokawa, T. Yasui, A. Takahashi
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such that a clock-input timing of each register is a multiple of a predefined unit delay and the length of interconnection from a parent node to its child is upper bounded. The clock trees are constructed for several practical circuits. The size of each clock tree is comparable to a zero skew clock tree. In order to assure the practical quality, they are examined under the five delay conditions, which cover various environmental and manufacturing conditions. As a result, they are proved stable under each condition and improve the clock speed up to 17.3 % against the zero skew clock trees.
Global optimization by suppression of partial redundancies
Authors: E. Morel
Venue: Communications of the ACM (1979)

The elimination of redundant computations and the moving of invariant computations out of loops are often done separately, with invariants moved outward loop by loop. We propose to do both at once and to move each expression directly to the entrance of the outermost loop in which it is invariant. This is done by solving a more general problem, i.e. the elimination of computations performed twice on a given execution path. Such computations are termed partially redundant. Moreover, the algorithm does not require any graphical information or restrictions on the shape of the program graph. Testing this algorithm has shown that its execution cost is nearly linear with the size of the program, and that it leads to a smaller optimizer that requires less execution time.
The CREW PRAM Complexity of Modular Inversion
Authors: Joachim vonzur Gathen, Igor E. Shparlinski
Venue: SIAM Journal on Computing (2000)

One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We present a lower bound $\Omega (\log n)$ for the parallel time on a concurrent-read exclusive-write parallel random access machine (CREW PRAM) computing the inverse modulo certain n-bit integers, including all such primes. For infinitely many moduli, our lower bound matches asymptotically the known upper bound. We obtain a similar lower bound for computing a specified bit in a large power of an integer. Our main tools are certain estimates for exponential sums in finite fields.
Hydrodynamics of a Water Rocket
Authors: Joseph M. Prusa
Venue: SIAM Review (2000)

Applications of mass, momentum, and energy balances are central to the teaching of fluid dynamics. In this study, a model to determine the trajectory of a water rocket is given that is far simpler than the system of coupled partial differential equations that typically results in modern hydrodynamic problems of interest. This makes the problem an excellent choice for a student project---it can reasonably be completed with a day or two of effort. In addition to the fundamental mathematics, this problem offers opportunities in scale analysis, numerical methods for IVPs, balance principles in accelerated frames of reference, and the collection and assessment of flight test data.
The design and implementation of a table driven, interactive diagnostic programming system
Authors: Thomas R. Wilcox, Alan M. Davis, Michael H. Tindall
Venue: Communications of the ACM (1976)

CAPS is a highly interactive diagnostic compiler/interpreter that allows beginning programmers to prepare, debug, and execute fairly simple programs at a graphics display terminal. Complete syntax checking and most semantic analysis is performed as the program is entered and as it is subsequently edited. Analysis is performed character by character. The most remarkable feature of CAPS is its ability to automatically diagnose errors both at compile time and at run time. Errors are not automatically corrected. Instead, CAPS interacts with the student to help him find the cause of his error. Most components of CAPS are table driven, both to reduce the space needed for implementation and to increase the flexibility of the multilingual system. Over 500 students have used CAPS to learn Fortran, PL/I, or Cobol in conjunction with a computer assisted course on introductory computer science.
Evaluation of Community Acquired Pneumonia Guidelines
Authors: Therese Sherlaine Ravago, Janet Mosniam, Fasika Alem
Venue: Journal of Medical Systems (2000)

Community acquired pneumonia (CAP) is a serious illness, in which the etiology of disease cannot be determined in 50% of the patients. The American Thoracic Society (ATS) and the Infectious Disease Society of America (IDSA) have independently developed treatment guidelines for CAP. These guidelines, however, differ in their approaches. The differences can be attributed to their unique approaches. ATS favors the application of empiric methodology verse IDSA, which recommends a definitive clinical approach. Presently, a widely accepted, standardized guideline for the diagnosis and treatment of CAP is unavailable. This contributes to the large variation in admission rates, use of institutional resources, and quality of care given to CAP patients.
On the design and quantification of privacy preserving data mining algorithms
Authors: Dakshi Agrawal, Charu C. Aggarwal
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

The increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms which preserve user privacy. A recently proposed technique addresses the issue of privacy preservation by perturbing the data and reconstructing distributions at an aggregate level in order to perform the mining. This method is able to retain privacy while accessing the information implicit in the original attributes. The distribution reconstruction process naturally leads to some loss of information which is acceptable in many practical situations. This paper discusses an Expectation Maximization (EM) algorithm for distribution reconstruction which is more effective than the currently available method in terms of the level of information loss. Specifically, we prove that the EM algorithm converges to the maximum likelihood estimate of the original distribution based on the perturbed data. We show that when a large amount of data is available, the EM algorithm provides robust estimates of the original distribution. We propose metrics for quantification and measurement of privacy-preserving data mining algorithms. Thus, this paper provides the foundations for measurement of the effectiveness of privacy preserving data mining algorithms. Our privacy metrics illustrate some interesting results on the relative effectiveness of different perturbing distributions.
Identity construction environments: supporting a virtual therapeutic community of pediatric patients undergoing dialysis
Authors: Marina U. Bers, Joseph Gonzalez-Heydrich, David Ray DeMaso
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

We describe a five-month pilot project conducted in the dialysis unit at Boston's Children's Hospital. Pediatric patients with renal disease used the Zora graphical multi-user environment while facing hemodialysis. Zora is an identity construciton environment specifically designed to help young people explore issues of identity, while engaging in a participatory virtual community. This paper presents the experience and evaluates the feasibility and safety of using Zora in a hospital setting. It describes how Zora facilitated explorations of identity and mutual patient support and interaction. Finally it also presents design recommendations for future interventions of this kind. More generally, this paper explores the potential of technology specifically designed with therapeutic purposes to help patients cope with their illness.
Position paper: completing the Ravenscar profile
Authors: Stephen Michell
Venue: Proceedings of the 10th international workshop on Real-time Ada workshop (2001)

There are some interactions between the Ravenscar Tasking Profile and sequential Ada language constructs which can cause undesirable behaviour for high integrity systems. We examine some of the interactions and discuss potential changes to the definition of the Ravenscar profile to correct the deficiencies found.
Using simulation across the curriculum
Authors: Matthew Dickerson, Timothy Huang, Ingrid Russell
Venue: Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference (2000)

Computer simulation has been well recognized as a valuable modelling tool in many disciplines, and many computer science educators already make use of simulations in various courses. To fully exploit its benefits, however, we believe that computer simulation should be integrated more broadly and intentionally across the curriculum rather than taught in an isolated, ad hoc fashion. In this paper we advocate the teaching and use of simulations across the undergraduate computer science curriculum at a liberal arts college. We focus on the development of simulations by students, though we also address the use of existing simulations. We present both advantages and disadvantages, and argue that in many situations the advantages outweigh the drawbacks. We then present in outline specific examples of how, with limited resources, simulations can be taught and used in several courses that are widely taught at many undergraduate institutions. An on-line version of this paper along with several resources and links can be found at: www.middlebury.edu/~dickerso/simulation/.
Digital document integrity
Authors: Graham Shaw
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

The revolution in digital data processing has brought many benefits to the way we create, organise and manage information, whether in the form of images, documents, audio or video files. The conversion of such information into digital form provides us with capabilities such as online storage and retrieval, efficient search processes and worldwide data transmission. But digital data also brings with it a major problem, namely the ease with which such information can be copied and tampered with, without the forensic trail of evidence that we have relied on for analogue and hard-copy files. The need has therefore arisen for technologies which are able to safeguard the integrity and authenticity of digital records, particularly if such records are subject to legal and/or ethical scrutiny. The preservation of integrity of digital records is particularly important where they are subject to concerted and possible criminal attack.
An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks
Authors: Yu-Liang Liu, Yue-Li Wang, D. J. Guan
Venue: IEEE Transactions on Computers (2001)

A weighted double-loop network can be modeled by a directed graph $G(n;h_1,h_2;w_1,w_2)$ with vertex set $Z_n=\{0,1,\ldots,n-1\}$ and edge set $E=E_1\cup E_2$, where $E_1=\{(u,u+h_1)\;|\; u\in Z_n\}$, $E_2=\{(u,u+h_2)\;|\; u\in Z_n\}$. Assume that the weight of each edge in $E_1$ is $w_1$ and the weight of each edge in $E_2$ is $w_2$. In this paper, we present an optimal routing algorithm on double-loop networks under the case where there is at most one faulty element. Our algorithm is based on the fact that the shortest path from a vertex to any other vertex in a double-loop network is in the L-shape region.
Algorithm 810: The SLEIGN2 Sturm-Liouville Code
Authors: P. B. Bailey, W. N. Everitt, A. Zettl
Venue: ACM Transactions on Mathematical Software (TOMS) (2001)

The SLEIGN2 code is based on the ideas and methods of the original SLEIGN code of 1979. The main purpose of the SLEIGN2 code is to compute eigenvalues and eigenfunctions of regular and singular self-adjoint Sturm-Liouville problems, with both separated and coupled boundary conditions, and to approximate the continuous spectrum in the singular case. The code uses some new algorithms, which we describe, and has a driver program that offers a user-friendly interface. In this paper the algorithms and their implementations are discussed, and the class of problems to which each algorithm applied is identified.
A Unified Symbolic Evaluation Framework for Parallelizing Compilers
Authors: Thomas Fahringer, Bernhard Scholz
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

The quality of many optimizations and analyses of parallelizing compilers depends significantly on the ability to evaluate symbolic expressions and on the amount of information available about program variables at arbitrary program points. In this paper, we describe an effective and unified symbolic evaluation framework that statically determines the values of variables and symbolic expressions, assumptions about and constraints between variable values, and the condition under which control flow reaches a program statement. We introduce the program context, a novel representation for comprehensive and compact control and data flow analysis information. Program contexts are described as first order logic formulas, which allows us to use public domain software for standard symbolic manipulation. Computations are represented as algebraic expressions defined over a program's problem size. Our symbolic evaluation techniques comprise accurate modeling of assignment and input/output statements, branches, loops, recurrences, arrays, and procedures. All of our techniques target both linear, as well as nonlinear, expressions and constraints. Efficiency of symbolic evaluation is highly improved by aggressive simplification techniques. A variety of examples, including program verification, dependence analysis, array privatization, communication vectorization, and elimination of redundant communication, are used to illustrate the effectiveness of our approach. We present results from a preliminary implementation of our framework, which is used as part of a parallelizing compiler that demonstrates the potential performance gains achievable by employing symbolic evaluation to support program parallelization.
Emotional content considered dangerous
Authors: Stephen W. Smoliar
Venue: Communications of the ACM (1974)

I had hoped that Moorer's rebuttal to my short communication in the November 1972 Communications would close the debate on a topic which, like the computer itself, has provoked an inordinately large quantity of unqualified argument. Unfortunately, the short communications by McMorrow and Wexelblat in the May 1973 Communications lead me to believe that my position is still grossly misunderstood. Therefore, allow me to clarify these matters.
Accurate Characterization of Silicon-On-Insulator MOSFETs for the Design of Low-Voltage, Low-Power RF Integrated Circuits
Authors: J.-P. Raskin, R. Gilon, G. Dambrine, J. Chen, D. Vanhoenacker, J.-P. Colinge
Venue: Analog Integrated Circuits and Signal Processing (2000)

The maturation of low cost Silicon-on-Insulator (SOI) MOSFET technology in the microwave domain has brought about a need to develop specific characterization techniques. An original scheme is presented, which, by combining careful design of probing and calibration structures, rigorous in-situ calibration, and a new powerful direct extraction method, allows reliable identification of the parameters of the non-quasi-static small-signal model and the high-frequency noise parameters for MOSFETs. The extracted model is shown to be valid up to 40 GHz.
Syntactic analysis by digital computer
Authors: M. P. Barnett, R. P. Futrelle
Venue: Communications of the ACM (1962)

This paper provides an account of the Shadow language that is used to describe syntax and of a corresponding subroutine that enables a computer to perform syntactic analysis. The input to this subroutine consists of a string to be analyzed and a description of the syntax that is to be used. The syntax is expressed in the Shadow language. The output consists of a trace table that expresses the results of the syntactic analysis in a tabular form. Several versions of the subroutine and some associated programs have been in use now for over three years. The present account of the language and the subroutine contains a summary of material that has been described previously in unpublished reports and also some additional discussion of the work in relation to the more general questions of problem-oriented languages and string transformations.
SOI Technologies Overview for Low-Power Low-Voltage Radio-Frequency Applications
Authors: O. Rozeau, J. Jomaah, S. Haendler, J. Boussey, F. Balestra
Venue: Analog Integrated Circuits and Signal Processing (2000)

Thanks to their structure, the SOI technologies present several intrinsic advantages for analog and RF applications. Indeed, as it is well established now, these technologies allow the reduction of the power consumption at a given operating frequency. Moreover, the high-insulating properties of SOI substrates, in particular when high resistivity substrate is used, make that these technologies are perfect candidates for mixed-signal applications. In the present paper, we will discuss the performances of the SOI technologies in radio-frequency range. First of all, the high-frequency behavior of SOI substrates, thanks to the characterization of transmission lines, will be shown. The impact of the SOI substrate resistivity on the performances of passive components will also be analyzed. Then, an overview of RF performances of SOI MOSFETs for two different architectures, fully- and partially-depleted, will be achieved and compared to the bulk ones. Finally, the influence of some specific parasitic effects, such as the kink effect, the self-heating effect and the kink-related excess noise, on the RF performances of SOI devices will be studied, thanks to a specific high-frequency characterization.
The lemniscate constants
Authors: John Todd
Venue: Communications of the ACM (1975)

The lemniscate constants, and indeed some of the methods used for actually computing them, have played an enormous part in the development of mathematics. An account is given here of some of the methods used&mdash;most of the derivations can be made by elementary methods. This material can be used for teaching purposes, and there is much relevant and interesting historical material. The acceleration methods developed for the purpose of evaluating these constants are useful in other problems.
C# essentials
Authors: Ben Albahari, Peter Drayton, Brad Merrill
Venue:  (2001)

Concise but thorough, C# Essentials introduces the brand-new Microsoft C# programming language and the Microsoft .NET Common Language Runtime (CLR) and Base Class Libraries (BCL) that support it. The compact format and terse presentation of key concepts serve as a roadmap to the online documentation included with the Microsoft .NET Framework SDK; the many examples provide much-needed context.
Deep realities: the fit of usability in business
Authors: Eric N. Wiebe
Venue: ACM Journal of Computer Documentation (JCD) (2000)

This commentary provides insight into the case study presented by Mirel by analyzing the social/organizational themes of (a) text book process versus deep reality, (b) group dynamics, (c) leadership, and (d) the role of values. It concludes that social information processing can provide explanatory power for both this case study and for other professional settings. It also notes the importance of ongoing and early educationof software industry professionals in the importance of usability.
Common phrases and minimum-space text storage
Authors: Robert A. Wagner
Venue: Communications of the ACM (1973)

A method for saving storage space for text strings, such as compiler diagnostic messages, is described. The method relies on hand selection of a set of text strings which are common to one or more messages. These phrases are then stored only once. The storage technique gives rise to a mathematical optimization problem: determine how each message should use the available phrases to minimize its storage requirement. This problem is nontrivial when phrases which overlap exist. However, a dynamic programming algorithm is presented which solves the problem in time which grows linearly with the number of characters in the text. Algorithm 444 applies to this paper.
On Stability Robustness of 2-D Systems Described by theFornasini&ndash;Marchesini Model
Authors: Tatsushi Ooba
Venue: Multidimensional Systems and Signal Processing (2001)

This paper studies the stability robustness estimates of two-dimensional (2-D) dynamics in the Fornasini&ndash;Marchesini model. It is stressed that the use of 2-D Lyapunov matrix inequality is limited in application to the stability robustness estimate problem. Two alternative ways to estimate the stability robustness of a 2-D dynamics are proposed. These are applicable in any stable 2-D dynamics. The comparison between the stability robustness estimate by the 2-D Lyapunov matrix inequality and those presented in this paper is illustrated by a numerical example.
Parallel hierarchical molecular structure estimation
Authors: Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altman
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Determining the structure of biological macromolecules such as proteins and nucleic acids is an important element of molecular biology because of the intimate relation between form and function of these molecules. Individual sources of data about molecular structure are subject to varying degrees of uncertainty. Previously we have examined the parallelization of a probabilistic algorithm for combining multiple sources of uncertain data to estimate the three-dimensional structure of molecules and also predict a measure of the uncertainty in the estimated structure. In this paper we extend our work on two major fronts. First we present a hierarchiacal decomposition of the original algorithm which reduces the sequential computational complexity tremendously. The hierarchical decomposition in turn reveals a new axis of parallelism not present in the "flat" organization of the problems, as well as new parallelization problems. We demonstrate good speedups on two cache-coherent shared-memory multiprocessors, the Stanford DASH and the SGI Challenge, with distributed and centralized memory organization, respectively. Our results point to several areas of further study to make both the hierarchiacal and the parallel aspects more flexible for general problems: automatic structure decomposition, processor load balancing across the hierarchy, and data locality management in conjunction with load balancing. Finally we outline the directions we are investigating to incorporate these extensions.