ppxscal/embedding_network huggingface dataset:
Performance of Nonlinear Approximate Adaptive Controllers
Authors: Mark French, Eric Rogers, Csaba Szepesvari
Venue:  (2002)

:In recent years there has been a wide interest in non-linear adaptive control using approximate models, either for tracking or regulation, and usually under the banner of neural network based control. The authors present a unique critical evaluation of the approximate model philosophy and its setting, rigorously comparing the performance of such controls against competing designs. Analysing a very topical aspect of contemporary research and control practice this book highlights the situations in which approximate model based designs are most appropriate and indicates scenarios in which other designs could be used more productively. Throughout the text concepts are illustrated using a variety of examples, both academic problems and those based on physical examples. The work is designed to open the door to realistic applications.Unified coverage of the theory and application of a wide range of control systems areas including neural network based control and control using the approximate modelPresents a mathematically well founded introduction to the area of intelligent controlA varied selecion of practical examples drawn from a variety of fields, including robotics and aerospace, illustrate theoretical principlesClear compaisons of a variety of control designsCross disciplinary approach to this leading edge topicA valuable reference for control practitioners and theorists, artificial intelligence researchers and applied mathematicians, as well as graduate students and researchers with an interest in adaptive control and stability.
Architectural Concepts in Implementation of End-system Protocols for High Performance Communications
Authors: K. Ravindran, G. Singh, C. M. Woodside
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

The paper presented a functional view of end-system protocol implementations whereby the protocol is decomposed into various functions, each causing a change in the protocol state. This view makes the interactions and the relationships among the various functional modules explicit. In terms of this view, currently prevalent architectural optimizations for performance improvement (such as `parallel executions' and `integrated layer processing') can be easily described as a set of control flow relationships among modules. If a protocol implementation is analyzed using our functional model, the possible architectural optimizations in the protocol can be easily identified and implemented without violating correctness. Thus, our approach can be used to optimize existing implementations by casting the underlying protocols in our framework, and it is particularly useful in developing implementatio
Requirements Engineering: What Have We Accomplished? Where Are We Now? Where Are We Going?
Authors: Donald C. Gause
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

We all expect ICRE 2000 to exert a positive influence on the future direction of requirements gathering and management. We will summarize important findings, processes, directions, and recommendations presented in the conference and explore their application to the design of systems of ever increasing complexity. We will look at the problems solved, the problems to be solved, the problems yet to be discovered, and the catastrophes to be avoided through effective Requirements Engineering.
Timed Models for Protocol Security
Authors: Nevin Heintze, J. D Tygar
Venue:  (1992)

The notion of time is prerequisite for describing and verifying the security properties of key management protocols. Without it, properties relating to the expiration of keys and the freshness of messages and nonces cannot be formulated. Recently Burrows, Abadi and Needham proposed a formal system for protocol verification which includes an ability to reason about time. In essence their "Logic of Authentication" is a proof theory for reasoning about key management protocols. One difficulty with such a logic lies in justifying the inferences that can be made. We approach this problem by developing an accompanying model theory for protocol security. Model theoretic techniques have been used before in the protocol verification literature, but our approach is different in two respects. First we consider a model theory which includes a notion of time. Second, the purpose of much of the previous model theoretic work was aimed at developing protocol verification tools and so assumptions about specific kinds of protocols and methods for breaking protocols were built into the model, often implicitly. In contrast, our account is more general and centers on a justification of the notion of model itself. The main results of this work include *a model theoretic definition of protocol security that is provably equivalent to a variety of alternative definitions; *demonstration that some questions about protocol security properties are undecidable, and *a schema for demonstrating the validity of many protocols by the use of model checking.
Reliable broadcasting and secure distributing in channel networks
Authors: Feng Bao, Y. Funyu, Y. Hamada, Y. Igarashi
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Let T/sub 1/, /spl middot//spl middot//spl middot/, T/sub n/ be n spanning trees rooted at node r of graph G. If for any node /spl nu/ of G, among the n paths from r to /spl nu/, each path in each spanning tree of T/sub 1/, /spl middot//spl middot//spl middot/, T/sub n/, there are k (k/spl les/n) internally disjoint paths, then T/sub 1/, /spl middot//spl middot//spl middot/, T/sub n/, are said to be (k, n)-independent spanning trees rooted at r. A graph is called an (k, n)-channel graph if G has (k, n)-independent spanning trees rooted at each node of G. We study two fault-tolerant communication tasks in (k, n)-channel graphs. The first task is reliable broadcasting. We analyze the relation between the reliability and the efficiency of broadcasting. The second task is secure message distributing. It is required that each message should be received by its destination node and that we should keep the message secret from the nodes called adversaries. We give two message distribution schemes. The first scheme uses secret sharing, and it can tolerate t+k-n listening adversaries for any t
Design and Performance of Horus: A Lightweight Group Communications System
Authors: Robbert Van Renesse, Takako M. Hickey, Kenneth P. Birman
Venue:  (1994)

The Horus project seeks to develop a communication system addressing the requirements of a wide variety of distributed applications. Horus implements the group communications model providing (among others) unreliable or reliable FIFO, causal, or total group multicasts. It is extensively layered and highly reconfigurable allowing applications to only pay for services they use. This architecture enables groups with different communication needs to coexist in a single system. The approach permits experimentation with new communication properties and incremental extension of the system, and enables us to support a variety of application-oriented interfaces. Our initial experiments show good performance.
Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
Authors: Boaz Tsaban
Venue: Journal of Algorithms (2003)

P ∈ SN is a fast forward permutation if for each m the computational complexity of evaluating pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ (N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold.
A Practical Approach to E-Government Web Evaluation
Authors: Fred B. Wood, Elliot R. Siegel, Eve-Marie LaCroix, Becky J. Lyon, Dennis A. Benson, Victor Cid, Susan Fariss
Venue: IT Professional (2003)

Does your Web site function smoothly enough to deliver government services? Combining evaluation techniques gives you a multidimensional answer.
Deciding Strictly Non-Blocking Generalized-Concentration Properties with Constrained Network Parameters
Authors: H. K. Dai
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Concentrators and generalized-concentrators are interconnection networks that provide respectively pairwise vertex-disjoint directed paths and trees to satisfy interconnection requests. An interconnection network is non-blocking in the strict sense if every compatible interconnection request can be satisfied by a path regardless of any existing interconnections. We present an interconnection property equivalent to the generalized-concentration with constrained network capacity and request multiplicity in the strictly non-blocking context, and show a polynomial-time computational complexity result for deciding the strictly non-blocking generalized-concentration properties with constrained network parameters, by using b-matching techniques.
Self-Timed Design with Dynamic Domino Circuits
Authors: Jung-Lin Yang, Erik Brunvand
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

We introduce a simple hierarchical design techniquefor building high-performance self-timed component using dynamic domino-style circuits. This technique is useful for building handshaking style functional blocks andfor self-timed data path components. We wrap the dynamic domino circuit in a wrapper that communicates using a request/acknowledge protocol and mediates the pre-charge/evaluate cycle of the dynamic logic. We applystandard bundled delay matching for completion detection but add an early completion feature that can signalcompletion if function validity can be determined fromthe output value. The circuit overhead required for thisearly-acknowledge feature is relatively small, but canprovide measurable speedup in some situations. We callthis approach semi-bundled delay (SBD).
Cohesive fracture in thermoelastic medium: a coupled analysis
Authors: S. Secchi, L. Simoni
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper presents a fully-coupled numerical model for the analysis of fracture initiation and propagation in a two dimensional non-homogeneous elastic medium driven by a transient thermal field. Cohesive crack behaviour is assumed for the solid. The solution of the coupled problem is obtained using the finite element method. Evolution of the process zone results in continuous changes of the domain topology. This is accounted for by updating the boundary geometry and successive remeshing of the domain. Optimality of the shape of the finite elements generated is controlled and the mesh density is adjusted adaptively on the basis of an error indicator which is calculated using the solution at previous steps. A numerical test case is presented, which demonstrate the effectiveness of the proposed procedure.
Design of Documentation Mediation System for Mobile Service
Authors: Sunghan Kim, Changsu Kim, Young Tae Park, Kishik Park, Hoekyung Jung
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In W3C (World Wide Web Consortium), many XML applications are evolving into EDI, e-commerce and mobile contents services with XML data formats so that various kinds of XML documents are expanding with great speed in the WEB.To use XML documents efficiently, it needs the role ofconnect different document structures.In this paper, we define the connection rules between source and destination documents through XML Schema which have XML structural information for transformation. According to the proposed connection Rules, XML mapper system are designed To generate XSL (extensible Stylesheet Language) stylesheet documents so that It might be useful for document translation between two different documents
Coordination of massively concurrent activities
Authors: Farhad Arbab
Venue:  (1995)

Massively parallel and distributed systems open new horizons for large applications and present new challenges for software technology. Many applications already take advantage of the increased raw computational power provided by such parallel systems to yield significantly shorter turn-around times. However, the availability of so many processors to work on a single application presents a new challenge to software technology: coordination of the cooperation of large numbers of concurrent active entities. Classical views of concurrency in programming languages that are based on extensions of the sequential programming paradigm are ill-suited to meet this challenge. Exploiting the full potential of massively parallel systems requires programming models that explicitly deal with the concurrency of cooperation among very large numbers of active entities that comprise a single application. In practice, the concurrent applications of today essentially use a set of ad hoc templates to coordinate the cooperation of their active components. This shows the lack of proper coordination languages that can be used to explicitly describe complex cooperation protocols in terms of simple primitives and structuring constructs. In this paper we present a generic model of communication and describe a specific control-oriented coordination language based on this model. The important characteristics of this model include compositionality, which it inherits from the data-flow model, anonymous communication, and separation of computation concerns from communication concerns. These characteristics lead to clear advantages in large concurrent applications.
Design for Large Scale Software Reuse: An Industrial Case Study
Authors: Muthu Ramachandran, Wolfgang Fleischer
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Reuse of software is an excellent way for saving costs and development efforts. Design for large scale reuse addresses the need for higher productivity in a domain-specific architectures (for a product family), design for reuse, reuse guidelines and rules. We have achieved more than 70% reuse within a product family and more than 40% on a different product family.
Open Spectrum: A Path to Ubiquitous Connectivity
Venue: Queue (2003)

Just as open standards and open software rocked the networking and computing industry, open spectrum is poised to be a disruptive force in the use of radio spectrum for communications. At the same time, open spectrum will be a major element that helps continue the Internet’s march to integrate and facilitate all electronic communications with open standards and commodity hardware.
Green''s Function Monte Carlo Calculations for 4He Using The Shadow Wave Function As Importance Function
Authors: P. A. Whitlock, S. A. Vitiello, G. V. Chester, M. H. Kalos
Venue:  (1990)

Previous Green''s function Monte Carlo (GFMC) calculations in the solid phase of 4He have given accurate and robust energies. Various insights to many of the properties of this system have been obtained as well. However, the calculations remained unsatisfactory in some aspects. For example, the importance function used in them was of the Bijl form times a product of Gaussians(1,2) centered about an a priori chosen lattice. The localized Gaussian functions destroyed some of the known properties of the system viz., translational invariance and symmetry under particle exchange. As a matter of principle and also to investigate anisotropies and a possible condensate that might exist in the solid phase, it is important to consider a trial function that restores the destroyed properties. One such trial function is the shadow wave function introduced by Vitiello et al.(3) In this paper, we report preliminary results obtained with the GFMC method that uses this trial function as importance function. In the next section, we present the shadow wave function and its motivation. After this, a discussion of the variational Monte Carlo method is presented with special attention devoted to the sampling of the shadow coordinates. In a GFMC calculation where the shadow wave function is the importance function, we need the Metropolis algorithm to sample the shadow coordinates. The implementation of the GFMC method with such a trial function as importance function follows. Finally we give our results and a discussion.
Verification of the Futurebus+ Cache Coherence Protocol
Authors: Edmund Clarke, Orna Grumberg, Hiromi Hiraishi, Somesh Jha, David Long, Kenneth McMillan, Linda Ness
Venue:  (1992)

We used a hardware description language to construct a formal model of the cache coherence protocol described in the draft IEEE Futurebus+ standard. By applying temporal logic model checking techniques, we found several errors in the standard. The result of our project is a concise, comprehensible and unambiguous model of the protocol that should be useful both to the Futurebus+ Working Group members, who are responsible for the protocol, and to actual designers of Futurebus+ boards.
Trends in Information Visualisation in Construction
Authors: Aouad Ghassan
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

It is widely recognised that construction is an information intensive and complex industry. Traditional computational techniques have failed our industry because of the shear number of information interfaces and complex relationships. Modern visual technologies can resolve many of the aforementioned problems by providing construction professionals with 3 dimensional information interfaces that allow them to use the visual model (3D, VR, etc) as the medium for communication, interaction, and integration.This paper looks at trends and predictions within the construction sector for technologies such as visualisation through CAD and VR. It then presents an improved model for information interfacing through VR capabilities. The information interface model is a web-based one developed to provide opportunities for many construction professionals across the supply chain using open technologies such as the Internet. This paper will demonstrate that information visualisation is of importance and can be used by every participant within the construction sector including clients, contractors, cost estimators, project planners, and others.Finally, this paper will conclude with a series of screen snap shots resulting from state of the art research on information visualisation and interfaces being conducted at the University of Salford in the UK. Salford is bringing together visualisation, object oriented and web technologies to solve the problems associated with construction information integration and communication. This paper will provide an overview of this research which will help many interested parties understand how these technologies can work together.
Spanning tree method for link state aggregation in large communication networks
Authors: W. C. Lee
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

We consider a communication network in which dynamic routing is used for establishing connections that support information transfer between end-users. Link state information is exchanged and maintained up-to-date among network nodes for path computation and network resource allocation. When the population of users is large, the amount of link state information can be overwhelming. A common solution is to use a hierarchical structure. In this paper, we present a method for aggregating link state information in a hierarchical network. We assume that each link state parameter associated with a link is symmetrical in both directions of the link. The key idea for the method is to first reduce the original subnetwork topology to a full-mesh representation that consists of a logical link for each pair of border nodes in the subnetwork, and then encode the link state information associated with the full-mesh representation with an appropriate spanning tree.
Some Properties of Discrete Interval Truth Valued Logic
Authors: Noboru Takagi, Kyoichi Nakashima
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper focus on functions defined on a special subset of the power set of f0; 1; . . . r_ 1g (the elements in the subset will be called discrete interval truth values because they act precisely as intervals) and operations on the truth-values. The operations discussed in this paper will be called regular because they can be seen as an extension of the regularity, which was introduced by Kleene in his ternary logic. M. Mukaidono investigated some properties of ternary functions, which can be represented by the regular operations. He called such ternary functions ¿regular ternary logic functions¿. Regular ternary logic functions are useful for representing and analyzing ambiguities such as transient states and/or initial states in binary logic circuits that Boolean functions cannot cope with. They are also applicable to studies of fail-safe systems for binary logic circuits. In this paper, we will discuss an extension of regular ternary logic functions to functions on the discrete interval truth-values. Section 2 will give some of the basic definitions of discrete interval truth valued logic, and show some of its mathematical properties. In Section 3, we will give logic formulas, which represent minimum and maximum information loss functions.
Finite State Automata as Form-Generation and Visualization Tools
Authors: Buthayna Eilouti, Emmanuel-George Vakalo
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Architects and other designers use diagrams to visualize the process of product analysis and synthesis. This paper outlines a new pictorial representation tool that helps designers visualize the process of composing and classifying their final products.Finite State Automata (FSAs) are used in the context of formal languages as recognition devices. In this sense, they complement the synthetic device of linear grammars in the definition of regular languages. Using the paradigm of language for understanding the design process, FSAs can be developed to describe how basic shapes standing for elements or subsystems can be put together into meaningful subsystems or systems. They can classify different options for component grouping. Compared to flow charts, FSAs represent graphically a class of flow charts that share a set of predefined criteria. In addition, FSAs allow the representation of recursive as well as topological and spatial relations among components.