ppxscal/embedding_network huggingface dataset:
A Distributed Parallel Processing Environment Based upon the Linda Paradigm: A Research Prospectus
Authors: Kenneth D. Landry, George E. Cline, James D. Arthur
Venue:  (1992)

As the computing capacity of the uniprocessor is being taxed, and the high cost of parallel and super-computers is still prevalent, alternative methods of achieving parallel performance at an economical price are desired. This proposed research effort offers one such alternative, focusing on the idle CPU cycles existing on local area networks. With the increase in the computing power of workstations and their declining costs, one can effectively transform the unused computing power attached to a local area network into a parallel processing environment. Effectively exploiting such an environment, however, requires a specification and operational framework that is portable, easy to use, and efficient. The environment is constructed around the Linda parallel programming paradigm which provides an effective parallel computational framework.
Linking BDD-Based Symbolic Evaluation to Interactive Theorem-Proving
Authors: Jeffrey J. Joyce, Carl Seger
Venue:  (1993)

A novel approach to formal hardware verification results from the combination of symbolic trajectory evaluation and interactive theorem-proving. From symbolic trajectory evaluation we inherit a high degree of automation and accurate models of circuit behaviour and timing. From interactive theorem-proving we gain access to powerful mathematical tools such as inductions and abstraction. We have prototyped a hybrid tool and used this tool to obtain verification results that could not be easily obtained with previously published techniques.
The EM Algorithm used for Gaussian Mixture Modelling and its Initialization
Authors: Patricia McKenzie, Mike Alder
Venue:  (1993)

This is an extended version of the paper on EM initialisation, involving a more indepth description and comparison. This file cannot be viewed with ghostview - please use pageview.
Rulebase Evolution in Object-Oriented Database Systems: Adapting thePast to Future Needs
Authors: Andreas Geppert, Stella Gatziu, Klaus R. Dittrich
Venue:  (1995)

The capability to modify the definition of reactive behavior is crucial for certain applications of active database management systems. We show how composite event definitions can be modified in the SAMOS active database management system, whereby it is possible to take into account events that have occurred prior to the modification even under the modified rulebase. The Petri net-based approach to event detection in SAMOS is used to define the semantics of rule modification, and is also applied for showing to the user the effects of his/her rule modification request.
ANALYSIS AND TRANSFORMATION OF LOGIC PROGRAMS (Ph.D. Thesis)
Authors: Kjell E Post
Venue:  (1994)

Logic programming is based on the idea that inference can be viewed as a computation. The fact that both programs and their specifications can be expressed in the same language makes logic programming very useful for program development. But it is also known that clarity and efficiency are two rather incompatible demands to put on a programming language. It is thus important to develop techniques for systematically transforming clear but inefficient programs into efficient (although probably rather opaque) final programs. This thesis contains some contributions that hopefully bring us closer to this goal. Before transformation can take place the input program must be parsed and analyzed to extract properties that are not explicit in the program itself. Parsing is an area of computer science well understood, but with the advent of modern languages, like Prolog and ML, the programmer was able to introduce and change operator symbols. On one hand, operator symbols made the code more readable but it also complicated the parsing job; standard parsing techniques cannot accommodate dynamic grammars. In the first part of this thesis we present an LR parsing methodology, called ``deferred decision parsing", that handles dynamic operator declarations, that is, operators that are declared at run time. It uses a parser generator much like Yacc. Shift/reduce conflicts that involve dynamic operators are resolved at parse time rather than at parser construction time. As an example of our parser generator we present a grammar for Prolog, a language that has been in use for almost twenty years but still lacks a precise formal syntactic definition. The parser generator can also serve as a replacement implementation for Definite Clause Grammars, a novel parsing feature of Prolog. However, an LR parser does not normally support inherited attributes. In the next part of the thesis we present two transformation methods for (strong) non-circular attribute grammars that allows them to be evaluated within the environment of an LR parser. Our methods represent a compromise in that attribute evaluation is normally performed on the fly except when, in some evaluation rule, the referenced attributes are unavailable, and the execution of the rule has to be postponed. Suspension and resumption points for these evaluation rules can either be determined statically (method 1) or dynamically (method 2). For both methods we guarantee that resumption takes place as soon as possible. In the final part of the thesis we present a technique to detect that pairs of rules in a logic program are ``mutually exclusive''''. In contrast to previous work our algorithm derives mutual exclusion by looking not only at built-in, but also user-defined predicates. This technique has applications to optimization of the execution of programs containing these rules. Additionally, the programmer is less dependent on non-logical language features, such as Prolog''s ``cut'''', thus creating more opportunities f
Binary Exponential Backoff is Stable for High Arrival Rates
Authors: Hesham Al-Ammal, Leslie A Goldberg, Phil MacKenzie
Venue:  (1999)

Goodman, Greenberg, Madras and March gave a lower bound of n^{-Omega(log n)} for the maximum arrival rate for which the n-user binary exponential backoff protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most n^{-Omega(log n)}. We improve the lower bound, showing that the protocol is stable for arrival rates up to O(n^{-.9}).
Curve Extraction in Images Using a Multiresolution Framework
Authors: A. D. Calway, R. G. Wilson
Venue:  (1993)

A multiresolution approach to curve extraction in images is described. Based on a piecewise linear representation of curves, the scheme combines an efficient method of extracting line segments with a grouping process to identify curve traces. The line segments correspond to linear features defined at appropriate spatial resolutions within a quadtree structure and are extracted using a hierarchical decision process based on frequency domain properties. Implementation is achieved through the use of the multiresolution Fourier transform (MFT), a linear transform providing spatially localised estimates of the frequency spectrum over multiple scales. The scheme is simple to implement, computationally inexpensive, and results of experiments performed on natural images demonstrate that its performance compares favourably with that of existing methods.
On Parallel Methods for Boundary Value Odes
Authors: Uri Ascher, S. Y. P Chan
Venue:  (1989)

Some of the traditional methods for boundary value ODEs, such as standard multiple shooting, finite difference and collocation methods, lend themselves well to parallelization in the independent variable: the first stage of the construction of a solution approximation is performed independently on each subinterval of a mesh. However, the underlying possibly fast bidirectional propagation of information by fundamental modes brings about stability difficulties when information from the different subintervals is combined to form a global solution. Additional difficulties occur when a very stiff problem is to be efficiently and stably solved on a parallel architecture. \n In this paper parallel shooting and difference methods are examined, a parallel algorithm for the stable solution of the resulting algebraic system is proposed and evaluated, and a parallel algorithm for stiff boundary value problems is proposed.
Local Search for the Retrieval Layout Problem
Authors: Lenwood S. Heath, Joseph W. Lavinus
Venue:  (1993)

An information graph is a data representation for object-oriented databases in which each object is a vertex and each relationship between objects is an edge. The retrieval layout problem is to arrange the storage of an information graph on a physical medium so as to use storage efficiently and to allow rapid navigation along paths in the graph. This paper describes an empirical study of the performance of various local search heuristics for the retrieval layout problem, including local optimization, simulated annealing, tabu search, and genetic algorithms. In addition, the hierarchical hybrid approach is introduced.
Validation of Optimizing Compilers,
Authors: L. Zuck, A. Pnueli, R. Leviathan
Venue:  (2001)

There is a growing awareness, both in industry and academia, of the crucial role of formally proving the correctness of safety-critical components of systems. Most formal verification methods verify the correctness of a high-level representation of the system against a given specification. However, if one wishes to infer from such a verification the correctness of the code which runs on the actual target architecture, it is essential to prove that the high-level representation is correctly implemented at the lower level. That is, it is essential to verify the the correctness of the translation from the high-level source-code representation to the object code, a translation which is typically performed by a compiler (or a code generator in case the source is a specification rather than a programming language). Formally verifying a full-fledged optimizing compiler, as one would verify any other large program, is not feasible due to its size, ongoing evolution and modification, and, possibly, proprietary considerations. The translation validation method used in this paper is a novel approach that offers an alternative to the verification of translators in general and compilers in particular. According to the translation validation approach, rather than verifying the compiler itself, one constructs a validation tool which, after every run of the compiler, formally confirms that the target code produced on that run is a correct translation of the source program. The paper presents a methodology for translation validation of optimizing compilers. We distinguish between structure preserving optimizations, for which we establish simulation relation between source and target based on computational induction, and structure modifying optimizations, for which we develop specialized ``meta-rules". We present some examples that illustrate the use of the methodology, including a ``real-life" validation of an EPIC compiler which uncovered a bug in the compiler.
The effects of temperature variation on the creep behaviour of pressure vessels using Theta projection data
Authors: M. Law, W. Payten, K. Snowden
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Pressure vessels are often exposed to through-wall temperature gradients. The thermal and pressure stresses and the resulting creep response are examined using the Theta projection creep algorithm within a finite element code. It was found that the stress and temperature dependence of the creep response may lead to complex stress evolution.
Delivery and Discrimination: The Seine Protocol
Authors: Mohamed G. Gouda, N. F. Maxemchuk, U. Mukherji, K. Sabnani
Venue:  (1989)

We present a family of protocols for data transmission from multiple identical senders to a single receiver. At each instant, every sender sends one bit, and the sent bits are or-ed together into one bit before being received by the receiver. If a sender has a data message to send, it sends the message bits one by one; otherwise it sends zero bits. Clearly, if the sending of two messages by two senders overlap in time, then the resulting collision can cause the receiver to receive a corrupted message, i.e., one that was not sent by either sender. The function of the protocol is to allow the receiver to detect and deliver those and only those messages that are not corrupted by collision. (In other words, the receiver acts as a discriminating seine that catches and delivers only uncorrupted messages; hence the title.) The seine protocol has been implemented in a class of fiber-optic local area networks.
Concentric Hyperspaces and Disk Allocation for Fast Parallel Searching
Authors: Hakan Ferhatosmanoglu, Divyakanth Agrawal, Amr El Abbadi
Venue:  (1999)

Data partitioning and declustering have been extensively used in the past to parallelize I/O for range queries. Numerous declustering and disk allocation techniques have been proposed in the literature. However, most of these techniques were primarily designed for two-dimensional data and for balanced partitioning of the data space. As databases increasingly integrate multimedia information in the form of image, video, and audio data, it is necessary to extend the declustering techniques for multidimensional data. In this paper, we first establish that traditional declustering techniques do not scale for high-dimensional data. We then propose several new partitioning schemes based on concentric hyperspaces. We then develop disk allocation methods for each of the proposed schemes. We conclude with an evaluation of range queries based on these schemes and show that partitioning based on concentric hyperspaces has a significant advantage over balanced partitioning approach for parallel I/O.
The Connection Method for Non-Monotonic \& Autoepistemic Logic
Authors: George K. Tsiknis
Venue:  (1988)

In this paper, first we present a connection method for non-monotonic logic, together with its soundness and completeness proof. Then, we extend this to a proof procedure for autoepistemic logic. In the last section, we also discuss some improvements on the method through structure sharing techniques.
Establishing Software Development Process Control: Technical Objectives, Operational Requirements, and the Foundational Framework
Authors: James D. Arthur, Richard E. Nance, Osman Balci
Venue:  (1992)

This paper proposes a foundational framework for establishing control over the software development process. Critical objectives stressed include (a) the complementary integration of maintenance and development activities, (b) the identification and definition of a (semi-) automated data collection and analysis process which employs quality indicators that are definitively linked to the existence of process and product attributes, and (c) the formulation and use of control methods that are designed to work within the defined automated process and to provide decision support capabilities. The significance and necessity of these objectives are established through an examination of the Abstraction Refinement Model, the Objectives/Principles/Attributes Framework and the Software Quality Indicator concept.
On a Constrained Bin-packing Problem
Authors: Yingfeng Oh, Sang H. Son
Venue:  (1995)

We study a bin-packing problem which is one-dimensional and is constrained in the manner items are placed into bins. The problem is motivated by a practical real-time scheduling problem, where redundant periodic tasks need to be assigned to a multiprocessor system. The problem is stated in the traditional light: to use as few bins as possible to pack a given list of items, and it is a generalization of the classical bin-packing problem. We first propose a heuristic algorithm called First-Fit-K to solve the bin-packing problem, and then prove that First-Fit-K has an asymptotical worst-case tight bound of 1.7. We also study the average-case performance of the algorithm. The simulation results show that First-Fit-K performs within 10% of the optimal solution.
Optimal design of stiffened plates for buckling under in-plane forces and bending moments
Authors: M. Ghorashi, A. Askarian, M. Gashtasby
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper, the buckling of stiffened plates with longitudinal, transverse, and combined orthogonal stiffeners is investigated. The plate is simply supported along all its edges and is subjected to a combination of in-plane forces and bending moments. The virtual work principle is implemented in order to obtain the critical load of the structure in terms of the displacement field coefficients and the stiffener position. It is then minimized with respect to the displacement field coefficients which results in the actual buckling load, together with the mode shape of the buckled plate. Finally, in order to find the most efficient spacing of the stiffeners, the spacing corresponding to the maximum buckling load is obtained.
HIDDEN MARKOV MODELS IN COMPUTATIONAL BIOLOGY: APPLICATIONS TO PROTEIN MODELING
Authors: Anders Krogh, Michael Brown, I. S Mian, Kimmen Sjolander, David Haussler
Venue:  (1993)

Hidden Markov Models (HMMs) are applied to the problems of statistical modeling, database searching and multiple sequence alignment of protein families and protein domains. These methods are demonstrated on the globin family, the protein kinase catalytic domain, and the EF-hand calcium binding motif. In each case the parameters of an HMM are estimated from a training set of unaligned sequences. After the HMM is built, it is used to search the SWISS-PROT 22 database for other sequences that are members of the given protein family, or contain the given domain. The HMM produces multiple alignments of good quality that agree closely with the alignments produced by programs that incorporate three-dimensional structural information. When employed in discrimination tests (by examining how closely the sequences in a database fit the globin, kinase and EF-hand HMMs), the HMM is able to distinguish members of these families from non-members with a high degree of accuracy. Both the HMM and PROFILESEARCH (a technique used to search for relationships between a protein sequence and multiply aligned sequences) perform better in these tests than PROSITE (a dictionary of sites and patterns in proteins). The HMM appears to have a slight advantage over PROFILESEARCH in terms of lower rates of false negatives and false positives, even though the HMM is trained using only unaligned sequences, whereas PROFILESEARCH requires aligned training sequences. Our results suggest the presence of an EF-hand calcium binding motif in a highly conserved and evolutionarily preserved putative intracellular region of 155 residues in the alpha-1 subunit of L-type calcium channels which play an important role in excitation-contraction coupling. This region has been suggested to contain the functional domains that are typical or essential for all L-type calcium channels regardless of whether they couple to ryanodine receptors, conduct ions or both.
Coroutines in a Theory of Programmable Machines
Authors: J. L. Baker
Venue:  (1977)

It is shown that, in the author''s theory of programmable machines, the composition of functions computable by programs is in some important cases computable by a program constructed to use the given programs as coroutines. To illustrate the utility of this result, a characterization of the full AFLs in terms of programmable machines is established with its help. 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
Video-Based Detection and Classification of Real-World Moving Objects
Authors: Sok G Lim, Mike Alder, Christopher J.S. deSilva, Yianni Attikiouzel
Venue:  (1993)

In this paper we propose a method for classifying objects moving in front of a video camera. Consecutive frames are grabbed from the video camera and the difference image from consecutive frames is use to detect moving objects. Border tracing and fitting of quadratic forms along the border of the objects are performed on the difference image. Classification is achieved by calculating an entropy value from the set of sequences of quadratic forms. The method is tested on domestic images such as people, curtains blown by wind and external events such as tree branches.
MORPH II: A UNIVERSAL AGENT - PROGRESS REPORT AND PROPOSAL
Authors: Robert Levinson
Venue:  (1994)

This short report describes progress on the Morph Adaptive Pattern-Oriented chess system over the last four years and describes ongoing work on Morph II, a domain-independent machine learning system and problem-solver. Morph II, is a direct generalization of the original Morph model and incorporates significant improvements to all aspects of the original system. The Universal Agent (Morph II) falls directly within the hierarchical reinforcement learning paradigm that has been gaining popularity in the last few years, but goes beyond: in this learning model, the system is responsible for abstracting its own features and patterns, developing its own learning modules, and employing transformations on the representations used. In essence the system is learning neurally (through weight propagation), genetically (through pattern evolution) and symbolically (through its own abstractions). Still, the system maintains uniformity, in that each module at any level of the hierarchy is an instantiation of the same learning strategy. This report describes the motivations and philosophy behind MorphII, outlines current and future performance objectives, and discusses the potential impact of this new technology.
The Inequalities of Quantum Information Theory
Authors: Nicholas Pippenger
Venue:  (2002)

The Inequalities of Quantum Information Theory Nicholas Pippenger Given an n-part quantum state, we consider the 2^n substates obtained by restricting attention to a subset of the parts. The entropies (in the sense of von Neumann) of these substates may be regarded as a point, called the allocation of entropy, in a (2^n)-dimensional real vector space. We show that the topological closure of the set of allocations of entropy form a convex cone. We show that a set of inequalities due to Lieb and Ruskai characterize this cone when n is at most 3. We also consider the symmetric situation in which the entropy depends only on the number of parts in the substate. In this case, the topological closure of the set of allocations of entropy (in (n+1)-dimensional space) again form a convex cone, and we give inequalities characterizing this cone for all n.
Multimedia Traffic Analysis Using CHITRA95
Authors: Marc Abrams, Stephen Williams, Ghaleb Abdulla, Shashin Patel, Randy Ribler, Edward A. Fox
Venue:  (1995)

We describe how to investigate collections of trace data representing network delivery of multimedia information with CHITRA95, a tool that allows a user to visualize, query, statistically analyze and test, transform, and model collections of trace data. CHITRA95 is applied to characterize World Wide Web (WWW) traffic from three workloads: students in a classroom of network-connected workstations, graduate students browsing the Web, undergraduates browsing educational and other materials, as well as traffic on a courseware repository server. We explore the inter-access time of files on a server (i.e., recency), the hit rate from a proxy server cache, and the distributions of file sizes and media types requested. The traffic study also yields statistics on the effectiveness of caching to improve transfer rates. In contrast to past WWW traffic studies, we analyze client as well as server traffic; we compare three workloads rather than drawing conclusions from one workload; and we analyze tcpdump logs to calculate the performance improvement in throughput that an end user sees due to caching.