ppxscal/embedding_network huggingface dataset:
Direct-execution computer architecture
Authors: YAOHAN CHU
Venue: ACM SIGARCH Computer Architecture News (1977)

The Direct-Execution Architecture is a language-directed computer architecture. It can accept a highlevel-language program and directly executes it without compilation, assembly, linkage editing or loading. It offers a means to eliminate compilers, loaders etc. and attacks the problem of mounting software cost. In addition, the advent of microprocessors has demonstrated that highly complex digital hardware can be built reliably and inexpensively. Using this hardware to implement the Direct-Execution Architecture redistributes apportionment of costs between the hardware and software. The paper surveys the Direct-Execution Architecture, presents the relationship between language and architecture, and explains how a Direct-Execution system works. It also brings up the use of Direct-Execution for a highly interactive program writing, debugging, execution system. With this system, program writing could proceed like English composition. This paper then discusses the issue of a single high-level machine language, and the potential role of the interpreters. Finally, it attempts to fortell what could happen to the Direct-Execution Architecture in the next five to 10 years.
Exact Bounds on the Sizes of Covering Codes
Authors: Maria Axenovich, Zoltán Füredi
Venue: Designs, Codes and Cryptography (2003)

A code c is a covering code of X with radius r if every element of X is within Hamming distance r from at least one codeword from c. The minimum size of such a c is denoted by cr(X). Answering a question of H&auml;m&auml;l&auml;inen et al. &lsqb;10&rsqb;, we show further connections between Tur&aacute;n theory and constant weight covering codes. Our main tool is the theory of supersaturated hypergraphs. In particular, for n > n0(r) we give the exact minimum number of Hamming balls of radius r required to cover a Hamming ball of radius r + 2 in &lcub;0, 1&rcub;n. We prove that cr(Bn(0, r + 2)) &equals; &Sigma;1 &le; i &le; r + 1 (&lfloor; (n + i &minus; 1) / (r + 1) &rfloor; 2) + &lfloor; n / (r + 1) &rfloor; and that the centers of the covering balls B(x, r) can be obtained by taking all pairs in the parts of an (r + 1)-partition of the n-set and by taking the singletons in one of the parts.
WLANs and WPANs Towards 4G Wireless (Universal Personal Communications Series)
Authors: Ramjee Prasad, Luis Munoz
Venue:  (2003)

:Explore the present and future trends of WLANs and WPANs with this new, forward-looking resource. You discover the path that these infrastructures are following from a perspective of synergies with 3G systems, and how they will pave the way for future 4G systems. The book presents a thorough overview of 3G networks and standards, and discusses interworking and handover mechanisms between WLANs and UMTS. You learn what performance can be expected from WLANs and WPANs when they support the TCP/IP stack. Several critical issues are examined in depth, including IP routing and mobility, , PHY and MAC layers for the main WLAN specifications, the TCP-UDP/IP protocol stack, and performance of TCP/IP over IEEE 802.11b. An entire chapter is devoted to the WPAN domain, where a detailed treatment of Bluetooth as well as a second-generation outlook are provided. Moreover, the book explains how the PEP paradigm provides internetworking capabilities between WLANs and WPANs and how it enhances performance over these platforms. This practical resource is designed to help you save time when planning your next generation networks, offering solutions for Internetworking between WLANs and public cellular networks and for improving the performance of these networks when they support IP.
GPRS for Mobile Internet
Authors: Emmanuel Seurre, Patrick Savelli, Pierre-Jean Pietri
Venue:  (2003)

:This new, leading-edge book offers you a comprehensive, in-depth presentation of GPRS (general packet radio service). The book helps practitioners understand how this system is used as a major building block technology for the emerging mobile Internet. It explores the most critical aspects of GPRS in great detail, and offers a real-world understanding of the inevitable implementation challenges that will be faced in the field.
Cube diagram bundles: a new representation of strongly unspecified multiple-valued functions and relations
Authors: S. Grygiel, M. Perkowski, M. Marek-Sadowska, T. Luba, L. Jozwiak
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

Efficient function representation is very important for speed and memory requirements of multiple-valued decomposers. This paper presents a new representation of multiple-valued relations (functions in particular), called multiple-valued cube diagram bundles (MVCDB). MVCDBs improve on rough partition representation by labeling their blocks with variable values and by representing blocks efficiently. The MVCDB representation is especially efficient for very strongly unspecified multiple-valued input, multiple-valued output functions and relations, typical for machine learning applications.
Policy-driven fault management in distributed systems
Authors: M. J. Katchabaw, H. L. Lutfiyya, A. D. Marshall, M. A. Bauer
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Management policies can be used to specify requirements about the desired behaviour of distributed systems. Violations of policies (faults) can then be detected, isolated, located and corrected using a policy-driven fault management system. Other work in this area to date has focused on network-level faults. We believe that in a distributed system it is more appropriate to focus on faults at the application level. Furthermore, this work has been largely domain-specific-a generic, structured approach to this problem is needed. Our work has focused on policy-driven fault management in distributed systems at the application level. In this paper, we define a generic architecture for policy-driven fault management and present a prototype system based on this architecture. We also discuss experience to date using and experimenting with our prototype system.
Program dependence analysis of concurrent logic programs and its applications
Authors: J. Zhao, J. Cheng, K. Ushijima
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In this paper a formal model for program dependence analysis of concurrent logic programs is proposed with the following contributions. First, two language-independent program representations are presented for explicitly representing control flows and/or data flows in a concurrent logic program. Then based on these representations, program dependences between literals in concurrent logic programs are defined formally, and a dependence-based program representation named the Literal Dependence Net (LDN) is presented for explicitly representing primary program dependences in a concurrent logic program. Finally, as applications of the LDNs, some important software engineering activities including program slicing, debugging, testing, complexity measurement, and maintenance are discussed in a programming environment for concurrent logic programs.
Architecture and Safety Requirements of the ACC Railway Interlocking System
Authors: A. M. Amendola, L. Impagliazzo, P. Marmo, G. Mongardi, G. Sartore Ansaldo Trasporti Genova, Napoli
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

The paper summarizes the design, implementation and validation of the Computer Based Interlocking (ACC) designed by Ansaldo Trasporti under the supervision of the Italian Railways. Particularly details are provided on the methodology that has been adopted to set the safety requirements and to give preliminary safety demonstrations. During the development of the ACC design, new drafts of European Standards have been circulated on the design and validation of railway signaling systems. Safety assessment activities compliant with the new European Standards have been started and integrated within the ACC safety process. Failure models, presented in this paper, have demonstrated that the ACC design requirements assure the system compliance with the required safety integrity levels. They also have allowed for the identification of the parameters to be measured by fault injection tests in an exhaustive experimental evaluation environment, which will be developed in the subsequent phases of the validation process.
Beginning Java Objects: From Concept to Code
Authors: Jacquie Barker
Venue:  (2003)

:Among Java's many attractive features as a programming language, its object-oriented nature is key to creating powerful, reusable code and applications that are easy to maintain and extend. To take advantage of these capabilities, you're going to need not only to master the syntax of the Java language, but also to gain a practical understanding of what objects are all about, and more importantly, how to structure a Java application from the ground up to make the most of objects. With Beginning Java Objects: From Concepts to Code, readers will learn all three!Learning to design objects effectively with Java is the goal of Beginning Java Objects: From Concepts to Code; a comprehensive yet approachable guide to object oriented programming using UML and today's hottest programming language. Plenty of titles dig into the Java language in massive detail, but this title takes the unique approach of stepping back and looking at fundamental object concepts first. The details of Java, from basic language features to a straightforward tutorial for building a complete "industrial strength" Java application, emerge only after a thorough tour of thinking in objects. In order to harness the power of Java as an object-oriented programming language, one must be proficient with objects first. Beginning Java Objects: From Concepts to Code provides the perfect introduction to both!
Two-sorted metric temporal logics
Authors: Angelo Montanari, Maarten Rijke
Venue:  (1995)

Temporal logic has been successfully used for modeling and analyzing the behavior of reactive and concurrent systems.One shortcoming of (standard) temporal logic is that it is inadequate for real-time applications, because it only deals with qualitative timing properties.This is overcome by metric temporal logics which offer a uniform logical framework in which both qualitative and quantitative timing properties can be expressed by making use of a parameterized operator of relative temporal realization. In this paper we deal with completeness issues for basic systems of metric temporal logic --- despite their relevance, such issues have been ignored or only partially addressed in the literature.We view metric temporal logics as two-sorted formalisms having formulae ranging over time instants and parameters ranging over an (ordered) abelian group of temporal displacements.We first provide an axiomatization of the pure metric fragment of the logic, and prove its soundness and completeness.Then, we show how to obtain the metric temporal logic of linear orders by adding an ordering over displacements.Finally, we consider general metric temporal logic allowing quantification over algebraic variables and free mixing of algebraic formulae and temporal propositional symbols.
Load Balancing in Counter-Rotated SONET Rings
Authors: Peng-Jun Wan, Yuanyuan Yang
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Load-balanced routing in SONET rings has attracted much attention recently. Most prior works model the SONET rings as undirected rings and the traffic as undirected chords. While this model fits well to the traditional telephony applications, it is inefficient for the explosive Internet traffic and multimedia data communications, which exhibit unidirectional and asymmetric nature. For these applications, it is proper to model the SONET rings as a pair of counter-rotated rings and the traffic as directed chords. In this paper, we first explore general flow properties in counter-rotated rings, and then introduce flow rounding and unsplitting techniques. Afterwards an optimal integral routing algorithm is provided. Finally, we show the NP-completeness of optimal unsplit routing, and present several polynomial-time approximation algorithms.
Optimal Code Size Reduction for Software-Pipelined Loops on DSP Applications
Authors: Qingfeng Zhuge, Zili Shao, Edwin H.-M. Sha
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try to reduce the prologue/epilogue produced by software pipelining. This paper presents the fundamental understanding of the relationship between code size expansion and software pipelining. Based on the retiming concept, we present a powerful Code-size REDuction (CRED) technique and its application on various kinds of processors. We also provide CRED algorithms integrated with software pipelining process. One advantage of our algorithms is that it can explore the trade-off space between "perfect" software pipelining and constrained code size. That is, the software pipelining process can be controlled to generate a schedule concerned with code size requirement. The experiment results show the effectiveness of ouralgorithms in both reducing the code size for software-pipelined loops and exploring the code size/performance trade-off space.
Exploring the Use of I/O Nodes for Computation in a MIMD Multiprocessor
Authors: David Kotz, Ting Cai
Venue:  (1994)

As parallel systems move into the production scientific computing world, the emphasis will be on cost-effective solutions that provide high throughput for a mix of applications. Cost-effective solutions demand that a system make effective use of all of its resources. Many MIMD multiprocessors today, however, distinguish between ``compute'''' and ``I/O'''' nodes, the latter having attached disks and being dedicated to running the file-system server. This static division of responsibilities simplifies system management but does not necessarily lead to the best performance in workloads that need a different balance of computation and I/O.
Heuristic algorithms for path selection in private ATM networks
Authors: Xuedong Jiang, Tao Yang
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

The path selection problem is formulated as a shortest path problem with multiple constraints which is known to be NP-complete. We propose heuristic algorithms to find a minimum hop path satisfying the constraints of end-to-end delay requirement, maximum load level on each of its link and minimum probability to pass the local call admission control. The spirit of the proposed heuristic is to transform the constrained shortest path problem into an unconstrained shortest path problem. Simulation study over a large number of randomly generated networks shows that in most cases it is better than existing heuristic algorithms in terms of the call blocking ratio.
Construction and operation of a snake-like robot
Authors: R. Worst, R. Linnemann
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Our robot, called the GMD-Snake, uses its body instead of wheels, legs, or arms for locomotion as well as for handling items. It may be used for inspection and manipulation in areas where motion is restricted. We describe the hardware and software of the GMD-Snake and some locomotion experiments. The GMD-Snake is assembled of some uniform sections, each one consisting of two rubber joints. The joints can be bent in arbitrary directions, thus making the robot's body very flexible. To imitate closely a real snake and to study different ways of movement, an appropriate control software is necessary, which manages the harmonious motion of all the sections. Therefore, the individual sections are connected to an external processor via a special type of field bus, called CAN bus. Currently, the snake can do its locomotion according to predefined commands. In future, the robot shall be able to use its sensors for flexible interactions with objects of its environment.
Known-item retrieval on broadcast TV
Authors: J. A. List, A. R. Ballegooij, A. P. Vries
Venue:  (2001)

Many content-based, multimedia retrieval systems are based on a feature-oriented approach to querying, mostly exposing a fixed set of features (introduced at design time) for querying purposes. This restriction to a limited set of features is problematic for two reasons: it restricts the expressiveness at the semantic level, and it seems unfeasible to obtain (a-priori) a sufficiently powerful set of features for all possible queries. We describe an alternative approach where users specify precisely the distinguishable characteristics of the desired result set. In this query process, the user first describes a representation of the content (based on a feature or collection of features) and then tells the system how to apply the representation in the search. Our prototype video retrieval system allows the expression of such queries as a sequence of operations, on MPEG video and audio streams, that can be executed on our database system. While the low-level decompression stage is implemented in an imperative programming language, the actual retrieval approach is expressed in declarative database queries. We assessed this system with a case study in known-item retrieval on broadcast video streams: detecting news bulletins in the stream, with the help of both audio and video information.
Visualizing Informationon a Sphere
Authors: M. H. Gross, T. C. Sprenger, J. Finger
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

We describe a method for the visualization of information units on spherical domains which is employed in the banking industry for risk analysis, stock prediction and other tasks. The system is based on a quantification of the similarity of related objects that governs the parameters of a mass-spring system. Unlike existing approaches we initialize all information units onto the inner surface of two concentric spheres and attach them with springs to the outer sphere. Since the spring stiffnesses correspond to the computed similarity measures, the system converges into an energy minimum which reveals multidimensional relations and adjacencies in terms of spatial neighborhoods. Depending on the application scenario our approach supports different topological arrangements of related objects. In order to cope with large data sets we propose a blobby clustering mechanism that enables encapsulation of similar objects by implicit shapes. In addition, we implemented various interaction techniques allowing semantic analysis of the underlying data sets. Our prototype system IVORY is written in JAVA, and its versatility is illustrated by an example from financial service providers.
Visual Basic .Net Programming
Authors: Harold Davis, Mark Ridgeway
Venue:  (2002)

:With the introduction of Visual Basic .NET, VB is now a complete object-oriented language, letting programmers access the full power of the Windows platform while enabling them to build reliable and robust web solutions. It doesn't matter if you're new to programming or just to VB.NET, Visual Basic. NET Programming gets you up and running with the new version and offers a comprehensive introduction to Windows and web application development. From language fundamentals to ADO.NET, SML, and Web Services, Harold Davis's thoughtful approach emphasizes meaningful tasks that tie in with VB.NET's principal strengths. For example, you'll learn to build a Web Service, implement XML support, and use object-oriented techniques -- without getting mired in theory but also without sacrificing the understanding you need to apply your skills in new situations. Much of the book is devoted to Windows application development, covering new ways to program standard elements, as well as emphasizing Visual Basic's new programming features. Want to build a desktop program with an oval interface? Want to create robust class libraries, components, and controls? Implement printing as a program feature? Start and stop a service? Every chapter provides solid examples that will help you learn the language and, more importantly, create effective applications with it.
A lightweight ontology repository
Authors: Jin Pan, Stephen Cranefield, Daniel Carter
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Multi-agent systems rely on shared ontologies to enable unambiguous communication between agents. An ontology defines the terms or vocabularies used within messages encoded using an agent communication language (ACL). In order for ontologies to be shared and reused, ontology repositories are needed to store and maintain ontologies. The Otago Ontology Repository is a prototype implementation of a design to allow ontology designers and agents to use open Web standards to publish and retrieve ontologies and metadata about them. Key features of the system include the use of the HTTP protocol following the REST architectural style, the representation of the recorded information about ontologies and the repository information schema using RDF and its schema language RDFS, and the use of URNs to identify ontologies. The use of Web standards for communication between agents and Web-based resources such as ontology repositories enables a more lightweight and open architecture for agent interaction with these resources.
Team formation and communication restrictions in collectives
Authors: Adrian K. Agogino, Kagan Tumer
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

A collective of agents often needs to maximize a "world utility" function which rates the performance of an entire system, while subject to communication restrictions among the agents. Such communication restrictions make it difficult for agents which try to pursue their own "private" utilities to take actions that also help optimize the world utility. Team formation presents a solution to this problem, where by joining other agents, an agent can significantly increase its knowledge about the environment and improve its chances of both optimizing its own utility and that its doing so will contribute to the world utility. In this article we show how utilities that have been previously shown to be effective in collectives can be modified to be more effective in domains with moderate communication restrictions resulting in performance improvements of up to 75%. Additionally we show that even severe communication constraints can be overcome by forming teams where each agent of a team shares the same utility, increasing performance an additional 25%. We show that utilities and team sizes can be manipulated to form the best compromise between how "aligned" an agent's utility is with the world utility and how easily an agent can learn that utility.