ppxscal/embedding_network huggingface dataset:
Safety Assurance via On-Line Monitoring (Extended Abstract)
Authors: Shlomi Dolev, Frank Stomp
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

This paper proposes a new approach and new techniques for on-line monitoring of concurrent programs to ensure that some of their safety properties are not violated. The techniques modify erroneous systems which violate a certain safety property, into new systems which satisfy the safety property by adding a new layer that controls the scheduling of steps in the system. We formally characterize the relationship between the erroneous and the new system. Safety monitors for mutual-exclusion, l-exclusion, and the producer consumer tasks are presented. A proof for the mutual-exclusion task is presented to demonstate the applicability of our approach. Our results are also of significance in the context of evolving systems--systems which are repeatedly modified due to changes in the user requirements, user specifications, or implementation. The monitoring technique proposed here ensures that safety requirements are not violated in such evolving systems, in spite of frequent changes.
A Migration-friendly Tasking Environment for Gardens
Authors: Siu Ashley Beitz
Venue:  (1997)

Gardens is a parallel computing environment that is capable of adapting at runtime to a changing set of available processors. It relies on the concept of migration to allow the application components (known as tasks) to move from one processor to another. This paper discusses the tasking environment needed to realise Gardens. The goal of this environment is to provide the runtime system with tasks that can easily and efficiently be migrated. It achieves this by employing the following features: a medium-grained unit of migration, global synchronisation, a heap management facility that supports migration and seed tasks. 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
Requirements Volatility and Defect Density
Authors: Yashwant K. Malaiya, Jason Denton
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Ideally the requirements for a software system should be completely and unambiguously determined before design, coding and testing take place. In practice, often there are changes in the requirements, causing software components to be redesigned, deleted or added. This requirements volatility causes the software to have a higher defect density.In this paper we analytically examine the influence of requirement changes taking place during different times by examining the consequences of software additions, removals and modifications. We take into account interface defects which arise due to errors at the interfaces among software sections. We compare the resulting defect density in the presence of requirement volatility, with the defect density that would have resulted had requirements not changed. The results show that if the requirement changes take place close to the release date, there is a greater impact on defect density. In each case we compute the defect equivalence factor representing the overall impact of requirement volatility.
Efficient fault protection of block gradient-based adaptive filters
Authors: Liangkung Lin, G. R. Redinbo
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Adaptive FIR filters are important in modern digital signal processing applications, and many situations require significant computational power attainable only through multi-processor configurations. Various block processing techniques have been proposed as viable alternatives to the sequential implementations to achieve the high throughput rate and reduce the effect of finite word length. While there are algorithm-based fault-tolerant techniques for protecting general digital signal processing systems against temporary/permanent failures, the specific features and requirements of the adaptive filtering systems have been largely ignored in the fault tolerance literature. By identifying common operations among different block adaptive filtering algorithms, however most operations of a particular algorithm can be protected with reasonably low-cost. We present a fine-grained approach, a highly efficient implementation of the well-known checksum encoding scheme, for protecting block adaptive filters. Through properly partitioning the input data, checksums for a parallel adaptive FIR filter can be calculated with reduced complexity. Computational and hardware overhead of the proposed scheme are analyzed, and shown to be proportional to the total number of partitioned submatrices.
Queueing and Fluid Analysis of Partial Message Discarding Policy
Authors: Parijat Dube, Eitan Altman
Venue: Queueing Systems: Theory and Applications (2003)

We consider a stream of packets that arrive at a queue with a finite buffer. A group of consecutive packets constitutes a frame. We assume that when an arriving packet finds the queue full, not only is the packet lost but also the future packets that belong to the same frame will be rejected. The first part of the paper deals with a detailed packet level queueing model; we obtain exact expressions for the stationary queue length distribution and the goodput ratio (i.e. the fraction of arriving frames that experience no losses). The second part deals with a fluid model and the fluid analysis leads to simple closed form expressions for the stationary workload process and the fluid goodput ratio.
Microsoft SQL Server 2000 Bible, 1 edition
Authors: Paul Nielsen
Venue:  (2002)

:Here's everything you need to harness the power of SQL Server 2000, Microsoft's high-performance, Web-enabled client/server database and data analysis package. With a focus on performance and data integrity, database expert Paul Nielsen shows you how to design performance into your database from day one. From basic installation to working with XML, monitoring, and performance tuning -- a topic so hot, it merits an entire section -- Nielsen provides clear instructions, sound theory, and a special "Best Practice" icon that points to the most effective way to accomplish a given task. It's more than a guidebook; it's your total SQL Server 2000 toolkit. 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
Landmarks for absolute localization
Authors: Howell Jon, Kotay Keith
Venue:  (2000)

For certain experiments in mobile robotics, it is convenient to eliminate positional estimation error in the interest of analyzing other parts of the experiment. We designed and implemented a simple, accurate scheme for encoding and recovering absolute position information. The encoding is a two-dimensional image printed on the plane of the floor, and the absolute position information is recovered using a downward-looking video camera mounted on a mobile robot.
Energy-Efficient Initialization Protocols for Radio Networks with no Collision Detection
Authors: Koji Nakano, Stephan Olariu
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

A radio network (RN, for short) is a distributed system consisting of n radio stations. The initialization problem is to assign each of the n stations of the RN a unique ID. The initialization problem is non-trivial since the stations are assumed indistinguishable. The main contribution of this work is to propose energy-efficient randomized initialization protocols for RNs lacking collision detection capabilities. We show that if the number n of stations is known beforehand, the single-channel RN can be initialized by a protocol that terminates, with probability exceeding1 - 1/n, in O(n) time slots, with no station being awake for more than O(log log n) time slots.
Power Consumption and Performance Analysis of Real-Time Speech Translator Smart Module
Authors: D. Reilly, D. Siewiorek, A. Smailagic
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

The paper describes a system level design approach to the power and performance of a dedicated application wearable computer, the Speech Translator Smart Module. While processor, speed and type affect power consumption and performance, memory size, and type of secondary storage have an even greater influence. In particular, the time to swap information in/out of main memory can reduce the performance of a wearable computer by more than half.
Stabilization Techniques and Subgrid Scales Capturing
Authors: F. Brezzi, L. P. Franca, T. J. R. Hughes, A. Russo
Venue:  (1996)

We present an overview of stabilized finite element methods and of the standard Galerkin method enriched with residual-free bubble functions. The inadequacy of the standard Galerkin method using piecewise polynomials is discussed for different applications; the treatment using stabilized methods in their different versions is reviewed; and the connection to the standard Galerkin method with richer subspaces follows using the subgrid method or the residual-free-bubbles viewpoint. We close with a discussion on how to approximate the exact problem suggested by residual-free bubbles.
I/O in the Gardens Non-Dedicated Cluster Computing Environment
Authors: Paul Roe, Siu Yuen Chan
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Gardens is an integrated programming language and system designed to support parallel computing across non-dedicated cluster computers, in particular networks of PCs. To utilize non-dedicated machines a program must adapt to those currently available. In Gardens this is realized by over decomposing a program into more tasks than processors, and migrating tasks to implement adaptation. Communication in Gardens is achieved via a lightweight form of remote method invocation. Furthermore I/O may be efficiently achieved by the same mechanism. All that is required is to support stable tasks which are not migrated - these are effectively bound to resources such as filesystems. The main contribution of this paper is to show how I/O may be achieved in an adaptive system utilizing task migration to harness the power of non-dedicated cluster computers.
The Multics input/output system
Authors: R. J. Feiertag, E. I. Organick
Venue: ACM SIGOPS Operating Systems Review (1972)

An I/O system has been implemented in the Multics system that facilitates dynamic switching of I/O devices. This switching is accomplished by providing a general interface for all I/O devices that allows all equivalent operations on different devices to be expressed in the same way. Also particular devices are referenced by symbolic names and the binding of names to devices can be dynamically modified. Available I/O operations range from a set of basic I/O calls that require almost no knowledge of the I/O System or the I/O device being used to fully general calls that permit one to take full advantage of all features of an I/O device but require considerable knowledge of the I/O System and the device. The I/O System is described and some popular applications of it, illustrating these features, are presented.
Expressing concurrency in Griffin
Authors: N. Afshartous, M. C. Harrison
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Griffin is a statically typed language designed specifically for the rapid prototyping of Ada software. In this paper we describe the Griffin language constructs for expressing concurrency. There are two salient innovations: (1) an extended select statement that provides greater flexibility in managing non-deterministic behavior and (2) the capability of a receiving thread to concurrently rendezvous with multiple sending threads. Thus by increasing concurrency, we alleviate the chief drawback to synchronous communication. We then apply the Griffin constructs in implementing solutions to the readers-writers problem, group lock mechanism, and scheduling groups of concurrent operations. The Griffin constructs facilitate the expression of high-level algorithms that maximize concurrency.
Connected Component and Simple Polygon Intersection Searching
Authors: K P Agarwal, van M Kreveld
Venue:  (1993)

\def\S{{\cal S}} \def\P{{\cal P}} \def\eps{\varepsilon} Efficient data structures are given for the following two query problems: preprocess a set $\P$ of simple polygons with a total of $n$ edges, so that all polygons of $\P$ intersected by a query segment can be reported efficiently, and (ii) preprocess a set $\S$ of $n$ segments, so that the connected components of the arrangement of $\S$ intersected by a query segment can be reported quickly. In these problems we do not want to return the polygons or connected components explicitly (i.e., we do not wish to report the segments defining the polygon or the segments lying in the connected components). Instead, we assume that the polygons (or connected components) are labeled and we just want to report their labels. We present data structures of size $O(n^{1+\eps})$ that can answer a query in time $O(n^{1/2+\eps} + k)$, where $k$ is the output size. If the edges of $\P$ (or the segments in $\S$) are orthogonal, the query time can be improved to $O(\log n + k)$ using $O(n\log n)$ space. We also present data structures that can maintain the connected components as we insert new segments. For arbitrary segments the amortized update and query time are $O(n^{1/2+\eps})$ and $O(n^{1/2+\eps} + k)$ respectively. If we allow $O(n^{4/3+\eps})$ space, the amortized update and query time can be improved to $O(n^{1/3+\eps})$ and $O(n^{1/3+\eps} +k)$, respectively. For orthogonal segments the amortized update and query time are $O(\log^2 n)$ and $O(\log^2 n + k \log n)$. Some other related results are also mentioned.
C# Text Manipulation Handbook, 1 edition
Authors: Wrox Press, Paul Wilton, Francois Liger
Venue:  (2002)

:The .NET Framework has a variety of string manipulation features, but incorrect or ill-considered use of these methods could drastically increase your memory and processor consumption. This book teaches you how to make use of regular expressions to match and replace text, and how to manipulate text using the various string matching, manipulation, and replacement classes. Issues such as Internationalization and data conversion will also be investigated.Every developer has to manipulate text, often on a regular basis. However, even an experienced C# developer may not have fully utilized the various options now made available through the .NET Framework. The StringBuilder class is one that provides much more memory-efficient string manipulation than when using the String object, whereas regular expressions, although popular in Perl and other UNIX/C-like languages, are unintelligible to those not proficient in this technology. Regular Expressions provide an incredibly powerful and compact way of matching and replacing text. The Internationalization chapter deals with ensuring that your application can be ported to different languages and character sets. This book is a one-stop shop for any developer who manipulates text, using concatenation or otherwise.
Going Virtual: Distributed Communities of Practice
Authors: Jatinder Gupta, Sushil Sharma
Venue:  (2003)

Creating Knowledge Based Organizations brings together high quality concepts closely related to organizational learning, knowledge workers, intellectual capital, virtual teams and will include the methodologies, systems and approaches needed to create and manager knowledge-based organizations of the 21st Century.
Bouncing Threads: Merging a New Execution Model into a Nanotechnology Memory
Authors: Sarah E. Frost, Arun F. Rodrigues, Charles A. Giefer, Peter M. Kogge
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

The need for small, high speed, low power computers asthe end of Moore's law approaches s driving research intonanotechnology. These novel devices have significantly different properties than traditional MOS devices and requirenew design methodologies, which in turn provide excitingarchitectural opportunities. The H-memory is a design developed for a particular nanotechnology, quantum-dot cellular automata. We propose a new execution model thatmerges with the H-memory to exploit the characteristics ofthis nanotechnology by distributing the functionality of theCPU throughout the memory structure.
An Asynchronous Recovery Scheme based on Optimistic Message Logging for Mobile Computing Systems
Authors: Taesoon Park, Heon Y. Yeom
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper presents an asynchronous recovery scheme to provide fault-tolerance for mobile computing systems. The proposed scheme is based on optimistic message logging, since the checkpointing-only schemes are not suitable for the mobile environment in which unreliable mobile hosts and fragile network connection may hinder any kind of coordination for checkpointing and recovery. Also, in order to reduce the overhead imposed on mobile hosts, mobile support stations take charge of logging and dependency tracking, and mobile hosts maintain only a small amount of information for mobility tracking. As a result, truly asynchronous recovery for mobile systems can be achieved with the little overhead.
Standards foundation for the Top Gun Design College
Authors: R. Milovanovic, S. Stockman, M. Norris
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The paper describes the successful use of DOD-STD-2167A elements, adapted for industrial use, in the training of the best software designers in a leading telecommunications company. The standards were used as the bridge between different technical cultures of different groups of designers, and provided significant return on investment. The adaptation started by recognizing that a commercial organization in general offers a multitude of products and services to the market, that they all belong to one or more domains, and that they (can) correspond to software configuration items. The Top Gun Design College was built by providing appropriate requirements specifications for college case studies. Each specification has a domain model, service specification, system specification, specifications of interfaces, and specifications of (software and other) configuration items. Case studies corresponded to real life projects. Both the real life projects and college exercises involved a multitude of methods and paradigms.
Large Fluctuations and Axiom-C Structures in Deterministically Thermostatted Systems
Authors: L. Rondoni, G. P. Morriss
Venue: Open Systems Information Dynamics (2003)

The Gallavotti-Cohen fluctuation theorem concerns large deviations in the time evolution of global quantities such as the phase space contraction rate of gaussian thermostatted particle systems, which in some cases is proportional to the entropy production rate. In this paper, we analyze the scaling properties of the probability distribution functions of the fluctuations of the phase space contraction rate of gaussian thermostatted shearing systems, at high shear rates. This leads us to argue that the dynamics of gaussian thermostatted shearing systems is closely related to that of the axiom-C systems defined by Bonetto and Gallavotti.
Modelling Transition Systems within an Action Based Logic
Authors: Alessandro Fantechi, Stefania Gnesi, Gioia Ristori
Venue:  (1995)

In this paper we study the ability of a logic to finitely characterize the complete behaviour of a system. Given a Labelled Transition System, we look for a formula of the logic that is satisfied by all and only the Labelled Transition Systems that are equivalent to it. The main result is that we are able to finitely characterize finite state Labelled Transition Systems, with respect to the classical notion of strong bisimulation equivalence, in a completely syntax driven way and using a logic without fixed points. The logic we have chosen is the action based version of CTL, known as ACTL, which is strictly less expressive than CTL TEL:: +39-50-593489 EMAIL:: gnesi@iei.pi.cnr.it
Constructing Approximation Models Based on Agent-Based Simulations by Genetic Algorithms
Authors: Yorikazu Takao, Isao Ono, Norihiko Ono
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper presents an agent-based simulation approach to the construction of Approximation models for macroscopic indices of economic and social systems(ESSs), in which a target ESS is modeled by a set of agents and the set is optimized by a genetic algorithm so as to behave similarly to the target ESS. Once an agent-based approximation model of an ESS has successfully been constructed, the ESS can be analyzed not only at macroscopic levels but also at microscopic levels through its agent-based simulations.To investigate thecapability of the proposed approach, we make some experiments on the U-Mart system.
Precedence constraints in hard real-time distributed systems
Authors: J. Orozco, R. Cayssials, J. Santos, E. Ferro
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Hard real-time multitask-multiprocessor systems are one of the more important species of the taxonomic genus of distributed systems. The assignment of m preemptible periodic tasks to be executed in a set of n processors (interconnected through a communications network) is a NP-complete problem that must meet several constraints: time, allocation, resources, communication and precedence. The first three are processor-dependent and the fourth is network-dependent, but all of them can be verified as the assignment process goes on. Precedence constraints, instead, can be best verified when a tentative assignment, meeting the first four constraints, is obtained. In this paper, a formally proved method is presented to validate tentative assignments. In order to solve the problem of jitter in data arrivals, timed release counters are proposed.
Comparison of Different Features of Quaternary Reed-Muller Canonical Forms and Some New Statistical Results
Authors: K. J. Adams, J. McGregor
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

An integrated set of utility programmes in C is presented. These can be usedto perform calculations in any quaternary Reed-Muller algebra by enteringaddition and multiplication tables, and the zero polarity transform matrix.For every completely specified quaternary function, canonical forms aregenerated for any pre-selected set of polarities. The laboratory is used togenerate statistics comparing realisation efficiency of five differentalgebras. A number of optimisation statistics were generated and discussed,and, based on our experiments, the number of non-zero coefficients in arepresentation seems a reasonable measure of complexity.
Co-Modal Browser-An Interface for Wearable Computers
Authors: Jonny Farringdon, Vanessa Oni, Chi Ming Kan, Leo Poll
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

This paper describes user tests on a co-modal browser, a general interface for wearable devices that can communicate through a browser. The co-modal browser is a Handheld Device Markup Language (HDML) browser with fully integrated visual display, synthetic speech, voice command, short sounds and buttons. The browser was tested for hands-free, eyes-free, and hands & eyes-free use. Usability test results are presented here of use to wearable computer researchers concerned with hands & eyes-free use. The co- modal concept is demonstrated as viable on an HDML browser.