ppxscal/embedding_network huggingface dataset:
Using Reflection for Flexibility and Extensibility in a Metacomputing Environment
Authors: Anh Nguyen-Tuong, Steve J. Chapin, Andrew S. Grimshaw, Charlie Viles
Venue:  (1998)

We present system developers with a reflective model, the Reflective Graph and Event model (RGE), for building metacomputing applications, incorporating our design goals of flexibility, extensibility, reusability, and composability. The model uses graphs and events to specify computations and enables first-class program graphs as event handlers. We demonstrate the RGE model in several areas of interest to metacomputing using Legion as our experimental testbed. We unify the concepts of exceptions and events; by making exceptions a special case of events. Furthermore, using RGE, we demonstrate how to build generic, composable and reusable components that can be shared across development environments such as MPI, PVM, NetSolve, C++, and Fortran.
A Cooperative Scheme for Image Understanding Using Multiple Sources of Information
Authors: Jay Glicksman
Venue:  (1982)

One method of resolving the ambiguity inherent in interpreting images is to add different sources of information. The multiple information source paradigm emphasizes the ability to utilize knowledge gained from one source that may not be present in another. However, utilizing disparate information may create situations in which data from different sources are inconsistent. .br A schemata-based system has been developed that can take advantage of multiple sources of information. Schemata are combined into a semantic network via the relations decomposition, specialization, instance of, and neighbour. Control depends on the structure of the evolving network and a cycle of perception. Schemata cooperate by message passing so that attention can be directed where it will be most advantageous. .br This system has been implemented to interpret aerial photographs of small urban scenes. Geographic features are identified using up to three information sources: the intensity image, a sketch map, and information provided by the user. The product is a robust system where the accuracy of the results reflects the quality and amount of data provided. Images of several geographic locales are analyzed, and positive results are reported.
SWEB: Towards a Scalable World Wide Web Server on Multicomputers
Authors: Daniel Andresen, Tao Yang, Vegard Holmedahl, Oscar H. Ibarra
Venue:  (1995)

We investigate the issues involved in developing a scalable World Wide Web (WWW) server on a cluster of workstations and parallel machines, using the Hypertext Transport Protocol (HTTP). The main objective is to strengthen the processing capabilities of such a server by utilizing the power of multicomputers to match huge demands in simultaneous access requests from the Internet. We have implemented a system called SWEB on a distributed memory machine, the Meiko CS-2, and networked SUN and DEC workstations. The scheduling component of the system actively monitors the usages of CPU, I/O channels and the interconnection network to effectively distribute HTTP requests across processing units to exploit task and I/O parallelism. We present the experimental results on the performance of this system. Our results indicate that the system delivers good performance on multi-computers and obtains significant improvements over other approaches.
VLSI Design of a Pipelined CORDIC Processor
Authors: Paul Chown, D. W. Walton, Graham R. Nudd
Venue:  (1990)

In this report we discuss the VLSI realisation of a pipelined CORDIC arithmetic unit to perform stable matrix row operations for the solution of systems of linear equations. The algorithmic considerations of the CORDIC process are highlighted and a chip level architecture is derived from these to implement the algorithm in a pipelined manner. We then proceed to give details of the 2pm CMOS processor that has been designed to implement that architecture.
The NAS Parallel Benchmark Kernels in MPL
Authors: Adam Ferrari, Adrian Filipi-Martin, Soumya Viswanathan
Venue:  (1995)

The Numerical Aerodynamic Simulation (NAS) Parallel Benchmarks are a set of algorithmically specified benchmarks indicative of the computation and communication needs of typical large-scale aerodynamics problems. Although a great deal of work has been done with respect to implementing the NAS Parallel Benchmark suite on high-end vector supercomputers, multiprocessors, and multicomputers, only recently has the possibility of running such demanding applications on workstation clusters begun to be explored. We implemented a subset of the NAS benchmarks using the Mentat Programming Language, and ran performance tests on a cluster of workstations using the Mentat system. We compared our performance results to previous NAS benchmark tests using the Parallel Virtual Machine (PVM) system in a similar hardware environment. We found that due to algorithmic improvements, efficient communications provided by the Mentat system, and low introduced overheads even at the higher level of programming abstraction provided by Mentat, we observed significantly improved performance in a number of cases.
CDIGITS: A Large Isolated English Digit Database
Authors: Yaxin Zhang, Mylene Pijpers, Roberto Togneri, Mike Alder
Venue:  (1994)

This paper described a large isolated English digit database which was designed for the training and evaluation of statistical algorithms and neural networks. 1108 speakers (575 males and 533 females) were recorded in the UWA campus under office environment.
Energy consumption of traffic padding schemes in wireless ad hoc networks
Authors: Shu Jiang, Nitin H. Vaidya, Wei Zhao
Venue: Real-time system security (2003)

Wireless ad hoc network possesses some unique characteristics that prove to be extremely valuable in mission-critical systems. However, the wide use of wireless ad hoc network in mission-critical systems is still limited by its poor security and constraints on energy consumption - the nodes in wireless ad hoc networks typically have limited battery supply. It is well known that the wireless medium provides greater opportunities for eavesdropping on the transmissions of data packets in the network. While encryption may be used to hide message contents in the packets, the observable traffic pattern might reveal important information about the system. Traffic padding may be used to hide the traffic pattern, which means to insert dummy traffic into the network and present to the intruder a different traffic pattern. The apparent traffic pattern, which is observed by intruder, is referred to as a cover mode that hides the real operation mode of the system. Since the dummy traffic incurs an overhead, it is important to minimize dummy traffic while achieving the desired security objective. This paper deals with the issue of designing energy-saving traffic padding schemes. Instead of simply reducing the amount of dummy traffic, we attempt to develop cover modes that optimize system parameters, i.e. system lifetime and energy consumption per unit of real traffic delivered by the network.
Bigger is Not Always Better
Authors: Christopher J.S. deSilva, Mike Alder, Yianni Attikiouzel
Venue:  (1991)

This paper consideres the question of how much data is required to train a backpropagation neural network. Results of a simulation experiment involving random data sets are supported by a single counting argument that shows that N(k+1)+2 is the minimum number of data points required to train a backpropagation network with n input units and k.units in a single hidden layer. This requirement indicates that some applications of backpropagation networks have used networks whose size may not have been appropriate to the training set.
Interactive Digital Video Authoring and Prototyping
Authors: Edward A. Fox, Deborah Hix, Edward E. Schwartz, Antonio C. Siochi, Prabhakar M. Koushik, Donald Inman
Venue:  (1990)

This paper reports on a joint research project between Virginia Tech and the NCR Corporation on Digital Video Interaction (DVI) technology. In particular, it discusses:
Evaluation of B-splines for Solving Systems of Boundary Value Problems
Authors: Uri Ascher, R. D. Russell
Venue:  (1977)

A general purpose collocation code COLSYS has been written, which is capable of solving mixed order systems of multi-point boundary value ordinary differential equations. The peicewise polynomial solution is given in terms of a B-spline basis. Efficient implementation of algorithms to calculate with B-splines is a necessary condition for the code to be competitive. Here we describe these algorithms and the special features incorporated to take advantage of the specific environment in which they are used.
Formal Specification of Real-time Systems
Authors: Farnam Jahanian, Aloysius K. Mok, Douglas A. Stuart
Venue:  (1988)

This paper presents the formal syntax and semantics of Real Time Logic (RTL), a logic for the specification of real-time systems. An example illustrating the specification of a system in RTL is presented, and natural deduction is used to verify that the system satisfies a given safety property. RTL is shown to be undecidable by a reduction from the acceptance problem for two-counter machines. Decidable subclasses of the logic are also discussed.
On Proebsting''s Law
Authors: Kevin Scott
Venue:  (2001)

In 1965 Gordon Moore observed that the capacity of semiconductor ICs doubled every 18 to 24 months. This trend, now known as Moore''s Law, has held for over 25 years and is responsible for the exponential increase in microprocessor performance over this period. In 1998 Todd Proebsting made a similar-in-spirit, but altogether less optimistic observation about optimizing compilers. His observation, henceforth known as Proebsting''s Law, is that improvements to compiler technology double the performance of typical programs every 18 years. Proebsting has suggested an experiment to evaluate the veracity of his observation. This paper presents the results of this experiment and some comments on what Proebsting''s Law portends for compiler research.
Consistency of Natural Relations on Sets
Authors: H. Koizumi, A. Maruoka, M. S. Paterson
Venue:  (1993)

Five natural relations for sets, such as inclusion, disjointness, intersection, etc., are introduced in terms of the emptiness of the subsets defined by Boolean combinations of the sets. Let N denote {1,2,...,n} and (N 2) denote {(i,j) | i,j in N and i > j}. A function mu on (N 2) specifies one of these relations for each pair of indices. Then mu is said to be "consistent on" M, a subset of N, if and only if there exists a collection of sets corresponding to indices in M such that the relations specified by mu hold between each associated pair of the sets. In this paper it is proved that if mu is consistent on all subsets of N of size three then mu is consistent on N. Furthermore, conditions that make mu consistent on a subset of size three are given explicitly.
Session-Key Generation Using Human Passwords Only
Authors: O. Goldreich, Y. Lindell
Venue:  (2000)

We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilistic polynomial-time adversaries that control the communication channel (between the parties), and may omit, insert and modify messages at their choice. Loosely speaking, the effect of such an adversary that controls m instances of the protocol is comparable to an on-line attack in which an adversary is only allowed to makes O(m) queries of the form ``is w the password of Party&#x00A0;A''''. We stress that the result holds also in case the passwords are selected at random from a small dictionary so that it is feasible (for the adversary) to scan the entire directory.
How Many Squares Must a Binary Sequence Contain?
Authors: A. S. Fraenkel, R. J. Simpson
Venue:  (1994)

Let g(n) be the length of a longest binary string containing at most n distinct squares (two identical adjacent substrings). Then g(0) = 3 (010 is such a string), g(1) = 7 (0001000) and g(2) = 18 (010011000111001101). How does the sequence {g(n)} behave? We give a complete answer.
Expressiveness of First-Order Description Logics
Authors: Natasha Kurtonina, Maarten de Rijke
Venue:  (1997)

We introduce a method for characterizing the expressive power of first-order description logics. The method is essentially model-theoretic in nature in that it gives preservation results uniquely identifying a wide range of description logics as fragments of first-order logic. The languages studied in the paper all belong to the well-known FL- and AL hierarchies.
An Isolated Word Recognizer Using the EM Algorithm for Vector Quantization
Authors: Yaxin Zhang, Christopher J.S. deSilva
Venue:  (1991)

This paper presents a scheme of speaker-independent isolated word recognition in which Hidden Markov Modelling is used with Vector Quantization codebooks constructed using the Expectation Maximization (EM) algorithm for Gaussian mixture models. In comparison with conventional vect or quantization, the EM algorithm results in greater recognition accuracy.
On the Implementation of Local Synchrony
Authors: Raymond R. Wagner,  Jr.
Venue:  (1993)

Local synchrony is a distributed approach to providing logically synchronous capabilities in an asynchronous system. Local synchrony provides a logical timeline to memory access, and thus a total ordering to the steps of a distributed computation, without many of the inherent consequences of global synchronization. Local synchrony offers a framework for the implementation of various concurrency control mechanisms, including combining and isochrons (parallel operations). We show the implementability of local synchrony, and demonstrate its compatibility with existing protocols for fault-tolerance in general purpose multiprocessors. The results of our research are threefold. We show first that practical implementation of local synchrony is feasible in general, asynchronous, MIMD architectures. We show that such implementations are compatible with existing hardware fault tolerance systems and present a correct rollback algorithm for our general implementation. Finally, we present both analytic and empirical studies which illustrate the performance characteristics of such implementations. Our analytic modeling technique extends in novel ways probabilistic modelling methods often employed for interconnec- tion networks. Our work establishes the practicality and feasibility of local synchrony as a means of providing support for concurrency control.
ACL2 Workshop 2000 Proceedings, Part B, Goerigk-Kaufman
Authors: Matt Kaufmann, J S Moore
Venue:  (2000)

The papers are listed in the order they were presented at the workshop. See http://www.cs.utexas.edu/users/moore/acl2/workshop-2000 for more information. Supporting scripts for many of the papers may be found at this site. This year we encouraged both long and short papers, the latter indended primarily to present work in progress.
Executable Object Modeling with Statecharts
Authors: D. Harel, E. Gery
Venue:  (1994)

A behaviorally expressive set of diagrammatic languages for modeling object-oriented systems is presented. It constitutes the constructive subset of UML, and is supported by Rhapsody, a tool that enables model execution and full code synthesis.
Representing Polyhedra: Faces Are Better than Vertices
Authors: Lenwood S. Heath, Praveen K. Paripati, John W. Roach
Venue:  (1992)

In this paper, we investigate the reconstruction of planar-faced polyhedra given their spherical dual representation. We prove that the spherical dual representation is unambiguous for all genus 0 polyhedra and that a genus 0 polyhedron can be uniquely reconstructed in polynomial time. We also prove that when the degree of spherical dual representation is at most four, the representation is unambiguous for polyhedra of any genus.
Class Structure Graphs for Object-Oriented Design and Implementation
Authors: Mathias Richter
Venue:  (1995)

We introduce a language independent representation of systems taking the form of graphs of object-oriented source-code. Using this representation, the object-oriented design process can be conducted from an abstract level to the detailed level of implementation. In turn, existing implementations can be analysed on different levels of abstraction in order to gain better understanding of a class''s structure as a basis for proper reuse.
Practical non-linear analysis for 3D semi-rigid frames
Authors: S. E. Kim
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A practical nonlinear analysis of 3D semi-rigid frame is developed. Herein, the nonlinear behavior of beam-to-column connections is discussed, and practical modeling of these connections is introduced. The proposed analysis can predict accurately the combined nonlinear effects of connection, geometry, and material on the behavior and strength of semi-rigid frames. Kishi-Chen power model is used to describe the nonlinear behavior of semi-rigid connections. Stability functions are used to capture second-order effects associated with P-δ and P-Δ effects. The Column Research Council (CRC) tangent modulus and a parabolic function for gradual yielding are used to represent material nonlinearity. The load-displacements predicted by the proposed analysis compare well with those available experiments. A case study has been performed for a four story semi-rigid frame.
Heuristics for Laying Out Information Graphs
Authors: Lenwood S. Heath, Joseph W. Lavinus
Venue:  (1993)

The concept of an information graph is introduced as a representation for object-oriented databases. The retrieval layout problem is an optimization problem defined over the class of information graphs. The layout abstracts the space efficiency of representing the database as well as the time efficiency of information retrieval. Heuristics for the retrieval layout problem are identified and evaluated experimentally. A new heuristic, connectivity traversal, is found to be fast and to produce high quality layouts.
How Much Can Hardware Help Routing?
Authors: A. Borodin, P. Raghavan, B. Schieber, E. Upfal
Venue:  (1993)

We study the extent to which complex hardware can speed up routing. Specifically, we consider the following questions. How much does adaptive routing improve over oblivious routing? How much does randomness help? How does it help if each node can have a large number of neighbors? What benefit is available if a node can send packets to several neighbors within a single time step? Some of these features require complex networking hardware, and thus it is important to investigate whether the performance justifies the investment. By varying these hardware parameters, we obtain a hierarchy of time bounds for worst-case permutation routing. We develop a nearly complete taxonomy of the complexity of routing.
On the Efficent Implementation of Implicit Runge-Kutta Methods
Authors: James M. Varah
Venue:  (1978)

Extending some recent ideas of Butcher, we show how one can efficiently implement general implicit Runge-Kutta methods, including those based on Gaussian quadrature formulas which are particularly useful for stiff equations. With this implementation, it appears that these methods are more efficient than the recently proposed semi-explicit methods and their variants.
Inheritance in Actor Based Concurrent Object-Oriented Languages
Authors: Dennis G. Kafura, Keung H Lee
Venue:  (1988)

Inheritance is a valuable mechanism which enhances reusability and maintainability of software. A language design based on the actor model of concurrent computation faces a serious problem arising from the interference between concurrency and inheritance. A similar problem also occurs in other concurrent object-oriented languages. In this paper, we describe problems found in existing concurrent object-oriented languages. We present a solution which is based on a concept called behavior abstraction.
Closure Spaces in the Plane
Authors: John L. Pfaltz
Venue:  (1999)

When closure operators are defined over figures in the plane, they are normally defined with respect to convex closure in the Euclidean plane. This report concentrates on discrete closure operators defined over the discrete, rectilinear plane. Basic to geometric convexity is the concept of a geodesic, or shortest path. Such geodesics can be regarded as the closure of two points. But, given the usual definition of geodesic in the discrete plane, they are not unique. And therefore convex closure is not uniquely generated. We offer a different definition of geodesic that is uniquely generated, although not symmetric. It results in a different geometry; for example, two unbounded lines may be parallel to a third, yet still themselves intersect. It is a discrete geometry that appears to be relevant to VLSI design. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Improved Training Procedure for Speaker-independent Isolated word recognition
Authors: Yaxin Zhang, Mike Alder
Venue:  (1994)

This paper describe an improved training procedure in a HMM/VQ speech recognition system for speaker-independent speech recognition. The phoneme based Gaussian mixture models (GMM) were generated in the first step modeling using the Expectation-Maximization (EM) algorithm. These Gaussians more accurately describe the distribution characteristic of the phonemes in the speech signal space. Therefore better first step modeling is achieved and the performance of the whole recognition system is improved. The new method was used in a speaker-independent isolated digits and phoneme recognition tasks. Two English databases were used for the training and testing. Significant improvements have been achieved in comparison with the conventional HMM/VQ system.
On the Existence of Complete Invariant Feature Spaces in Pattern Recognition
Authors: Hanns Schulz-Mirbach
Venue:  (1992)

This paper presents a general and model indepen- dent analysis of the problem of feature extraction in pattern recognition. We will derive two criteria which ensure the existence of a complete feature space. This is a space which contains exactly the information relevant for the classification process following feature extraction. We discuss several possibilities for the construction of such a complete feature space and present experimental results which indicate the potential of the proposed methods for practical applications.
Scalable Causal Message Logging for Wide-Area Networks
Authors: Karan Bhatia, Keith Marzullo, Lorenzo Alvisi
Venue:  (2000)

Wide-area systems are gaining in popularity as an infrastructure for running scientific applications. From a fault tolerance perspective, these environments are challenging due to their scale and their inherent variability. Causal message logging protocols have attractive properties that make them suitable for these environments. They spread fault tolerance information around in the system providing high availability. This information can also be used to replicate objects that are otherwise inaccessible due to network partitions. However, current causal message logging protocols do not scale to thousands or millions of processes. We describe the Hierarchical Causal Logging Protocol (HCML) that uses a hierarchy of shared logging sites, or proxies, to reduces the space requirements exponentially. These proxies also act as caches for fault tolerance information and reduce the overall message overhead of causal message logging protocols by as much as 50%. In addition, HCML leverages differences in bandwidth between communicating processes by piggybacking more fault tolerance information over high bandwidth links. Doing so improves overall message latency by as much as 97%.