ppxscal/embedding_network huggingface dataset:
Structured name-spaces in secure databases
Authors: Adrian Spalka, Armin B. Cremers
Venue: Journal of Computer Security (2000)

The satisfaction of confidentiality demands is secure logic-based databases requires a distortion of the databases intended model. This work focuses on distortions incurred by changes in a databases name-space, i.e., its signature, which are useful for achieving a high degree of confidentiality. Extensions to an open databases universal name-space which preserve its static and dynamic semantics are the key element. The resulting structured name-spaces can be used to reflect both the sharing of protection units between groups of users and the demands to keep them confidential. With respect to multi-level databases, these extensions can be embedded in the partial order of the security levels, which yields a set of hierarchical name-spaces.
Folk computing: revisiting oral tradition as a scaffold for co-present communities
Authors: Rick Borovoy, Brian Silverman, Tim Gorton, Matt Notowidigdo, Brian Knep, Mitchel Resnick, Jeff Klann
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

In this paper, we introduce Folk Computing: an approach for using technology to support co-present community building inspired by the concept of folklore. We also introduce a new technology, called &ldquo;i-balls,&rdquo; whose design helped fashion this approach. The design of the i-ball environment is explained in terms of our effort to simultaneously preserve what works about folklore while also using technology to expand its power as a medium for community building.
Worst case constant time priority queue
Authors: Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We present a new data structure of size 3M + &Ogr;(M) bits for solving the &ldquo;discrete priority queue&rdquo; problem. When this data structure is used in combination with a new memory topology it provides an O(1) worst case time solution. In doing so we demonstrate how an unconventional, but practically implementable, memory architecture can be employed to sidestep a lower bound (of lg lg M) and achieve constant time performance.
Generic Uniqueness of Equilibrium in Large Crowding Games
Authors: Igal Milchtaich
Venue: Mathematics of Operations Research (2000)

A crowding game is a noncooperative game in which the payoff of each player depends only on the player's action and the size of the set of players choosing that particular action: The larger the set, the smaller the payoff. Finite,n-player crowding games often have multiple equilibria. However, a large crowding game generically has just one equilibrium, and the equilibrium payoffs in such a game are always unique. Moreover, the sets of equilibria of them-replicas of a finite crowding game generically converge to a singleton asm tends to infinity. This singleton consists of the unique equilibrium of the "limit" large crowding game. This equilibrium generically has the following graph-theoretic property: The bipartite graph, in which each player in the original, finite crowding game is joined with all best-response actions for (copies of ) that player, does not contain cycles.
Static checking of system behaviors using derived component assumptions
Authors: Paola Inverardi, Alexander L. Wolf, Daniel Yankelevich
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2000)

A critical challenge faced by the developer of a software system is to understand whether the system's components correctly integrate. While type theory has provided substantial help in detecting and preventing errors in mismatched static properties, much work remains in the area of dynamics. In particular, components make assumptions about their behavioral interaction with other components, but currently we have only limited ways in which to state those assumptions and to analyze those assumptions for correctness. We have formulated a method that begins to address this problem. The method operates at the architectural level so that behavioral integration errors, such as deadlock, can be revealed early and at a high level. For each component, a specification is given of its interaction behavior. Form this specification, assumptions that the component makes about the corresponding interaction behavior of the external context are automatically derived. We have defined an algorithm that performs compatibility checks between finite representations of a component's context assumptions and the actual interaction behaviors of the components with which it is intended to interact. A configuration of a system is possible if and only if a successful way of matching actual behaviors with assumptions can be found. The state-space complexity of this algorithm is significantly less than that of comparable approaches, and in the worst case, the time complexity is comparable to the worst case of standard rachability analysis.
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
Authors: Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa
Venue: ACM SIGPLAN Notices (2000)

In this paper we propose a new method for deriving a practical linear-time algorithm from the specification of a maximum-weightsum problem: From the elements of a data structure x, find a subset which satisfies a certain property p and whose weightsum is maximum. Previously proposed methods for automatically generating linear-time algorithms are theoretically appealing, but the algorithms generated are hardly useful in practice due to a huge constant factor for space and time. The key points of our approach are to express the property p by a recursive boolean function over the structure x rather than a usual logical predicate and to apply program transformation techniques to reduce the constant factor. We present an optimization theorem, give a calculational strategy for applying the theorem, and demonstrate the effectiveness of our approach through several nontrivial examples which would be difficult to deal with when using the methods previously available.
OpenMath: compositionality achieved at last
Authors: Andreas Strotmann, Ladislav Kohout
Venue: ACM SIGSAM Bulletin (2000)

As a language for exchanging computer-"understandable" representations of mathematical formulas and concepts, OpenMath has a fairly standard syntactic structure for most of the mathematical notions that have so far been formalized in its "Content Dictionaries." The syntax for most operators is closely related to the well-known and decades-old LISP prefix notation for function application.For syntactic representations of a particular large class of mathematical operators, however, OpenMath takes a very unusual approach when compared with any of the existing Computer Algebra systems, say. This class contains integration and differentiation operators, sums and products, and other generalized quantifiers.In our paper we argue that OpenMath's novel approach to representing generalized quantifiers is superior to the classic representations. In particular, we show that this unusual feature of OpenMath has been designed to adhere to the Compositionality Principle[10], a design principle that classic representations, including older versions of OpenMath, have been violating[12].Having thus shown the importance of compositionality for the design of modern OpenMath, we then proceed to show that the Compositionality Principle is a fundamental research instrument in the Formal Semantics branch of linguistics[9], and argue that, like the use of this particular guiding principle for improvements in the design of a representation for generalized quantifiers, the study of the underlying structure of natural language as discovered by various branches of linguistics can provide many more suggestions for further improvements to OpenMath and to its sibling, MathML. We give some examples to substantiate our claim.
On the relevance of wire load models
Authors: Kenneth D. Boese, Andrew B. Kahng, Stafanus Mantik
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

Wire load models (WLMs) are generally perceived to be inaccurate and inadequate for good optimization. The traditional wisdom is that accuracy of WLMs will worsen as die sizes expand and feature sizes shrink, and as wire loads become less predictable and more dominant over pin loads. In many industry white papers and academic works, the weaknesses of WLMs are used to motivate the unification of logic synthesis and physical layout into a single tool. We believe, however, that care must be taken in how we derive our motivations for new flows. In previous studies, evidence against WLMs was generally anecdotal or based on limited data (e.g., from a single design). Today, the maturation of Cadence Design Systems' PKS design tool affords us a unique opportunity to study WLMs in greater depth, and to quantify the timing improvements achieved by the unification of synthesis and layout. Using PKS, we have performed extensive experiments on fifteen real industry test cases. Our results confirm much of the conventional wisdom about WLMs, but also indicate that WLMs probably can still perform a useful function in the design flow.
Horner's rule for the evaluation of general closed queueing networks
Authors: M. Reiser, H. Kobayashi
Venue: Communications of the ACM (1975)

The solution of separable closed queueing networks requires the evaluation of homogeneous multinomial expressions. The number of terms in those expressions grows combinatorially with the size of the network such that a direct summation may become impractical. An algorithm is given which does not show a combinatorial operation count. The algorithm is based on a generalization of Horner's rule for polynomials. It is also shown how mean queue size and throughput can be obtained at negligible extra cost once the normalization constant is evaluated.
False-Path Removal Using Delay Fault Simulation
Authors: Marwan A. Gharaybeh, Vishwani D. Agrawal, Michael L. Bushnell, Carlos G. Parodi
Venue: Journal of Electronic Testing: Theory and Applications (2000)

Some false paths are caused by redundant stuck-at faults. Removal of those stuck-at faults automatically eliminates such false paths from the circuit. However, there are other false paths that are not associated with any redundant stuck-at fault. All segments of such a false path are shared with other testable paths. We focus on the elimination of this type of false paths. We use a non-enumerative path delay fault simulator based on the path status graph (PSG) data-structure, which duplicates selected gates to separate the detected and undetected path delay faults. The expanded circuit may contain new redundant stuck-at faults, corresponding to those undetected paths that are false. This happens because the expanded circuit has some new interconnects with only false paths passing through them. Such links become the sites for redundant stuck-at faults. Removal of these redundant faults eliminates false paths. The reported results show that the quality of the result may depend on the coverage of testable paths by the vectors that are simulated. When non-enumerative path delay simulation and implication-based redundancy removal techniques are used, the present procedure of false-path elimination can be applied to very large circuits.
An online editor
Authors: L. Peter Deutsch, Butler W. Lampson
Venue: Communications of the ACM (1967)

An online, interactive system for text editing is described in detail, with remarks on the theoretical and experimental justification for its form. Emphasis throughout the system is on providing maximum convenience and power for the user. Notable features are its ability to handle any piece of text, the content-searching facility, and the character-by-character editing operations. The editor can be programmed to a limited extent.
Transforming a company with OOP
Authors: Andrea Rinaldi
Venue: ACM SIGAPP Applied Computing Review (2000)

The object-oriented software development paradigm has reached the mainstream application market very soon after its boom in research institutions. However, the lack of an organized work plan has spelt the doom of those who jumped on corporate object orientation without a precise growth plan. Many are the choices that have to be undertaken in such an environment, and some of them affect the fabric of software development in the very core of the business. Object orientation, however, promises to relieve the company from the ever-increasing necessity to adapt every product as soon as a requirement change occurs, by limiting the changes to a restricted number of well-identified code fragments.This paper presents an account of how object-oriented software development was introduced in our company, the foundation of our understanding object orientation, and the hurdles we overcame in the process of building a reusable application framework.
The Non-Collinearity Graph of the O^+(8,2)Quadric Is Uniquely Geometrisable
Authors: Pratima Panigrahi
Venue: Designs, Codes and Cryptography (2000)

The graph of the title has the points of the O^+(8,2) polar space as its vertices, two such vertices being adjacent iff the corresponding points are non-collinear in the polar space. We prove that, upto isomorphism, there is a unique partial geometry pg(8,7,4) whose point graph is this graph. This is the partial geometry of Cohen, Haemers and Van Lint and De Clerck, Dye and Thas. Our uniqueness proof shows that this geometry has a subgeometry isomorphic to the affine plane of order three, and the geometry is canonically describeable in terms of this affine plane.
Test circuits for substrate noise evaluation in CMOS digital ICs
Authors: Makoto Nagata, Takafumi Ohmoto, Jin Nagai, Takashi Morie, Atsushi Iwata
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A Transition Controllable Noise Source (TCNS) generates substrate noises with controlled transitions in size, interstage delay, and direction. The noises are measured in a 100-ps 100-uV resolution by a linear substrate voltage detector that uses a front-end PMOS source follower probing substrate potential and a back-end latch comparator for sampling/digitizing the source follower output. A 0.4-um CMOS test chip demonstrates the effectiveness of these circuits in performing advanced researches on the substrate noise.
Our method to teach algorithmic development
Authors: Ana Rosso, Marcela Daniele
Venue: ACM SIGCSE Bulletin (2000)

In this paper we outline a method of teaching algorithmic, based on problem-solving and stating the necessary stages to be considered when writing an algorithm which solves a given problem.
Generating mixing hardware/software systems from SDL specifications
Authors: Frank Slomka, Matthias Dörfel, Ralf Münzenberger
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

A new approach for the translation of SDL specifications to a mixed hardware/software system is presented. Based on the computational model of communicating extended finite state machines (EFSM) the control flow is separated from data flow of the SDL process. Hence for the first time it is possible to generate a mixed hardware/software implementation of an SDL process. This technique also reduces the complexity for high-level and register-transfer synthesis tools for the hardware parts of the system. The advantage of this methodology is shown by a design example of a wireless communication chip.
An Accurate Instruction-Level Energy Consumption Model for Embedded RISC Processors
Authors: Sheayun Lee, Andreas Ermedahl, Sang Lyul Min
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

Energy consumption of software is becoming an increasingly important issue in designing mobile embedded systems where batteries are used as the main power source. As a consequence, recently, a number of promising techniques have been proposed to optimize software for reduced energy consumption. Such low-power software techniques require an energy consumption model that can be used to estimate or predict the energy consumed by software. We propose a technique to derive an accurate energy consumption model at the instruction level, combining an empirical method and a statistical analysis technique. The result of the proposed approach is given by a model equation that characterizes energy behavior of software based on the properties of the instructions. Experimental results show that the model equation can accurately estimate the energy consumption of random instruction sequences, with an average error of 2.5%
Computer-assigned codes from verbal responses
Authors: Robert T. O'Reagan
Venue: Communications of the ACM (1972)

It is often desirable to convert verbal responses to multidigit codes. This conversion is generally accomplished by clerk-coders. A study was conducted to test the feasibility of translating verbal descriptions to numerical codes in a computer program. Primary emphasis was placed on computerized construction of a reference file of verbal descriptions for use by the program. The results of the study clearly show that such procedures are feasible.
Determining computable scenes in films and their structures using audio-visual memory models
Authors: Hari Sundaram, Shih-Fu Chang
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results from the psychology of audition into a computational scene model. We define a computable scene to be a chunk of audio-visual data that exhibits long-term consistency with regard to three properties: (a) chromaticity (b) lighting (c) ambient sound. Central to the computational model is the notion of a causal, finite-memory viewer model. We segment the audio and video data separately. In each case we determine the degree of correlation of the most recent data in the memory with the past. The respective scene boundaries are determined using local minima and aligned using a nearest neighbor algorithm. We introduce a periodic analysis transform to automatically determine the structure within a scene. We then use statistical tests on the transform to determine the presence of a dialogue. The algorithms were tested on a difficult data set: five commercial films. We take the first hour of data from each of the five films. The best results: scene detection: 88% recall and 72% precision, dialogue detection: 91% recall and 100% precision.
A method for comparing the internal operating speeds of computers
Authors: Eugene Raichelson, George Collins
Venue: Communications of the ACM (1964)

First, a table of frequencies of various types of operations is prepared based on experience in similar applications or, perhaps, on actual counts if these are available. Table 1 shows such a frequency table. Next, the total weighted execution time for a given operation type is obtained by multiplying the time required for the operation by the frequency count. Finally, an &ldquo;average&rdquo; operation time is calculated by summing overall operation types and dividing by the sum of the frequency counts. Table 2 shows the computation for the IBM 7090. Table 3 shows a comparison of average and relative speeds for several current computers for the particular application using the IBM 7090 as a reference base.
Database-friendly random projections
Authors: Dimitris Achlioptas
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space where k is logarithmic in n and independent of d so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a random k-dimensional hyperplane. We give a novel construction of the embedding, suitable for database applications, which amounts to computing a simple aggregate over k random attribute partitions.
&ldquo;According to Abramowitz and Stegun&rdquo; or arccoth needn't be uncouth
Authors: Robert M. Corless, David J. Jeffrey, Stephen M. Watt, James H. Davenport
Venue: ACM SIGSAM Bulletin (2000)

This paper addresses the definitions in OpenMath of the elementary functions. The original OpenMath definitions, like most other sources, simply cite [2] as the definition. We show that this is not adequate, and propose precise definitions, and explore the relationships between these definitions.In particular, we introduce the concept of a couth pair of definitions, e.g. of arcsin and arcsinh, and show that the pair arccot and arccoth can be couth.
Designing computer systems with MEMS-based storage
Authors: Steven W. Schlosser, John Linwood Griffin, David F. Nagle, Gregory R. Ganger
Venue: ACM SIGPLAN Notices (2000)

For decades the RAM-to-disk memory hierarchy gap has plagued computer architects. An exciting new storage technology based on microelectromechanical systems (MEMS) is poised to fill a large portion of this performance gap, significantly reduce system power consumption, and enable many new applications. This paper explores the system-level implications of integrating MEMS-based storage into the memory hierarchy. Results show that standalone MEMS-based storage reduces I/O stall times by 4--74X over disks and improves overall application runtimes by 1.9--4.4X. When used as on-board caches for disks, MEMS-based storage improves I/O response time by up to 3.5X. Further, the energy consumption of MEMS-based storage is 10--54X less than that of state-of-the-art low-power disk drives. The combination of the high-level physical characteristics of MEMS-based stor-age (small footprints, high shock tolerance) and the ability to directly integrate MEMS-based storage with processing leads to such new applications as portable gigabit storage systems and ubiquitous active storage nodes.
Factors affecting performance in first-year computing
Authors: Annagret Goold, Russell Rimmer
Venue: ACM SIGCSE Bulletin (2000)

Performances are analysed over successive semesters for a cohort of first-year students doing computer programming. Attainment is related to performance in other studies. However, many factors have roles. Learning style and problem-solving skills are important in information technology in Semester I. Gender and secondary school outcomes matter in introductory programming, also in Semester I. Dislike of programming influences outcomes in introductory programming and in Data Structures and Algorithms in Semester II. For a number of indicators, influence fluctuates over time and across area of study.
Scalable parallel simulations of wireless networks with WiPPET: modeling of radio propagation, mobility and protocols
Authors: O. E. Kelly, J. Lai, N. B. Mandayam, A. T. Ogielski, J. Panchal, R. D. Yates
Venue: Mobile Networks and Applications (2000)

We review the design, selected applications and performance of WiPPET &lpar;Wireless Propagation and Protocol Evaluation Testbed&rpar;, a general parallel simulation testbed for various types of wireless networks. WiPPET has been written in TeD&sol;C&plus;&plus;, an object&dash;oriented modeling framework that isolates network modeling from the underlying parallel discrete event simulator. We describe the techniques for modeling radio propagation &lpar;long and short&dash;scale fading and interference&rpar; and protocols that promote scalability of parallel simulations at session and packet time&dash;scales. We outline two selected applications of WiPPET: integrated radio resource management in a mobile wireless network; and packet losses due to mobility and short&dash;scale fading over a radio link. We illustrate the efficiency of the simulator under two partitioning schemes with parallel performance data obtained using the Georgia Time Warp optimistic simulator.