ppxscal/embedding_network huggingface dataset:
DATA FILTERING AND DISTRIBUTION MODELING ALGORITHMS FOR MACHING LEARNING (Ph.D. Thesis)
Authors: Yoav Freund
Venue:  (1993)

This thesis is concerned with the analysis of algorithms for machine learning. The main focus is on the role of the distribution of the examples used for learning. Chapters 2 and 3 are concerned with algorithms for learning concepts from random examples. Briefly, the goal of the learner is to observe a set of labeled instances and generate a hypothesis that approximates the rule that maps the instances to their labels. Chapter 2 describes and analyses an algorithm for improving the performance of a general concept learning algorithm by selecting those labeled instances that are most informative. This work is an improvement over previous work by Schapire. The analysis provides upper bounds on the time, space and number of examples that are required for concept learning. Chapter 3 is concerned with situations in which the learner can select, out of a stream of random instances, those for which it wants to know the label. We analyze an algorithm of Seung et.al. for selecting such instances, and prove that it is effective for the Perceptron concept class. Both Chapters 2 and 3 show situations in which a carefully selected exponentially small fraction of the random training examples are sufficient for learning. Chapter 4 is concerned with learning distributions of binary vectors. Here we present a new distribution model that can represent combinations of correlation patterns. We describe two different algorithms for learning this distribution model from random examples, and provide experimental evidence that they are effective. We conclude, in Chapter 5, with a brief discussion of the possible use of our algorithms in real world problems and compare them with classical approaches from pattern recognition.
TRACEVIEWER: A GRAPHICAL BROWSER FOR TRACE ANALYSIS
Authors: David P. Helmbold, Charles E. McDowell, Jian Wang
Venue:  (1990)

This report contains a brief description of the operation of TraceViewer. TraceViewer is a graphical tool for browsing the trace of the execution of a parallel Fortran program written using IBM''s parallel Fortran. TraceViewer is intended for examining the ordering relationships between events (which must come first if either) and for reporting data races detected by a companion trace analyzer.
Providing Reusability and Learning Support in the Simulation Model Development Environment
Authors: Jay D. Beams, Osman Balci
Venue:  (1992)

The Premodels Manager, one of the tools of the Simulation Model Development Environment (SMDE), is required to enable a user to locate and reuse components of successfully completed simulation studies and learn from past experience. This paper presents the SMDE Premodels Manager and describes how it provides reusability and learning support. Objectives are set forth and a design is established and implemented on a Sun workstation. The SMDE Premodels Manager consists of four working windows, three access windows, and three support windows. It uses the SMDE Premodels Database which is a highly modifiable repository of documentation on successfully completed simulation studies. It is evaluated with respect to the design objectives and is shown to provide effective reusability and learning support within the SMDE.
Integration und Erhaltung von Integritatsbedingungen inFDBSen
Authors: S. Janssen
Venue:  (1996)

In diesem Papier soll ein kurzer Uberblick uber die Integration und Einhaltung von Integritatsbedingungen foderierter Datenbanksysteme (FDBSe) gegeben werden. Die Schritte des FDBS-Entwurfsprozesses werden unter dem Aspekt der Integration von Integritatsbedingungen uberblicksartig vorgestellt. Dabei werden Probleme in Abhangigkeit von Anforderungen an das FDBS aufgezeigt. Anschlie?end erfolgen Betrachtungen zur Wahrung der im Entwurfsproze? auftretenden Integritatsbedingungen. 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
Error Correcting Codes and Combinatorial Games
Authors: A. S. Fraenkel
Venue:  (1994)

The ``losing positions'''' of certain combinatorial games constitute linear error detecting and correcting codes. We show that annihilation games provide a potentially polynomial method for computing codes (anncodes ). We also give a short proof of the basic properties of the previously known lexicodes, which are defined by means of an exponential algorithm, and are related to game theory. In the final section we indicate, by means of an example, how the method of producing lexicodes can be applied optimally to find anncodes.
Characterizing the SPHINX Speech Recognition System
Authors: Kartik K. Agaram, Stephen W. Keckler, Doug Burger
Venue:  (2001)

This paper examines SPHINX, a system for speaker independent, large vocabulary, continuous speech recognition. We find that SPHINX in particular, and speech recognition systems in general, display behavior that is substantially different from the compute-bound benchmarks that have traditionally driven popular computer system design. SPHINX applies considerable load on the memory hierarchy, with a large primary working set and poor locality. In this paper we quantify these results, and correlate them with the source code, showing that they are a consequence of the algorithms used, rather than specific implementation details of the processor, or the way the application is coded. The unprecedented growth of speech recognition applications makes it imperative that system designers lend them due consideration when designing the next generation of computer systems.
Arithmetic Classification of Perfect Models of Stratified Programs
Authors: Krzysztof R. Apt, Howard A. Blair
Venue:  (1989)

We study here the recursion theoretic complexity of the perfect (Herbrand) models of stratified logic programs. We show that these models lie arbitrarily high in the arithmetic hierarchy. As a byproduct we obtain a similar characterization of the recursion theoretic complexity of the set of consequences in a number of formalisms for non-monotonic reasoning. We show that under some circumstances this complexity can be brought down to recursiveness and recursive enumerability. To this purpose we study a class of recursion-free programs.
Vide Hoc: A Visualization for Homogenous Coordination
Authors: Robert R. Lewis
Venue:  (1995)

VideHoc is an interactive graphical program that visualizes two-dimensional homogeneous coordinates. Users manipulate data in one of four views and all views are dynamically updated to reflect the change. 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
Hermite Spectral Coefficients as features in pattern recognition.
Authors: Arkell
Venue:  (1994)

Abstract unavailable. 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
Segmentation of Natural Images using Hierarchical and Syntactic Methods
Authors: Paul S Williams, Mike D. Alder
Venue:  (1998)

This paper examines the problem of image segmentation using hierarchical and syntactic methods. A bottom up approach takes low level feature vectors and combines them to form higher level objects corresponding to disjoint regions of the image with homogeneous characteristics. This transformation is known as The UpWrite. A DownWrite process is also introduced which reconstructs an image using only the higher level representation. This not only provides an insight into the effectiveness of the representation, but also outlines its weaknesses. The results of the UpWrite, or segmentation, and the DownWrite are illustrated from a database of 1000 Corel Photo-CD images. Finally a simple classification scheme is presented to distinguish between predefined image classes such as Fields, Brown Bears and Elephants. The classification results indicate the effectiveness of the approach for use in content based image retrieval (CBIR).
Simulation Model Development Environments: A Research Prototype
Authors: Osman Balci, Richard E. Nance
Venue:  (1986)

The objectives of this paper are to: (1) describe the current state of research on simulation support environments, (2) use the Simulation Model Development Environment (SMDE) research prototype as an example for describing concepts and principles employed, experiences gained, and guidelines (potential principles) derived in the design and creation of the prototype, and (3) identify and speculate on future directions.
Parallel Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures
Authors: Cong Fu, Xiangmin Jiao, Tao Yang
Venue:  (1997)

Gaussian elimination based sparse LU factorization with partial pivoting is important to many scientific applications, but it is still an open problem to develop a high performance sparse LU code on distributed memory machines. The main difficulty is that partial pivoting operations make structures of $L$ and $U$ factors unpredictable beforehand. This paper presents an approach called $S^*$ for parallelizing this problem on distributed memory machines. The $S^*$ approach adopts static symbolic factorization to avoid run-time control overhead, incorporates 2-D L/U supernode partitioning and amalgamation strategies to improve caching performance, and exploits irregular task parallelism embedded in sparse LU using asynchronous computation scheduling. The paper discusses and compares the algorithms using 1-D and 2-D data mapping schemes, and presents experimental studies on Cray-T3D and T3E. The megaflop performance results for a set of nonsymmetric benchmark matrices are very encouraging.
Generating Oracles From Your Favorite Temporal Specifications
Authors: Laura K. Dillon, Y. S. Ramakrishna
Venue:  (1995)

The paper describes a generic tableau algorithm, which is the basis for a general customizable method for producing oracles from temporal logic specifications. A generic argument gives semantic rules with which to build the semantic tableau for a specification. Parameterizing the tableau algorithm by semantic rules permits it to easily accommodate a variety of temporal operators and provides a clean mechanism for fine-tuning the algorithm to produce efficient oracles. The paper develops conditions that ensure a set of rules results in a correct tableau procedure. It gives sample rules for a variety of linear-time temporal operators and shows how rules are tailored to reduce the size of an oracle. To illustrate the versatility of this method, its application to a high level interval logic is discussed.
The Need for Ethics Education in Computer Curriculum
Authors: John A. N. Lee
Venue:  (1991)

The availability of the computer to a broad section of the community has brought under its influence a number of individuals who may not have been so well disciplined in appropriate ethical behavior. Lacking precedents and truly parallel paradigms as in driver and sex education, this paper recommends that earnest consideration must be given to introducing ethical concepts and case studies into secondary school classes as well as in professional school curriculum related to computing. Surveys have shown that the person most likely to have misused a computer/communication system is the employee of the company under attack. It is the responsibility of the computer community to reach as many of these employees during their formative years to divert them from inappropriate practices. The objective of this paper is to consider the state of affairs in computing which lead to deep concerns about ethical behavior and to present proposals for the inclusion of ethical concepts in early computer related courses. 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
Arrays, Numeration Systems and Games
Authors: A. S. Fraenkel
Venue:  (1999)

We define an infinite array A of nonnegative integers based on a linear recurrence, which produces basis elements of an exotic ternary numeration system. Using the numeration system we explore many properties of A. Further, we propose and analyze a family of 2-player games on a variable number of heaps of tokens, and present a winning strategy based on certain subarrays of A. Though the strategy looks easy, it is actually computationally hard. The numeration system is then used to decide whether the family has an efficient strategy or not.
Confidence based Dual Reinforcement Q-Routing: an On-line Adaptive NetworkRouting Algorithm
Authors: Shailesh Kumar
Venue:  (1998)

Efficient routing of information packets in dynamically changing communication networks requires that as the load levels, traffic patterns and topology of the network change, the routing policy also adapts. Making globally optimal routing decisions would require a central observer/controller with complete information about the state of all nodes and links in the network, which is not realistic. Therefore, the routing decisions must be made locally by individual nodes (routers) using only local routing information. The routing information at a node could be estimates of packet delivery time to other nodes via its neighbors or estimates of queue lengths of other nodes in the network. An adaptive routing algorithm should efficiently explore and update routing information available at different nodes as it routes packets. It should continuously evolve efficient routing policies with minimum overhead on network resources. In this thesis, an on-line adaptive network routing algorithm called {\sc Confidence-based Dual Reinforcement Q-Routing} ({\sc CDRQ-routing}), based on the Q learning framework, is proposed and evaluated. In this framework, the routing information at individual nodes is maintained as Q value estimates of how long it will take to send a packet to any particular destination via each of the node''s neighbors. These Q values are updated through exploration as the packets are transmitted. The main contribution of this work is the faster adaptation and the improved quality of routing policies over the {Q}-Routing. The improvement is based on two ideas. First, the quality of exploration is improved by including a confidence measure with each Q value representing how reliable the Q value is. The learning rate is a function of these confidence values. Secondly, the quantity of exploration is increased by including backward exploration into Q learning. As a packet hops from one node to another, it not only updates a Q value in the sending node (forward exploration similar to {Q}-Routing), but also updates a Q value in the receiving node using the information appended to the packet when it is sent out (backward exploration). Thus two Q value updates per packet hop occur in {CDRQ}-Routing as against only one in {\sc Q-routing}. Certain properties of forward and backward exploration that form the basis of these update rules are stated and proved in this work. Experiments over several network topologies, including a 36 node irregular grid and 128 node 7-D hypercube, indicate that the improvement in quality and increase in quantity of exploration contribute in complementary ways to the performance of the overall routing algorithm. {CDRQ}-Routing was able to learn optimal shortest path routing at low loads and efficient routing policies at medium loads almost twice as fast as {Q}-Routing. At high load levels, the routing policy learned by {CDRQ}-Routing was twice as good as that learned by {Q}-Routing in terms of average packet delivery time. {CDRQ}-
OPTIMAL DESIGN OF SELF-DAMPED LOSSY TRANSMISSION LINES FOR MULTICHIP MODULES
Authors: Jimmy S Wang, Wayne W Dai
Venue:  (1993)

This paper presents a simple and robust method of designing the lossy-transmission-line interconnects in a network for multichip modules. This paper is the first to identify that the performance-driven-layout optimal objective is to minimize both the maximum path delay and the maximum damping ratio together. The optimal performance is achieved entirely through wire-sizing on any general network which may contains loops. This method uses wire-sizing entirely to meet the electrical damping criteria to solve the problems encountered in propagating high-speed signals through unterminated lossy transmission lines on the substrates of multichip modules (MCM). The optimal design method is based on a new improved scattering-parameters (S-parameters) based macro-model of distributed-lumped networks that keeps track of the time-of-flight term in the transfer functions. The wire-sizing optimal design concept is to relate the layout parameter (line width) and the transfer function (damping ratio, and natural undamped frequency) to the signal propagation delay. The optimal design method results in fast and stable signal propagation for single-source multi-receiver networks on multichip modules without using termination resistors. Multi-receiver networks on High Performance MCM process technologies are designed for illustration.
A Contribution to Nonlinear System Theory
Authors: Hans Burkhardt, Hanns Schulz-Mirbach
Venue:  (1995)

This paper suggests a characterization of systems through equivalence classes of the imput signals. Two input signals are called equivalent if they are mapped by the system to the same output. The corresponding equivalence classes for linear systems can be described by subspaces of the signal space. For the nonlinear case the description in terms of subspaces is no longer valid. We show how to construct nonlinear systems whose equivalence classes are generated by the action of a group on the signal space. This construction has in- teresting connections with the general Volterra theory of nonlinear systems. We discuss for a specific group how to perform the computations efficiently by using a nonlinear form of the FFt-graph. This gives general hints concerning the recursive calculation of the global system output from local computations.
Common Illumination between Real and Computer Generated Scenes
Authors: Alain Fournier, Atjeng S. Gunawan, Chris Romanzin
Venue:  (1992)

The ability to merge a real video image (RVI) with a computer-generated image (CGI) enhances the usefulness of both. To go beyond ``cut and paste'''' and chroma-keying, and merge the two images successfully, one must solve the problems of common viewing parameters, common visibility and common illumination. The results can be dubbed Computer Augmented Reality (CAR). We present in this paper techniques for approximating the common global illumination for RVIs and CGIs, assuming some elements of the scene geometry of the real world and common viewing parameters are known. Since the real image is a projection of the exact solution for the global illumination in the real world (done by nature), we approximate the global illumination of the merged image by making the RVI part of the solution to the common global illumination computation. The objects in the real scene are replaced by few boxes covering them; the image intensity of the RVI is used as the initial surface radiosity of the visible part of the boxes; the surface reflectance of the boxes is approximated by subtracting an estimate of the illuminant intensity based on the concept of ambient light; finally global illumination using a classic radiosity computation is used to render the surface of the CGIs with respect to their new environment and for calculating the amount of image intensity correction needed for surfaces of the real image. An example animation testing these techniques has been produced. Most of the geometric problems have been solved in a relatively ad hoc manner. The viewing parameters were extracted by interactively matching of the synthetic scene with the RVIs. The visibility is determined by the relative position of the ``blocks'''' representing the real objects and the computer generated objects, and a moving computer generated light has been inserted. The results of the merging are encouraging, and would be effective for many applications.
Digital Library: Gross Structure and Requirements (Report from aWorkshop)
Authors: Henry M. Gladney, Nicholas J. Belkin, Zahid Ahmed, Edward A. Fox, Ron Ashany, Maria Zemankova
Venue:  (1994)

The overall workshop goals were: 1) to define those digital library parameters which especially influences issues of access to, retrieval of, and interaction with information; 2) to identify key problems which must be solved to make digital library service an effective reality; 3) to identify a general structure or framework for integrating research and solutions; and 4) to propose and encourage specific, high-priority research directions within such a framework.
Semi-automatic wrapper generation and adaption: living with heterogeneity in a market environment
Authors: Michael Christoffel, Bethina Schmitt, Jürgen Schneider
Venue: Enterprise information systems IV (2003)

The success of the Internet as a medium for the supply and commerce of various kinds of goods and services leads to a fast growing number of autonomous and heterogeneous providers that offer and sell goods and services electronically. The new market structures have already entered all kinds of markets. Approaches for market infrastructures usually try to cope with the heterogeneity of the providers by special wrapper components, which translate between the native protocols of the providers and the protocol of the market infrastructure. Enforcing a special interface to the provider limits their independence. Moreover, requirements such as a direct access to the internal business logic and databases of the providers or fix templates for internal data structures are not suitable to establish a real open electronic market. A solution is the limitation of the access to the existing Web interface of the provider. This solution keeps the independence of the providers without burdening them additional work. However, for efficiency reasons, it keeps necessary to tailor a wrapper for each provider. What comes more, each change in the provider or its Web representation forces the modification of the existing wrapper or even the development of a new wrapper. In this paper, we present an approach for a wrapper for complex Web interfaces, which can easily be adapted to any provider just by adding a source description file. A tool allows the construction and modification of source descriptions without expert knowledge. Common changes in the Web representation can be detected and comprehended automatically. The presented approach has been applied to the market of scientific literature.
Neural Networks for Object Recognition
Authors: N. Cross, R. G. Wilson
Venue:  (1995)

The overall aim is to produce a vision system using artificial neural networks that is capable of working with whole images. To this end some major problems in Computer vision are considered. These are questions of control, binding, multiple pattern recognition, invariant processing and the modelling of complex visual behaviours. The majority of the practical work presented here is concerned with development of higher order neural networks.