ppxscal/embedding_network huggingface dataset:
A Task Scheduling Algorithm to Package Messages on Distributed Memory Parallel Machines
Authors: Noriyuki Fujimoto, Tomoki Baba, Takashi Hashimoto, Kenichi Hagihara
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

In this paper, we report a performance gap between a schedule with good makespan on the task scheduling model and the corresponding parallel program on distributed memory parallel machines. The main reason is the software overhead in the interprocessor communication. Therefore, speedup ratios of schedules on the model do not well approximate to those of parallel programs on the machines.The purpose of the paper is to get a task scheduling algorithm that generates schedules with good approximation to the corresponding parallel program. For this purpose, we propose an algorithm BCSH that generates only bulk synchronous style schedules. In those schedules, computation phases and communication phases appear alternately. All interprocessor communications are done only in the latter phases, and thus the corresponding parallel programs can make better use of the message technique easily. It reduces some software overheads of messages from a source processor to the same destination processor to almost one software overhead, and improves performance of a parallel program significantly.Finally, we show some results of performance between BCSH and Kruatrachue's algorithm DSH. schedules by the latter are famous for their good However, the approximations of ours are much better than those of Kruatrachue's.
Defining and Manipulating Symbolic Bit Flags in Assembly Language
Authors: Thomas R. Wilcox
Venue:  (1975)

NO SUPPLIED
Batteries and Power Supplies for Wearable and Ubiquitous Computing
Authors: Robert Hahn, Herbert Reichl
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

The paper discusses the energy storage requirements of wearable computer technology and identifies research topics for novel battery technologies. Three categories of devices with basically different battery requirements were defined. They comprise the wearable computer main unit, small devices which are distributed around the human body and active tags which enable situated and ubiquitous computing. There is a demand for small, high energy density rechargeable batteries witch enable a flexible design and for very low cost thin primary batteries for smart label active tags. Prototypes of 120 µm thick AgO-Zn batteries have been fabricated by a screen printing process. They can be directly integrated into plastic cards, smart labels and hybrid circuits.
Completeness Results for Recursive Data Bases
Authors: Tirza Hirst, David Harel
Venue:  (1995)

We consider infinite recursive (i.e., computable) relational data bases. Since the set of computable queries on such data bases is not closed under even simple relational operations, one must either make do with a very modest class of queries or considerably restrict the class of allowed data bases. We define two query languages, one for each of these possibilities, and prove their completeness. The first is the language of quantifier-free first-order logic, which is shown to be complete for the non-restricted case. The second is an appropriately modified version of Chandra and Harel''s language QL, which is proved complete for the case of ``highly symmetric" data bases, i.e., ones whose set of automorphisms is of finite index for each tuple-width. We also address the related notion of BP-completeness.
MEDEA - A Model for the Event-Based Data Exchange Architecture
Authors: Ruey-Kai Sheu, Shyan-Ming Yuan, Win-Tsung Lo
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Traditional data interchange mechanisms are based on the client/server model, which has confronted with plethora of problems. For example, bilateral partners must exchange data sets through recognized protocols. Whenever the data set is updated, data interchange participants have to rebuild their protocols as well as applications. It is really a considerable problem for system maintenance or scalability. In this paper, we propose an event-based data exchange model, called MEDE 1 A, to solve the problems encountered by traditional data exchange systems. The designed MEDEA data exchange framework and the learned experiences are also detailed.
Algorithms for Sequential Decision Making
Authors: Michael L Littman
Venue:  (1996)

Sequential decision making is a fundamental task faced by any intelligent agent in an extended interaction with its environment; it is the act of answering the question ``What should I do now?'''' In this thesis, I show how to answer this question when ``now'''' is one of a finite set of states, ``do'''' is one of a finite set of actions, ``should'''' is maximize a long-run measure of reward, and ``I'''' is an automated planning or learning system (agent). In particular, I collect basic results concerning methods for finding optimal (or near-optimal) behavior in several different kinds of model environments: Markov decision processes, in which the agent always knows its state; partially observable Markov decision processes (POMDPs), in which the agent must piece together its state on the basis of observations it makes; and Markov games, in which the agent is in direct competition with an opponent. The thesis is written from a computer-science perspective, meaning that many mathematical details are not discussed, and descriptions of algorithms and the complexity of problems are emphasized. New results include an improved algorithm for solving POMDPs exactly over finite horizons, a method for learning minimax-optimal policies for Markov games, a pseudopolynomial bound for policy iteration, and a complete complexity theory for finding zero-reward POMDP policies.
Decentralized Autonomous Object-Oriented EMS/SCADA System
Authors: Tomomichi Seki, Hideaki Sato, Toshibumi Seki, Tatsuji Tanaka, Hadime. Watanabe
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Usually Energy Management Systems/Supervisory Control and Data Acquisition (EMS/SCADA)systems are geographically distributed and have hierarchical operational organizations. They are continuously changing in accordance with the various and varying environments, and they should be flexible enough to adopt to those changes quickly. This paper proposes a new architecture called SCOPE(System Configuration Of PowEr control system) to realize flexible and reliable EMS/SCADA systems. SCOPE makes application programs independent of operational organization and system configuration of EMS/SCADA system, i.e., application programs are not influenced by changes in them. By these properties, EMS/SCADA systems become flexible and reliable, and also development of EMS/SCADA systems become efficient and economical. Through developing and evaluating a SCOPE prototype system, it has been confirmed that the flexibility and maintainability of EMS/SCADA systems based on SCOPE architecture had been improved.
Building Trust for Distributed Commerce Transactions
Authors: Jiawen Su, Daniel Manchala
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

The explosive growth of the Internet exposes unprecedented commercial opportunities over the network. The vast computer networks easily bring together customers and vendors who are physically distributed in different continents. Current research in electronic commerce mainly focuses on payment mechanisms. However, the global presence of customers and vendors makes it difficult to build trust among the parties involved in a transaction. In this paper, we will develop systematic mechanisms to address the trust problem in network commerce environment. We first develop protocols for single-customer single-vendor case where one customer buys goods from one vendor. Then we derive protocols for more complicated environments such as when a customer wants to buy goods from several vendors as part of a single transaction. Most of our protocols require some trusted third-party to intermediate transactions. However the workload and requirements placed on the trusted third-party vary from the whole goods and payment store-and-forward to very simple book-keepings of encryption keys. Our contributions also include an algorithm to find the optimal trusted agent.
Pilgrim Performance over a New CAliF Communication Layer
Authors: Éric Garcia, Jean-Christophe Lapayre, Gregori David
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

We defined in [Guy96] CAliF (Cooperative Application Framework): a platform for cooperative work applications. First, the both lower layers of CAliF have been developed separately: the interprocess communication layer CAliFCom and the shared memory layer where the Pilgrim, a new consistency protocol, is implemented. In this paper we show the qualities of CAliFCom, and we study Pilgrim performance over this interprocess communication layer. Results are promising, and thus, our system allows transparent handling of data sharing.
Surface Reconstruction from Multiple Views using Rational B-Splines
Authors: Matheen Siddiqui, Stan Sclaroff
Venue:  (2001)

Abstract A method for reconstructing 3D rational B-spline surfaces from multiple views is proposed. The method takes advantage of the projective invariance properties of rational B-splines. Given feature correspondences in multiple views, the 3D surface is reconstructed via a four step framework. First, corresponding features in each view are given an initial surface parameter value (s,t), and a 2D B-spline is fitted in each view. After this initialization, an iterative minimization procedure alternates between updating the 2D B-spline control points and re-estimating each feature''s (s,t). Next, a non-linear minimization method is used to upgrade the 2D B-splines to 2D rational B-splines, and obtain a better fit. Finally, a factorization method is used to reconstruct the 3D B-spline surface given 2D B-splines in each view. This surface recovery method can be applied in both the perspective and orthographic case. The orthographic case allows the use of additional constraints in the recovery. Experiments with real and synthetic imagery demonstrate the efficacy of the approach for the orthographic case.
An Agent-Based System for Electronic Commerce Using Recipes
Authors: Tamami Sugasaka, Kyoko Tanaka, Ryusuke Masuoka, Akira Sato, Hironobu Kitajima, Fumihiro Maruyama
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper proposes an agent-based system, called SAGE:Francis, to search a commodity or sets of commodities for electronic commerce. This system has the following functions, (1) to seamlessly integrate information about commodities distributed over networks by a conversational agents, (2) to search for commodity required by compound conditions, (3) to create a menu for a search for sets of commodities from legacy knowledge such as cooking recipes. This paper describes the system configuration, the interface between agents, and the experimental results. As a result, SAGE:Francis successfully supports users to search for sets of commodities by recipe-based menus and integrated information about commodities stored in databases over networks by conversational agents.
Facial feature location with Delaunay triangulation/Voronoi diagram calculation
Authors: Yi Xiao, Hong Yan
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature extraction is still a filed to be explored. In this paper, an automatic extracting algorithm is developed to locate "key points" of facial features. The Delaunay Triangulation/Voronoi Diagram technique well known in computational geometric is applied on the edge enhanced binarized facial image. Facial features are classified and extracted in terms of various types of Delaunay triangles and the dual of a subset of the Delaunay triangles, Voronoi edges form the skeleton of facial skin. That is, facial feature's shape is described by Delaunay Triangulation/Voronoi Diagram. Furthermore, the facial features can be identified. The method succeeds in locating facial features in the facial region exactly and is insensitive to face deformation. The method is executable in a reasonably short time.
Concurrency Control for Transactions with Priorities
Authors: Keith Marzullo
Venue:  (1989)

Priority inversion occurs when a process is delayed by the actions of another process with less priority. With atomic transactions, the concurrency control mechanism can cause delays, and without taking priorities into account can be a source of priority inversion. In this paper, three traditional concurrency control algorithms are extended so that they are free from unbounded priority inversion. Keywords: Priority inversion, concurrency control, real-time databases.
Multi-version Speculative Concurrency Control with Delayed Commit
Authors: Azer Bestavros, Biao Wang
Venue:  (1993)

Abstract This paper presents an algorithm which extends the relatively new notion of speculative concurrency control by delaying the commitment of transactions, thus allowing other conflicting transactions to continue execution and commit rather than restart. This algorithm propagates uncommitted data to other outstanding transactions thus allowing more speculative schedules to be considered. The algorithm is shown always to find a serializable schedule, and to avoid cascading aborts. Like speculative concurrency control, it considers strictly more schedules than traditional concurrency control algorithms. Further work is needed to determine which of these speculative methods performs better on actual transaction loads.
Using Pyramids in Mixed Meshes - Point Placement and Basis Functions
Authors: Vasiliki Chatzi, Franco P. Preparata
Venue:  (2000)

For mixed 3D finite element meshes (meshes that contain cubes and tetrahedra) pyramids are very convenient because they have both square and triangular faces and can therefore be used in implementing conformal transitions between regions that contain cubes and regions that contain tetrahedra. However, pyramids are rarely used, because the specification of basis functions for them is known to be problematic. Of specific importance it the development of Lagrangian basis functions for pyramids, since Lagrangian standard elements are the most commonly used type of elements today. In this paper, we present basis functions for pyramidal finite elements that can be used in Lagrangian meshes. The functions are ratios of polynomials, but reduce to polynomials on the boundaries of the shape. We also prove that polynomial basis functions for Lagrangian pyramids do not exist, and therefore the basis functions shown here are the simplest ones possible. We describe in detail a convenient and elegant method to obtain the basis functions for the order-k pyramid (for any k<0), which uses the functions for the order-(k-1) pyramid. A valid set of basis functions for the order-1 pyramid (which can be used as the basis of the construction) are also presented.
Bounded Hyperset Theory and Web-like Data Bases
Authors: Alexei Lisitsa, Vladimir Sazonov
Venue:  (1997)

It is demonstrated how a Hyperset Theory (satisfying P.Aczel''s Anti-Foundation Axiom) naturally arises from the idea of World-Wide Web (WWW). Alternatively, Web serves as an illustration and possible application of the abstract notion of antifounded sets. A $\Delta$-language of Bounded Hyperset Theory is presented as a query language to the Web or, more generally, to Web-like Data Bases (WDB). It is shown that it describes exactly all abstract (or generic, up to bisimulation) PTIME-computable queries with respect to (possibly cyclic) graph encoding of hypersets. This result is based (i) on reducing of the $\Delta$-language for hypersets to the language FO+LFP ( = First-Order Logic with the Least Fixed-Point operator) over graphs considered up to bisimulation relation and (ii) on definability in FO+LFP of a linear ordering on any strongly extensional finite graph by a single formula (cf.\ also DIMACS TR-97-05). The case of finitely branching, possibly infinite graphs and corresponding hypersets is also discussed. It corresponds to finitely-branching, but infinite Web. However, it deserves special further investigation.
An Example Of Risk Assessment Of Software Systems Specifications
Authors: H. H. Ammar, T. Nikzadeh, J. B. Dugan
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

This paper presents an example of risk assessment in complex real-time software systems at the early stages of development. A heuristic risk assessment technique based on colored Petri net (CPN) models is used to classify software according to its relative importance in terms of such factors as severity and complexity. The methodology of this technique is presented in a companion paper (Ammar et al., 1997). This technique is applied on the Earth Operation Commanding Center; a large component of NASA's Earth Observing System (EOS) project. Two specifications of the system are considered: a sequential model and a pipeline model. Results of applying the above technique to both CPN-based models yield different complexity measures. The pipeline model shows clearly a higher risk factor than the sequential model. Whereas using traditional complexity measures, the risk factors were similar in both models.
Breakpoints and Breakpoint Detection in Source Level Emulation
Authors: Gernot Koch, Udo Kebschull, Wolfgang Rosenstiel
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

In this paper we discuss, what breakpoints in Source Level Emulation are, how we can work with them and how we have to change the cicuit generated by high level synthesis to do so. We show the details of breakpoint encoding and detection in our approach. The presented approach allows for breakpoint detection by hardware means without seriously slowing down the circuit or dramatically increasing its size.
An Implementation of a Reactive Distributed Air Conflict Resolution System
Authors: Jean-Francois Bosc, Garfield Dean
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

The fast growth of air traffic that began during the 80's raises some questions about what future Air Traffic Control (ATC) systems will need to be. A major change will probably be required in Europe within a 30~years timeframe. Fortunately, recent developments in air navigation systems provide new opportunities for efficient autonomous navigation. Several studies have been conducted in order to develop automation in ATC, based either on centralized or distributed systems. An important part of the ATC task is to avoid separation losses (which are called ``conflicts'') between aircraft. This article presents an implementation of a reactive distributed conflict resolution method on a traffic simulator providing a realistic traffic sample. The method is described, and some results regarding its efficiency and its degradation with traffic increase are given. In particular, a critical traffic level appears, above which efficiency drops dramatically. This level depends on the method used; the airspace itself is not saturated.
RSVP for LEO Satellites
Authors: M. Villapol, J. Billington
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

The Internet Engineering Task Force (IETF) is working on extending the traditional TCP/IP model for supporting multimedia and real-time applications on the Internet. Thus, new protocols have been developed such as the Resource Reservation Protocol (RSVP). At the same time, there has been a growing interest in using Low Earth Orbit (LEO) satellites. In the near future, when the Internet with multimedia and real-time support is widely deployed, it will need to work over LEO satellite networks. This paper surveys the networking issues related to RSVP over LEO satellite networks. It also describes different approaches for extending RSVP for supporting satellite users.
Fault-Tolerant VLSI Processor Arrays Via Laser Welding'' Arnold L. Rosenberg.
Authors: L A Rosenberg
Venue:  (1984)

We study here a strategy for constructing fault-tolerant VLSI processor arrays that achieves tolerance to faults by running buses past the implemented PEs and configuring the fault-free ones into an array of the desired structure by ``welding'''' PEs into the bank of buses. We build here on earlier studies that have shown this strategy to be competitive in terms of area-efficiency and that have presented and analyzed fault-tolerant ``welded'''' implementations of linear arrays and tree-structured arrays. In this paper, we present and validate a methodology for designing fault-tolerant ``welded'''' implementations of a large variety of families of networks. For a large class of array structures (including, for instance, binary trees, rectangular grids, and cube-connected cycles), the designs produced by the methodology are optimal in area consumption (to within a constant factor) among such ``welded'''' fault-tolerant designs. Moreover, for the ``denser'''' of these arrays (all but the trees), the area of a fault-tolerant ``welded'''' design is just a small constant factor greater than the area of an arbitrary fault-free collinear layout of the array. We illustrate the methodology by deriving ``welded'''' fault-tolerant implementations of tree-structured arrays and rectangular-grid arrays.
Nonlinear behaviour of the RFNS element - large displacements and rotations
Authors: D. Briassoulis
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The reformulated four-node shell element has been shown to exhibit an excellent behaviour with respect to a well-known set of benchmark tests for shell elements. Recently the performance of the RFNS element was re-confirmed in terms of its asymptotic behaviour by means of classical and new limit tests. In the present paper, the RFNS formulation is extended to incorporate geometric nonlinear behaviour. The total Lagrangian formulation is employed. The RFNS element nonlinear formulation allows for large displacements and large rotations. An efficient performance of the new nonlinear shell element formulation is confirmed for the applications investigated.
Derivation of an Integrated Operational Profile and Use Case Model
Authors: Per Runeson, Björn Regnell
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

Requirements engineering and software reliability engineering both involve model building related to the usage of the intended system; requirements models and test case models respectively are built. Use case modelling for requirements engineering and operational profile testing for software reliability engineering are techniques which are evolving into software engineering practice. In this paper, approaches towards integration of the use case model and the operational profile model are proposed. By integrating the derivation of the models, effort may be saved in both development and maintenance of software artifacts. Two integration approaches are presented, transformation and extension. It is concluded that the use case model structure can be transformed into an operational profile model adding the profile information. As a next step, the use case model can be extended to include the information necessary for the operational profile. Through both approaches, modelling and maintenance effort as well as risks for inconsistencies can be reduced. A positive spin-off effect is that quantitative information on usage frequencies is available in the requirements, enabling planning and prioritizing based on that information.