ppxscal/embedding_network huggingface dataset:
Analysis of Data Replication with Two Levels of Consistency
Authors: Manoj Misra, Isi Mitrani
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

A system employing data replication is structured as a two-level logical hierarchy. Replicas at level 0 maintain strong consistency, while those at level 1 may contain out-of-date information. Accesses which change the data have to be executed at level 0, and require an appropriate quorum of replicas. Read requests may be executed either at level 0 or at level 1, depending on whether the most recent information is required or not. A read quorum is necessary in the former case, but not in the latter. The performance and reliability characteristics of the system are evaluated by means of two models - one with reliable servers and one with random breakdowns and repairs. Much of the analysis is exact, but there are also some approximations.
Dome: Parallel Programming in a Heterogeneous Multi-User Environment
Authors: Jose N Arabe, Adam Beguelin, Bruce Lowekamp, Erik Seligman, Mike Starkey, Peter Stephan
Venue:  (1995)

Writing parallel programs for distributed multi-user computing environments is a difficult task. The Distributed object migration environment (Dome) addresses three major issues of parallel computing in an architecture independent manner: ease of programming, dynamic load balancing, and fault tolerance. Dome programmers, with modest effort, can write parallel programs that are automatically distributed over a heterogeneous network, dynamically load balanced as the program runs, and able to survive compute node and network failures. This paper provides the motivation for and an overview of Dome, including a preliminary performance evaluation of dynamic load balancing for distributed vectors. Dome programs are shorter and easier to write than the equivalent programs written with message passing primitives. The performance overhead of Dome is characterized, and it is shown that this overhead can be recouped by dynamic load balancing in imbalanced systems. Finally, we show that a parallel program can be made failure resilient through Dome''s architecture independent checkpoint and restart mechanisms.
Compressed Video Communications
Authors: Abdul H. Sadka
Venue:  (2002)

:Compressed Video Communications addresses the compression and transmission of coded video streams over mobile IP networks. By analysing a broad spectrum of compression techniques and error resilience algorithms this book provides realistic solutions to the problems of quality degradation and transmission error.Features include:Discussion of the real-time transmission of coded video streams over mobile IP packet networks such as GPRS and UMTS, at both application and transport level.Descriptions of relevant rate control schemes such as bit rate regulation, scaleability and resolution reduction.Evaluation of the performance of compression techniques and comparison of available video coding standards.Comprehensive overview of homogeneous and heterogeneous video transcoding algorithms and error resilient transcoders.Examination of error control in video communications including coverage of error resilience and decoder-based error concealment.Accompanying CD-ROM containing 50 video clips illustrating the temporal and spatial quality achieved by the compression techniques outlined in the text.Highlighting the quality of service issues associated with transmission over mobile networks, Compressed Video Communications is an essential guide for communications engineers and multimedia systems designers. This overview of the basic technologies and applications of digital video compression will also appeal to researchers and graduate students in the field.
Lessons Learned from a Trial Application of Requirements Modeling Using Statecharts
Authors: C. R. Nobe, W. E. Warner
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

A project is described in which statechart modeling is applied to the development and validation of system behavior in a state-of-the-practice organization. A group of systems engineers modeled the behavior of diverse airplane systems. The lessons learned by these engineers are described and categorized as lessons about statechart modeling and lessons about tool features that do a good job of supporting statechart modeling. While statecharts provided a robust semantic with which to model behavior, the most powerful experience for the users came from their ability to see the effect of their models via the tool's dynamic simulation and interactive animation features.
An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networks
Authors: J. Sairamesh, D. F. Ferguson, Y. Yemini
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Proposes a new methodology based on economic models to provide quality of service (QoS) guarantees to competing traffic classes (classes of sessions) in packet networks. The authors consider an economic model of a packet network where resources are priced. Traffic classes compete for network resources and they purchase them to satisfy their QoS needs. The authors provide a new definition for QoS provisioning based on economic models (Pareto efficiency). They obtain the set of optimal resource allocations (Pareto optimal) which provide QoS guarantees to competing traffic classes. They show the impact on equilibrium prices and optimal allocations due to traffic load and variability, and QoS requirements. They propose packet scheduling and admission policies to provide QoS guarantees to traffic classes based on available QoS and prices in the network.
Making Use of JavaScript
Authors: Shweta Bhasin
Venue:  (2002)

:In order to create highly dynamic and interactive Web sites, more and more companies are hiring experts to incorporate scripting languages. JavaScript is one such language that while easy to master, enables you to add new life to the Web. This book provides you with everything you need to begin programming with JavaScript. Bhasin first presents a detailed introduction to the basics of the language, covering concepts such as data types, literals, expressions, and operators. She then shows you how to progress from developing basic applications with JavaScript to more advanced ones using browser objects, cookies, plugins, layers, and server-side scripting. Throughout each chapter, Bhasin includes extensive real-world exercises and case studies that will help you gain valuable exposure to procedures you can use to design your own Web sites.
A Development Methodology for Concurrent Programs
Authors: Bryan Chow, Andrew Fyfe, Daniel Maskit, Stephen Taylor, Jarrell R. Watts, Yair Zadik
Venue:  (1994)

This paper describes a development methodology for the design of concurrent programs that provides a migration path from existing sequential C and FORTRAN programs. These programs may be executed immediately, without change, using the entire physical memory of a distributed memory machine or a network of ATM-coupled shared-memory multiprocessors. Subsequent program refinements may involve data and control decomposition together with explicit message passing to improve performance. Each step in the program development may utilize new hardware mechanisms supporting shared memory, segmentation and protection. The ideas presented in this paper are currently being implemented within the Multiflow compiler which is being targetted for the M-Machine. Although the examples we present use the C programming language, the concepts will also be available in FORTRAN.
Nonverbal indicators of malicious intent: affective components for interrogative virtual reality training
Authors: Frederic McKenzie, Mark Scerbo, Jean Catanzaro, Mark Phillips
Venue: International Journal of Human-Computer Studies (2003)

Models of affective behavior are critical for the development of training systems that are designed to exercise social interactions. Potential applications include various security-oriented operations such as police interrogation, airport security, border crossings, and military peacekeeping. Aside from speech, humans also communicate through vocalizations and inflections, as well as with body language. Such nonverbal communication can convey affect such as anger or nervousness that is important in identifying deception. In this research, a trainee is asked to perform checkpoint duty and question drivers of vehicles about their identity and reasons for entering a secured area. Most of the encounters are routine and innocuous, but occasionally a scenario unfolds that requires additional interrogation and rapid decision-making the part of the trainee. These special scenarios require the individual to draw upon his/her knowledge of social interactions in order to make the proper decisions and act appropriately. Virtual environments that address this form of training are few. Accordingly, the present paper describes an ongoing program of research designed to generate affective states for intelligent agents, create affective component behaviors to convey cues for anger, nervousness, and deception, and provide a complex interrogative training environment to exercise judgment-based decision-making.
Availability and Consistency in a Partitionable Low Bandwidth Network
Authors: Takako Hickey
Venue:  (1998)

The Internet is a partitionable low bandwidth network. Two computers connected by the Internet could temporarily become unable to communicate for various reasons, from a failure at either end, to overloading of an intermediate node connecting the two, to an out-of-date routing table. The bandwidth of the Internet is relatively low: its data transfer speed is inadequate for applications that need to access very large data objects. Since its introduction the Internet kept a much faster rate of increase for the data available than for the data transfer speed. This trend is not likely to change any time soon. This thesis presents techniques to deal with availability and consistency in partitionable low bandwidth networks, and it presents a service suitable for use in such networks. The first part of the thesis presents replication techniques suitable in a partitionable network. A partitionable network puts goals of availability and consistency at odds. Making objects available in a partitionable network requires replication; yet modifications of replicated objects during a partition can introduce inconsistencies. We show various replication techniques that provide continuous availability while managing inconsistencies among replicas. The second part of the thesis describes the PEX system, an example of a service that instantiates these abstractions. PEX is an execution service that facilitates processing of remote data. It allows computations to be performed near data, so that data need not be copied over the network. It provides a session interface which facilitates the management of related computations operating on scattered data. Internally, PEX replicates various information, including sessions, using some of the techniques introduced in the first section of the thesis. This permits the system to keep computations running in the face of partitions. The third part of the thesis gives two example applications that use PEX (a distributed shell and a parallel make) and reports the performance of the PEX system.
New results on flow time with resource augmentation
Authors: L. Epstein, Rob Stee
Venue:  (2000)

We study the problem of scheduling $n$ jobs that arrive over time. We consider a non-preemptive setting on a single machine. The goal is to minimize the total flow time. We use extra resource competitive analysis: an optimal off-line algorithm which schedules jobs on a single machine is compared to a more powerful on-line algorithm that has $l$ machines. We design an algorithm of competitive ratio $O(\min(\Delta^{1/l},n^{1/l}))$, where $\Delta$ is the maximum ratio between two job sizes, and provide a lower bound which shows that the algorithm is optimal up to a constant factor for any constant $l$. The algorithm works for a hard version of the problem where the sizes of the smallest and the largest jobs are not known in advance, only $\Delta$ is known. This gives a trade-off between the resource augmentation and the competitive ratio. We also consider scheduling on parallel identical machines. In this case the optimal off-line algorithm has $m$ machines and the on-line algorithm has $lm$ machines. We give a lower bound for this case. Next, we give lower bounds for algorithms using resource augmentation on the speed. Finally, we consider scheduling with hard deadlines.
Efficient Automated Testing of Cryptographic Protocols
Authors: bibliothek ARRAY(0x817b860) EMAIL::
Venue:  (1998)

We present a search method for detecting potential security flaws in cryptographic protocols. The method can find flaws which are inherent in the design of the protocol as well as flaws arising from the particular implementation of the protocol. The latter possibility arises from the fact that there is no universally accepted standard for describing either the cryptographic protocols themselves or their implementation. Thus, security can (and in practice does) depend on decisions made by the implementer, who may not have the necessary expertise. Our method relies on automatic theorem proving tools. Specifically, we used "Otter", an automatic theorem proving software developed at Argonne National Laboratories. 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
Exact Monte Carlo for Few-Fermion Systems
Authors: Malvin H. Kalos
Venue:  (1991)

We have reconsidered the fundamental difficulties of fermion Monte Carlo as applied to few-body systems. We conclude that necessary ingredients of successful algorithms include the following: There must be equal populations of random walkers that carry positive and negative weights. The positions of positive walkers should be selected from a distribution that uses Green''s functions to couple all walkers. The positions of negative walkers should be generated from those of positive walkers by means of odd permutations. The correct importance functions that take into account the global interactions of the populations are different for positive and negative walkers. Use of such importance functions breaks the symmetry that otherwise would exist between configurations (of the entire population) and configurations derived by interchanging positive and negative walkers. Based upon these observations, we have constructed a stable and accurate algorithm that solves a fully-polarized three-dimensional three-body model problem.
HP Hyperplex(r) Clustering Technology
Authors: D. Charlu
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

HP HyperPlex (r) is a clustering technology that leverages HP platforms, mass storage and interconnect products to provide customers with mission-critical high availability and increased processing capacity. A HyperPlex cluster consists of two or more symmetric multiprocessing (SMP) nodes, an interconnect, mass storage options, and a centrally-managed operating environment. Further, HyperPlex solutions lower costs by consolidating resources and increasing users' productivity. This paper describes the technologies for each of these components, the features and benefits of Hewlett-Packard's HyperPlex implementation, and the software that complements these technologies. 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
Vstyle: a coding style analyzer for synthesizable Verilog
Authors: B. Gelinas
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

The paper describes the implementation of Vstyle, a proprietary Verilog coding style checker implemented in yacc and c. The emphasis is not on any particular set of coding practices, but on how to craft a tool which validates that coding practices are being followed. As with any proprietary tool, the benefits must be weighed with the cost of development and support. The paper demonstrates a method of implementation which delivers the most basic style verification with a modest coding effort, and which can be extended over time to yield increasing benefit.
Running Linux on the Xbox
Authors: Michael Steil
Venue: Linux Journal (2003)

The Xbox is basically a PC, so with a little work you can upgrade it to run your OS of choice. 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
The Role of Net Angular Momentum in Pump/Probe Spectroscopy: Absorption, Refringence, Scattering, and Nuclear Resonance
Authors: M. W. Evans
Venue:  (1990)

Applied net angular momentum (J) has the same role in spectroscopy as applied magnetic flux density (B), both having the same parity and motion reversal symmetry. This simple statement appears to have profound consequencies [sic], especially in the context of non-linear optics, where J can be generated by a pump laser. These are explored for pump/probe spectroscopy involving absorption, refringence and scattering in the semi-classical Rayleigh theory. It is shown that there are phenomena analogous to those induced by B, exemplified by the spin chiral class of circular and axial birefringence/dichroism (analogues of the Faraday and Wagniere/Meier effects produced by B); and pump laser induced Rayleigh/Raman optical activity; analogues of scattered optical activity induced by B. Nuclear effects of the pump laser induced J are introduced as nuclear electromagnetic resonance (N.E.R.).
Global IT Management - a Practical Approach
Authors: Robert Barton
Venue:  (2003)

:IT functions in many large corporations are either contemplating or actually undergoing a globalization of their IT operations. The two major business drivers behind the move to globalize IT are to reduce the costs by the co-ordination of the operations and, more importantly, to integrate business processes.Global IT Management is based on practical experience that covers the essentials of process, communications and maintenance.* Provides a practical keep-it-simple approach* Offers a streamline process* Presents a model to ensure affiliate buy-in
A Formal Syntax for PL/CS
Authors: Tim Teitelbaum
Venue:  (1976)

This document contains a formal syntax for the PL/CS programming language. As is customary, the defining context-free grammar generates a somewhat larger language than PL/CS. That is, only those restrictions conveniently expressed by context-free productions are incorporated in the definition. However, all legal PL/CS programs are contained in the language defined. With some exceptions, the formal syntax defines the language described in: Conway, R., "PL/CS A Highly-Disciplined Subset of PL/C", Dept. of Computer Science, Cornell University, TR 76-273. The present report supersedes this earlier report as the document defining the syntax of the PL/CS subset.
The AMA Handbook of E-Learning: Effective Design, Implementation, and Technology Solutions
Authors: American Management Association
Venue:  (2003)

:This authoritative sourcebook is a timely decision-making tool for companies making the transition to (or already using) e-learning.Featuring all-original contributions from high-profile practitioners and renowned theorists, the book reveals how top companies are implementing and using this crucial employee development tool. Topics include: * analyzing organizational need * selling e-learning to the organization * learning management systems * synchronous collaboration * learning portals * repurposing materials * outsourcing and vendor relations. Other chapters focus on motivation and retention, technological and software options, measuring ROI, and more. Author Biography: George M. Piskurich (Macon, GA) is the author of The ASTD Handbook of Training Design and Delivery and a consultant on learning technology, organizational performance, and instructional design.
A Novel Technique for Noise-Tolerance in Dynamic Circuits
Authors: Sumeer Goel, Tarek Darwish, Magdy Bayoumi
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Nosie issues in deep sub-micron CMOS VLSI circuitshave an importance comparable to area, delay and powerconsumption issues due to aggressive scaling trends indevices and interconnections.An attempt has been madeto address this problem in this paper.A new technique tomake dynamic CMOS circuits noise tolerant has beenproposed in this paper.Simulation results for a dynamic-CMOS NAND gate and a dynamic-CMOS 1-Bit full-adder circuit show that the propsed technique has an improvement in ANTE of 6.0X over conventional dynamiclogic.The proposed technique, in comparison with thetwin transistor technique, proves to improve ANTE by2.8X.There is a large power dissipation incurred duringthe evaluation period for certain input combinations.
The Morphosyntactic Analyser for Italian
Authors: Irina Prodanof
Venue:  (1996)

Documentation on MIRA, the natural language front-end for Italian TEL:: +39 50 560481
Action selection in continuous state and action spaces by cooperation and competition of extended kohonen maps
Authors: Kian Hsiang Low, Wee Kheng Leow, Marcelo H. Ang,  Jr.
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper presents an action selection framework based on an assemblage of self-organizing neural networks called Cooperative Extended Kohonen Maps. This framework encapsulates two features that significantly enhance a robot's action selection capability: self-organization in the continuous state and action spaces to provide smooth, efficient and fine motion control; action selection via the cooperation and competition of Extended Kohonen Maps to achieve more complex motion tasks. Qualitative tests demonstrate the capability of our action selection method for both single- and multi-robot motion tasks.
Computing a Trust Region Step for a Penalty Function
Authors: Thomas F. Coleman, Christian Hempel
Venue:  (1987)

We consider the problem of minimizing a quadratic function subject to an ellipsoidal constraint when the matrix involved is the Hessian of a quadratic penalty function (i.e., a function of the form $p(x) = f(x) + \frac{1}{2\mu} c(x)^{T} c(x))$. Most applications of penalty functions require $p(x)$ to be minimized for values of $\mu$ decreasing to zero. In general, as $\mu$ tends to zero the nature of finite precision arithmetic causes a considerable loss of information about the null space of the constraint gradients when $\nabla^{2}p(x)$ is formed. This loss of information renders ordinary trust region Newton''s methods unstable and degrades the accuracy of the solution to the trust region problem. The algorithm of More and Sorenson [1983] is modified so as to be more stable and less sensitive to the nature of finite precision arithmetic in this situation. Numerical experiments clearly demonstrate the stability of the proposed algorithm.