ppxscal/embedding_network huggingface dataset:
Structuring Remote Object Systems for Mobile Hosts with Intermittent Connectivity
Authors: Girish Welling, Maximilian Ott
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

In distributed object systems, remote method invocation attempts to abstract communication between different machines to the level of object method invocation. Link failure in such systems often appears as a failed method invocation, which must be explicitly handled outside the remote object infrastructure. This usually implies that techniques to handle the effects of link failure are embedded within application functionality. The resulting application can become unnecessarily specialized to a particular environment, restricting the situations where it could be used. In this paper, we explore the possibility of cleanly decoupling policies for handling a link failure from the application.With this goal in mind, we present extensions to the Java RMI system in the context of a distributed system with mobile hosts. An intermittent communication link is typical in such systems, and applications use techniques such as data caching or queuing of method calls to alleviate the effects. We show how such techniques and policies can be implemented generically so that not only does the application become oblivious of them, but also policies can be chosen dynamically depending on a particular situation.
A methodology of separating images from text using an OCR approach
Authors: N. G. Bourbakis
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

This paper presents a document processing methodology based on an OCR approach. The document methodology separates text from images by keeping their relationships for a possible reconstruction of the original page. The text separation and extraction is based on a hierarchical framing process. The process starts with the framing a single character, after its recognition, continues with the framing of a word, and ends with the framing of all text lines.
Quiescent Reliable Communication and Quiescent Consensus in Partitionable Networks
Authors: Marcos K Aguilera, Wei Chen, Sam Toueg
Venue:  (1997)

We consider partitionable networks with process crashes and lossy links, and focus on the problems of reliable communication and consensus for such networks. For both problems we seek algorithms that are quiescent, i.e., algorithms that eventually stop sending messages. We first tackle the problem of reliable communication for partitionable networks by extending the results of [ACT97a]. In particular, we generalize the specification of the heartbeat failure detector HB, show how to implement it, and show how to use it to achieve quiescent reliable communication. We then turn our attention to the problem of consensus for partitionable networks. We first show that, even though this problem can be solved using a natural extension of ><S, such solutions are not quiescent --in other words, ><S alone is not sufficient to achieve quiescent consensus in partitionable networks. We then solve this problem using ><S and the quiescent reliable communication primitives that we developed in the first part of the paper. Our model of failure detectors for partitionable networks, a natural extension of the model in [CT96], is also a contribution of this paper.
Energy Management for Dynamically Reconfigurable Heterogeneous Mobile Systems
Authors: Paul J. M. Havinga, Lodewijk T. Smit, Gerard J. M. Smit, Martinus Bos, Paul M. Heysters
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

Dynamically reconfigurable systems offer the potential for realising efficient systems as well asproviding adaptability to changing system requirements. Such systems are suitable for futuremobile multimedia systems that have limited battery resources, must handle diverse data types, and must operate in dynamic application and communication environments. We propose an approach in which reconfiguration is applied dynamically at various levels of a mobile system, whereas traditionally, reconfigurable systems mainly focus at the gate level only. The research performed in the CHAMELEON project 1aims at designing such a heterogeneous reconfigurable mobile system. The two main motivations for the system are 1) to have an energy-efficient system, while 2) achieving an adequate Quality of Service for applications.
Normalized volumes of configurations related with root systems and complete bipartite graphs
Authors: Hidefumi Ohsugi, Takayuki Hibi
Venue: Discrete Mathematics (2003)

Let Φ ⊂ Zn denote one of the classical irreducible root systems An-1, Bn, Cn, and Dn, and write Φ(+) for the configuration consisting of all positive roots of Φ together with the origin of Rn. Gelfand, Graev and Postnikov, in: V.I. Arnold, I.M. Gelfand, M. Smirnov, V.S. Retakh (Eds.), Arnold-Gelfand, Mathematics Seminars, Geometry and Singularity Theory, Birkhäuser, Boston, 1997, pp. 205-221 showed that by constructing an explicit unimodular triangulation, the normalized volume of the convex hull of An-1(+) is equal to the Catalan number. On the other hand, Fong (Triangulations and Combinatorial Properties of Convex Polytopes, Dissertation, MIT Press, Cambridge, MA, 2000) computed the normalized volume of the convex hull of each of the configurations Bn(+), Cn(+) and Dn(+). Moreover, the normalized volume of the convex hull of the subconfiguration of An-1(+) arising from a complete bipartite graph was computed by Ohsugi and Hibi (Illinois J. Math. 44 (2000) 391) and Fong. The purpose of the present paper is, via the theory of Gröbner bases of toric ideals and triangulations, to compute the normalized volume of the convex hull of each of the subconfigurations of Bn(+), Cn(+) and Dn(+) arising from a complete bipartite graph.
Numerical Simulation of a Steady-State Electron Shock Wave in a Submicron Semiconductor Device
Authors: L C Gardner
Venue:  (1990)

The hydrodynamic model plays an important role in simulating the behavior of charge carriers in submicron semiconductor devices, since it exhibits hot carrier effects missing in the standard drift-diffusion model. The hydrodynamic equations are just the Euler equations of gas dynamics for a gas of charged particles in an electric field, with the addition of a heat conduction term. Thus the hydrodynamic model PDEs have hyperbolic, parabolic, and elliptic modes. The nonlinear hyperbolic modes support shock waves. The first numerical simulations of a steady-state electron shock wave in a semiconductor device are presented, using the hydrodynamic model. For the ballistic diode (which models the channel of a MOSFET), the shock wave is fully developed in Si (with a 1 volt bias) at 300 K for a 0.1 micron channel and at 77 K for a 1.0 micron channel.
Big Storage: Make or Buy?
Venue: Queue (2003)

We hear it all the time. The cost of disk space is plummeting. Your local CompUSA is happy to sell you a 200-gigabyte ATA drive for $300, which comes to about $1,500 per terabyte. Go online and save even more—$1,281 for 1 terabyte of drive space (using, say, 7X Maxtor EIDE 153-GB ATA/113 5400-RPM drives).
Case-Analysis Based Fixpoint Semantics for Disjunctive Logic Programs; David W. Reed
Authors: T B Smith
Venue:  (1990)

We present a fixpoint semantics for disjunctive logic programs. The motivation behind our semantics is the splitting rule, which reduces the problem of determining logical consequence from a disjunctive program to a se tof cases utilizing only Horn programs. We define two operators, a {\bf case operator} which captures all of the information obtainable via Horn cases, and a {\bf joint operator} which combines this Horn case information to capture the consequences of the original program. The main advantages of this case-analysis based approach are a close correlation to the well understood Horn semantics of van Emden and Kowalski [8], and the ability to neatly focus attention on the interesting class of definite (single atom) consequences of a program. We also discuss the relationship between our semantics and the near-Horn Prolog procedure [4,5,6].
Partial Resolution in Data Value Predictors
Authors: Toshinori Sato, Itsujiro Arita
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Recently, the practice of speculation in resolving data dependences has been studied as a means of extracting more instruction level parallelism (ILP). Value predictors predict an outcome of an instruction. The instruction and its dependent instructions can be executed simultaneously, thereby exploiting ILP aggressively. One of the serious hurdles for realizing data speculation is huge hardware budget of the predictors. In this paper, we investigate a technique reducing the budget by employing partial resolution, using fewer tag address bits than necessary to uniquely identify every instruction. Simulation results show only two tag bits are enough for achieving performance improvement comparable to full resolution, saving the hardware budget of value predictors substantially.
Spelling Correction and Systems Programming
Authors: Howard L. Morgan
Venue:  (1969)

Several specialized techniques are shown to make the incorporation of spelling correction algorithms into compilers and operating systems efficient. These include the use of syntax and semantics information, restricted keyword and symbol table organizations, and consideration of only a limited class of spelling errors. The number of debugging runs per program has been cut down by using systems which perform spelling correction, saving both programmer and machine time. Key Words and Phrases: spelling correction, error correction, debugging, compilers, operating systems, diagnostics, error detection, misspelling, lexical analysis, systems programming.
Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking
Authors: Edmund Clarke, Orna Grumberg, Kenneth McMillan, Xudong Zhao
Venue:  (1994)

Model checking is an automatic technique for verifying sequential circuit designs and protocols. An efficient search procedure is used to determine whether or not the specification is satisfied. If it is not satisfied, our technique will produce a counterexample execution trace that shows the cause of the problem. Although finding counterexamples is extremely important, there is no description of how to do this in the literature on model checking. We describe an efficient algorithm to produce counterexamples and witnesses for symbolic model checking algorithms. This algorithm is used in the SMV model checker and works quite well in practice. We also discuss how to extend our technique to more complicated specifications. This extension makes it possible to find counterexamples for verification procedures based on showing language containment between various types of @g(w)-automata.
CALDER CONNECTIONS: An intercultural simulation game
Authors: Sandra M. Fowler
Venue: Simulation and Gaming (2003)

A model or a slice of a model is often the referent underlying a simulation game. CALDER CONNECTIONS is a short simulation game developed to illustrate one element in a model connecting art and culture. CALDER CONNECTIONS helps participants understand the range of impressions, knowledge, and connections they bring to art and any intercultural encounter. In other words, the role of the viewer in art (or in life) is the centerpiece of this game. The author describes the development of the game, how it is played using art postcards, and how the learning from the game can be applied.
New Techniques for Accelerating Fault Injection in VHDL Descriptions
Authors: B. Parrotta, M. Rebaudengo, M. Sonza Reorda, M. Violante
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

Simulation-based Fault Injection in VHDL descriptions is increasingly common due to the popularity of top-down design flows exploiting this language. However, the large CPU time required to perform VHDL simulations often represents a major drawback stemming from the adoption of this method. This paper presents some techniques for reducing the time to perform the Fault Injection experiments. Static and dynamic methods are proposed to analyze the list of faults to be injected, and for removing faults as soon as their behavior is known. Common features available in most VHDL simulation environments are also exploited. Experimental results show that the proposed techniques are able to reduce the time required by a typical Fault Injection campaign by a factor ranging from 51% to 96%.
Administrator''s Guide to the Digital Signature Facility "Rover"
Authors: Matt Bishop
Venue:  (1990)

This document describes the installation and maintenance of the rover utility, which provides a digital signature capability for internet messages. 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
A Fault-tolerant Strategy for Real-time Task Scheduling on Multiprocessor System
Authors: Hamidzadeh Babak
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

With more and more multiprocessor computers coming to the market and applications, system reliability is becoming a key issue of the multiprocessor systems. As there is an inherent characteristic of redundancy existing in the multiprocessor systems, the way to raise the reliability of the system is turned to software strategy rather than hardware redundancy. Aiming at realizing fault tolerance and making better utilization of system resources, this paper presents a fault tolerant strategy to raise the reliability for the multiprocessor systems, which utilizes a common class of operating system algorithm referred to as Self- Scheduling (SS).Simulation results have been analyzed to show the feasibility of the proposed fault tolerant policy.
Introducing human-like hearing perception in intelligent virtual agents
Authors: Pilar Herrero, Angélica de Antonio
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Although, at this moment, there are not many researches on perceptual models for Intelligent Virtual Agents, the few that exist are more focused on visual than on hearing perception. This paper describes the work that the Universidad Politicnica de Madrid, in collaboration with the University of Nottingham, is carrying on, with the aim of endowing Intelligent Virtual Agents with a synthetic model of human-like hearing perception. We have based the design and development of this model on Endsley studies about situational awareness [10,11], where perception can be understood as the first level of awareness. This perceptual model also extends and reinterprets the key concepts introduced by a CSCW model of awareness known as the Spatial Model of Interaction [4]. In this paper, we give an overview of those studies related to our work and we describe how we have achieved our purposes: selecting an agent architecture; re-defining and reinterpreting the set of key concepts introduced by the Spatial Model of Interaction; and analysing those factors that make the auditory perceptual model more realistic. We also expose how a mathematical function can describe the agents clarity of perception and how this model of perception has been implemented and evaluated.
Tool and method reciprocity: a case study in requirements management
Authors: R. Gallant, M. Winokur, J. Kudish
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

This Paper Appears in : Computer Systems and Software Engineering, 1996., Proceedings of the Seventh Israeli Abstract: The paper examines the reciprocal influence of method, process and tool as evidenced in a case study in which a requirements management method and process were defined, evolved and applied on projects. Although a tool is primarily a means of implementing a defined method, it is inevitable that the evolution of the method and process will be influenced by the chosen tool. In the case study two tools were examined. This examination yielded important insights into requirements management issues. These insights contributed to the refinement of their defined method and process, as well as helping us identify desired tool improvements that would better support the process. Based on experience with actual projects it is argued that organizational maturity is a key factor in determining when and how to introduce a method-process-tool troika.
Query Processing in a Device Database System
Authors: Philippe Bonnet, Johannes Gehrke, Tobias Mayr, Praveen Seshadri
Venue:  (1999)

In the next decade, networks of devices will be widely deployed for measurement, detection and surveillance applications. Millions of sensors and small-scale mobile devices will integrate processors, memory and communication capabilities. Large collections of devices need to be controlled and accessed in an ad-hoc manner. This paper shows that database technology can be adapted to meet the challenges of this new computing environment. In our new concept of a device database system, individual devices are modeled as database objects, which allows us to access collections of devices with declarative queries. We present a semantics for queries over device database systems and novel query processing techniques for evaluating such queries. We describe our implementation of these techniques in the Cornell COUGAR system and present a experimental evaluation that illustrates the performance characteristics of query processing in a device database system.
Mathematics as Programming
Authors: Robert L. Constable
Venue:  (1983)

In a sufficiently rich programming language it is possible to express a very substantial amount of mathematics in a natural way. I don''t mean only that one can write down functions or solve equations, I mean that one can write theorems and proofs. Moreover, expressing mathematics in this way reveals its computational content and makes it available for use with digital computers. This point is illustrated with reference to a programming language which is sufficiently rich in the above sense. I develop parts of Basic Recursive Function Theory and logic to illustrate the way in which doing some rather abstract mathematics is like programming. I chose BRFT in order to make certain points about the programming language by reflecting part of it inside itself. For example, while Church''s Thesis can be false inside the language, it is true outside, reflecting in some sense the fact that while we may believe it, we do not expect to prove it. I chose a bit of logic to illustrate that the virtues of model theory (a certain abstractness and notation independence) are sometimes possible without sacrificing computational meaning.
Generalized Hierarchical Completely-Connected Networks
Authors: Toshinori Takabatake, Keiichi Kaneko, Hideo Ito
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

In this paper, a new network structure called generalized Hierarchical Completely-Connected networks (HCC) is proposed, and its properties and features are evaluated. A set of the HCCs constructed by the proposed method includes some conventional hierarchical networks, then it is called generalized one. The construction of an HCC is started from a basic block (a level-$1$ block) which consists of $n$ nodes with a constant degree. Then a level-$h$ ($h \geq 2$) block is constructed recursively by interconnecting any pair of macro nodes ($n$ level-($h-1$) blocks) completely. An HCC has the constant node degree regardless of increasing its size (the number of nodes). Furthermore, since an HCC has the hierarchically structured character and the feature of uniformity, a wide variety of inter-cluster connections are possible.
Larchant-RDOSS: a distributed shared persistent memory and its garbage collector
Authors: Marc Shapiro, Paulo Ferreira
Venue:  (1994)

Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and of locks, collecting objects unreachable from the persistent root, writing reachable objects to disk, and reducing store fragmentation. Memory management is based on a novel garbage collection algorithm, that approximates a global trace by a series of local traces, with no induced I/O or locking traffic, and no synchronization between the collector and the application processes. This results in a simple programming model, and expected minimal added application latency. The algorithm is designed for the most unfavorable environment (uncontrolled programming language, reference by pointers, distributed system, non-coherent shared memory) and should work well also in more favorable settings.
Service without Servers
Authors: Chris Maeda, Brian N. Bershad
Venue:  (1993)

We propose a new style of operating system architecture appropriate for microkernel-based operating systems: services are implemented as a combination of shared libraries and dedicated server processes. Shared libraries implement performance critical portions of each system service, while dedicated servers implement the parts of each service that do not require high performance or that are difficult to implement in an application. Our initial experiments show that this approach to operating system structure can yield performance that is comparable to monolithic kernel systems while retaining all the modularity advantages of microkernel technology. Since services reside in libraries, an application is free to use the library that is most appropriate. This approach can even yield better performance than monolithic kernel systems by allowing the shared libraries to be closely coupled with the applications, thereby exploiting application-specific knowledge in policy decisions.
On the definition of surface potentials for finite-difference operators
Authors: Tsynkov S.V.
Venue:  (2001)

For a class of linear constant-coefficient finite-difference operators of the second order, we introduce the concepts similar to those of conventional single- and double-layer potentials for differential operators. The discrete potentials are defined completely independently of any notion related to the approximation of the continuous potentials on the grid. We rather use an approach based on differentiating, and then inverting the differentiation of, a function with surface discontinuity of a particular kind, which is the most general way of introducing surface potentials in the theory of distributions. The resulting finite-difference "surface" potentials appear to be solutions of the corresponding system of linear algebraic equations driven by special source terms. The properties of the discrete potentials in many respects resemble those of the corresponding continuous potentials. Primarily, this pertains to the possibility of representing a given solution to the homogeneous equation on the domain as a variety of surface potentials with the density defined on the domain''s boundary. At the same time, the discrete surface potentials can be interpreted as one specific realization of the generalized potentials of Calderon''s type, and consequently, their approximation properties can be studied independently in the framework of the difference potentials method by Ryaben''kii. The motivation for introducing and analyzing the discrete surface potentials was provided by the problems of active shielding and control of sound, in which the aforementioned source terms that drive the potentials are interpreted as the acoustic control sources that cancel out the unwanted noise on a predetermined region of interest.