ppxscal/embedding_network huggingface dataset:
Practical Algorithms for Selection on Coarse-Grained Parallel Computers
Authors: Ibraheem Al-furiah, Srinivas Aluru, Sanjay Goil, Sanjay Ranka
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. We also consider several algorithms for load balancing needed to keep a balanced distribution of data across processors during the execution of the selection algorithms. We have carried out detailed implementations of all the algorithms discussed on the CM-5 and report on the experimental results. The results clearly demonstrate the role of randomization in reducing communication overhead.
A context mechanism to control sharing in a design database
Authors: Denise J. Eklund, Fred Tonge
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Database systems for electrical engineering design should provide engineers with a mechanism for sharing the design data stored by the system and with consistent and sometimes restricted views of the data stored by the system. The goals of data sharing and data consistency are often in direct opposition. We propose a context mechanism that supports sharing of design data, in a manner controlled by the engineers themselves, while automatically maintaining individual, locally consistent views of the design data.
Some Conservative Stopping Rules for the Operational Testing of Safety-Critical Software
Authors: Bev Littlewood, David Wright
Venue: IEEE Transactions on Software Engineering (1997)

Operational testing, which aims to generate sequences of test cases with the same statistical properties as those that would be experienced in real operational use, can be used to obtain quantitative measures of the reliability of software. In the case of safety critical software it is common to demand that all known faults are removed. This means that if there is a failure during the operational testing, the offending fault must be identified and removed. Thus an operational test for safety critical software takes the form of a specified number of test cases (or a specified period of working) that must be executed failure-free. This paper addresses the problem of specifying the numbers of test cases (or time periods) required for a test, when the previous test has terminated as a result of a failure. It has been proposed that, after the obligatory fix of the offending fault, the software should be treated as if it were completely novel, and be required to pass exactly the same test as originally specified. The reasoning here claims to be conservative, inasmuch as no credit is given for any previous failure-free operation prior to the failure that terminated the test. We show that, in fact, this is not a conservative approach in all cases, and propose instead some new Bayesian stopping rules. We show that the degree of conservatism in stopping rules depends upon the precise way in which the reliability requirement is expressed. We define a particular form of conservatism that seems desirable on intuitive grounds, and show that the stopping rules that exhibit this conservatism are also precisely the ones that seem preferable on other grounds.
The F programming language
Authors: Ralph Frisbie, Richard Hendrickson, Michael Metcalf
Venue: ACM SIGPLAN Notices (1997)

We introduce a new programming language, F, that is intended for the teaching of modern concepts. Strong typing and a strict syntax facilitate teaching and learning. The language is available in optimized form for all major platforms and some teaching experience has already been gained.
The Enumeration of Coxeter Elements
Authors: Jian-Yi Shi
Venue: Journal of Algebraic Combinatorics: An International Journal (1997)

Let (W,S, \Gamma) be a Coxeter system: a Coxeter group W with S its distinguished generator set and \Gamma its Coxeter graph. In the present paper, we always assume that the cardinality l=|S| ofS is finite. A Coxeter element of W is by definition a product of all generators s\in S in any fixed order. We use the notation C(W) to denote the set of all the Coxeter elements in W. These elements play an important role in the theory of Coxeter groups, e.g., the determination of polynomial invariants, the Poincar&eacute; polynomial, the Coxeter number and the group order of W (see [1&ndash;5] for example). They are also important in representation theory (see [6]). In the present paper, we show that the set C(W) is in one-to-one correspondence with the setC(\Gamma) of all acyclic orientations of\Gamma . Then we use some graph-theoretic tricks to compute the cardinality c(W) of the setC(W) for any Coxeter group W. We deduce a recurrence formula for this number. Furthermore, we obtain some direct formulae of c(W) for a large family of Coxeter groups, which include all the finite, affine and hyperbolic Coxeter groups.The content of the paper is organized as below. In Section 1, we discuss some properties of Coxeter elements for simplifying the computation of the value c(W). In particular, we establish a bijection between the sets C(W) andC(\Gamma) . Then among the other results, we give a recurrence formula of c(W) in Section 2. Subsequently we deduce some closed formulae of c(W) for certain families of Coxeter groups in Section 3.
An object-oriented phone center model using SIMPLE++
Authors: Gerald A. Levasseur
Venue: Proceedings of the 28th conference on Winter simulation (1996)

A demonstration model and Application Object Template (object library) was created to show how SIMPLE++ simulation software can be applied to service industry telephone call handling centers. In addition, this example was designed to show modeling techniques that can be used to take advantage of some key object-orientation concepts to quickly create highly flexible simulation models. Finally, some features of the SIMPLE++ simulation package are illustrated.
Performance of a new annealing schedule
Authors: Jimmy Lam, Jean-Marc Delosme
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A new simulated annealing schedule has been developed; its application to the standard cell placement and the traveling salesman problems results in a two to twenty-four times speedup over annealing schedules currently available in the literature. Since it uses only statistical quantities, the annealing schedule is applicable to general combinatorial optimization problems.
Design and analysis of a video-on-demand server
Authors: Alok Srivastava, Anup Kumar, Aditi Singru
Venue: Multimedia Systems (1997)

The availability of high-speed networks, fast computers and improved storage technology is stimulating interest in the development of video on-demand services that provide facilities similar to a video cassette player (VCP). In this paper, we present a design of a video-on-demand (VOD) server, capable of supporting a large number of video requests with complete functionality of a remote control (as used in VCPs), for each request. In the proposed design, we have used an interleaved storage method with constrained allocation of video and audio blocks on the disk to provide continuous retrieval. Our storage scheme interleaves a movie with <i>itself</i> (while satisfying the constraints on video and audio block allocation. This approach minimizes the starting delay and the buffer requirement at the user end, while ensuring a jitter-free display for every request. In order to minimize the starting delay and to support more nonconcurrent requests, we have proposed the use of multiple disks for the same movie. Since a disk needs to hold only one movie, an array of inexpensive disks can be used, which reduces the overall cost of the proposed system. A scheme supported by our disk storage method to provide all the functions of a remote control such as "fast-forwarding", "rewinding" (with play "on" or "off"), "pause" and "play" has also been discussed. This scheme handles a user request independent of others and satisfies it without degrading the quality of service to other users. The server design presented in this paper achieves the multiple goals of high disk utilization, global buffer optimization, cost-effectiveness and high-quality service to the users.
Toward the efficient implementation of expert systems in Ada
Authors: S. Daniel Lee
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Due to the Ada mandate of such government agencies as DoD, NASA and FAA, interest in deploying expert systems in Ada has increased. Recently, a couple of Ada-based expert system tools have been developed. According to recent benchmark reports, these tools do not perform as well as similar tools written in C. While poorly implemented Ada compilers also contribute to the poor benchmark result, some fundamental problems of the Ada language itself have been uncovered. In this paper, we describe Ada language issues encountered during the development of ART-Ada, an expert system tool for Ada deployment. ART-Ada is- being used to implement several expert system applications for the Space Station Freedom and the U.S. Air Force.
Discriminantal Arrangements, Fiber Polytopes and Formality
Authors: Margaret M. Bayer, Keith A. Brandt
Venue: Journal of Algebraic Combinatorics: An International Journal (1997)

Manin and Schechtman defined the discriminantal arrangement of a generic hyperplane arrangement as a generalization of the braid arrangement. This paper shows their construction is dual to the fiber zonotope construction of Billera and Sturmfels, and thus makes sense even when the base arrangement is not generic. The hyperplanes, face lattices and intersection lattices of discriminantal arrangements are studied. The discriminantal arrangement over a generic arrangement is shown to be formal (and in some cases 3-formal), though it is in general not free. An example of a free discriminantal arrangement over a generic arrangement is given.
Brachistochrone with Coulomb Friction
Authors: Stephen C. Lipp
Venue: SIAM Journal on Control and Optimization (1997)

This paper formulates and solves in closed form the problem of finding the minimum-time path of a particle between two points in a uniform gravitational field when motion of the particle is resisted by a force proportional to the normal force exerted on the particle by the path. This resistance to motion is the common mathematical form for Coulomb friction. The problem solution involves the reformulation of the classical brachistochrone of Bernoulli in terms of a singular control problem in which the time derivative of the heading angle of the particle is the control parameter. As such, this solution provides a unique approach to the solution of minimum-time path problems.
An introduction to simulation modeling
Authors: Martha A. Centeno
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper offers an introductory overview of discrete simulation, with emphasis on the simulation modeling process rather than on any specific simulation package. Examples are used to demonstrate the application of the methodology at each step of the process. An extensive list of additional readings is given for the reader who wishes to deepen his/her knowledge in a specific area.
Novel Neural Network Models for Computing HomotheticInvariances: An Image Algebra Notation
Authors: Carmen Paz Suárez Araujo
Venue: Journal of Mathematical Imaging and Vision (1997)

In this paper we propose a theoretical approach to invariant perception. Invariant perception is an important aspect in both natural and artificial perception systems, and it remains an important unsolved problem in heuristically based pattern recognition. Our approach is based on a general theory of neural networks and studies of invariant perception by the cortex. The neural structures that we propose uphold both the architecture and functionality of the cortex as currently understood.The formulation of the proposed neural structures is in the language of image algebra, a mathematical environment for expressing image processing algorithms. Thus, an additional benefit of our study is the implication that image algebra provides an excellent environment for expressing and developing artificial perception systems.The focus of our study is on invariances that are expressible in terms of affine transformations, specifically, homothetic transformations. Our discussion will include both one-dimensional and two-dimensional signal patterns. The main contribution of this paper is the formulation of several novel morphological neural networks that compute homothetic auditory and visual invariances. With respect to the latter, we employ the theory and trends of currently popular artificial vision systems.
DEVise: integrated querying and visual exploration of large datasets
Authors: M. Livny, R. Ramakrishnan, K. Beyer, G. Chen, D. Donjerkovic, S. Lawande, J. Myllymaki, K. Wenger
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

DEVise is a data exploration system that allows users to easily develop, browse, and share visual presentation of large tabular datasets (possibly containing or referencing multimedia objects) from several sources. The DEVise framework is being implemented in a tool that has been already successfully applied to a variety of real applications by a number of user groups. Our emphasis is on developing an intuitive yet powerful set of querying and visualization primitives that can be easily combined to develop a rich set of visual presentations that integrate data from a wide range of application domains. While DEVise is a powerful visualization tool, its greatest strengths are the ability to interactively explore a visual presentation of the data at any level of detail (including retrieving individual data records), and the ability to seamlessly query and combine data from a variety of local and remote sources. In this paper, we present the DEVise framework, describe the current tool, and report on our experience in applying it to several real applications.
Finding Space-Time Transformations for Uniform Recurrences viaBranching Parametric Linear Programming
Authors: Karl-Heinz Zimmermann, Wolfgang Achtziger
Venue: Journal of VLSI Signal Processing Systems (1997)

Many important algorithms in signal and image processing can be described by uniform recurrences. A common method for the synthesis of systolic arrays from uniform recurrences is based on space-time transformations each of which consisting of two linear mappings, an allocation and a timing function. In this paper, we address the problem of finding space-time transformations which are time-optimal or at least nearly time-optimal. For a given allocation function, a continuous relaxation of this problem is studied by passing from linear to quasi-linear timing functions. A parametrized linear programming formulation is provided for finding quasi-linear timing functions. The solution of each such linear problem, however, depends on the basis representation of the null space of the allocation function. Therefore, a branching approach is proposed for finding quasi-linear timing functions which are optimal or have at least low latency. It will be demonstrated by several large test examples that branching into hundreds or even thousands of linear subproblems can be computed with reasonable effort and often leads to an optimum linear timing function.
An object-based model for pprototyping user interfaces of cooperative systems
Authors: Mao Bing, Xie Li
Venue: ACM SIGSOFT Software Engineering Notes (1997)

This paper presents an object-based model to support the construction of user interfaces of CSCW systems. The model divides a cooperative system into layers and each layer is formed by component objects. A principal focus of the model is the provision of an object linking mechanism which links the relevant objects in the same interactive layers of multiple users to realize multi-level collaboration which is independent of the application. In addition, multi-level collaboration obtains fine-grained collaboration of the cooperative system and improves its collaboration efficiency. The object-based method used in this paper ensures a structured collaboration, realizes a simple collaboration management, and facilitates cooperative system development.
The symmetric analogue of the polynomial power basis
Authors: J. Sánchez-Reyes
Venue: ACM Transactions on Graphics (TOG) (1997)

A new polynomial basis over the unit interval t&isin;0,1 is proposed. The work is motivation by the fact that the monomial (power) form is not suitable in CAGD, as it suffers from serious numerical problems, and the monomial coefficients have no geometric meaning. The new form is the symmetric analogue of the power form, because it can be regarded as an &ldquo;Hermite two-point expansion&rdquo; instead of a Taylor expansion. This form enjoys good numerical properties and admits a Horner-like evaluation algorithm that is almost as fast as that of the power form. In a ddition, the symmetric power coeddicients convey a geometric meaning, and therefore they can be used as shape handles. A polynomial expressed in the symmetric power basis is decomposed into linear, cubic, quintic, and successive components. In consequence, this basis is better suited to handle polynomials of different degrees than the Bernstein basis, and those algorithms involving degree operations have extremely simple formulations. The minimum degree of a polynomial is immediately obtained by inspecting its coefficients. Degree reduction of a curve or surface reduces to drooping the desired high degree terms.
AnLex and AnSin: a compiler generator system for beginners
Authors: Marta Patiño-Martínez, J. Ignacio Castelló-Gómez, Ricardo Jiménez-Peris
Venue: ACM SIGCSE Bulletin (1997)

The study of compiler generators is an integral part of compiler construction, and for this reason it is customary to have a programming project entirely devoted to it in compiler courses. There are many compilers generators, but their use in a compiler course presents several problems (e.g. the parsers generated are difficult to understand and to debug). In this paper, we describe such problems and present a compiler generator system, AnLex-AnSin, that solves these problems, and can thus be used in compiler programming projects.
Incorporating imprecise computation into system-level design of application-specific heterogeneous multiprocessors
Authors: Yosef G. Tirat-Gefen, Diogenes C. Silva, Alice C. Parker
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

This paper introduces a basic mixedinteger-linear model (MILP) to design application-specificheterogeneous multiprocessors (ASHM) allowingimprecise computation of tasks executed ina non-preemptive mode.The proposed model wasused in the development of a genetic algorithm integratedinto the tool set MEGA that uses soft computingtechniques for design of optimal/near-optimalASHMs subject to constraints on performance, costand output-data quality.
Multi-way FPGA partitioning by fully exploiting design hierarchy
Authors: Wen-Jong Fang, Allen C.-H. Wu
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

In this paper, we present a new integrated synthesisand partitioning method for multiple-FPGA applications.This method first synthesizes a design specificationin a fine-grained way so that functional clusters can bepreserved based on the structural nature of the designspecification.Then, it applies a hierarchical set-coveringpartitioning method to form the final FPGA partitionings.Our approach bridges the gap between HDL synthesisand physical partitioning by fully exploiting the designhierarchy.Experimental results on a number of benchmarksand industrial designs demonstrate that I/O limitsare the bottleneck for CLB utilization when applying atraditional multiple-FPGA synthesis method on flattenednetlists.In contrast, by fully exploiting the design structuralhierarchy during the multiple-FPGA partitioning,our proposed method produces fewer FPGA partitionswith higher CLB and low I/O-pin utilizations.
An Optimal Algorithm for Global Termination Detection in Shared-Memory Asynchronous Multiprocessor Systems
Authors: Ho-fung Leung, Hing-fung Ting
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

In the literature, the problem of global termination detection in parallel systems is usually solved by message passing. In shared-memory systems, this problem can also be solved by using exclusively accessible variables with locking mechanisms. In this paper, we present an algorithm that solves the problem of global termination detection in shared-memory asynchronous multiprocessor systems without using locking. We assume a reasonable computation model in which concurrent reading does not require locking and concurrent writing different values without locking results in an arbitrary one of the values being actually written. For a system of n processors, the algorithm allocates a working space of 2n + 1 bits. The worst case time complexity of the algorithm is $n+2\sqrt n+1,$ which we prove is the lower bound under a reasonable model of computation.
Advances in fractal compression for multimedia applications
Authors: John Kominek
Venue: Multimedia Systems (1997)

Fractal image compression is a promising new technology but is not without problems. Most critically, fast encoding is required for it to find wide use in multimedia applications. This is now within reach: recent methods are five orders of magnitude faster than early attempts. Beginning with the basic ideas and problems, this paper explains how to accelerate fractal image compression.
Error-Resilient Optimal Data Compression
Authors: James A. Storer, John H. Reif
Venue: SIAM Journal on Computing (1997)

The problem of communication and computation in the presence of errors is difficult, and general solutions can be time consuming and inflexible (particularly when implemented with a prescribed error detection/correction). A reasonable approach is to investigate reliable communication in carefully selected areas of fundamental interest where specific solutions may be more practical than general purpose techniques.In this paper, we study the problem of error-resilient communication and computation in a particularly challenging area, adaptive lossless data compression, where the devastating effect of error propagation is a long-standing open problem that was posed in the papers of Lempel and Ziv in the late 1970s. In fact, the non-error resilience of adaptive data compression has been a practical drawback of its use in many applications. Protocols that require the receiver to request retransmission from the sender when an error is detected can be impractical for many applications where such two-way communication is not possible or is self-defeating (e.g., with data compression, retransmission may be tantamount to losing the data that could have been transmitted in the mean time). In addition, bits of encoded data that are corrupted while data is in storage will in general not be recoverable and may corrupt the entire decompressed file. By error resilience, we mean that even though errors may not be detected, there are strong guarantees that their effects will not propagate.Our main result is a provable error-resilient adaptive lossless data-compression algorithm which nevertheless maintains optimal compression over the usual input distributions (e.g., stationary ergodic sources). We state our result in the context of a more general model that we call dynamic dictionary communication, where a sender and receiver work in a "lock-step" cooperation to maintain identical copies of a dictionary D that is constantly changing. For lossless data compression, the dictionary stores a set of strings that have been seen in the past and data is compressed by sending only indices of strings over the channel. Other applications of our model include robotics (e.g., remote terrain mapping) and computational learning theory.