ppxscal/embedding_network huggingface dataset:
Multiscouting: Guiding distributed manipulation with multiple mobile sensors
Authors: Michael G. Ross
Venue:  (1998)

This thesis investigates the use of multiple mobile sensors to guide the motion of a distributed manipulation system. In our system, multiple robots cooperatively place a large object at a goal in a dynamic, unstructured, unmapped environment. We take the system developed in [Rus, Kabir, Kotay, Soutter 1996], which employs a single mobile sensor for navigational tasks, and extend it to allow the use of multiple mobile sensors. This allows the system to perform successful manipulations in a larger class of spaces than was possible in the single scout model. We focus on the development of a negotiation protocol that enables multiple scouts to cooperatively plan system motion. This algorithm enhances the previous'' system''s scalability and adds greater fault-tolerance. Two alternate algorithms for cooperation: a modification of negotiation and a bidding protocol, are also discussed. Finally, an implementation of the negotiation protocol is described and experimental data produced by the implementation is analyzed. 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
Learning Models for Robot Navigation
Authors: Hagit Shatkay
Venue:  (1998)

Hidden Markov models (\textsc{hmm}s) and partially observable Markov decision processes (\textsc{pomdp}s) provide a useful tool for modeling dynamical systems. They are particularly useful for representing environments such as road networks and office buildings, which are typical for robot navigation and planning. The work presented here describes a formal framework for incorporating readily available odometric information into both the models and the algorithm that learns them. By taking advantage of such information, learning \textsc{hmm}s/\textsc{pomdp}s can be made better and require fewer iterations, while being robust in the face of data reduction. That is, the performance of our algorithm does not significantly deteriorate as the training sequences provided to it become significantly shorter. Formal proofs for the convergence of the algorithm to a local maximum of the likelihood function are provided. Experimental results, obtained from both simulated and real robot data, demonstrate the effectiveness of the approach.
Workload Characteristics for Process Migration and Load Balancing
Authors: Mark Nuttall, Morris Sloman
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Is process migration useful for load balancing? We present experimental results indicating that the answer to this question depends largely on the characteristics of the applied workload. Experiments with our Shiva system, which supports remote execution and process migration, show that only those CPU-bound workloads which were generated using an unrealistic Poisson distribution for execution times show improvements for dynamic load balancing. (We use the term `dynamic' to indicate remote execution determined at and not prior to run time. The latter is known as `static' load balancing.) Using a more realistic workload distribution and adding a number of short-lived tasks prevents dynamic algorithms from working. Migration is only useful with heterogeneous workloads. We find the migration of executing tasks to remote data to be effective for balancing I/O-bound workloads, and indicate the region of `workload variable space' for which this migrate-to-data approach is useful.
Using Set-Associative Caches Deterministically to Achieve Near Peak Performance on RS6000 Machines
Authors: A R Wagner
Venue:  (1995)

The gap between memory speed and CPU speed in current RISC machines is often bridged with one or more levels of set-associative cache. In programs which operate on dense matrices, performance is often limited by memory reference itmes, rather than the apparent arithmetic complexity. Attempts to improve performance by blocking the loops of the code may fail to achieve the promised speed, because the submatrices which they try to maintain in cache exhibit self-interference. That is, many distinct cache lines of some or all of the submatrices map into the same cache association set. This can cause essentially every reference to such cache lines to produce a cache miss. A program is presented which determines, for each submatrix row-size, and leading dimension of the array in which the matrix is embedded, the largest number of columns which produce zero self-interference for all the sub-matrices so defined. By choosing triples consisting of a host matrix dimension, a sub-matrix row dimension, and the computed zero self-interferencesub-matrix column dimension, code performance can be predicted, and sub-matrix sizes chosen to maximize the performance equation. Tables indicating the approximate fraction of usable data cache which each choice of zero self-intererence sub-matrix size permits are also presented. Larger such fractions are associated in many programs with improved arithmetic performance. The tables presented take into account both the Table Look-Aside Buffer [TLB], and the data cache of the IBM RS/6000. Both levels of cache are involved in the choice of parameters.
Robust identification of shared losses using end-to-end unicast probes
Authors: K. Harfoush, A. Bestavros, J. Byers
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When two or more such connections share a common endpoint, there is an opportunity to correlate the end-to-end measurements made by these protocols to better diagnose and control the use of shared resources. We develop packet probing techniques to determine whether a pair of connections experience shared congestion. Correct, efficient diagnoses could enable new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. Our extensive simulation results demonstrate that the conditional (Bayesian) probing approach we employ provides superior accuracy, converges faster, and tolerates a wider range of network conditions than previously proposed memoryless (Markovian) probing approaches.
An approach to integration testing based on architectural descriptions
Authors: A. Bertolino, P. Inverardi, H. Muccini, A. Rosetti
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Software architectures can play a role in improving the testing process of complex systems. In particular descriptions of the software architecture can be useful to drive integration testing, since they supply information about how the software is structured in parts and how those parts (are expected to) interact. We propose to use formal architectural descriptions to model the "interesting" behaviour of the system. This model is at a right level of abstraction to be used as a formal base on which integration test strategies can be devised. Starting from a formal description of the software architecture (given in the CHAM formalism), we first derive a graph of all the possible behaviours of the system in terms of the interactions between its components. This graph contains altogether the information we need for the planning of integration testing. On this comprehensive model, we then identify a suitable set of reduced graphs, each highlighting specific architectural properties of the system. These reduced graphs can be used for the generation of integration tests according to a coverage strategy, analogously to what happens with the control and data flow graphs in unit testing.
The development of an online video browsing system
Authors: Jesse Jin, Ruiyi Wang
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

This paper presents a system designed to allow efficient retrieving, browsing and real time playing of videos through the Internet using a web browser. The system consists of a web site as well as tools to facilitate browsing, searching and video streaming. At the website, users can view video structures and clip details, search for segments in a video by key words and play video clips in real time according to their own connection speeds.In this paper, various approaches to each component of the system are discussed. Issues encountered in the design and implementations of the system are described. Testing results on resource usage and system usability are also evaluated.
Enhancement of Text Representations Using Related Document Titles
Authors: Gerard Salton, Y. Zhang
Venue:  (1986)

Various attempts have been made over the years to construct enhanced document representations by using thesauruses of related terms, term association maps, or knowledge frameworks that can be used to extract appropriate terms and concepts. None of the proposed methods for the improvement of document representation has proved to be generally useful when applied to a variety of different retrieval environments. Some recent work by Kwok suggests that document indexing may be enhanced by using title words taken from bibliographically related items. An evaluation of the process shows that many useful content words can be extracted from related document titles, as well as many terms of doubtful value. Overall, the procedure is not sufficiently reliable to warrant incorporation into operational automatic retrieval systems.
Type Dispatch for Named Hierarhical Types
Authors: Neal Glew
Venue:  (1999)

Type dispatch constructs are an important feature of many programming languages. Scheme has predicates for testing the runtime type of a value. Java has a class cast expression and a try statement for switching on an exception''s class. Crucial to these mechanisms, in typed languages, is type refinement: The static type system will use type dispatch to refine types in successful dispatch branches. Existing work in functional languages has addressed certain kinds of type dispatch, namely, intensional type analysis. However, this work does not extend to languages with subtyping nor to named types. This paper describes a number of type dispatch constructs that share a common theme: class cast and class case constructs in object oriented languages, ML style exceptions, hierarchical extensible sums, and multimethods. I describe a unifying mechanism, {\em tagging}, that abstracts the operation of these constructs, and formalise a small tagging language. After discussing how to implement the tagging language, I present a more primitive language and give a formal translation from the tagging language.
Asymptotic analysis of a diffusive model for shape memory alloys with Cattaneo-Maxwell heat flux law
Authors: Elena Bonetti
Venue:  (2000)

This work is concerned with a diffusive model for some austenitie-martensite phase transition process ruled by the Cattaneo-Maxwell heat flux law, namely assuming for ythe heat flux a relaxed version of the classical Fourier law. A rigorous asymptotic analysis of the macroscopic model is performed and it is shown that such model is nothing but a singular perturbation of the standard Fremond model for shape memory alloys. Convergence results are proved along with error estimates.
Automatic Generation of Formal Specification from Requirements Definition
Authors: Lingzi Jin, Hong Zhu
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

Developing software on the bases of formal functional specifications in first order logic and algebraic languages has been the prime endeavor of research on formal methods. But, the industrial development community has been slow to adopt formal methods. Instead, researchers and software engineers in the area of software requirements engineering have advanced various notations for defining user's requirements and systematic methods of developing requirements definitions. There is a wide gap between the current practice of software requirements engineering and the research on formal specification and software formal development. This paper presents the system NDRASS, which support requirements engineering with the methods of current state of practice and to link such practice to formal methods by automatically generating formal functional specifications in Z.
Discovery of comprehensible symbolic rules in a neural network
Authors: S. Avner
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

In this paper, we introduce a system that extracts comprehensible symbolic rules from a multilayer perceptron. Once the network has been trained in the usual manner, the training set is presented again, and the actual activations of the units recorded. Logical rules, corresponding to the logical combinations of the incoming signals, are extracted at each activated unit. This procedure is used for all examples belonging to the training set. Thus we obtain a set of rules which account for all logical steps taken by the network to process all known input patterns. Furthermore, we show that if some symbolic meaning were associated to every input unit, then the hidden units, which have formed concepts in order to deal with recurrent features in the input data, possess some symbolic meaning tool. Our algorithm allows the recognition or the understandability of these concepts: they are found to be reducible to conjunctions and negations of the human input concepts. Our rules can also be recombined in different ways, thus constituting some limited but sound generalization of the training set. Neural networks could learn concepts about domains where little theory was known but where many examples were available. Yet, because their knowledge was stored in the synaptic strengths under numerical form, it was difficult to comprehend what they had discovered. This system therefore provides some means of accessing the information contained inside the network.
XML Primer Plus
Authors: Nicholas Chase
Venue:  (2002)

:This book presents XML programming from a conceptual perspective, teaching not just the technology, but the background and thinking behind it. Developers learn to do it right, gaining a thorough understanding of the hows and the whys from the ground up. Rather than teaching programmers to memorize specific APIs, this book teaches programmers how to think about XML programming in a language-neutral way, with examples in various languages (such as Java, C++, Perl, and VB) and provides guidance on how and when XML can be used in real-world situations.
Disambiguation, Correctness and Flow-Analysis Issues for Trace Scheduling Compilers
Authors: Alexandru Nicolau
Venue:  (1984)

Trace scheduling is a global compaction technique for transforming sequential programs into parallel code. When this investigation began, trace scheduling was unimplemented and many serious questions of appropriateness and effectiveness needed to be solved. This paper addresses questions of its applicability to ordinary programming for Very Long Instruction Word machines. We developed practical methods of exploiting this parallelism (e.g. memory anti-aliasing). To justify and better understand the dynamic interaction between trace scheduling and anti-aliasing, we designed a more formal model in which we proved the correctness of trace scheduling and showed that it terminates. This in turn allowed us to analyze our flow information requirements. Finally we addressed the problem of ambiguous memory references which cannot be resolved at compile time. 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
A Context-Aware Data Management System for Ubiquitous Computing Applications
Authors: Christopher K. Hess, Roy H. Campbell
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

One of the factors that differentiates ubiquitous computingfrom traditional distributed computing is context. Context,such as time, location, and situation, allows a system to adaptto the current surroundings in order to facilitate the use ofthe computational environment. In this paper, we presenta file system for ubiquitous computing applications that iscontext-aware. Context is used to support the types of applicationsand devices that are found in ubiquitous computingspaces. Novel features of the system include how the viewof data adapts to the activity being currently performed andhow user data is imported into the local environment. Oursystem is evaluated as part of a ubiquitous computing infrastructuredeployed in a seminar room to investigate issues ofperformance, scalability, and usability.
Is There a Gap between RE Research and RE Practice?
Authors: Julio Cesar Sampaio do Prado Leite
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

I will take the position that yes, as in most disciplines there are gaps between research and practice. However, since we are dealing with engineering, the novelty may also come from practice. My perception of the field is that in the last 7 years there was a growing maturity of the software engineering community concerning the aspect of software definition, both in academia as well as in industry. Industry now understands [5], and recent surveys [2], [4] have confirmed, that doing what the client wishes is not trivial. On the other hand, still several people believe that it is the client responsibility to provide the requirements, and when this is the case, the blame goes to the document that is not formal enough.
From chaotic iteration to constraint propagation
Authors: Krzysztof R. Apt
Venue:  (1997)

We show how the constraint propagation process can be naturally explained by means of chaotic iteration.
VaR Modelling on Long Run Horizons
Authors: K. Giannopoulos
Venue: Automation and Remote Control (2003)

The Value-at-Risk (VaR) criterion as a measure of portfolio's risk on long run horizons is considered. The method which makes possible to generate VaR estimates on longer horizons is suggested. The VaR estimation is based on the general method of Filtered Historical Simulation (FHS). The results of numerical experiments with real financial data are described.
Interactive Theatre Experience in Embodied + Wearable Mixed Reality Space
Authors: Adrian David Cheok, Wang Weihua, Xubo Yang, Simon Prince, Fong Siew Wan, Mark Billinghurst, Hirokazu Kato
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This paper presents an interactive theatre based on an embodied mixed reality space and wearable computers. Embodied computing mixed reality spaces integrate ubiquitous computing, tangible interaction and social computing within a mixed reality space, which enables intuitive interaction with physical world and virtual world. We believe it has potential advantages to support novel interactive theatre experiences. Therefore, we explored thenovel interactive theatre experience supported in the embodied mixed reality space, and implemented live 3D characters to interact with user in such a system.
An inversion algorithm for loss networks with state-dependent rates
Authors: G. L. Choudhury, K. K. Leung, W. Whitt
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

We extend our recently developed algorithm for computing (exact) steady-state blocking probabilities for each class in product-form loss networks to cover general state-dependent arrival and service rates. This generalization allows us to consider, for the first time, a wide variety of buffered and unbuffered resource-sharing models with non-Poisson traffic as may arise with overflows in the context of alternative routing. As before, we consider non-complete-sharing policies involving upper-limit and guaranteed-minimum bounds for the different classes, but here we consider both bounds simultaneously. Major features of the algorithm are: dimension reduction by conditional decomposition based on special structure, an effective scaling algorithm to control errors in the inversion, the efficient treatments of multiple classes with identical parameters and the truncation of large sums.
A Computer Tool Kit for Chemists and Engineers
Authors: P. A. D. DeMaine, M. M. DeMaine
Venue:  (1991)

This series of papers will be devoted to demonstrating selected members of a family of thirteen general based systems that can be used in laboratories as educational and research aids by chemists and engineers with minimal computer skills. Because the key systems do not use the state-of-the-art and therefore do not mimic human reasoning, they can predict unprecedented events (i.e. events that cannot be predicted by the state-of-the-art alone). This first part briefly describes the family of general rule based systems, then demonstrates the use of the CURFIT system. In CURFIT the raw data and their user stipulated Maximum Tolerance or Uncertainities are used to reject erroneous data-points, detect curvature, and determine the equation(s) that describe the data to within the stipulated maximum tolerance. Within the available computer resources there is no limit on the number of variables in the fitting equation, and different equations can be unambiguously compared.
Characterizations for Acyclic Database Schemes
Authors: Gosta Grahne, Kari Raiha
Venue:  (1985)

Acyclic database schemes have attracted much interest because of the nice properties enjoyed by such schemes. Recently some new acyclicity conditions that are strictly stronger than the normal $\alpha$-acyclicity have been introduced by Fagin. Because of increased requirements, the database schemes in the new classes have some further useful properties that are not shared by $\alpha$-acyclic schemes. Therefore the new classes have practical relevance. A database designer may work in terms of attribute sets and data dependencies, and not only in terms of database schemes. Thus it is important to have a characterization for the acyclic schemes of various degree in terms of data dependencies. For $\alpha$-acyclic schemes such a characterization exists, but for the new classes the question has been open. In this paper we provide characterizations for $\beta$-, $\gamma$and Berge-acyclic database schemes. The characterizations can be stated in a simple form: thus they should be useful for the database designer.
A Task-Based Production Environment for Intelligent Learning/Teaching Systems: the 'NGE' Kernel
Authors: Marie-Francoise Canut, Murielle Eloi
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

After many studies, experiments, and assessments on the design and development of intelligent learning/ .teaching systems, we are now offering a production environment for these systems and shells. This environment is based on a high abstraction level primitives : the 'NGE' kernel. Elaborated in a cognitive approach, these primitives have been defined on the notion of task (generic, cognitive,operating), not only to define the different levels of abstraction but also to improve the interactions between the universe of teachers, pedagogues and the universe of computer science.20 Keywords : intelligent learning/teaching systems, shells, tasks (generic,cognitive,operating), knowledge representation, cognitive models.