ppxscal/embedding_network huggingface dataset:
Least-squares fitting using orthogonal multinomials
Authors: Richard H. Bartels, John J. Jezioranski
Venue: ACM Transactions on Mathematical Software (TOMS) (1985)

Forsythe has given a method for generating basis polynomials in a single variable that are orthogonal with respect to a given inner product. Weisfeld later demonstrated that Forsythe's approach could be extended to polynomials in an arbitrary number of variables. In this paper we sharpen Weisfeld's results and present a method for computing weighted, multinomial, least-squares approximations to given data.
A Flexible Bit-Pattern Associative Router for Interconnection Networks
Authors: Douglas H. Summerville, José G. Delgado-Frias, Stamatis Vassiliadis
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

A programmable associative approach to execute implicit routing algorithms is presented. Algorithms are mapped onto a set of bit-patterns that are matched in parallel. We have studied and mapped a large number of routing algorithms for a wide range of interconnection network topologies. Here we report three cases that illustrate the capabilities of the router scheme. For the studied topologies, the number of required bit-patterns is of the same order as the topology degree. The proposed approach is one of the fastest routers and requires a very small amount of hardware.
A tree-structured mean value analysis algorithm
Authors: K. P. Hoyme, S. C. Bruell, P. V. Afshari, R. Y. Kain
Venue: ACM Transactions on Computer Systems (TOCS) (1986)

In a recent paper, Lam and Lien described an algorithm called tree-convolution that can reduce the space and computation time required for evaluating sparse multiclass, product-form queueing networks. In this paper, we develop an exact algorithm based on mean value analysis (MVA) that is the counterpart of the tree-convolution algorithm. The order of reduction in storage and computation achieved by our new Tree-MVA algorithm compared to the standard MVA algorithm is the same order of reduction obtained by the tree-convolution algorithm over that of the standard convolution algorithm. Our Tree-MVA algorithm preserves the inherent simplicity of MVA based algorithms.
Hard-core theorems for complexity classes
Authors: Shimon Even, Alan L. Selmen, Yacov Yacobi
Venue: Journal of the ACM (JACM) (1985)

Nancy Lynch proved that if a decision problem A is not solvable in polynomial time, then there exists an infinite recursive subset X of its domain on which the decision is almost everywhere complex. In this paper, general theorems of this kind that can be applied to several well-known automata-based complexity classes, including a common class of randomized algorithms, are proved.
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
Authors: Paul W. Goldberg, Mark R. Jerrum
Venue: Machine Learning (1995)

The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bounds on the V-C dimension that are polynomial in the syntactic complexity of concepts. Such upper bounds are automatic for discrete concept classes, but hitherto little has been known about what general conditions guarantee polynomial bounds on V-C dimension for classes in which concepts and examples are represented by tuples of real numbers. In this paper, we show that for two general kinds of concept class the V-C dimension is polynomially bounded in the number of real numbers used to define a problem instance. One is classes where the criterion for membership of an instance in a concept can be expressed as a formula (in the first-order theory of the reals) with fixed quantification depth and exponentially-bounded length, whose atomic predicates are polynomial inequalities of exponentially-bounded degree, The other is classes where containment of an instance in a concept is testable in polynomial time, assuming we may compute standard arithmetic operations on reals exactly in constant time.Our results show that in the continuous case, as in the discrete, the real barrier to efficient learning in the Occam sense is complexity-theoretic and not information-theoretic. We present examples to show how these results apply to concept classes defined by geometrical figures and neural nets, and derive polynomial bounds on the V-C dimension for these classes.
Hybrid inferential security methods for statistical databases
Authors: Steven C. Hansen
Venue: ACM SIGAPP Applied Computing Review (1995)

Memoryless inference control methods have been shown to provide effective means of reducing the amount of sensitive information released from a statistical database while maximizing the release of non-sensitive information. Early memoryless inference controls have the additional benefit of providing control at a low computation and storage cost. Two recent extensions to memoryless inference control allow the controls to release more non-sensitive information but do so at a greater cost in terms of computation and storage. This paper describes a proposed hybrid inference control method that can potentially maximize the release of information while holding down computation costs.
Goal-oriented buffer management revisited
Authors: Kurt P. Brown, Michael J. Carey, Miron Livny
Venue: ACM SIGMOD Record (1996)

In this paper we revisit the problem of achieving multi-class workload response time goals by automatically adjusting the buffer memory allocations of each workload class. We discuss the virtues and limitations of previous work with respect to a set of criteria we lay out for judging the success of any goal-oriented resource allocation algorithm. We then introduce the concept of hit rate concavity and develop a new goal-oriented buffer allocation algorithm, called Class Fencing, that is based on this concept. Exploiting the notion of hit rate concavity results in an algorithm that not only is as accurate and stable as our previous work, but also more responsive, more robust, and simpler to implement.
Software reuse: metrics and models
Authors: William Frakes, Carol Terry
Venue: ACM Computing Surveys (CSUR) (1996)

As organizations implement systematic software reuse programs to improve productivity and quality, they must be able to measure their progress and identify the most effective reuse strategies. This is done with reuse metrics and models. In this article we survey metrics and models of software reuse and reusability, and provide a classification structure that will help users select them. Six types of metrics and models are reviewed: cost-benefit models, maturity assessment models, amount of reuse metrics, failure modes models, reusability assessment models, and reuse library metrics.
Statistical estimation of sequential circuit activity
Authors: Tan-Li Chou, Kaushik Roy
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

Abstract: In this paper, we present a Monte Carlo based technique to estimate signal activity at the internal nodes of sequential logic circuits. The technique takes spatial and temporal correlations of logic signals into consideration. The Monte Carlo based techniques that have been proposed for combinational circuits can not be directly applied to sequential circuits due to the initial transient problem. The proposed approach deals with this problem by gaining insight from Markov chain theory. Experimental results show that the error (%) of estimated activity of individual nodes is within 3% in comparison to that of long run simulation results.
Evaluating software engineering methods and tool&mdash;part 3: selecting an appropriate evaluation method&mdash;practical issues
Authors: Barbara Ann Kitchenham
Venue: ACM SIGSOFT Software Engineering Notes (1996)

In the first article about the DESMET evaluation methodology, I identified nine different types of evaluation:1. Quantitative Experiments2. Quantitative Case Studies3. Quantitative Surveys4. Feature Analysis --- Screening mode5. Feature Analysis --- Case Study6. Feature Analysis --- Experiment7. Feature Analysis --- Survey8. Qualitative Effects Analysis9. Benchmarking.In the last article I discussed various technical criteria that would influence your choice of an evaluation method. In principle, you should select the simplest evaluation method appropriate for your specific evaluation requirements and organisational capability. However there are a number of constraints that can influence your final choice of evaluation method: bull; the elapsed time that is needed for the different evaluation options; bull; the confidence that a user can have in the results of an evaluation; bull; the cost of an evaluation;This information may be useful in two circumstances:1. When you want to decide between a quantitative case study and a quantitative formal experiment and there are no clear technical reasons for preferring one to the other.2. When you want to ensure that the evaluation you have decided to undertake is feasible.These issues are discussed in this article.
Computational techniques for accurate performance evaluation of multirate, multihop communication networks
Authors: Albert G. Greenberg, R. Srikant
Venue: ACM SIGMETRICS Performance Evaluation Review (1995)

Computational techniques are presented for connection-level performance evaluation of communication networks, with stochastic multirate traffic, state dependent admission control, alternate routing, and general topology --- all characteristics of emerging integrated service networks. The techniques involve solutions of systems of fixed point equations, which estimate equilibrium network behavior. Though similar techniques have been applied with success to single-rate fully connected networks, the curse of dimensionality arises when the techniques are extended to multirate, multihop networks, and the cost of solving the fixed point equations exactly is exponential. This exponential barrier is skirted by exploiting, in particular, a close relationship with the network reliability problem, and by borrowing effective heuristics from the reliability domain. A series of experiments are reported on, comparing the estimates from the new techniques to the results of discrete event simulations.
Design and user testing of a multi-paradigm query interface to an object-oriented database
Authors: Dac Khoa Doan, Norman W. Paton, Alistair Kilgour
Venue: ACM SIGMOD Record (1995)

This paper reports on experience obtained during the design, implementation and use of a multi-paradigm query interface to an object-oriented database. The specific system which has been developed allows equivalent data retrieval tasks to be expressed using textual, form-based and graph-based notations, and supports automatic translation of queries between these three paradigms. The motivation behind the development of such an interface is presented, as is the software architecture which supports the multi-paradigm functionality. Feedback from initial user trials with a dual-paradigm version of the system indicates that users can use it to perform complex query tasks without difficulty, that given the choice users overwhelmingly prefer the graph- based to the text-based interaction style, and that graphical visualisation of textual queries appears to aid users in query construction.
Broadcast disks: data management for asymmetric communication environments
Authors: Swarup Acharya, Rafael Alonso, Michael Franklin, Stanley Zdonik
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

This paper proposes the use of repetitive broadcast as a way of augmenting the memory hierarchy of clients in an asymmetric communication environment. We describe a new technique called "Broadcast Disks" for structuring the broadcast in a way that provides improved performance for non-uniformly accessed data. The Broadcast Disk superimposes multiple disks spinning at different speeds on a single broadcast channel--in effect creating an arbitrarily fine-grained memory hierarchy. In addition to proposing and defining the mechanism, a main result of this work is that exploiting the potential of the broadcast structure requires a re-evaluation of basic cache management policies. We examine several "pure" cache management policies and develop and measure implementable approximations to these policies. These results and others are presented in a set of simulation studies that substantiates the basic idea and develops some of the intuitions required to design a particular broadcast program.
Evaluation of Binarization Methods for Document Images
Authors: Øivind Due Trier, Torfinn Taxt
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents an evaluation of eleven locally adaptive binarization methods for gray scale images with low contrast, variable background intensity and noise. Niblack¿s method with the addition of the postprocessing step of Yanowitz and Bruckstein¿s method added performed the best and was also one of the fastest binarization methods.
An improved cost function for static partitioning of parallel circuit simulations using a conservative synchronization protocol
Authors: Kevin L. Kapp, Thomas C. Hartrum, Tom S. Wailes
Venue: ACM SIGSIM Simulation Digest (1995)

Distributing computation among multiple processors is one approach to reducing simulation time for large VLSI circuit designs. However, parallel simulation introduces the problem of how to partition the logic gates and system behaviors of the circuit among the available processors in order to obtain maximum speedup. A complicating factor that is often ignored is the effect of the time-synchronization protocol (conservative [1] or optimistic [2]). Inherent in the partitioning problem is the question of how to effectively measure the relative quality of a partition. This paper describes an objective cost function for measuring the relative quality of a task partition that includes a synchronization factor for a conservative NULL-message protocol. A graph-based partitioning tool based on this cost function is used to perform the static task allocation for parallel simulation of a structural VHDL circuit. Results for two 1000 &ndash; 4000 gate circuits demonstrate that the additional consideration of the synchronization protocol in the cost function generates partitions that exhibit improved speedup.
DSSA (Domain-Specific Software Architecture): pedagogical example
Authors: Will Tracz
Venue: ACM SIGSOFT Software Engineering Notes (1995)

A Domain-Specific Software Architecture (DSSA) has been defined as: bull; "an assemblage of software components, specialized for a particular type of task (domain), generalized for effective use across that domain, composed in a standardized structure (topology) effective for building successful applications" [Hay94] or, alternately bull; "a context for patterns of problem elements, solution elements, and situations that define mappings between them [Hid90].The following small example illustrates these definitions as well as provides the reader with some insight into the types of processes and tools needed to support the creation and use of a DSSA.
Fortran language extensions
Authors: David Levine
Venue: ACM SIGPLAN Fortran Forum (1994)

Current Fortran 90 implementations support a large number of extensions to the Standard language, most of which originated prior to F90. A great many user programs require at least some extensions. The "Implementations" Subgroup of X3J3 discussed the possibility of informally assembling some documentation of these extensions.
Parallel Discrete-Event Simulation (PDES): a case study in design, development, and performance using SPEEDES
Authors: Frederick Wieland, Eric Blair, Tony Zukas
Venue: Proceedings of the ninth workshop on Parallel and distributed simulation (1995)

Can parallel simulations efficiently exploit a network of workstations? Why haven't PDES models followed standard modeling methodologies? Will the field of PDES survive, and if so, in what form? Researchers in the PDES field have addressed these questions and others in a series of papers published in the last few years [1,2,3,4]. The purpose of this paper is to shed light on these questions, by documenting an actual case study of the development of an optimistically synchronized PDES application on a network of workstations. This paper is unique in that its focus is not necessarily on performance, but on the whole process of developing a model, from the physical system being simulated, through its conceptual design, validation, implementation, and, of course, its performance. This paper also presents the first reported performance results indicating the impact of risk on performance. The results suggest that the optimal value of risk is sensitive to the latency parameters of the communications network.
On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems
Authors: Arun K. Somani, Ofer Peleg
Venue: IEEE Transactions on Computers (1996)

The classical t-diagnosability approach has its limitation when dealing with large fault sets in large multiprocessor systems. This is due to limited diagnosability of large multiprocessor systems connected using regular interconnection structures. We propose an alternative approach to system diagnosis by allowing a few upper bounded number of units to be diagnosed incorrectly. This measure is called t/k-diagnosability. Using this new measure, it is possible to increase the degree of diagnosability of large system considerably. The t/k-diagnosis guarantees that all the faulty units (processors) in a system are detected (provided the number of faulty units does not exceed t) while at most k units are incorrectly diagnosed. We provide necessary and sufficient conditions for t/k-diagnosability and discuss their implication. To demonstrate the power of this approach, we analyze the diagnosability of large systems connected as hypercube, star-graph, and meshes. It is shown that a substantial increase in the degree of diagnosability of these structures is achieved, compared with the degree of diagnosability achieved using the classic t-diagnosability approach, at the cost of a comparably small number of incorrectly diagnosed units.
Introducing asymmetry into interneuron learning
Authors: Colin Fyfe
Venue: Neural Computation (1995)

A review is given of a new artificial neural network architecture in which the weights converge to the principal component subspace. The weights learn by only simple Hebbian learning yet require no clipping, normalization or weight decay. The net self-organizes using negative feedback of activation from a set of "interneurons" to the input neurons. By allowing this negative feedback from the interneurons to act on other interneurons we can introduce the necessary asymmetry to cause convergence to the actual principal components. Simulations and analysis confirm such convergence.
A Dynamical System Approach to Stochastic Approximations
Authors: Michel Benaim
Venue: SIAM Journal on Control and Optimization (1996)

It is known that some problems of almost sure convergence for stochastic approximation processes can be analyzed via an ordinary differential equation (ODE) obtained by suitable averaging. The goal of this paper is to show that the asymptotic behavior of such a process can be related to the asymptotic behavior of the ODE without any particular assumption concerning the dynamics of this ODE. The main results are as follows: a) The limit sets of trajectory solutions to the stochastic approximation recursion are, under classical assumptions, almost surely nonempty compact connected sets invariant under the flow of the ODE and contained in its set of chain-recurrence. b) If the gain parameter goes to zero at a suitable rate depending on the expansion rate of the ODE, any trajectory solution to the recursion is almost surely asymptotic to a forward trajectory solution to the ODE.
The role of composition in computer programming
Authors: Donald B. McIntyre
Venue: Proceedings of the international conference on Applied programming languages (1995)

Iverson has greatly enlarged the mathematical notion of function composition and made it available to computer programmers. This paper explains the concept, and uses practical examples to show how concise, powerful programs can be written and read. Alternative forms are given, and ways of overcoming initial difficulties are explained.The systematic use of composition extends the well-known advantages of APL; namely conciseness, consistency, and generality.
Multiple Subclass Pattern Recognition: A Maximin Correlation Approach
Authors: Hadar I. Avi-Itzhak, Jan A. Van Mieghem, Leonardo Rub
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper addresses a correlation based nearest neighbor pattern recognition problem where each class is given as a collection of subclass templates. The recognition is performed in two stages. In the first stage the class is determined. Templates for this stage are created using the subclass templates. Assignment into subclasses occurs in the second stage. This two stage approach may be used to accelerate template matching. In particular, the second stage may be omitted when only the class needs to be determined.We present a method for optimal aggregation of subclass templates into class templates. For each class, the new template is optimal in that it maximizes the worst case (i.e., minimum) correlation with its subclass templates. An algorithm which solves this maximin optimization problem is presented and its correctness is proved. In addition, test results are provided, indicating that the algorithm¿s execution time is polynomial in the number of subclass templates.We show tight bounds on the maximin correlation. The bounds are functions only of the number of original subclass templates and the minimum element in their correlation matrix.The algorithm is demonstrated on a multifont optical character recognition problem.
An integrated compilation and performance analysis environment for data parallel programs
Authors: Vikram S. Adve, John Mellor-Crummey, Mark Anderson, Jhy-Chun Wang, Daniel A. Reed, Ken Kennedy
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

Supporting source-level performance analysis of programs written in data-parallel languages requires a unique degree of integration between compilers and performance analysis tools. Compilers for languages such as High Performance Fortran infer parallelism and communication from data distribution directives, thus, performance tools cannot meaningfully relate measurements about these key aspects of execution performance to source-level constructs without substantial compiler support. This paper describes an integrated system for performance analysis of data-parallel programs based on the Rice Fortran 77D compiler and the Illinois Pablo performance analysis toolkit. During code generation, the Fortran D compiler records mapping information and semantic analysis results describing the relationship between performance instrumentation and the original source program. An integrated performance analysis system based on the Pablo toolkit uses this information to correlate the program's dynamic behavior with the data parallel source code. The integrated system provides detailed source-level performance feedback to programmers via a pair of graphical interfaces. Our strategy serves as a model for integration of data-parallel compilers and performance tools.