ppxscal/embedding_network huggingface dataset:
Probably Almost Discriminative Learning
Authors: Kenji Yamanishi
Venue: Machine Learning (1995)

This paper develops a new computational model for learning stochastic rules, called PAD (Probably Almost Discriminative)-learning model, based on statistical hypothesis testing theory. The model deals with the problem of designing a discrimination algorithm to test whether or not any given test sequence of examples of pairs of (instance, label) has come from a given stochastic rule P*. Here a composite hypothesis {\tilde P} is unknown other than it belongs to a given class {\cal C}.In this model, we propose a new discrimination algorithm on the basis of the MDL (Minimum Description Length) principle, and then derive upper bounds on the least test sample size required by the algorithm to guarantee that two types of error probabilities are respectively less than &delta;1 and &delta;2 provided that the distance between the two rules to be discriminated is not less than &epsiv;.For the parametric case where {\cal C} is a parametric class, this paper shows that an upper bound on test sample size is given by O({1\over \varepsilon}\ {\rm ln}\ {1\over\delta _1}\ +\ {1\over \varepsilon ^2}\ {\rm ln}{1\over \delta _2}\ +\ {\tilde{k}\over \varepsilon}\ {\rm ln}\ {\tilde{k}\over \varepsilon}\ +\ {\ell({\tilde M})\over \varepsilon}). Here {\tilde k} is the number of real-valued parameters for the composite hypothesis {\tilde P,} and \ell({\tilde M}) is the description length for the countable model for {\tilde P.} Further this paper shows that the MDL-based discrimination algorithm performs well in the sense of sample complexity efficiency, comparing it with other kinds of information-criteria-based discrimination algorithms. This paper also shows how to transform any stochastic PAC (Probably Approximately Correct)-learning algorithm into a PAD-learning algorithm.For the non-parametric case where {\cal C} is a non-parametric class but the discrimination algorithm uses a parametric class, this paper demonstrates that the sample complexity bound for the MDL-based discrimination algorithm is essentially related to Barron and Cover's index of resolvability. The sample complexity bound gives a new view at the relationship between the index of resolvability and the MDL principle from the PAD-learning viewpoint.
The EOS laboratory environment for a course in operating systems
Authors: Carl Erickson
Venue: ACM SIGCSE Bulletin (1996)

This paper describes a laboratory environment for teaching operating systems. The EOS (Exploratory Operating Systems) lab was developed with a National Science Foundation ILI grant to be used in conjunction with a traditional operating systems (OS) course. The main goal of the EOS project was to improve the teaching of operating system principles without the necessity of a special purpose laboratory and the addition to the curriculum of a second course in OS. The EOS labs are summarized and a CPU scheduling lab is described in some detail. A standardized testing instrument was used to compare class performance before and after adding the lab to the OS course. Preliminary results show an improvement attributable to the EOS laboratory. The author's experience in building a workstation laboratory from an externally funded grant is described.
Flexible language constructs for large parallel programs
Authors: Matt Rosing, Robert Schnabel
Venue: Scientific Programming (1994)

The goal of the research described in this article is to develop flexible language constructs for writing large data parallel numerical programs for distributed memory (multiple instruction multiple data [MIMD]) multiprocessors. Previously, several models have been developed to support synchronization and communication. Models for global synchronization include single instruction multiple data (SIMD), single program multiple data (SPMD), and sequential programs annotated with data distribution statements. The two primary models for communication include implicit communication based on shared memory and explicit communication based on messages. None of these models by themselves seem sufficient to permit the natural and efficient expression of the variety of algorithms that occur in large scientific computations. In this article, we give an overview of a new language that combines many of these programming models in a clean manner. This is done in a modular fashion such that different models can be combined to support large programs. Within a module, the selection of a model depends on the algorithm and its efficiency requirements. In this article, we give an overview of the language and discuss some of the critical implementation details.
Disciplined C
Authors: Yves L. Noyelle
Venue: ACM SIGPLAN Notices (1995)

Some proposals to render the C language a truly high level language are presented, as well as a program verifying that a given C program conforms to those proposals.
An Index Theorem for Monotone Matrix-Valued Functions
Authors: Werner Kratz
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

The main result of this paper is the following index theorem, which is closely related to oscillation theorems on linear selfadjoint differential systems such as results by M. Morse. Let real $m\times m$-matrices $R_1, R_2, X, U $ be given, which satisfy $$ R_1R_2^T = R_2R_1^T \,, \quad X^TU = U^TX \,, \quad \:\mbox{rank}\:(R_1,R_2) = \;\mbox{rank}\:(X^T,U^T) = m. $$ Moreover, assume that $X(t), \;U(t)$ are real $m\times m$-matrix-valued functions on some interval ${\cal{J}} = [-\varepsilon , \varepsilon ] , \;\; \varepsilon >0$, such that $$ X^T(t) U(t) = U^T(t) X(t) \quad \mbox{on} \quad {\cal{J}}, $$ $$ X(t) \to X \quad \mbox{and} \quad U(t) \to U \quad \mbox{as} \quad t \to 0, $$ $$ X(t) \quad \mbox{is invertible for} \quad t\in {\cal{J}}\backslash \{0\} \,, \quad \mbox{and such that} $$ $$ U(t) X^{-1}(t) \quad \mbox{is decreasing on} \quad {\cal{J}}\backslash \{0\}, $$ and define $$ M(t) \equiv R_1R_2^T + R_2 U(t) X^{-1}(t) R_2^T , \quad \Lambda (t) \equiv R_1X(t) + R_2U(t) , \quad \Lambda \equiv R_1X + R_2U. $$ Then $\mbox{ind}\:M(0+), \;\;\mbox{ind}\:M(0-) ,$ and $\mbox{def}\:\Lambda (0+)$ exist and $$ \mbox{ind}\:M(0+) - \;\mbox{ind}\:M(0-) = \;\mbox{def}\:\Lambda - \;\mbox{def}\:\Lambda (0+) - \;\mbox{def}\:X , $$ where $\mbox{ind}$ denotes the index (the number of negative eigenvalues) and $\mbox{def}$ denotes the defect (the dimension of the kernel) of a matrix. The basic tool for the proof of this result consists of a theorem on the rank of a certain product of matrices, so that this rank theorem is the key result of the present paper.
On Lotteries with Unique Winners
Authors: Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin
Venue: SIAM Journal on Discrete Mathematics (1995)

Lotteries with the unique maximum property and the unique winner property are considered. Tight lower bounds are proven on the domain size of such lotteries.
Adaptable, reusable code
Authors: Margaret J. Davis
Venue: ACM SIGSOFT Software Engineering Notes (1995)

This paper discusses the concept of adaptability as a means for reaping the cost and schedule reduction benefits of reuse. Adaptability strives to implement the variability identified by domain analyses while managing the cost of implementation, extension, and use. The paper discusses a context for understanding different domain-specific reuse approches relative to adaptability and analyzes experience in designing and developing adaptable code. The experience is drawn from the ARPA Software Technology for Adaptable, Reliable Systems (STARS) joint demonstration project with U.S. Navy.
A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
Authors: Knud D. Andersen
Venue: ACM Transactions on Mathematical Software (TOMS) (1996)

The main computational work in interior-point methods for linear programming (LP) is to solve a least-squares problem. The normal equations are often used, but if the LP constraint matrix contains a nearly dense column the normal-equations matrix will be nearly dense. Assuming that the nondense part of the constraint matrix is of full rank, the Schur complement can be used to handle dense columns. In this article we propose a modified Schur-complement method that relaxes this assumption. Encouraging numerical results are presented.
Efficiently computing Φ-nodes on-the-fly
Authors: Ron K. Cytron, Jeanne Ferrante
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1995)

Recently, Static Single-Assignment Form and Sparse Evaluation Graphs have been advanced for the efficient solution of program optimization problems. Each method is provided with an initial set of flow graph nodes that inherently affect a problem's solution. Other relevant nodes are those where potentially disparate solutions must combine. Previously, these so-called &fgr;-nodes were found by computing the iterated dominance frontiers of the initial set of nodes, a process that could take worst-case quadratic time with respect to the input flow graph. In this article we present an almost-linear algorithm for determining exactly the same set of &fgr;-nodes.
A Family of Interconnection Networks for Nonuniform Traffic
Authors: David M. Koppelman
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

New networks, called GLO networks, are constructed by adding bus-like links to omega networks, providing additional capacity between cells on momentarily busy paths. Equivalent pin-count GLO and omega networks offered uniform and nonuniform traffic were simulated. GLO networks exhibited lower latency for nonuniform traffic and light to moderate uniform traffic.
Low power realization of finite state machines&mdash;a decomposition approach
Authors: Sue-Hong Chow, Yi-Cheng Ho, TingTing Hwang, C. L. Liu
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1996)

We present in this article a new approach to the synthesis problem for finite state machines with the reduction of power dissipation as a design objective. A finite state machine is decomposed into a number of coupled submachines. Most of the time, only one of the submachines will be activated which, consequently, could lead to substantial savings in power consumption. The key steps in our approach are: (1) decomposition of a finite state machine into submachines so that there is a high probability that state transitions will be confined to the smaller of the submachines most of the time, and (2) synthesis of the coupled submachines to optimize the logic circuits. Experimental results confirmed that our approach produced very good results (in particular, for finite state machines with a large number of states.)
Using simulation to assess costs of quality
Authors: L. Leslie Gardner, Mary E. Grant, Laurie J. Rolston
Venue: Proceedings of the 27th conference on Winter simulation (1995)

This paper illustrates the impact of defective rates of inspection and defective removal strategies on the profitability of a manufacturing system. The use of simulation to assess the cost of quality for justification of quality improvement is demonstrated. The model is written for the academic version of SLAMSYSTEM with Microsoft FORTRAN 5.1 inserts.
Semi-automatic, self-adaptive control of garbage collection rates in object databases
Authors: Jonathan E. Cook, Artur W. Klauser, Alexander L. Wolf, Benjamin G. Zorn
Venue: ACM SIGMOD Record (1996)

A fundamental problem in automating object database storage reclamation is determining how often to perform garbage collection. We show that the choice of collection rate can have a significant impact on application performance and that the "best" rate depends on the dynamic behavior of the application, tempered by the particular performance goals of the user. We describe two semi-automatic, self-adaptive policies for controlling collection rate that we have developed to address the problem. Using trace-driven simulations, we evaluate the performance of the policies on a test database application that demonstrates two distinct reclustering behaviors. Our results show that the policies are effective at achieving user-specified levels of I/O operations and database garbage percentage. We also investigate the sensitivity of the policies over a range of object connectivities. The evaluation demonstrates that semi-automatic, self-adaptive policies are a practical means for flexibly controlling garbage collection rate.
Learning and generalization in radial basis function networks
Authors: J. A. S. Freeman, D. Saad
Venue: Neural Computation (1995)

The two-layer radial basis function network, with fixed centers of the basis functions, is analyzed within a stochastic training paradigm. Various definitions of generalization error are considered, and two such definitions are employed in deriving generic learning curves and generalization properties, both with and without a weight decay term. The generalization error is shown analytically to be related to the evidence and, via the evidence, to the prediction error and free energy. The generalization behavior is explored; the generic learning curve is found to be inversely proportional to the number of training pairs presented. Optimization of training is considered by minimizing the generalization error with respect to the free parameters of the training algorithms. Finally, the effect of the joint activations between hidden-layer units is examined and shown to speed training.
Evaluation of human computer interfaces: a report from an ARPA workshop
Authors: Lynette Hirschman, Donna Cuomo
Venue: ACM SIGCHI Bulletin (1995)

This report summarizes a two and a half day workshop sponsored by Dr. Craig Wier, Program Manager for the ARPA HCI program and organized and chaired by the authors (both of MITRE Corporation). The workshop took place from March 30 through April 1, 1994 at the MITRE Corporation in Bedford, Massachusetts.
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
Authors: Albert G. Greenberg, Schmuel Winograd
Venue: Journal of the ACM (JACM) (1985)

A problem related to the decentralized control of a multiple access channel is considered: Suppose k stations from an ensemble of n simultaneously transmit to a multiple access channel that provides the feedback 0, 1, or 2+, denoting k = 0, k = 1, or k &ge; 2, respectively. If k = 1, then the transmission succeeds. But if k &ge; 2, as a result of the conflict, none of the transmissions succeed. An algorithm to resolve a conflict determines how to schedule retransmissions so that each of the conflicting stations eventually transmits singly to the channel. In this paper, a general model of deterministic algorithms to resolve conflicts is introduced, and it is established that, for all k and n (2 &le; k &le; n), &OHgr;(k(log n)/(log k)) time must elapse in the worst case before all k transmissions succeed.
On a Matrix Generalization of Affine-Scaling Vector Fields
Authors: Leonid Faybusovich
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

We construct a generalization of affine-scaling vector fields for matrix linear programming problems. We discuss various properties of these vector fields and suggest a generalization of a path-following algorithm that is due to C. Gonzaga [SIAM Rev., 34 (1992), pp. 493--513].
High-performance incremental scheduling on massively parallel computers: a global approach
Authors: Min-You Wu, Wei Shu
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

Runtime incremental parallel scheduling (RIPS) is a new approach for load balancing. In parallel scheduling, all processors cooperate together to balance the workload. Parallel scheduling accurately balances the load by using global load information. In incremental scheduling, the system scheduling activity alternates with the underlying computation work. RIPS produces high-quality load balancing and adapts to applications of nonuniform structures. This paper presents methods for scheduling a single job on a dedicated parallel machine.
Conference on computer-aided software engineering summary report
Authors: Tanehiro Tatsuta
Venue: ACM SIGSOFT Software Engineering Notes (1996)

The fifth Conference on Computer-Aided Software Engineering was held July 10-12, 1996 in Tokyo in conjunction with CASE Japan'96. The general chair, Yoshihiro Matsumoto (University of OSAKA Institute of Technology), organized the program, along with the vice-chair, Hiroshi Mukaiyama (Japan Information Processing Developing Center), Ichiro Moriyama (Reed Exhibitions Japan), and the 17 members of the program Screening Committee. Reed Exhibitions Japan sponsored the Conference and all the related events as well.The program consisted of the Keynote Address and 20 sessions. I have selected several features out of the program and have submitted here as a Summary Report on behalf of all the members of the Committee so as to attempt to capture the essence of the Conference.
A correspondence between continuation passing style and static single assignment form
Authors: Richard A. Kelsey
Venue: Papers from the 1995 ACM SIGPLAN workshop on Intermediate representations (1995)

We define syntactic transformations that convert continuation passing style (CPS) programs into static single assignment form (SSA) and vice versa. Some CPS programs cannot be converted to SSA, but these are not produced by the usual CPS transformation. The CPS&rarr;SSA transformation is especially helpful for compiling functional programs. Many optimizations that normally require flow analysis can be performed directly on functional CPS programs by viewing them as SSA programs. We also present a simple program transformation that merges CPS procedures together and by doing so greatly increases the scope of the SSA flow information. This transformation is useful for analyzing loops expressed as recursive procedures.
Algorithm 664: A Gauss algorithm to solve systems with large, banded matrices using random-access disk storage
Authors: Géza Schrauf
Venue: ACM Transactions on Mathematical Software (TOMS) (1988)

A FORTRAN 77 implementation of a Gauss algorithm with partial pivoting for banded matrices is described. The algorithm keeps only part of the matrix that is necessary for the actual computation in memory. This allows large systems to be solved on machine without virtual memory, or if the virtual memory is too small for the problem.
A Global Convergence Theorem for a Class of Parallel Continuous Explicit Runge--Kutta Methods and Vanishing Lag Delay Differential Equations
Authors: Christopher T. H. Baker, Christopher A. H. Paul
Venue: SIAM Journal on Numerical Analysis (1996)

Iterated continuous extensions (ICEs) are continuous explicit Runge--Kutta methods developed for the numerical solution of evolutionary problems in ordinary and delay differential equations (DDEs). ICEs have a particular role in the explicit solution of DDEs with vanishing lags. They may be regarded as parallel continuous explicit Runge--Kutta (PCERK) methods, as they allow one to take advantage of parallel architectures. ICEs can also be related to a collocation method.The purpose of this paper is to provide a theorem giving the global order of convergence for variable-step implementations of ICEs applied to state-dependent DDEs with and without vanishing lags. Implications of the theory for the implementation of this class of methods are discussed and demonstrated. The results establish that our approach allows the construction of PCERK methods whose order of convergence is restricted only by the continuity of the solution.
Surveying molecular interactions with DOT
Authors: Lynn F. Ten Eyck, Jeffrey Mandell, Victoria A. Roberts, Michael E. Pique
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

The purpose of the molecular interaction program DOT (Daughter of Turnip) is rapid computation of the electrostatic potential energy between two proteins or other charged molecules. DOT exhaustively tests all six degrees of freedom, rotational and translational, and produces a grid of approximate interaction energies and orientations. It is able to do this because the problem is cast as the convolution of the potential field of the first molecule and any rotated charge distribution of the second. The algorithm lends itself to both parallelization and vectorization, permitting huge increases in computational speed over other methods for obtaining the same information. For example, a complete mapping of interactions between plastocyanin and cytochrome c was done in eight minutes using 256 nodes of an Intel Paragon. DOT is expected to be particularly useful as a rapid screen to find configurations for more detailed study using exact energy models.
Evolutionary artificial intelligence
Authors: Nils J. Nilsson
Venue: ACM SIGART Bulletin (1995)

Several challenges confront the organizer of an introductory course in artificial intelligence (AI). First, one has to decide what subject matter to include. The union of everything in all of the popular AI textbooks is much too large, and the intersection undoubtedly won't include enough of what the organizer thinks important. The second challenge is how to blend the selected topics into a coherent whole. The third involves matters such as problem sets, programming exercises, laboratory work, case studies, and collateral readings. Finally, one must decide on the main purpose of the course: is it to teach AI techniques and skills, or is it to study AI's intellectual content, perhaps presenting related topics in psychology and philosophy? In this note we concentrate on the first and second of these topics---how to present a coherent view of the core subject matter of AI.
Logic partition orderings for multi-FPGA systems
Authors: Scott Hauck, Gaetano Borriello
Venue: Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays (1995)

One of the critical issues for multi-FPGA systems is developing software tools for automatically mapping circuits. In this paper we consider one step in this process, partitioning. We described the task of finding partition orderings, i.e., determining the way in which a circuit should be bipartitioned so as to best map it to a multi-FPGA system. This allows multi-FPGA partitioners to harness standard partitioning techniques. We develop an algorithm for finding partition orderings, which includes a method for increasing parallelism in the process, as well as for including multi-sectioning and multi-way partitioning algorithms. This method is very efficient, and capable of handling most of the current multi-FPGA topologies.
Tree-Adjoining Language Parsing in o(n^6) Time
Authors: Sanguthevar Rajasekaran
Venue: SIAM Journal on Computing (1996)

In this paper we present algorithms for parsing general tree-adjoining languages (TALs). Tree-adjoining grammars (TAGs) have been proposed as an elegant formalism for natural languages. It was an open question for the past ten years as to whether TAL parsing can be done in time $o(n^6)$. We settle this question affirmatively by presenting an $O(n^3 M(n))$-time algorithm, where $M(k)$ is the time needed for multiplying two Boolean matrices of size $k\times k$ each. Since $O(k^{2.376})$ is the current best-known value for $M(k)$, the time bound of our algorithm is $O(n^{5.376})$. On an exclusive read exclusive write parameter random-access machine (EREW PRAM) our algorithm runs in time $O(n\log n)$ using $\frac{n^2 M(n)}{\log n}$ processors. In comparison, the best-known previous parallel algorithm had a run time of $O(n)$ using $n^5$ processors (on a systolic array machine). We also present algorithms for parsing context-free languages (CFLs) and TALs whose worst case run times are $O(n^3)$ and $O(n^6)$, respectively, but whose average run times are better. Therefore, these algorithms may be of practical interest.