ppxscal/embedding_network huggingface dataset:
A Learning Generalization Bound with an Application to Sparse-Representation Classifiers
Authors: Yoram Gat
Venue: Machine Learning (2001)

A classifier is said to have good generalization ability if it performs on test data almost as well as it does on the training data. The main result of this paper provides a sufficient condition for a learning algorithm to have good finite sample generalization ability. This criterion applies in some cases where the set of all possible classifiers has infinite VC dimension. The result is applied to prove the good generalization ability of support vector machines by a exploiting a sparse-representation property.
Reducing the gap between what users know and what they need to know
Authors: Ron Baecker, Kellogg Booth, Sasha Jovicic, Joanna McGrenere, Gale Moore
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

Universal usability [17] is currently impeded by system complexity and poorly-crafted interfaces which lead to confusion, frustration, and failure. One of the key challenges is the gap between what users know and what they need to know [17, p. 86]. This paper describes and presents early results from three related research projects designed to identify and close this gap and to examine how users might learn what they need to know.
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions
Authors: A. Ben-Tal, M. Kovara, A. Nemirovski, J. Zowe
Venue: SIAM Review (2000)

Free material design deals with the question of finding the stiffest structure with respect to one or more given loads which can be made when both the distribution of material and the material itself can freely vary. The case of one single load has been discussed in several recent papers, and an efficient numerical approach was presented in [M. Kovara, M. Zibulevsky, and J. Zowe, RAIRO Modél. Math. Anal. Numér., 32 (1998), pp. 255--281]. We attack here the multiload situation (understood in the worst-case sense), which is of much more interest for applications but also significantly more challenging from both the theoretical and the numerical points of view. After a series of transformation steps we reach a problem formulation for which we can prove existence of a solution; a suitable discretization leads to a semidefinite programming problem for which modern polynomial time algorithms of interior point type are available. A number of numerical examples demonstrate the efficiency of our approach.
SiGe LNAs for UMTS System
Authors: Petteri Paatsila, Kari Stadius, Jussi Ryynänen
Venue: Analog Integrated Circuits and Signal Processing (2001)

Three LNAs at 2 GHz frequency range have been implemented in a SiGe Bipolar process targeted for a universal mobile telecommunications system. The LNAs are operating in two gain modes and they include a power-down mode. Both on-wafer and packaged LNAs were measured. Noise figure below 2 dB with IIP3 of 1 dBm and gain exceeding 15 dB has been achieved. LNAs work from a 2.7&ndash;5.5 V power supply. A figure of merit method is used to compare this work to other published LNAs.
Repartitioning and technology mapping of electronic hybrid systems
Authors: C. Grimm, K. Waldschmidt
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The systematic top-down design of mixed-signal systems requires an abstract specification of the intended functions. However, hybrid systems are systems whose parts are specified using different time models. Specifications of hybrid systems are not purely functional as they also contain structural information. The structural information is introduced by partitioning the specification into blocks with a homogeneous time model. This often leads to inefficient implementations. In order to overcome this problem, a homogeneous representation for behavior of hybrid systems -- KIR -- is introduced. This representation makes it possible to represent behavior in all time models in a common way so that the separation in different modeling styles is no longer necessary. Rules for re-writing the KIR-graph are given which permit the description of the same behavior in another time model.
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Authors: Samir R. Das, Robert Castañeda, Jiangtao Yan
Venue: Mobile Networks and Applications (2000)

In this paper we evaluate several routing protocols for mobile, wireless, ad hoc networks via packet&dash;level simulations. The ad hoc networks are multi&dash;hop wireless networks with dynamically changing network connectivity owing to mobility. The protocol suite includes several routing protocols specifically designed for ad hoc routing, as well as more traditional protocols, such as link state and distance vector, used for dynamic networks. Performance is evaluated with respect to fraction of packets delivered, end&dash;to&dash;end delay, and routing load for a given traffic and mobility model. Both small &lpar;30 nodes&rpar; and medium sized &lpar;60 nodes&rpar; networks are used. It is observed that the new generation of on&dash;demand routing protocols use much lower routing load, especially with small number of peer&dash;to&dash;peer conversations. However, the traditional link state and distance vector protocols provide, in general, better packet delivery and end&dash;to&dash;end delay performance.
Performance-driven mapping for CPLD architectures
Authors: Deming Chen, Jason Cong, Milos D. Ercegovac, Zhijun Huang
Venue: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays (2001)

In this paper we present a performance-driven mapping algorithm, PLAmap, for CPLD architectures which consist of a large number of PLA-style logic cells. The primary goal of our mapping algorithm is to minimize the depth of the mapped circuit. Meanwhile, we have successfully reduced the area of the mapped circuits by applying several heuristic techniques, including threshold control of PLA fanouts and product terms, slack-time relaxation, and PLA-packing. We compare our PLAmap with a recently-published algorithm TEMPLA [1] and a commercial tool, Altera's MAX+PLUS II [16]. Experimental results on various MCNC benchmarks show that overall TEMPLA uses 8 to 11% less area at the cost of 96 to 106% more mapping depth, and MAX+PLUS II uses 12% less area but 58% more delay compared with our mapper.
G/EDANKEN&mdash;a simple typeless language based on the principle of completeness and the reference concept
Authors: John C. Reynolds
Venue: Communications of the ACM (1970)

GEDANKEN is an experimental programming language with the following characteristics. (1) Any value which is permitted in some context of the language is permissible in any other meaningful context. In particular, functions and labels are permissible results of functions and values of variables. (2) Assignment and indirect addressing are formalized by introducing values, called references, which in turn possess other values. The assignment operation always affects the relation between some reference and its value. (3) All compound data structures are treated as functions. (4) Type declarations are not permitted. The functional approach to data structures and the use of references insure that any process which accepts some data structure will accept any logically equivalent structure, regardless of its internal representation. More generally, any data structure may be implicit; i.e. it may be specified by giving an arbitrary algorithm for computing or accessing its components. The existence of label variables permits the construction of co-routines, quasi-parallel processes, and other unorthodox control mechanisms. A variety of programming examples illustrates the generality of the language. Limitations and possible extensions are discussed briefly.
A Note on the Finite Time Behavior of Simulated Annealing
Authors: Andreas Nolte, Rainer Schrader
Venue: Mathematics of Operations Research (2000)

Simulated Annealing has proven to be a very successful heuristic for various combinatorial optimization problems. It is a randomized algorithm that attempts to find the global optimum with high probability by local exchanges. In this paper we give a new proof of the convergence of Simulated Annealing by applying results about rapidly mixing Markov chains. With this proof technique it is possible to obtain better bounds for the finite time behavior of Simulated Annealing than previously known.
Array language support for parallel sparse computation
Authors: Bradford L. Chamberlain, Lawrence Snyder
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

This paper describes an array-based language-level approach to parallel sparse computation. Our approach is unique due to its separation of sparse index sets from arrays, both syntactically and in the implementation. This design allows users to express their computation using dense array syntax, making the code easier for readers to understand and for compilers to parallelize and optimize. This work is done within the context of Advanced ZPL, retaining its crisp syntax and source-level performance model. Our implementation uses a novel sparse storage format that supports general operations such as arbitrary iteration and slicing. We describe how our compiler automatically optimizes this data structure in to more compact forms based on the operations required by the program. We demonstrate our approach using the NAS CG and MG benchmarks, comparing our implementations with the original Fortran+MPI versions in terms of clarity and performance. We present performance results on the Cray T3E indicating that our implementation compares favorably to the hand-coded NAS versions in terms of memory requirements and often surpasses them in terms of execution speed.
Operating system support for database management
Authors: Michael Stonebraker
Venue: Communications of the ACM (1981)

Several operating system services are examined with a view toward their applicability to support of database management functions. These services include buffer pool management; the file system; scheduling, process management, and interprocess communication; and consistency control.
The structure of programming languages
Authors: Bertram Raphael
Venue: Communications of the ACM (1966)

The following are identified as major components of every programming language: (1) the elementary program statement, (2) mechanisms for linking elementary statements together, (3) the means by which a program can obtain data inputs. Several alternative forms of each of these components are described, compared and evaluated. Many examples, frequently from list processing languages, illustrate the forms described. Elementary program statements usually take the form of commands, requirements, or implicit specifications. A command is an imperative statement that commands the action to be taken. A requirement describes the effect to be achieved without saying anything about the actions to be taken. An implicit specification is similar to a requirement, but the programmer must understand what actions will be taken to achieve the desired effect. Subroutines may be entered explicitly, by execute call, or by function composition. Explicitly called subroutines generally require special linkage conventions. An execute subroutine call is syntactically indistinguishable from a basic instruction of the programming language. Function composition is a convenient alternative to the explicit call. The three principal ways of getting inputs for routines are (1) by referring to the data itself, (2) by referring to the data by a &ldquo;name&rdquo;, and (3) by referring to it implicitly by means of variables or functions. Names are useful entry points into permanent data structures, but can be error-causing distractions in other contexts. The author discusses advantages, disadvantages, and factors influencing the choice of a form of component for a language. He concludes by suggesting the evolution of programming languages toward one which will permit all
Residual resultant over the projective plane and the implicitization problem
Authors: Laurent Busé
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

In this article, we first generalize the recent notion of residual resultant of a complete intersection [4] to the case of a local complete intersection of codimension 2 in the projective plane, which is the necessary and sufficient condition for a system of three polynomials to have a solution &ldquo;outside&rdquo; a variety, defined here by a local complete intersection of codimension 2. We give its degree in the coefficients of each polynomial and compute it as the god of three polynomials or as a product of two determinants divided by another one. In a second part we use this new type of resultant to give a new method to compute the implicit equation of a rational surface with base points in the case where these base points are a local complete intersection of codimension 2.
A machine program for theorem-proving
Authors: Martin Davis, George Logemann, Donald Loveland
Venue: Communications of the ACM (1962)

The programming of a proof procedure is discussed in connection with trial runs and possible improvements.
Representation of contours and regions for efficient computer search
Authors: R. D. Merrill
Venue: Communications of the ACM (1973)

A novel computer-searchable representation for the three basic pictorial features, contour maps, region coverage, and line structures, is described. The representation, which has practical storage requirements, provides a rapid means of searching large files for data associated with geometric position as well as with attribute value. An application of this representation to handling terrain information illustrates its utility. The algebraic properties of the data structure make it computationally easy to determine whether a point lies within a closed boundary; compute the area contained by a closed boundary; generate the closed boundary representing the union or intersection of two closed boundaries; and determine the neighboring boundaries to a point and the minimum distances between them and the point.
Adaptive disk spin&mdash;down for mobile computers
Authors: David P. Helmbold, Darrell D. E. Long, Tracey L. Sconyers, Bruce Sherrod
Venue: Mobile Networks and Applications (2000)

We address the problem of deciding when to spin down the disk of a mobile computer in order to extend battery life. One of the most critical resources in mobile computing environments is battery life, and good energy conservation methods increase the utility of mobile systems. We use a simple and efficient algorithm based on machine learning techniques that has excellent performance. Using trace data, the algorithm outperforms several methods that are theoretically optimal under various worst&dash;case assumptions, as well as the best fixed time&dash;out strategy. In particular, the algorithm reduces the power consumption of the disk to about half of the energy consumed by a one minute fixed time&dash;out policy. Furthermore, the algorithm uses as little as 88% of the energy consumed by the best fixed time&dash;out computed in retrospect.
The computer science and engineering research study (COSERS)
Authors: Bruce W. Arden
Venue: Communications of the ACM (1976)

The Computer Science and Engineering Research Study (COSERS) is briefly described. The motivation, organization, and schedule for this NSF supported study are given. For possible further reference, the subject area panel chairmen and the members of the Steering Committee are identified.
Linley on Linux: Yopy Puts Linux in Hand
Authors: Linley Gwennap
Venue: Linux Journal (2000)

The author writes about Yopy, the first handheld computer that runs Linux.
A comment on English neologisms and programming language keywords
Authors: Caroline M. Eastman
Venue: Communications of the ACM (1982)

The choice of keywords in the design of programming languages is compared to the formation of neologisms, or new words, in natural languages. Examination of keywords in high-level programming languages shows that they are formed using mechanisms analogous to those observed in English. The use of mirror words as closing keywords is a conspicuous exceptions.
On Shary's Algebraic Approach for Linear Interval Equations
Authors: Arnold Neumaier
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

A recent method by Shary for enclosing the solution set of a system of linear interval equations is derived in a new way. It is shown that the method converges to the fixed-point inverse and that it has finite termination with probability 1.
On Some Necessary Conditions of Optimality for a Nonlocal Variational Principle
Authors: Julio Muñoz
Venue: SIAM Journal on Control and Optimization (2000)

The aim of this work is to deduce optimality conditions for a nonlocal variational principle in the one-dimensional scalar case. We consider the relaxation of the problem in terms of Young measures. This relaxation is a new problem where we perform variations to derive optimality conditions, and those conditions yield explicit information about minimizers in the homogeneous case. It also provides a method capable of finding minimizers for some specific problems.
Optimal acyclic fine-grain scheduling with cache effects for embedded and real time systems
Authors: Sid-Ahmed-Ali Touati
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

To sustain the increases in processor performance, embedded and real-time systems need to find the best total schedule time when compiling their application. The optimal acyclic scheduling problem is a classical challenge which has been formulated using integer programming in lot of works. In this paper, we give a new formulation of acyclic instruction scheduling problem under registers and resources constraints in multiple instructions issuing processors with cache effects. Given a direct acyclic graph G = (V, E), the complexity of our integer linear programming model is bounded by &Ogr;(&brvbar;V&brvbar;2) variables and &Ogr;(&brvbar;E&brvbar;+&brvbar;V&brvbar;2) constraints. This complexity is better than the complexity of the existing techniques which includes a worst total schedule time factor.
A generic type system for the Pi-calculus
Authors: Atsushi Igarashi, Naoki Kobayashi
Venue: ACM SIGPLAN Notices (2001)

We propose a general, powerful framework of type systems for the pi;-calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial properties like deadlock-freedom and race-freedom. A key idea is to express types and type environments as abstract processes: We can check various properties of a process by checking the corresponding properties of its type environment. The framework clarifies the essence of recent complex type systems, and it also enables sharing of a large amount of work such as a proof of type preservation, making it easy to develop new type systems.
Achieving specific accuracy in simulation output analysis
Authors: George S. Fishman
Venue: Communications of the ACM (1977)

This paper extends the use of the regenerative property of queueing systems in the analysis of simulation output. In particular, it describes a sequential estimation method which when used with the regenerative property allows results to be obtained with specified statistical accuracy. This method includes a test to check the normality assumption on which the sequential procedure relies. The paper illustrates the method using the empty and idle state as the regenerative state. A second example then describes how using the most frequently entered state as the regenerative state reduces the chance of making a costly error in a preliminary simulation run. The paper also described how a variance reduction method due to Page [9] can be used to obtain a specified accuracy with considerably fewer job completions than are required when no variance reduction technique is applied.
Interval arithmetic determinant evaluation and its use in testing for a Chebyshev system
Authors: Lyle B. Smith
Venue: Communications of the ACM (1969)

Two recent papers, one by Hansen and one by Hansen and R. R. Smith, have shown how Interval Arithmetic (I.A.) can be used effectively to bound errors in matrix computations. In the present paper a method proposed by Hansen and R. R. Smith is compared with straightforward use of I.A. in determinant evaluation. Computational results show the accuracy and running times that can be expected when using I.A. for determinant evaluation. An application using I.A. determinants in a program to test a set of functions to see if they form a Chebyshev system is then presented.
Just Curious: An Interview with John Cocke
Authors: Bruce Shriver, Peter Capek
Venue: Computer (1999)

A legend in computer architecture and perhaps best known as a pioneer of ideas that led to reduced instruction set computing, John Cocke has designed machines that still influence processor design today. In conjunction with his winning the inaugural Seymour Cray award, Computer interviewed Cocke in his Westchester, New York, home. Computer talked to Cocke about how he became interested in computers and the projects for which he is famous: the IBM Stretch, Advanced Computer System (ACS), and the 801, RS6000, and PowerPC processors. The project to build the 801 (one of the first RISC processors) used the code-name America. Cocke recounts how he chose the name based on a story about the first America's Cup yacht race. In the interview, Cocke expresses his opinions on the prospects for parallel computing, quantum computing, and future computer architectures.
Designing palaver tree online: supporting social roles in a community of oral history
Authors: Jason B. Ellis, Amy S. Bruckman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

As a more diverse population of users moves online, understanding how to help those groups work together and leverage their diverse skills poses a significant challenge for human-computer interaction. This paper presents a case study of the design of an online community that supports kids interviewing elders to build up a shared database of oral history. Two pilot studies with existing technology are presented, and a software design based on those studies is described, along with future work. This work shows the value of prototyping with existing technology in order to uncover user needs in an onine environment.
Multimedia File Allocation on VC Networks Using Multipath Routing
Authors: Pao-Yuan Chang, Deng-Jyi Chen, Krishna M. Kavi
Venue: IEEE Transactions on Computers (2000)

The problem of allocating high-volume multimedia files on a virtual circuit network with the objective of maximizing channel throughput (and minimizing data transmission time) is addressed. The problem is formulated as a multicommodity flow problem. We present both the optimal and suboptimal solutions to the problem using novel approaches.
SITAR: an interactive text processing system for small computers
Authors: Ben Ross Schneider,  Jr., Reid M. Watts
Venue: Communications of the ACM (1977)

SITAR, a low-cost interactive text handling and text analysis system for nontechnical users, is in many ways comparable to interactive bibliographical search and retrieval systems, but has several additional features. It is implemented on a PDP/11 time-sharing computer invoked by a CRT with microprogrammed editing functions. It uses a simple command language designating a function, a file, and a search template consisting of the textual string desired and strings delimiting the context in which the hit is to be delivered. Extensive experience with SITAR shows that the combined powers of simple commands, string orientation, circular file structure, a CRT with local memory, and conversational computing produce a system much more powerful than the sum of its parts.