ppxscal/embedding_network huggingface dataset:
The Weakest Failure Detector for Solving Consensus
Authors: Tushar D Chandra, Vassos Hadzilacos, Sam Toueg
Venue:  (1994)

We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In [CT91], we proved that $\Diamond\cal W$, a failure detector that provides surprisingly little information about which processes have crashed, is sufficient to solve Consensus in asynchronous systems with a majority of correct processes. In this paper, we prove that to solve Consensus, any failure detector has to provide at least as much information as $\Diamond\cal W$. Thus, $\Diamond\cal W$ is indeed the weakest failure detector for solving Consensus in asynchronous systems with a majority of correct processes.
GeoOOA: Object-Oriented Analysis for Geographic Information Systems
Authors: Georg Koesters, Bernd-Uwe Pagel, Hans-Werner Six
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

We stress the need of a domain-tailored requirements engineering method for the development of GIS-applications. To this end, we discuss three GIS-application scenarios, the so-called topological scenario, the network scenario and the (spatio-) temporal scenario, we frequently encountered in real life projects. Our investigations reveal that conventional RE-methods like e.g. Coad/Yourdon's Object-Oriented Analysis (OOA) are not capable to model GIS-specific requirements appropriately. To overcome the deficiencies of conventional OOA we introduce GeoOOA which complements OOA by suitable domain-tailored primitives and allows for a more adequate treatment of GIS-specific requirements. We provide GeoOOA-models of a broadcasting corporation, an electric power supply system and a land registry as first validation steps for the usefulness of GeoOOA.
Scalable Distributed Concurrency Services for Hierarchical Locking
Authors: Nirmit Desai, Frank Mueller
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Middleware components are becoming increasingly importantas applications share computational resources indistributed environments. One of the main challenges insuch environments is to achieve scalability of concurrencycontrol. Existing concurrency protocols lack scalability.Scalability enables resource sharing and computing withdistributed objects in systems with a large number of nodes.We have designed and implemented a novel, scalable andfully decentralized middleware concurrency control protocol.Our experiments on a Linux cluster indicate that anaverage number of three messages is required per lock requeston a system with as many as 120, which is a logarithmicasymptote. At the same time, the response timefor the requests scales linearly with the increase in concurrencylevel. A comparison to another scalable concurrencyprotocol shows that our protocol results in significantlysuperior asymptotic savings in message overheadand response time for large number of nodes. While ourapproach follows the specification of general CORBA concurrencyservices for large-scale data and object repositories,the principles are applicable to any distributed concurrencyservices and transaction models. The results ofthis work impact scalability for distributed computing facilitiesranging from embedded computing with distributedobjects over peer-to-peer computing environments to arbitratingaccesses in very large database environments.
BLITPAK II : A Parallel Implementation of Block Iterative Methods for Sparse Systems of Linear Algebraic Equations
Authors: T J Wilkes
Venue:  (1989)

In many scientific software applications, such as circuit simulation, the major computational costs are found in solving large systems of linear equations. The advancement of these applications is dependent on performing linear solves quickly. BLITPAK $||$ (parallel BLock ITerative PAcKage) is a set of FORTRAN and C subroutines designed to solve sparse systems of linear algebraic equations in parallel. The package is implemented on the BBN Butterfly GP1000, a scalable NUMA machine. This paper describes sequential and parallel block iterative methods, the implementation and use of the package, the parallel issues encountered during the implementation, and test results. A user''s guide is included as an appendix. The package offers many options, including several block iterative methods, direct or iterative solution of diagonal blocks, sparse or full storage of diagonal blocks, and various convergence criteria. Results show that significant speedups are obtainable in solving a particular class of sparse systems of linear algebraic equations through the use of parallel block iterative methods. 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
Source Code Files as Structured Documents
Authors: Jonathan I. Maletic, Michael L. Collard, Andrian Marcus
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

A means to add explicit structure to program source code is presented. XML is used to augment source code with syntactic information from the parse tree. More importantly, comments and formatting are preserved and identified for future use by developmentenvironments and program comprehension tools. The focus is to construct a document representation in XML instead of a more traditional data representation of the source code. This type of representation supports a programmer centric view of the source rather than a compiler centric view. Our representation is made relevant with respect to other research on XML representations of parse trees and program code. The highlights of the representation are presented and the use of queries and transformations discussed.
General Theory of Discourse
Authors: Giacomo Ferrari, Irina Prodanof, Michele Carenini
Venue:  (1991)

In these pages a General Theory of Discourse, GTD, will be described, some elements of which have been developed and used also in the IDEAL Project. Initially we were oriented towards a taxonomic approach to the construction of such a theory; however this approach allowed us only to identify a certain number of features of explanation dialogues; to use such features it became necessary to develop an alternative approach which gave account of a structure plausible to them. We focused on the relationship between explanation dialogues and discourse theory to emphasize the characteristics the former must have to be reasonably representative of the latter ones. It is obvious that a full theory of dialogic communication requires a highly structured and rich system of categories, which may turn out to be overdimensioned for the decription of dialogues in the field of explanation. The model presented in the following sections is, then, a reduced and domain oriented version of a more articulated theory of dialogue and discourse. TEL:: +39 50 560481
Succinctness of Descriptions of Unambiguous Context-Free Languages
Authors: Erik M Schmidt
Venue:  (1976)

There is no recursive function bounding the succintness gained using ambiguous grammars over unambiguous ones in the description of unambiguous context-free languages.
Low Cost Management of Replicated Data
Authors: Thomas A. Joseph
Venue:  (1985)

NOT SUPPLIED
Advanced SQL 1999: Understanding Object-Relational, and Other Advanced Features
Authors: Jim Melton
Venue:  (2002)

:Advanced SQL:1999 - Understanding Object-Relational and Other Advanced Features is the practitioner's handbook to the standard's advanced features. It is not a re-presentation of the standard, but rather an authoritative, in-depth guide to its practical application. Like its companion, SQL:1999 - Understanding Relational Language Components, which explained the standard's basic features, this book will show you how to make your applications both effective and standard-compliant.This handy reference has a modular format so you can explore specific topics with ease. It is equally useful to those upgrading from earlier versions of SQL and those with no previous experience. Written by the standard's distinguished editor, Advanced SQL:1999 will complete your knowledge and support your skills like no other book can.FeaturesFocuses entirely on the issues that matter to programmers who are connecting applications to databases.Details SQL:1999's object facilities, including structured user-defined types, typed tables, user-defined routines, and routine invocation.Examines facilities new to SQL, including those relating to on-line analytical processing (OLAP), management of external data (SQL/MED), and Java support.Covers the ongoing development of XML support.Includes appendices that cover the SQL:1999 annexes, a SQL:1999 example using UDTs, status codes, and useful information on the standardization process.About the Author:Jim Melton is editor of all parts of ISO/IEC 9075 (SQL) and representative for database standards at Oracle Corporation. Since 1986, he has been his company's representative tothe ANSI NCITS Technical Committee H2 for Database and a U.S. representative to ISO/IEC JTCI/SC32/WG3. He was the editor of SQL-92 and the recently published SQL:1999 suite of standards and is increasingly involved in standards related to querying XML and integrating SQL and XML. He is also the editor of the next generation of the SQL standards, currently under development, as well as an editor for the Functions and Operators specification currently being developed by the W3C XML Query Working Group. He is the author of several SQL books.
Evolving the morphology of a neural network for controlling a foveating retina: and its test on a real robot
Authors: Peter Eggenberger Hotz, Gabriel Gómex, Rolf Pfeifer
Venue: Proceedings of the eighth international conference on Artificial life (2002)

The standard approach in evolutionary robotics is to evolve neural networks for control by encoding the parameters of the network in the genome. By contrast, we have evolved a neural controller based on biological principles from molecular and developmental biology. The kay principles employed in our algorithms model the specific ligand-receptor interactions and gene regulation. These mechanisms were used to control the growth of the axons, the generation of synapses including the synaptic efficiencies (i.e. the synaptic weights in a neural network model). The evolved neural network was then transferred to a real robotic system with results comparable to the ones achieved the simulation. We hypothesize that the incorporation of mechanisms of gene regulation potentially leads to more adaptive neural networks, that can help bridging the "reality gap" between simulation and the real world.
Object state testing and fault analysis for reliable software systems
Authors: D. Kung, Y. Lu, N. Venugopalan, P. Hsia, Y. Toyoshima, C. Chen, J. Gao
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

Object state behavior implies that the effect of an operation on an object may depend on the states of the object and other objects. It may cause state changes to more than one object. Thus, the combined or composite effects of the object operations must be analyzed and tested. We show that certain object state behavior errors cannot be detected readily by conventional testing methods. We describe an object state test method consisting of an object state model, a reverse engineering tool, and a composite object state testing tool. The object state test model is an aggregation of hierarchical, concurrent, communicating state machines envisioned mainly for object state testing. The reverse engineering tool produces an object state model from any C++ program. The composite object state testing tool analyzes the object state behaviors and generates test cases for testing object state interactions. We show the detection of several composite object state behavior errors that exist in a well-known thermostat example.
Incremental Recompilation for Standard ML of New Jersey
Authors: Robert Harper, Peter Lee, Frank Pfenning, Eugene Rollins
Venue:  (1994)

The design and implementation of an incremental recompilation manager (IRM) for Standard ML of New Jersey (SML/NJ) is described. Truly separate compilation is difficult to implement correctly and efficiently for SML because one compilation unit may depend not only on the interface of another, but also on its implementation. In this paper we present an integrated compilation system based on the "visible compiler" primitives provided by SML/NJ that supports "smart recompilation" to minimize system build time in most situations. Large systems are presented as hierarchical source groups. An automatic dependency analyzer determines constraints on the order in which sources must be considered. By abstracting away from the specifics of the SML/NJ compiler, the IRM readily generalizes to arbitrary "compilation tools" such as parser generators and embedded languages.
Implementation of Multipliers in FPGA Structures
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper studies different solutions for carrying out multiplication: a fully functional multiplier denoted as Variable Coefficient Multiplier (VCM), Constant Coefficient Multiplier (KCM) and self-configurable multiplier denoted as Dynamic Constant Coefficient Multiplier (DKCM). For FPGAs which can be easily reconfigured, the choice between the VCM and KCM cannot be easily defined. Furthermore, the DKCM is an additional, middle-way between the KCM and VCM solution, as it offers shorter reprogramming time but occupies more area in comparison with the KCM. In FPGAs, the choice of the optimum multiplier involves three factors: area, propagation and reconfiguration time, which have been thoroughly studied and respective implementation results given. Furthermore, to speed-up implementation of multipliers a design-automated tool has been developed, which generates optimum (for given input parameters), VHDL description of multipliers.
Assignment to Subscripted Variables
Authors: David Gries
Venue:  (1977)

The assignment b(r):=e is investigated using two axiomatic definitions in order to gain an understanding of the problems involved with using arrays. It is seen that assignment to array elements leads to many of the difficulties encountered with pointers or references. The axiomatic definition is extended to cover the multiple assignment statement to both simple and subscripted variables, and a proof of correctness for a nontrivial program is outlined using the new definition. 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 Griesmer bound for linear codes over finite quasi-Frobenius rings
Authors: Keisuke Shiromoto, Leo Storme
Venue: Discrete Applied Mathematics (2003)

In this article we give a Griesmer type bound for linear codes over finite quasi-Frobenius rings and consider linear codes over these rings meeting the bound. And we study a geometrical characterization of linear codes over finite chain rings meeting the bound, that is, a one-to-one correspondence between these codes and minihypers in projective Hjelmslev spaces over these rings.
Fingerprint classification based on extraction and analysis of singularities and pseudoridges
Authors: Qinzhi Zhang, Kai Huang, Hong Yan
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

In this paper, we introduce a new approach to fingerprint classification based on both singularities and traced pseudoridge analysis. Since noise exists in most of the fingerprint images including those in the NIST databases which are used by many researchers, it is difficult to get the correct number and position of the singulairities such as core or delta points which are widely used in current structural classification methods. The problem is we may miss the true singular points and/or get false singular points due to the poor quality of fingerprint images. Classification based on exact pair of singulairities will fail in such conditions. With the help of the pseudoridge tracing and analysis of the traced curve, our method does not rely on the extraction of the exact number and positions of the true singular points, thus improving the classification accuracy. This method has been tested on the NIST-4 fingerprint database. For the 4000 images in this database, the classification accuracy is 95.3% with 11.8% reject rate for 4-class problem (combining Arch and Tented Arch as one class).
Flow Oriented Approach for Human-Centered Agile Manufacturing Systems
Authors: Naoki Tomita, Satoru Shibao, Masaru Omura, Masaharu Oku
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The recent individualization in customer demand and fluctuation in business environment require manufacturing systems to follow the changing small trends promptly. This paper proposes Flow Oriented Approach, a method to design manufacturing system information, to accelerate diversified autonomous improvement activities performed by personnel from many department. Based on this approach, raw data generated and used in manufacturing system are categorized according to work objectives, combined to messages, and made to flow through the system on autonomous decentralize system architecture. A tool on this architecture is also proposed for personnel to use manufacturing information selectively and promptly. This approach makes it possible to process data variously and extract useful information for improvement activities without disturbing on-line operation, in comparison with information sharing by shared files. The proposed approach has been applied to actual manufacturing systems and evaluated in several improvement activities.
Managing Code Assignment in Multi-Code CDMA Wireless Networks for the Delivery of H.263 Video Streams
Authors: Ming Liu, Wu-chi Feng, Urbashi Mitra, Ming T. Liu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

With the advance of wireless technologies, multimedia traffic will become more and more popular in the wireless networks. In this paper, we study the problem of how to efficiently distribute network resources among H.263 packet video streams in a multi-code CDMA network. Due to high flexibility of both the video encoding system and CDMA system, it is not trivial to find an optimal solution for the problem. We present different algorithms for transferring video in CDMA networks. We compare those algorithms in our simulation environment with multiple video users at different situations and show the results with various system loads. By observing those results, we come to the conclusion and come up with some guidelines fordesign code assignment algorithm for video traffic in wireless networks.
Analysis of Caching-Based Location Management in Personal Communication Networks
Authors: Karunaharan Ratnam, Ibrahim Matta, Sampath Rangarajan
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Personal communication networks support the delivery of communication services as the user moves from one region to another. When a mobile user/terminal receives a call, the network has to quickly determine its current location. The existing approach suffers from high delay in locating the mobile as it requires maintaining the current location in a stable storage that has to be always consulted to reach the mobile. To reduce this delay, many proposed schemes rely on caching the locations of mobiles, especially those which do not move too frequently. To measure mobility, the node that originates the call usually measures only those movements that it sees between successive calls to that mobile. In this paper, we present a caching scheme based on fully disseminating the location updates of mobiles to every node so as to increase the chance that the cache entry points to the correct location of the mobile user. We analyze our full dissemination based scheme and compare it to other caching and non-caching based schemes.
Natural Language Edit Controls: Constrained Natural Language Devices in User Interfaces
Authors: G. Hall, F. Poopwich, D. Fass
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The concept of "natural language edit controls" (NLECs) is introduced. NLECs are special purpose devices within graphical user interfaces (GUIs) for inputting part of a user' s query in natural language which, when combined with other GUI controls for inputting the remainder of the query, can be used to build the most effective interface for a particular application. NLECs require less grammatical and lexical information than the equivalent component of a traditional natural language interface, hence their customization and maintenance costs tend to be lower.
Approximation of the Stokes Problem by Residual-Free Macro Bubbles
Authors: L. P. Franca, A. Russo
Venue:  (1996)

Linear-constant velocity-pressure elements are enriched with residual-free macro bubbles. Static condensation prompts a stabilized method for this element, where mesh-dependent jumps of the normal stress are added across internal edges of the underlying macroelements. This procedure renders the SIMPLEST element stable.
An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs
Authors: A. S. Nepomniaschaya
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In this paper, we propose a novel associative parallel algorithm for selecting a critical cycle in directed weighted graphs by means of an abstract model of the SIMD type with vertical data processing (the STAR--machine). This problem arises when performing Edmonds' algorithm for finding optimum branchings. This algorithm is represented as the corresponding STAR procedure whose correctness is verified and time complexity is evaluated.
A Note on the Computation of an Orthonormal Basis for the Null Space of a Matrix
Authors: Thomas F. Coleman, Danny C. Sorensen
Venue:  (1982)

A highly regarded method to obtain an orthonormal basis, $Z$, for the null space of a matrix $A^{T}$ is the $QR$ decomposition of $A$, where $Q$ is the product of Householder matrices. In several optimization contexts $A(x)$ varies continuously with $x$ and it is desirable the $Z(x)$ vary continuously also. In this note we demonstrate that the standard implementation of the $QR$ decomposition does not yield an orthonormal basis $Z(x)$ whose elements vary continuously with $x$. We suggest three possible remedies.
Transportation Modeling: An Artificial Life Approach
Authors: Panta Lucic, Du"an Teodorovic
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Artificial Life (ALife) uses biological knowledge and techniques to help solve different engineering, management, control and computational problems. Natural systems teach us that very simple individual organisms can form systems capable of performing highly complex tasks by dynamically interacting with each other. The main goal of this paper is to show how we can use ALife concepts (inspired by some principles of natural swarm intelligence) when solving complex problems in traffic and transportation. The Bee System that represents the new approach in the field of Swarm Intelligence is described. It is also shown in the paper that ALife approach can be successful to "attack" transportation problems characterized byuncertainty. The Fuzzy Ant System (FAS) described in the paper represents an attempt to handle the uncertainty that sometimes exists in some complex transportation problems. The potential applications of the Bee System and the Fuzzy Ant System in the field of Traffic and Transportation Engineering are discussed.