ppxscal/embedding_network huggingface dataset:
Rate-Distortion Analysis of Discrete-HMM Pose Estimation via Multiaspect Scattering Data
Authors: Yanting Dong, Lawrence Carin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We consider the problem of estimating the pose of a target based on a sequence of scattered waveforms measured at multiple target-sensor orientations. Using a hidden Markov model (HMM) representation of the scattered-waveform sequence, pose estimation reduces to estimating the underlying HMM states from a sequence of observations. It is assumed that each scattered waveform must be quantized via an encoding procedure. A distortion D is defined as the error in estimating the underlying HMM states, and the rate R represents the size of the discrete-HMM codebook. Rate-distortion theory is applied to define the minimum rate required to achieve a desired distortion, denoted as R(D). After deriving the rate-distortion function R(D), we demonstrate that discrete-HMM performance based on Lloyd encoding is far from this bound. Performance is improved via block coding, based on Bayes VQ. Results are presented for a canonical HMM problem, and then for multiaspect acoustic scattering from underwater elastic targets. Although the examples presented here are for multiaspect scattering and pose estimation, the results are of general applicability to discrete-HMM state estimation.
Displacement models for THUNDER actuators having general loads and boundary conditions
Authors: Wieman Robert, Smith Ralph C., Kackley Tyson, Ounaies Zoubeida, Author:
Venue:  (2001)

This paper summarizes techniques for quantifying the displacements generated in THUNDER actuators in response to applied voltages for a variety of boundary conditions and exogenous loads. The PDE models for the actuators are constructed in two steps. In the first, previously developed theory quantifying thermal and electrostatic strains is employed to model the actuator shapes which result from the manufacturing process and subsequent repoling. Newtonian principles are then employed to develop PDE models which quantify displacements in the actuator due to voltage inputs to the piezoceramic patch. For this analysis, drive levels are assumed to be moderate so that linear piezoelectric relations can be employed. Finite element methods for discretizing the models are developed and the performance of the discretized models are illustrated through comparison with experimental data.
Transforming System Formulations in Robotics for Efficient Perception and Planning
Authors: D. Paul Benjamin
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

For efficient perception and planning, it is necessary for an autonomous robot to find a formulation with good computational properties. An especially important computational property is decomposability. The perspective of this work is to view a system's state space as though it were physical space, and the system's behavior as though it were physical motion. Following the analogy with physics, a formulation is an abstract coordinate system whose axes specify a decomposition, and formulations are transformed by changing coordinates. The mathematical basis for this analogy is given. Continuous and discrete formulations for a robot vehicle are transformed to yield decompositions, which shed light on the relationship between the continuous and discrete formulations. The implications of decomposition for learning are discussed.
A Volumetric Approach to Visualize Holographic Reconstructions
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

In synthetic holography, the emphasis has been on numerical simulation Methods for the recording and reconstruction processes, but methods to visualize the calculated results are yet underdeveloped. We show how volume slicing and volume rendering using a threshold for translucency can be applied to synthetic holography. Results of the three-dimensional visualization of the reconstruction are presented, thereby illustrating the usefulness of the threshold operator.
A reduced-load equivalence for generalised processor sharing networks with heavy-tailed input flows
Authors: M. J.G. Uitert, Simon C. Borst
Venue:  (2000)

We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow~$i$ at the bottleneck node on its path. Flow $i$ is assumed to have long-tailed traffic characteristics. We distinguish between two traffic scenarios, (i) flow~$i$ generates instantaneous traffic bursts and (ii) flow $i$ generates traffic according to an on/off process. In addition, we consider two configurations of feed-forward networks. First we focus on the situation where other flows join the path of flow~$i$. Then we extend the model by adding flows which can branch off at any node, with cross traffic as a special case. We prove that under certain conditions the tail behaviour of the workload distribution of flow~$i$ is equivalent to that in a {\em two}-node tandem network where flow~$i$ is served in isolation at {\em constant} rates. These rates only depend on the traffic characteristics of the other flows through their average rates. This means that the results do not rely on any specific assumptions regarding the traffic processes of the other flows. In particular, flow~$i$ is not affected by excessive activity of flows with `heavier-tailed'' traffic characteristics. This confirms that GPS has the potential to protect individual flows against extreme behaviour of other flows, while obtaining substantial multiplexing gains.
The Performance of Multicast Banyan Networks
Authors: Yuanyuan Yang
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Multicast the ability to transmit information from a single source node to multiple selected destination nodes in a network. Current trends in networking applications indicate that there will be an increasing demand in future networks for multicast communication. Banyan networks have been proposed for use in ATM high-speed communications networks and have been used for the interconnection of processors in scalable parallel computers. This paper addresses the performance issues of supporting multicast communication in banyan networks. Previous work on the performance of banyan networks has been primarily for the networks which can support only one-to-one communication (i.e., unicast banyan networks). We present here an analytical model for the performance of banyan networks which support multicast communication (i.e., multicast banyan networks). The performance of both unbuffered and buffered banyan multicast networks is analyzed. Our model yields a set of equations that can be solved for the throughput of the network. We show that the throughput of a multicast banyan network is generally higher than that of a unicast banyan network. In particular, we obtain that the throughput of an unbuffered multicast banyan network is \Theta(N), where N is the size of the network, compared with \Theta\left(\frac{N}{\log N} \right) for an unbuffered unicast banyan network. In addition to throughput, we also derive formulas for other two important performance metrics, average packet transfer time and packet loss probability, in the buffered multicast banyan networks. 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
The Development of a Virtual Myoelectric Prosthesis Controlled by an EMG Pattern Recognition System Based on Neural Networks
Authors: Alcimar Soares, Adriano Andrade, Edgard Lamounier, Renato Carrijo
Venue: Journal of Intelligent Information Systems (2003)

One of the major difficulties faced by those who are fitted with prosthetic devices is the great mental effort needed during the first stages of training. When working with myoelectric prosthesis, that effort increases dramatically. In this sense, the authors decided to devise a mechanism to help patients during the learning stages, without actually having to wear the prosthesis. The system is based on a real hardware and software for detecting and processing electromyografic (EMG) signals. The association of autoregressive (AR) models and a neural network is used for EMG pattern discrimination. The outputs of the neural network are then used to control the movements of a virtual prosthesis that mimics what the real limb should be doing. This strategy resulted in rates of success of 100% when discriminating EMG signals collected from the upper arm muscle groups. The results show a very easy-to-use system that can greatly reduce the duration of the training stages.
HW-SW Co-Design and Verification of a Multi-Standard Video and Image Codec
Authors: Albert Van der Werf
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

The impact of design quality on electronic designs being phenomenal, trend towards proven design methods have received considerable attention from the electronic design community. In this work, we present one such method followed in Philips Research for HW-SW co-design and verification. The method starts with an application code and goes through the various steps of HW-SW partitioning and verification and culminates in an IP with a proven design quality. We illustrate the method through the design of a multi-standard video and image codec.
Stopping Criteria Comparison: Towards High Quality Behavioral Verification
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Verification of complex behavioral models has become a critical and time-consuming process. Determine when to switch to different testing strategy phase is key to improving efficiency. This paper presents an overview of the existing statistical stopping rules that can be used for behavioral models verification. We examined the stopping rules using two VHDL models for five consecutive test phases. The results of the coverage gained and the number of testing patterns applied are then compared for each stopping rule. We conclude that the confidence-based stopping criterion out-performs others in terms of efficiency. 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
Monadic Spectra and Regular Sets
Authors: Mark W. Krentel
Venue:  (1986)

Abstract not available.
Proposal and Development of an Autonomous Decentralized System for Newspaper Production
Authors: H. Ito, S. Fujisawa, Y. Hattori
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Over the past sixteen years, newspaper PCSs (Production Control Systems) have been developed to support newspaper production, so that newspaper publishers can offer the most up to date information to the greatest possible number of readers in a timely manner while keeping production costs low. Up to now, the chief goal has been to produce a predetermined number of copies of a stylized newspaper (using a set layout and set number of pages) as efficiently and accurately as possible. However, in today's information-oriented society, readers and advertising clients have come to expect low cost newspapers that reflect their various interests and demands. To satisfy these, a PCS should aim at providing a reliable and flexible production system that allows immediate changes in format and circulation volume according to article contents, as well as coordinated production (printing and delivery) between locally distributed printing plants. In this paper, a new newspaper PCS architecture and data-processing and networking techniques are discussed based on an autonomous decentralized system (ADS). The architecture provides a system that allows flexible change of the production schedule, while ensuring reliability, because it has autonomous filtering functions that distinguish between different kinds of data, namely control data and man-machine data. The Asahi Shimbun newspaper company currently uses this highly effective system in its Setagaya printing plant.
A global atomicity primitive
Authors: C. Allison, P. Harrington, Feng Huang, M. Livesey
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

This paper describes a novel mechanism that supports a global atomicity primitive. In distributed systems, it is important that concurrent access to shared data items does not violate some pre-defined notion of consistency. A global atomicity primitive is a simple programming paradigm for controlling access to shared data, that guarantees to preserve consistency (provided individual processes do) and suffices for many applications. The mechanism presented also provides other desirable coherency properties, including failure atomicity, liveness and responsiveness. In addition, its concurrency control can be configured variably between optimistic and pessimistic.
On multihop optical network topology using Kautz digraphs
Authors: G. Panchapakesan, A. Sengupta
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Proposes a new topology for multihop, optical networks using Kautz digraphs. The properties of such a network as a logical topology are evaluated and compared with other topologies proposed in the literature. For a given degree of each node and a given diameter of the network, a Kautz digraph supports more nodes than other topologies like shufflenet or that using a DeBruijn digraph and hence seems to be an attractive design for the physical topology too.
Generating Representative Web Workloads for Network and Server Performance Evaluation
Authors: Paul Barford, Mark Crovella
Venue:  (1997)

Abstract One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on current and projected usage. This paper applies a number of observations of Web server usage to create a realistic Web workload generation tool which mimics a set of real users accessing a server. The tool, called SURGE (Scalable URL Reference Generator) generates references matching empirical measurements of 1) server file size distribution; 2) request size distribution; 3) relative file popularity; 4) embedded file references; 5) temporal locality of reference; and 6) idle periods of individual users. This paper reviews the essential elements required in the generation of a representative Web workload. It also addresses the technical challenges to satisfying this large set of simultaneous constraints on the properties of the reference stream, the solutions we adopted, and their associated accuracy. Finally, we present evidence that SURGE exercises servers in a manner significantly different from other Web server benchmarks.
A rewriting approach to satisfiability procedures
Authors: Alessandro Armando, Silvio Ranise, Michaël Rusinowitch
Venue: Information and Computation (2003)

We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly for deciding satisfiability in various theories including lists, encryption, extensional arrays, extensional finite sets, and combinations of them. We also give a superposition-based decision procedure for homomorphism.
Securing Internet Sessions with Sorbet
Authors: Fred Long, Robert C. Seacord, Scott A. Hissam, John E. Robert
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

More and more organizations are using intranets, and even the Internet, as the communications media for important data. However, such communications media are inherently insecure and subject to hijacking. To secure these connections, mechanisms must be built on top of the underlying communications facilities. In this paper, we discuss one such security mechanism and describe an implementation using common object request broker architecture (CORBA) -based interceptors.
Extension of protocol synthesis to structured entities
Authors: B. B. Bista, A. Togashi, N. Shiratori
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Entities in communication systems behave under sets of communication rules (protocols) and their behaviours are related to each other. Using this relationship, we present a synthesis algorithm to derive a structured protocol model by generating a peer entity from a given entity automatically. The given entity is in the form of a communicating process, which is natural in the context of communication protocols. We prove that the synthesized protocol model consisting of the generated entity and the peer entity is safe: i.e. logical errors free, collectively represented as deadlock free and is bisimulated by both entities. Unlike many previous works, where FSMs (Finite State Machines) are used to synthesize protocol model we present our synthesis algorithm for the process-algebraic language LOTOS, which is one of the FDTs developed by ISO
XML with data values: typechecking revisited
Authors: Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
Venue: Journal of Computer and System Sciences (2003)

We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output DTD, for inputs satisfying a given input DTD. This problem had been studied by a subset of the authors in a simplified framework that captured the structure of XML documents but ignored data values. We revisit here the typechecking problem in the more realistic case when data values are present in documents and tested by queries. In this extended framework, typechecking quickly becomes undecidable. However, it remains decidable for large classes of queries and DTDs of practical interest. The main contribution of the present paper is to trace a fairly tight boundary of decidability for typechecking with data values. The complexity of typechecking in the decidable cases is also considered.
On the Expressive Power of Indeterminate Network Primitives
Authors: Prakash Panangaden, Vasant Shanbhogue
Venue:  (1987)

It is well known that a fair merge primitive leads to unbounded indeterminacy. In this paper we show that unbounded indeterminacy cannot express a fair merge in the setting of Kahn-style dataflow networks. Intuitively, unbounded indeterminacy can be used to program a fair merge when it is guaranteed that data will always be available. But such schemes rely on predictive scheduling and they may fail if one of the inputs to the merge is a finite stream. It is reasonable to expect that if one were to add a primitive which ``knows how to avoid bottom'''' (so called ``angelic merge'''') then one could use this in conjunction with unbounded choice in order to produce a fair merge. Somewhat surprisingly, this expectation is incorrect as we show in this paper. The method we use to prove this is to identify a property which generalises monotonicity to indeterminate networks and then show that this property is possessed by determinate networks and by unbounded choice and by angelic merge but not by fair merge. It appears that there is a hierarchy of inequivalent indeterminate primitives all of which feature some form of unbounded indeterminacy.
k-wise Set-Intersections and k-wise Hamming-Distances
Authors: Grolmusz Vince, Sudakov Benny
Venue:  (2001)

We prove a version of the Ray-Chaudhuri--Wilson and Frankl-Wilson theorems for $k$-wise intersections and also generalize a classical code-theoretic result of Delsarte for $k$-wise Hamming distances. A set of code-words $a^1,a^2,\ldots,a^k$ of length $n$ have $k$-wise Hamming-distance $\ell$, if there are exactly $\ell$ such coordinates, where not all of their coordinates coincide (alternatively, exactly $n-\ell$ of their coordinates are the same). We show a Delsarte-like upper bound: codes with few $k$-wise Hamming-distances must contain few code-words.
SmartNet: a scheduling framework for heterogeneous computing
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

SmartNet is a scheduling framework for heterogeneous systems. Preliminary conservative simulation results for one of the optimization criteria, show a 1.21 improvement over Load Balancing and a 25.9 improvement over Limited Best Assignment, the two policies that evolved from homogeneous environments. SmartNet achieves these improvements through the implementation of several innovations. It recognizes and capitalizes on the inherent heterogeneity of computers in today's distributed environments; it recognizes and accounts for the underlying non-determinism of the distributed environment; it implements an original partitioning approach, making runtime prediction more accurate and useful; it effectively schedules based on all shared resource usage, including network characteristics; and it uses statistical and filtering techniques, making a greater amount of prediction information available to the scheduling engine. In this paper, the issues associated with automatically managing a heterogeneous environment are reviewed, SmartNet's architecture and implementation are described, and performance data is summarized.
An Automated Negotiation Model for Electronic Commerce
Authors: Jo Ueyama, Edmundo R. M. Madeira
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Electronic commerce applications are lacking a bilateral negotiation model which provides the bargaining between two participants (supplier and consumer) in order to buy and sell goods. This paper proposes a negotiation protocol between two participants, as well as the similarity measures which were implemented to find a similar product, when a specific one could not be found. The proposed protocol follows the bilateral model approved by the OMG. The negotiation model is composed of selling and buying Grasshopper mobile agents which negotiate between them in order to get the best deal. The negotiation of the price is based on the Kasbah model. The catalogs in the model are implemented in XML to provide the interoperability among different systems. A simple prototype has been implemented to verify the viability of this concept.
An Architecture for Automated Software Maintenance
Authors: Alex Sellink, Chris Verhoef
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

We developed an assembly line to implement certain specific changes in a stockbroking system written in COBOL with embedded SQL. The changes were proposed by the maintenance team of the system. Using our architecture, it took a few hours to implement the conditional transformations from the code examples we obtained from the maintenance team. Then we could carry out the tasks completely automated. We report on the transformations, their implementation and the architecture we used. It is the intention of the company that owns the COBOL/SQL to use our architecture for similar tasks. This study was carried out in order to give the company that owns the code an indication of the effort it takes, the development process of the components that carry out such tasks, and the process to change software using our architecture.