ppxscal/embedding_network huggingface dataset:
Compositional specification and verification of distributed systems
Authors: Bengt Jonsson
Venue:  (1990)

We present a method for specification and verification of distributed systems that communicate via asynchronous message-passing. The method handles both safety and liveness properties. It is compositional, i.e., a specification of a composite system can be obtained from specifications of its components. Specifications are given as labeled transition systems with fairness properties, using a program-like notation with guarded multiple assignments. A specification denotes a set of allowed sequences of message transmissions and receptions, in analogy with the way finite automata are used as acceptors of finite strings. A lower-level specification implements a higher-level specification if all sequences allowed by the lower-level specification are also allowed by the higher-level one. We present a verification technique which reduces the problem of verifying the correctness of an implementation to classical verification conditions. Safety properties are verified by establishing a simulation between transition systems. Liveness properties are verified using methods for proving termination under fairness assumptions. Since specifications can be given at various levels of abstraction, the method is suitable in a development process where a detailed implementation is developed from an abstract specification through a sequence of refinement steps. The method is applied to a sliding window protocol, and to an algorithm by Thomas for updating a distributed database.
A systematic approach to the design and implementation of a computer instruction set
Authors: Nenad Marovac
Venue: ACM SIGARCH Computer Architecture News (1983)

When selecting the instruction set for a computer family, the designer must consider several criteria. The design considerations leading to the final instruction set for a new computer are very seldom published. The purpose of this paper is twofold:&bull; Discussion of the design and implementation criteria for an instruction set.&bull; Proposal of a systematic approach for the design and implementation of an instruction set.
Inference in fuzzy logic via generalized constraint propagation
Authors: L. A. Zadeh
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

The concept of a generalized constraint provides a basis for a significant generalization of inference processes in fuzzy logic. In this paper, generalized rules of inference for various values of r are formulated and illustrated by examples. The inference rules are interpreted as rules for generalized constraint propagation. Such rules provide a foundation for what might be called computing with words, or CW for short.
A Semantic Broadcast Scheme for a Mobile Environment Based on Dynamic Chunking
Authors: Ken Lee, Hong Va Leong, Antonio Si
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Data broadcast is an effective approach to disseminate information from a database server to numerous mobile clients in a mobile environment. Since a broadcast session contains only a subset of the database items, a client might not be able to obtain all its items from the broadcast and is forced to request additional ones from the server on demand.In this paper, we describe a semantic-based broadcast approach which attaches a semantic description to each broadcast unit, called chunk, which is a cluster of data items, This allows a client to determine if a query can be answered entirely using a broadcast as well as defining the precise nature of the remaining items in the form of a ¿supplementary¿ query. Chunks could be of different sizes and are hierarchically organized.We propose a heuristic to schedule the broadcast order of the chunks to improve the tuning time, access time, and a new metric called data affinity index. The performance is evaluated via experiments based on a simulation model.
An Architecture for Planning in Uncertain Domains
Authors: Mario E. Agueda, Pablo H. Ibargüengoytia
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

This paper presents an architecture for intelligent planning in uncertain real domains. This architecture is based on the paradigm of beliefs, desires and intention (BDI). The planning technique consists in the use of Markov Decision Processes (MDP) and Partially Observed MDP (POMDP). The output of the planning consists in advices that the system provides to the operator of a power plant. Specifically, the process experimented in this work is the uncertainty that a classical controller (PID) observes in the control of the level of water of the drum in a steam generator of a power plant. The graphics of the optimal trajectory of control is discretized in order to form a finite set of states in the space. The actions are the increments or decrements of the variables that produce the movements in the control space. The transition matrix is obtained with real data from different operation conditions of the plant. The reward and observation functions are obtained from experimented operators of power plants.
Lectures in Least Squares
Authors: Charles Van Loan
Venue:  (1976)

These lecture notes arose out of the numerical analysis seminar given at Cornell University in the Spring of 1976. The goal of the seminar was to acquaint a variety of researchers and undergraduates with the field of least squares computations. I hope the presentation will neither bore the expert nor discourage the layman.
Syntactic and Semantic Type and Selection. SPARKLE Deliverable 5.2
Authors: Ted Briscoe, Diana McCarrthy, John Carroll, Paolo Allegrini, Nicoletta Calzolari, Stefano Federici, Simonetta Montemagni, Vito Pirrelli, Steven Abney, Franz Beil, Glenn Carroll, Marc Light, Detlef Prescher, Stefan Riezler, Matz Rooth
Venue:  (1999)

This document describes research on techniques for semantic annotation of subcategorization frames involving semantic classification of heads of phrases. In keeping with the Sparkle policy of exploring alternative approaches, the methods vary widely in statistical models using (i) the minimum description principle, (ii) analogy-based semantic similary, (iii) EM-based clustering, and (iv) Markov models induced by semantic class hierarchies
Model Checking Mobile Processes (Full version)
Authors: Mads Dam
Venue:  (1993)

We introduce a temporal logic for the polyadic pi-calculus based on fixed point extensions of Hennessy-Milner logic. Features are added to account for parametrisation, generation, and passing of names, including the use, following Milner, of dependent sum and product to account for (unlocalised) input and output, and explicit parametrisation on names using lambda-abstraction and application. The latter provides a single name binding mechanism supporting all parametrisation needed. A proof system and decision procedure is developed based on Stirling and Walker''s approach to model checking the modal mu-calculus using constants. One difficulty, for both conceptual and efficiency-based reasons, is to avoid the explicit use of the omega-rule for parametrised processes. A key idea, following Hennessy and Lin''s approach to deciding bisimulation for certain types of value-passing processes, is the relativisation of correctness assertions to conditions on names. Based on this idea a proof system and decision procedure is obtained for arbitrary pi-calculus processes with finite control, pi-calculus correlates of CCS finite-state processes, avoiding the use of parallel composition in recursively defined processes.
Self-Organization of Distributed Document Archives
Authors: Dieter Merkl, Andreas Rauber
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Document archives may be regarded as a perfect application arena for unsupervised neural networks because many operations computers have to perform on text documents are classification tasks based on noisy patterns. The "noise" originates from the known inaccuracy of mapping free-form natural language to an indexing vocabulary representing the contents of the documents. In this paper we describe an approach towards management of distributed document archives based on a system of independent self-organizing maps each of which represents just a portion of the complete document archive. These individual maps may be integrated in a hierarchical fashion. This leads to enormous flexibility for the user who may define her own personal library that reflects her particular interests.
A Spatial Digital Video Watermark that Survives MPEG
Authors: Bijan G. Mobasseri
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Spatial watermarks are simple and quick to embed but vulnerable to intentional attacks or benign transformation such as compression. Watermarking of compressed video is often performed in the compressed domain. In this paper we show that by exploiting the inherent processing gain of direct sequence spread spectrum, it is possible to embed a watermark in raw video and still recover it from MPEG decoder.
A note on Bernstein-type inequalities for martingales
Authors: Kacha O. Dzhaparidze, J. H Zanten
Venue:  (1999)

Several inequalities of Bernstein''s type are derived in a unified manner. Some extra light is shed on the classical inequalities and implications are sought for instance for conditionally symmetric martingales and sequences of asymptotically continuous martingales.
Counting in Structural Complexity Theory
Authors: Lane A. Hemachandra
Venue:  (1987)

Structural complexity theory is the study of the form and meaning of computational complexity classes. Complexity classes P, NP, Probabilistic P, PSPACE, etc. are formalizations of computational powers deterministic, nondeterministic, probabilistic, etc. By examining the structure of and the relationships between these classes, we seek to understand the relative strengths of their underlying computational paradigms. This thesis studies counting in structural complexity theory. We are interested in complexity classes defined by counting and in the use of counting to explore the structure of these and other classes.
Compiling Parallel Sparse Code for User-Defined Data Structures
Authors: Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
Venue:  (1997)

We describe how various sparse matrix and distribution formats can be handled using the {\em relational} approach to sparse matrix code compilation. This approach allows for the development of compilation techniques that are independent of the storage formats by viewing the data structures as relations and abstracting the implementation details as access methods.
Securing Ad Hoc Networks
Authors: Lidong Zhou, Zygmunt Haas
Venue:  (1999)

Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we study the threats an ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks --multiple routes between nodes --to defend routing against denial of service attacks. We also use replication and new cryptographic schemes, such as threshold cryptography, to build a highly secure and highly available key management service, which forms the core of our security framework.
On Interrupt-Transparent Synchronization in an Embedded Object-Oriented Operating System
Authors: Friedrich Schoen, Wolfgang Schroeder-Preikschat, Olaf Spinczyk, Ute Spinczyk
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

A crucial aspect in the design of (embedded real-time) operating systems concerns interrupt handling. This paper presents the concept of a modularized interrupt-handling subsystem that enables the synchronization of interrupt-driven, non-sequential code without the need to disabling hardware interrupts. The basic idea is to use non-blocking/optimistic concurrency sequences for synchronization inside an operating-system kernel. Originally designed for the PURE embedded operating system, the presented object-oriented implementation is highly portable not only regarding the CPU but also operating systems and yet efficient.
An Algorithm for Resource Allocation Requiring Low Overhead Communication
Authors: Ann Marks
Venue:  (1986)

A heuristic algorithm for allocating resource units to sites in a distributed system is presented. Starting with a given allocation of sites, the algorithm performs a series of optimizations involving pairs of sites in an attempt to improve the worst pair-wise imbalance present in the system; termination occurs when no further improvement is possible. After outlining the general form of the algorithm, which effectively defines an entire family of algorithms, we present theoretical results that speak to the performance of the algorithm as measured in the number of optimizations that can be done, the amount of control communication required and the worst case imbalance of the resulting allocation. Subsequently, two particular algorithms in the family are given and the results of a simulation study of their performance is presented.
An Integrated Approach to Modeling and Analysis of Embedded Real-Time Systems Based on Timed Petri Nets
Authors: Zonghua Gu, Kang G. Shin
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In computer-based control systems, embedded softwareis taking over what mechanical and dedicated electronicsystems used to do, that is, to engage and controlthe physical world, interacting directly with sensorsand actuators. Therefore, software running on a digitalprocessor is tightly-coupled with its surrounding physicalenvironment. We propose an integrated approachbased on Timed Petri-Nets for modeling and analysisof embedded real-time systems where real-time schedulingbehavior of the controller software is explicitly representedat the model-level, together with the physicalenvironment that it interacts with. This enables thedesigner to have an integrated view of the entire systemwhile analyzing the system and making design decisions.We also describe a syntax-directed, automatedtranslation procedure from Timed Petri-Nets to TimedAutomata, thus enabling the use of model checkers suchas UPPAAL for analysis purposes. We consider therailroad crossing problem as an application example,and evaluate alternatives for controller implementationon either single-processor or distributed multi-processorplatforms based on the integrated approach.
A few logs suffice to build (almost) all trees (II)
Authors: P. L. Erdos, M. A. Steel, L. A. Szekely, T. J. Warnow
Venue:  (1997)

Inferring evolutionary trees is an interesting and important problem in biology that is very difficult from a computational point of view as most associated optimization problems are NP-hard. Although it is known that many methods are provably statistically consistent (i.e. the probability of recovering the correct tree converges on 1 as the sequence length increases), the actual rate of convergence for different methods has not been well understood. In a recent paper we introduced a new method for reconstructing evolutionary trees called the Dyadic Closure Method (DCM), and we showed that DCM has a very fast convergence rate. DCM runs in O(n^5 log n) time, where n is the number of sequences, so although it is polynomial it has computational requirements that are potentially too large to be of use in practice. In this paper we present another tree reconstruction method, the Witness-Antiwitness Method, or WAM. WAM is significantly faster than DCM, especially on random trees, and converges at the same rate as DCM. We also compare WAM to other methods used to reconstruct trees, including Neighbor Joining (possibly the most popular method among molecular biologists), and new methods introduced in the computer science literature.
Multiple Inverted Array Structure for Similar Image Retrieval
Authors: Noburou Taniguchi, Masashi Yamamuro
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

The retrieval functionality of multimedia database system is so important to provide users with comfortable access to the stored data. Similarity retrieval (also called ''content-based retrieval'') is a promising technique for multimedia retrieval. We have therefore been carrying out research on an image retrieval system that makes use of similarity retrieval. This kind of retrieval is based on nearest neighbour searching in a multi-dimensional space. To make the retrieval fast and flexible we have developed a novel access method that uses an index structure consisting of multiple inverted arrays. Experimental evaluation of this method showed that it is potentially useful for shape similarity retrieval. The search speed is significantly faster than that of brute-force searching, and the accuracy is good enough.
A Combinatorial Algorithm for Pfaffians
Authors: Mahajan Meena, Subramanya P. R., Vinay V.
Venue:  (1999)

The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm for computing Pfaffians. We present the first completely combinatorial algorithm for computing the Pfaffian in polynomial time. Our algorithm works over arbitrary commutative rings. Over integers, we show that it can be computed in the complexity class GapL; this result was not known before. Our proof techniques generalize the recent Mahajan-Vinay combinatorial characterization of determinant in novel ways. As a corollary, we show that under reasonable encodings of a planar graph, Kasteleyn''s algorithm for counting the number of perfect matchings in a planar graph is also in GapL. The combinatorial characterization of Pfaffian also makes it possible to directly establish several algorithmic and complexity theoretic results on Perfect Matching which otherwise use determinants in a roundabout way. We also present hardness results for computing the Pfaffian of an integer skew-symmetric matrix. We show that this is hard for #L and GapL under logspace many-one reductions. Keywords: pfaffian, perfect matchings, determinant, planar graphs, GapL
Sojourn times in non-homogeneous QBD processes with processor sharing
Authors: Rudesindo N\''{u}\~{n}ez Queija
Venue:  (1999)

We study sojourn times of customers in a processor sharing model with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace-Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is given to the conditional mean sojourn time of a customer as a function of his required amount of work, and we establish the existence of an asymptote as the amount of work tends to infinity. The method of random time change is then extended to include the possibility of a varying service rate. By means of this method, we explain the well-established proportionality between the conditional mean sojourn time and required amount of work in processor sharing queues without random environment. Based on numerical experiments, we propose an approximation for the conditional mean sojourn time. Although first presented for exponentially distributed service requirements, the analysis is shown to extend to phase-type services. The service discipline of discriminatory processor sharing is also shown to fall within the framework.
Multi-perspective images for visualisation
Authors: Scott Vallance, Paul Calder
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

This paper describes the concept, and previous realisations, of multi-perspective images in nature, art and visualisation. By showing how distortions have been used for visualisation, it motivates the use of multi-perspective images, which are similar in effect to object based distortions. A new API being developed to facilitate multi-perspective rendering is presented, with particular reference to its suitability for interactive applications. This API is demonstrated in a simple example of a multiperspective image, where five faces of a cube are shown at once. Further work necessary to make multi-perspective images for visualisation a reality is discussed.
Elements of Construction of Expert System of the Analysis of Heart-Rate Variability Based on Principles of Nonlinear Dynamics
Authors: V. G. Zakharevich, O. N. Sakharova
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In this article it a concept of nonlinear analysis of heart-rate variability that may improve the understanding of the underlying physiological processes of the autonomic nervous system is introduced.
Assurance Technologies for Growing Systems and their Application to Large-Scale Transport Operation Control Systems
Authors: Kazuo Kera, Keisuke Bekki, Naoki Miwa, Fumio Kitahara, Keiji Kamijyo, Kazuya Seki
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Recently, system needs of growing large-scale systems including heterogeneous functions and operations are increased. Assurance system that achieves high reliability and high availability is very important for such systems. In order to realize assurance system, we developed the assurance technology based on ADS (Autonomous Decentralized System). When a growing large-scale system changes or grows, its reliability may be lowered. In this paper, we clarify the risk factors which lower the reliability and quality of a growing system when the system is modified. We will then examine the methods to eliminate or ease those risk factors, and propose adaptable assurance technology that can minimize the risk under restrictive conditions such as cost, resource, periods, etc. We also describe ATOS as an example that was applied the assurance technique and its effectiveness as really changing and growing system.ATOS; Autonomous Decentralized Transport Operation Control System.