ppxscal/embedding_network huggingface dataset:
Using Time to Improve the Performance of Coordinated Checkpointing
Authors: Nuno Neves, W. Kent Fuchs
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

This paper describes and evaluates a coordinated checkpoint protocol that uses time to eliminate several performance overheads that are present in traditional protocols. The time-based protocol does not have to exchange coordination messages, does not need to add information to the processes' messages, and only accesses stable storage when checkpoints are saved. This protocol uses a simple initialization procedure to set checkpoint timers at the different processes. After the initialization, each process saves its state independently from the other processes. By disallowing processes from sending messages during an interval before the checkpoint time, the protocol prevents in-transit messages from occurring. Two coordinated checkpoint protocols were implemented on a CM5, and their performance was compared using several applications. Results showed that the time-based protocol outperforms the two-phase protocol in all applications.
Error estimates for the hybrid finite element/finite volume methods for linear hyperbolic and convection-dominated problems
Authors: M. D. Tidriri
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, we establish the error estimates for the generalized hybrid finite element/finite volume methods we have introduced in our earlier work (J. Comput. Appl. Math. 139 (2002) 323; Comm. Appl. Anal. 5(1) (2001) 91). These estimates are obtained for linear hyperbolic and convection-dominated convection-diffusion problems. Our analysis is performed for general mesh of a bounded polygonal domain of Rn satisfying the minimum angle condition. Our errors estimates are new and represent significant improvements over the previously known error estimates established for the streamline diffusion and discontinuous Galerkin methods applied to hyperbolic and convection dominated problems (Math. Comp. 46 (1986) 1; Comput. Methods Appl. Mech. Eng. 45 (1984) 285; in: C. de Boor (Ed.), Mathematical Aspects of Finite Elements in Partial Differential Equations, Academic Press, New York, 1974).
Tool Support for Production Use of Formal Techniques
Authors: John C. Knight, Kimberly S. Hanks, Sean R. Travis
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

The relatively scant use of formal techniques in software development is the result, in part, of a lack of suitable support tools.Many tools have been developed that provide novel analysis apabilities but lack basic yet commonplace facilities which are essential in production software development.More importantly, many existing tools for the development of formal specifications fail to provide mechanisms for the manipulation of natural language despite the fact that natural language is essential to give meaning to the terms in the formal specification.In this paper, we describe a toolset that has been developed with the specific intent of providing comprehensive facilities for creating formal specifications in production softwaredevelopment.The toolset supports a powerful formal notation, Z, but also provides omprehensive and fully integrated support for natural language.As well as describingthe toolset we present a preliminary evaluation of its use on a commercial specification.
Functions Returning Values of Dynamic Size
Authors: Mark Sherman, Andy Hisgen, Jonathan Rosenberg, David A Lamb
Venue:  (1986)

Modern programming languages, such as Ada (Ichbiah 80), permit the definition of functions that return values whose size can not be determined until the function returns. This paper discusses five implementation techniques that can be used to implement this capability. Comparisons of the techniques are provided and guidelines for selecting a particular technique for a compiler are given.
Optimal Policies for Partially Observable Markov Decision Processes
Authors: Anthony R. Cassandra
Venue:  (1994)

The main objective of this report is to provide implementation details for the more popular exact algorithms for solving finite horizon partially observable Markov decision processes (POMDPs). Along with the existing algorithms, a new algorithm, Witness, is proposed that has empirically been faster than the existing exact techniques. In addition to algorithmic details, the basic formulas and concepts of POMDPs are presented, as well as explanations and discussion about the basic form of POMDP solutions. This document is aimed at those who do not have a lot of experience with the techniques or concepts of POMDPs.
The Incompleteness of Misra and Chandy''s Proof Systems
Authors: Van L Nguyen
Venue:  (1984)

In this paper we show that Misra and Chandy''s proof systems for networks of communicating processes ([1, 2]) are incomplete.
Data Handles and Virtual Connections: High-level Support for Anonymous Reconfiguration
Authors: Bala Swaminathan, Kenneth J. Goldman
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Data handles and virtual connections are presented as a solution to the problem of supporting application-driven reconfiguration without sacrificing the separation of communication and computation. The solution supports anonymous reconfiguration, meaning that the module performing the reconfiguration and the modules affected by the reconfiguration need not be aware of each other's presence in the system. The solution allows modules to reconfigure the system within the limits of a specified communication structure while retaining support for dynamic end-user reconfiguration. The work is presented in the context of I/O abstraction, a programming model that defines the communication structure of a distributed system in terms of connections among narrow data interfaces of encapsulated modules. I/O abstraction supports dynamic end-user reconfiguration of distributed applications by separating the communication structure from the module definitions.
Continual coordination through shared activities
Authors: Bradley J. Clement, Anthony C. Barrett
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of real-time, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities over the lifetimes of multiple agents, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.
Symmetrization of Binary Random Variables
Authors: Kagan Abram, Mallows Colin L., Shepp Larry A., Vanderbei Robert J., Vardi Yehuda
Venue:  (1999)

A random variable $Y$ is called an independent symmetrizer of a given random variable $X$ if (a) it is independent of $X$ and (b) the distribution of $X+Y$ is symmetric about $0$. In cases where the distribution of $X$ is symmetric about its mean, it is easy to see that the constant random variable $Y = - \Exp X$ is a minimum-variance independent symmetrizer. Taking $Y$ to have the same distribution as $-X$ clearly produces a symmetric sum but it may not be of minimum variance. We say that a random variable $X$ is symmetry resistant if the variance of any symmetrizer, $Y$, is never smaller than the variance of $X$. Let $X$ be a binary random variable: $\Prob \{ X = a \} = p$ and $\Prob \{ X = b \} = q$ where $a \ne b$, $0 > p > 1$, and $q = 1-p$. We prove that such a binary random variable is symmetry resistant if (and only if) $p \ne 1/2$. Note that the minimum variance as a function of $p$ is discontinuous at $p = 1/2$. Dropping the independence assumption, we show that the minimum-variance reduces to $pq - \min (p,q)/2$, which is a continuous function of $p$.
Balanced Routing
Authors: Jorge A. Cobb, Mohamed G. Gouda
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

The distance vector routing protocol satisfies the following property. If this protocol is used to route a sequence of data messages from a source to a destination, then these data messages will follow the same shortest-distance path from the source to the destination. In this paper, we show how to modify this protocol, without adding new messages, in order to satisfy the following load balancing property. If the modified protocol is used to route a sequence of data messages from a source to a destination, then these messages will be uniformly distributed over all k-monotonic paths from the source to the destination, i.e., over all paths whose distance to the destination never increases at each hop, and may remain constant in at most k hops. In particular, by choosing k to be zero, the modified protocol distributes the data messages over all shortest-distance paths from the source to the destination.
A solution to the distribution and standardization of multimedia medical data in E-Health
Authors: Jinman Kim, David Dagan Feng, Tom Weidong Cai, Stefan Eberl
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

Electronic Patient Record (EPR) is an area of research in E-Health that is progressing rapidly due to its demand and rapid growth of Information Technology used in the Health Management Organizations (HMO). Benefits of having EPR are the timely access of critical data, inclusion of multimedia, and the ease of availability and distribution, those making it more presentable, distributable, efficient and cost-effective. A number of studies, ranging from global standardization of EPR to the building of the infrastructure to support it are being implemented. Along this trend, this paper discusses the problem in medical data standards and distribution. The proposed solution is an application that can adapt to the data used in the HMO that has the ability to automatically generate distributable EPR from any medical data.
ConSIT: A Conditioned Program Slicer
Authors: Sebastian Danicic, Chris Fox, Mark Harman, Rob Hierons
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Conditioned slicing is a powerful generalization of static and dynamic slicing, which has applications to many problems in software maintenance and evolution, including re-use, re-engineering and program comprehension. However, there has been relatively little work on the implementation of conditioned slicing. Algorithms for implementing conditioned slicing necessarily involve reasoning about the values of program predicates in certain sets of states derived from the conditioned slicing criterion, making implementation particularly demanding. This paper introduces ConSIT, a conditioned slicing system that is based upon conventional static slicing, symbolic execution and theorem proving. ConSIT is the first fully automated implementation of conditioned slicing.
Rendezvous Primitives for Operating System Design
Authors: Charles D Pevsner
Venue:  (1982)

A well chosen, comprehensive set of kernel primitives is essential for the construction of higher levels of a computer''s operating system. In particular, although many solutions to the classical operating system problems of interprocess synchronization and communication have been proposed in the past, difficulties with destination naming and language construct symmetry have continued to mar most proposed solutions. This thesis proposes a set of primitives, the Rendezvous primitives, that form the kernel of an operating system. It is argued that the Rendezvous primitives constitute a reasonable and practical set of operations on which to base an operating system. The Rendezvous primitive itself is presented as a solution to the interprocess synchronization and communication problems. A rendezvous occurs when two processes synchronize and subsequently exchange messages. Rendezvous is symmetric, in that processes that wish to communicate both use the same primitive; and processes invoke Rendezvous with class designations, not procedure names. Rendezvous is presented within the context of the other primitives, which support the restriction of access to Rendezvous, process creation and destruction, process scheduling, and stack resource management. A comparison of Rendezvous and existing primitives and language constructs to solve interprocess synchronization and communication is made. The full syntax and semantics of the Rendezvous primitives are presented, along with a discussion of their design rationale. The Crossbar Switch, a generalized virtual device interconnection and reconfiguration scheme, is presented as an example of the use to which the Rendezvous primitives might be put. A high level program description of the Crossbar Switch is presented as well. The thesis concludes with a description of the implementation of the Rendezvous kernel on a DEC PDP 11/60. The kernel code is given in an appendix. 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
Dependence Analysis for Recursive Data
Authors: Yanhong A. Liu
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

This paper describes a general and powerful method for dependence analysis in the presence of recursive data constructions. The particular analysis presented is for identifying partially dead recursive data, but the general framework for representing and manipulating recursive substructures applies to all dependence analyses. The method uses projections based on general regular tree grammars extended with notions of live and dead, and defines the analysis as mutually recursive grammar transformers. To guarantee that the analysis terminates, we use %appropriate finite grammar abstract domains or carefully designed approximations. We describe how to approximate argument projections with grammars that can be computed without iterating and how to approximate resulting projections with a widening operation. We design an approximation operation that combines two grammars to give the most precise deterministic result possible. All grammar operations used in the analysis have efficient algorithms. The overall analysis yields significantly more precise results than other known methods.
Special Year on Logic and Algorithms Tutorial Notes: Random Finite Models (Tutorial Lectures by James Lynch)
Authors: James Lynch
Venue:  (1997)

The 1995-1996 DIMACS Special Year on Logic and Algorithms began with three week-long tutorial sessions on the topics of the special year: Finite Model Theory Proof Complexity Computer-Aided Verification These notes on the lectures given by James Lynch were compiled by Eric Allender from the notes supplied by Thomas Wilke, James Lynch, Sandeep K. Shukla, Helmut Veith, and Ida Pu.
Collective or scattering: evolving schooling behaviors to escape from predator
Authors: Tamon Oboshi, Shohei Kato, Atsuko Mutoh, Hidenori Itoh
Venue: Proceedings of the eighth international conference on Artificial life (2002)

In this paper, we consider an artificial life, model of the fish behavior, and discuss the mechanism of fish school behavior by making it acquire the school behavior by evolutionary computation. An artificial ecology where fishes and a predator coexist is considered and we enhance one of the models for fish schooling with the ability to sense a predator's approach. This paper proposes an evolutionary method for the acquisition of evading behavior against predator. This paper also shows our computer simulation of the prey-predator system, and reports well simulated prey behaviors, especially evading behaviors of the predator with advantage of schooling.
Minimizing Communication Conflicts with Load-Skewing Task Assignment Techniques on Network of Workstations
Authors: Wei Xie, Wei-Ming Lin
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In a bus-based network of workstations, a perfectly load balance arrangement does not always lead to the best performance due to potential communication resource conflicts. Such a situation arises when workstations tend to compete for the shared bus after they all finish their assigned workload at about the same time under such a load arrangement. In this paper, we provide a thorough analysis on how such communication conflicts can be minimized in a bus-based system by using a load-skewing assignment method. A probablistic model is used to analyze the needed skewing factor for a one-stage divide-and-conquer programming paradigm. Our analytical results are closely confirmed by various simulation and experiment outcome. The proposed technique can also be extended to handle multi-stage cases.
Analysis of Hard Real-Time Systems
Authors: Abha Moitra
Venue:  (1985)

In this paper we study hard real-time systems: systems where strict time deadlines have to be met. We analyze a special case as well as a general model for hard real-time systems and study pre-emptive, static, scheduling policies for a single processor. The analysis is exact and can handle any arbitrary choice of strict deadlines. For any specification of a hard real-time system, a feasible priority assignment is one where all deadlines are met. An optimal scheduling algorithm is an algorithm that always produces a feasibile priority assignment if one exists. For both the special and general model we present an optimal scheduling algorithm.
Getting Useful Gender Statistics from English Text
Authors: John Hale, Eugene Charniak
Venue:  (1998)

Gender, understood as a lexical feature, is important for anaphora because it narrows down the number of possible referents involved in a typical pronoun resolution situation. This work describes an automatic method for obtaining reliable guesses about the gender of entities in a corpus using free text. By using a simple but unreliable anaphora algorithm repeatedly over a large corpus, the probable genders of referenced entities can be compiled and given a salience ranking. These statistics are an inexpensive way to add on gender-feature information to a statistical anaphora resolution algorithm.
Extensions of the Reduction Process in the Wong-Youssefi Strategy for Query Processing
Authors: Gary Haggard, Dale Skeen
Venue:  (1982)

NO SUPPLIED
Exploring the space of emotional faces of subjects without acting experience
Authors: J. Hendrix, Zs Ruttkay
Venue:  (2000)

The current state of semi-automated facial animation demands better understanding of how facial expressions are produced by real people. As a first step of a series of empirical studies, we investigated snapshots of facial expressions of the six basic emotions, produced by 18 subjects in `out of context'' sessions. The MPEG-4 coded vectors were analysed on principal components and canonical variates, which served as a basis to draw conclusions about the (for the negative emotions: lack of) generic characteristics of the six emotions and their mutual distances. Our results are compared to ones obtained by facial image analysis and human perception researchers.
Performance Analysis and Optimization of Asynchronous Circuits Produced by Martin Synthesis
Authors: Steven M. Burns
Venue:  (1990)

We present a method for analyzing the timing performance of asynchronous circuits, in particular, those derived by program transformation from concurrent programs using the synthesis approach developed by Martin. The analysis method produces a performance metric (related to the time needed to perform an operation) in terms of the primitive gate delays of the circuit. Because the gate delays are functions of transistor sizes, the performance metric can be optimized with respect to these sizes. For a large class of asynchronous circuits -- including those produced by the Martin synthesis -- these techniques produce the global optimum of the performance metric. A CAD tool has been implemented to perform this optimization.
Site-Locking Protocol for Global Concurrency Control in Multidatabase Systems
Authors: Kyu-Woong Lee, Myung-Joon Kim, Seog Park
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Many researches in managing global transactions in multidatabase systems(MDBS) have been proposed to solve problems of ensuring the global serializability. In these method, a few opportunities are provided to the global transaction to execute concurrently. We concentrate our attention on 1) maintaining consistent database state that is defined by global integrity constraints and 2) investigation into the more accurate indirect conflict situation so that the global transaction manager(GTM) of MDBS provides the higher degree of concurrency. In this paper, we propose a site-locking concurrency control method in MDBS. In our method the more global transaction can be concurrently executed, since the refined boundary of possibility of indirect conflict is offered.
Two-Level Method for Solids on Unstructured Meshes
Authors: Radek Tezaur, Petr Vanek, Marian Brezina
Venue:  (1996)

We propose an abstract two-level algorithm with convergence independent of the coarse-space size. The abstract algorithm is applied to problems of solids discretized on unstructured meshes. With no regularity assumptions and jumps in Young modulus. Numerical experiments confirm the theory and show that the method works well even if some assumptions of the theory are violated.
The study of three-body interaction Hamiltonian on a lattice
Authors: Subramanian Balakrishna, Lebowitz Joel
Venue:  (1999)

We investigate the phase diagram and the segregation kinetics of a system of particles with three-body interactions on a two dimensional square lattice. We compare this to the usual case of pair interactions which have particle-hole symmetry. Our simulations suggest that the kinetics belong to the same universality class as the symmetric model with pair interactions.