ppxscal/embedding_network huggingface dataset:
Looking back on looking ahead
Authors: Jim Lucas
Venue: ACM SIGAPL APL Quote Quad (2002)

At the APL90 Conference I presented a paper (Programming Ecology, or APL and the World at Large) in which I suggested that APL's future was dependent on its becoming an integral part of a wider computing environment, and in it I made a number of proposals for accomplishing this. Comparing my analysis and proposals to how both APL and its environment have actually evolved in the intervening dozen years is both interesting and instructive, inspiring a mixture of celebration, trepidation, and sober reflection.
A Class of (12, 8) Codes for Correcting Single Errors and Detecting Double Errors Within a Nibble
Authors: R. Johansson
Venue: IEEE Transactions on Computers (1993)

A class of (12, 8) codes is given that corrects all single errors, and detects all double errors in the three nibbles. It is shown that there exist three distinct solutions to this problem. One of these can be implemented with an LS636/7 chip. It is also shown that there do not exist any other codes except these three which correct all single errors and detect adjacent double errors confined to a nibble.
Subanalyticity of the Sub-Riemannian Distance
Authors: S. Jacquet
Venue: Journal of Dynamical and Control Systems (1999)

The aim of this paper is to study the subanalyticity of the distance function d defined by a sub-Riemannian structure (&Delta;, g). If the distribution is of degree 2, we prove that d is subanalytic and if &Delta;2 is fat d is subanalytic far away from the diagonal. In this last case we prove in fact that the function d(x0,&middot;) is subanalytic in a neighborhood of x0.
PAC-Bayesian Stochastic Model Selection
Authors: David A. McAllester
Venue: Machine Learning (2003)

PAC-Bayesian learning methods combine the informative priors of Bayesian methods with distribution-free PAC guarantees. Stochastic model selection predicts a class label by stochastically sampling a classifier according to a &ldquo;posterior distribution&rdquo; on classifiers. This paper gives a PAC-Bayesian performance guarantee for stochastic model selection that is superior to analogous guarantees for deterministic model selection. The guarantee is stated in terms of the training error of the stochastic classifier and the KL-divergence of the posterior from the prior. It is shown that the posterior optimizing the performance guarantee is a Gibbs distribution. Simpler posterior distributions are also derived that have nearly optimal performance guarantees.
A Content-Based Authorization Model for Digital Libraries
Authors: N. R. Adam, V. Atluri, E. Bertino, E. Ferrari
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Digital Libraries (DLs) introduce several challenging requirements with respect to the formulation, specification, and enforcement of adequate data protection policies. Unlike conventional database environments, a DL environment typically is characterized by dynamic user population, often making accesses from remote locations, and by an extraordinarily large amount of multimedia information, stored in a variety of formats. Moreover, in a DL environment, access policies are often specified based on user qualifications and characteristics, rather than user identity (for example, a user can be given access to an R-rated video only if he/she is older than 18 years). Another crucial requirement is the support for content-dependent authorizations on digital library objects (for example, all documents containing discussions on how to operate guns must be made available only to users who are 18 or older). Since traditional authorization models do not adequately meet access control requirements typical to DLs, in this paper, we propose a content-based authorization model suitable for a DL environment. Specifically, the most innovative features of our authorization model are: 1) flexible specification of authorizations based on the qualifications and characteristics of users (including positive and negative), 2) both content-dependent and content-independent access control to digital library objects, and 3) varying granularity of authorization objects ranging from sets of library objects to specific portions of objects.
PA-RISC to IA-64: Transparent Execution, No Recompilation
Authors: Cindy Zheng, Carol Thompson
Venue: Computer (2000)

Making the transition to a new architecture is never easy. Users want to keep running their favorite applications as they normally would, without stopping to adapt them to a different platform. For some legacy applications the problem is more severe. Without all the source code, it is well-nigh impossible to recompile the application to a new platform.Binary translation helps this transition process because it automatically converts the binary code from one instruction set to another without the need for high-level source code. However, different choices force different trade-offs between some form of interpretation (or emulation) and static translation. Interpretation requires no user intervention, but its performance is slow. Static translation, on the other hand, requires user intervention but provides much better performance.To help PA-RISC (precision architecture-reduced instruction set computing) users migrate to its upcoming IA-64 systems, Hewlett-Packard has developed the Aries software emulator, combining fast interpretation and dynamic translation. The article describes how the system works and outlines its performance characteristics and quality.
Choosing the Right Software Protection
Venue: IEEE Software (1993)

Three forms of intellectual property protection-trade secrecy, copyrights, and patents-are discussed. Deciding how to use and possibly combine these forms of protection depends on the nature of the protection needed and the ways in which the software will be distributed. It is argued that the more important the software is to a company and the more significant technologically it is to the industry, the more crucial a solid protection strategy becomes.
Modified Oja&lsquo;s Algorithms For Principal Subspace and Minor Subspaceextraction
Authors: Tianping Chen
Venue: Neural Processing Letters (1997)

Principal component extraction and minor component extraction are well known and powerful techniques in time series. Modified Oja&lsquo;s algorithms for extracting principal and minor component subspaces are proposed. The only difference between them is the sign of the first term in the iteration equations. Simulations show that the algorithms are effective.
Performance Evaluation and Policy Selection in Multiclass Networks
Authors: Shane G. Henderson, Sean P. Meyn, Vladislav B. Tadić
Venue: Discrete Event Dynamic Systems (2003)

This paper concerns modeling and policy synthesis for regulation of multiclass queueing networks. A 2-parameter network model is introduced to allow independent modeling of variability and mean processing-rates, while maintaining simplicity of the model. Policy synthesis is based on consideration of more tractable workload models, and then translating a policy from this abstraction to the discrete network of interest. Translation is made possible through the use of safety-stocks that maintain feasibility of workload trajectories. This is a well-known approach in the queueing theory literature, and may be viewed as a generic approach to avoid deadlock in a discrete-event dynamical system. Simulation is used to evaluate a given policy, and to tune safety-stock levels. These simulations are accelerated through a variance reduction technique that incorporates stochastic approximation to tune the variance reduction. The search for appropriate safety-stock levels is coordinated through a cutting plane algorithm. Both the policy synthesis and the simulation acceleration rely heavily on the development of approximations to the value function through fluid model considerations.
Comments on "Distributed Algorithms for Network Recognition Problems"
Authors: C. -H. Sun, S. -D. Wang
Venue: IEEE Transactions on Computers (1994)

K.V.S. Ramarao (1989) proposed distributed algorithms to recognize five network topologies. In these comments, we first use a counter example to comment that the approach by Ramarao of recognizing a star topology is incomplete. Then, we propose two modified approaches to do the work.
Skyrmion effects in integer quantum hall systems in the presence of a single valence hole
Authors: K. Asano
Venue: Microelectronic Engineering (2002)

Two dimensional electron system is studied under a strong magnetic field in the presence of a single valence hole at around the electron filling factor νe= 1. In the vanishing limit of the electron Zeeman energy, the ground state shows multi-spin flips forming a skyrmion, which strongly depends on the electron-hole layer distance d. Such spin flips are entangled with the screening effects, which affect the energy shifts of the left circularly polarized photoemission. In fact, photoluminescence energy calculated for infinitesimal and infinite Zeeman energies show a significant deviation at d ≲ 0.2ℓ and d ≳ 1.2ℓ, where ℓ denotes the magnetic length.
Control strategies for parallel mixed integer branch and bound
Authors: Jonathan Eckstein
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Mixed integer programs are numerical optimization problems that arise frequently in operations research, particularly in industrial logistics and tactical planning. Their classical solution method is a tree-search branch and bound algorithm in which each tree node represents a linear program. This paper describes an implementation of general mixed integer branch and bound that runs on the CM5 family of parallel processors. This code allows varying amounts of centralization, and combines the randomized work-distribution scheme of Karp and Zhang with a global load-balancing method based on SIMD algorithms. This combination proves effective in an asynchronous, MIMD setting.
Two-Phase Barrier: A Synchronization Primitive for Improving the Processor Utilization
Authors: Inbum Jung, Jongwoong Hyun, Joonwon Lee, Joongsoo Ma
Venue: International Journal of Parallel Programming (2001)

Barrier is widely used for synchronization in parallel programs. Since the process arrived earlier than others should wait at the barrier, the total processor utilization decreases. In this paper, to find the sources of the barrier waiting time, parallel programs are executed on the various grain sizes through execution-driven simulations. In simulation studies, we found that even if approximately equal amounts of work are distributed to each processor, all processes may not arrive at a barrier at the same time. The reasons are that the different numbers of cache misses and instructions within in partitioned grains result in the difference in arrival time of processors at the barrier. In this paper, the two-phased barrier is considered to reduce the blind waiting time in the traditional barrier scheme, which can be simply constructed by dividing one specific stage for the synchronization into two stages. On each stage, processes decide their stall or not, which is dependent on the current execution state of grains running on any given processors. Simulation results show that the reduced barrier waiting times attributed to the two-phased barrier contribute to the performance improvement of parallel programs.
Road Ahead
Authors: Bill Gates
Venue:  (1996)

:What is the information highway? How will the new technology change our lives? Do I have to learn to use a computer? Will my job become obsolete? Welcome to The Road Ahead. We have all been bombarded by the seemingly endless hype about the information highway and the coming age of technology. Now, Bill Gates - who built Microsoft into one of the most successful companies in the world - gives us his vision of what the future holds for us. The Road Ahead is his bird's-eye view of the undiscovered territory on the information highway - an authoritative, thought-provoking, and very readable travel guide for the journey. In this optimistic and refreshingly realistic book, Gates looks ahead to show how the emerging technologies of the digital age will transform all our lives. As he says, we are on the brink of a new revolution, and crossing a technology threshold that will forever change the way we buy, work, learn, and communicate with each other.
Dynamic Synchrony Among Atomic Actions
Authors: G. C. Roman, J. Y. Plun, C. D. Wilcox, S. Varma
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Synchrony continues to be an important concern in concurrent programming. Existinglanguages and models have introduced a great diversity of constructs for expressing and managing synchronization among sequential processes or atomic actions. The authors putforth a model in which synchrony is viewed as a relation among atomic actions, a relation which may evolve with time. The model is shown to be convenient for expressing formally the semantics of synchrony as it appears in many of the languages and models proposed to date. Among such models Swarm is singled out for its use of dynamic synchrony. The Swarm notation is briefly reviewed. A new concurrent algorithm for the leader election problem illustrates the use of dynamic synchrony in Swarm.
The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization
Authors: X. Kong, D. Klappholz, K. Psarris
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

The I test is a subscript dependence test which extends both the range of applicability and the accuracy of the GCD and Banerjee tests (U. Banerjee, 1976), standard subscript dependence tests used to determine whether loops may be parallelized/vectorized. It is shown that the I test is useful when, in the event that a positive result must be reported, a definitive positive is of more use than a tentative positive and when insufficient loop iterations are known for the Banerjee test to apply.
Conducting experiments on software evolution
Authors: Dag I. K. Sjøberg, Erik Arisholm, Magne Jørgensen
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Software evolution is a challenging issue. For example, how do we judge whether one kind of structure supports evolution better than another kind of structure without comparing them in a fairly controlled way? In this paper we claim that certain aspects of software evolution should be evaluated in controlled experiments with first students, and then professionals, as subjects. Although we may have to compromise on longevity (due to enormous costs), we may observe cause-effect relationships in experiments that cannot be identified in case studies. We describe various challenges of conducting such experiments. We illustrate these issues by a controlled experiment on changeability decay conducted with students and a planned, more realistic extension with mostly software professionals as subjects.
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
Authors: Eran Halperin, Uri Zwick
Venue: Random Structures Algorithms (2002)

We obtain improved semidefinite programming based approximation algorithms for all the natural maximum bisection problems of graphs. Among the problems considered are: MAX n/2-BISECTION--partition the vertices of the graph into two sets of equal size such that the total weight of edges connecting vertices from different sides is maximized; MAX n/2-VERTEX-COVER--find a set containing half of the vertices such that the total weight of edges touching this set is maximized; MAX n/2-DENSE-SUBGRAPH--find a set containing half of the vertices such that the total weight of edges connecting two vertices from this set is maximized; and MAX n/2-UNCUT partition the vertices into two sets of equal size such that the total weight of edges that do not cross the cut is maximized. We also consider the directed versions of these problems, such as MAX n/2-DIRECTED-BISECTION and MAX n/2-DIRECTED-UNCUT. These results can be used to obtain improved approximation algorithms for the unbalanced versions of the partition problems mentioned above, where we want to partition the graph into two sets of size k and n - k, where k is not necessarily n/2. Our results improve, extend and unify results of Frieze and Jerrum, Feige and Langberg, Ye, and others. All these results may be viewed as extensions of the MAX CUT algorithm of Goemans and Williamson, and the MAX 2-SAT and MAX DI-CUT algorithms of Feige and Goemans.
Analysis of Finite Buffered Multistage Combining Networks
Authors: Gyungho Lee, Byung-Chang Kang, Richard Y. Kain
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Analyzing the performance of finite buffered multistage networks has been considered a difficult task because of dynamic blocking effects due to finite sized buffers. With the multistage networks enhanced with combining capability, in which multiple requests directed to a shared location combine together to form a single request to be forwarded, the analysis becomes even more difficult due to the interactions between combining probability and queuing delay. Performance bounds for combining networks are known under two extreme assumptions: infinite combining queues and saturated finite combining queues. We analyze multistage combining networks with the consideration of blocking due to finite combining queues. Our analysis provides iterative solutions for combining probability, blocking probability, and queuing delay.
An Implementable Parallel Scheduler for Input-Queued Switches
Authors: Paolo Giaccone, Devavrat Shah, Balaji Prabhakar
Venue: IEEE Micro (2002)

The Apsara algorithm is an input-queued switch scheduler that uses limited parallelism to find a matching in a single iteration, as compared to the O(N3) iterations of the more common maximum-weight matching algorithm. Apsara also achieves a throughput of up to 100 percent and has very good delay properties.
Java-Centric Distributed Computing
Authors: Ann Wollrath, Jim Waldo, Roger Riggs
Venue: IEEE Micro (1997)

By providing a homogeneous view to a heterogeneous group of machines and by safely allowing the dynamic downloading of code into a running process, Java has changed the usual set of assumptions that have governed distributed computing systems. Coupled with a strongly-typed language, the Java platform gives an environment for developing the first truly object-oriented, as opposed to object-based, distributed computing system. The first step towards such a system has been taken in the Java Developers Kit release 1.1. That release includes the Java Remote Method Invocation system. This system allows a Java object running in one virtual machine to make method calls on other Java objects in other virtual machines, perhaps on a different physical machine. The overall design of RMI has much in common with other distributed object and remote procedure call systems. However, since RMI assumes that the calls are made from one Java object to another Java object, the system is able to pass object arguments and return values by their actual type rather than their declared type, allowing full distributed polymorphism. If the class of such a passed object is not present in the receiving machine, the system allows the code for the type to be dynamically loaded. The system also utilizes the garbage collection present on the base platform to implement a distributed garbage collection scheme, enhanced to be robust in the face of network failures. In this paper, we will describe the Java RMI system, including the underlying object serialization system that is used to convert Java objects into a form that can be transmitted from one virtual machine to another. We will show how a language-centered approach to distributed systems leads to a distributed object model that is a natural extension of the language's object model. This in turn makes the programming of such a system comparatively simple, and enhances the functionality and robustness of the distributed infrastructure.
Seven Myths of Formal Methods
Authors: Anthony Hall
Venue: IEEE Software (1990)

Seven widely held conceptions about formal methods are challenged. These beliefs are variants of the following: formal methods can guarantee that software is perfect; they work by proving that the programs are correct; only highly critical systems benefit from their use; they involve complex mathematics; they increase the cost of development; they are incomprehensible to clients; and nobody uses them for real projects. The arguments are based on the author's experiences. They address the bounds of formal methods, identify the central role of specifications in the development process, and cover education and training.
The Scientific Method and Design and Test
Authors: Franc Brglez
Venue: IEEE Design Test (2000)

A few years ago, during a well-attended open Design Automation Conference benchmark forum,1 a panelist pointed out that "...reporting experimental results is a science and an art. A survey of the literature may reveal a consistent methodology.... Also, we should address the verification of reported results." In retrospect, the suggestion may have hinted at the vast body of techniques commonly known as "experimental design." However, this forum was not ready to expand on the subject. Most any search engine currently on the Web returns tens of thousands of URLs in response to keyword searches using terms such as experimental design or design of experiments. Few, if any, of these search results point to an evaluation of CAD algorithms. In contrast, the experimental design methodology, pioneered by Fischer during the 1920s in agricultural research,2 is now firmly established in science and manufacturing. Its application to biomedical research can save lives. Biomedical journals have strict guidelines on how to report experimental results so others may replicate experiments. A URL from a medical school points to a concise illustration of a simple experimental design flow and the terminology used (http://www.fammed.ouhsc.edu/TUTOR/expdes.htm)
Efficient Subgraph Isomorphism Detection: A Decomposition Approach
Authors: Bruno T. Messmer, Horst Bunke
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Graphs are a powerful and universal data structure useful in various subfields of science and engineering. In this paper, we propose a new algorithm for subgraph isomorphism detection from a set of a priori known model graphs to an input graph that is given online. The new approach is based on a compact representation of the model graphs that is computed offline. Subgraphs that appear multiple times within the same or within different model graphs are represented only once, thus reducing the computational effort to detect them in an input graph. In the extreme case where all model graphs are highly similar, the run-time of the new algorithm becomes independent of the number of model graphs. Both a theoretical complexity analysis and practical experiments characterizing the performance of the new approach will be given.