ppxscal/embedding_network huggingface dataset:
Mass-Extinction: Evolution and the Effects of External Influences on Unfit Species
Authors: M. E. J. Newman, B. W. Roberts
Venue:  (1995)

We present a new model for extinction in which species evolve in bursts or ''avalanches,'' during which they become on average more susceptible to environmental stresses such as harsh climates and so are more easily rendered extinct. Results of simulations and analytic calculations using our model show a power-law distribution of extinction sizes which is in reasonable agreement with fossil data. We also see a number of features qualitatively similar to those seen in the fossil record. For example, we see frequent smaller extinctions in the wake of a large mass extinction, which arise because there is reduced competition for resources in the aftermath of a large extinction event, so that species which would not normally be able to compete can get a foothold, but only until the next cold winter or bad attack of the flu comes along to wipe them out.
Sequential Testing of Series-Parallel Systems of Small Depth
Authors: Boros Endre, Unluyurt Tonguc
Venue:  (1999)

We consider the problem of testing sequentially the components of a multi component system, when the testing of each component is costly. We consider a polynomial time testing policy for series-parallel systems, proposed in the literature. Generalizing published results, we prove that the considered policy is cost-minimal in the average case sense, for two sub-families of series-parallel systems. We also demonstrate via examples that neither this algorithm nor some of its improved versions are optimal for general series-parallel systems, disproving some published claims.
Impact of network transmission delay and echo on Group 3 facsimile performance
Authors: S. Dimolitsas, J. G. , . Jr. Phipps, M. H. Sherif
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

This paper provides information on a laboratory study conducted by COMSAT Laboratories to evaluate the effect of echo and delay on facsimile call retention rates. The term "call retention" is defined as the ability of a pair of facsimile terminals to maintain a circuit connection until all pages have been successfully transmitted after negotiation of the high speed signaling rate. The results of this study indicate that the effect of network echo has the potential of degrading facsimile call retention. In addition, propagation delay reduces retention rates even further. The results of this work are currently under consideration by the International Telecommunication Union (formerly CCITT) in the formulation of test methodologies for assessing facsimile terminal implementation performance.
SinusCone - A ThetaPhi Algorithm for Human Arm Animation
Authors: Huang Jing
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Arm animation algorithms are often categorized by their constraint expansion strategy. One option is the geometric bounding polygon-cone strategy, a simple containment search strategy that traverses the search space in the order in which successor-bounding polygon edges are generated. An alternative is the ThetaPhi-cone strategy, which was designed to make it possible to use domain-specific heuristic information. By exploring promising parts of the cone space first, ThetaPhi-cone algorithms generally are more efficient than polygon-cone algorithms.
Finding People by Sampling
Authors: Sergey Ioffe, David Forsyth
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

We show how to use a sampling method to find sparsely clad people in static images. People are modeled as an assembly of nine cylindrical segments. Segments are found using an EM algorithm, and then assembled into hypotheses incrementally, using a learned likelihood model. Each assembly step passes on a set of samples of its likelihood to the next; this yields effective pruning of the space of hypotheses. The collection of available nine-segment hypotheses is then represented by a set of equivalence classes, which yield an efficient pruning process. The posterior for the number of people is obtained from the class representatives. People are counted quite accurately in images of real scenes using an MAP estimate. We show the method allows top-down as well as bottom up reasoning. While the method can be overwhelmed by very large numbers of segments, we show that this problem can be avoided by quite simple pruning steps.
Diagnosability of Regular Systems
Authors: Antonio Caruso, Stefano Chessa, Piero Maestrini, Paolo Santi
Venue:  (2001)

A novel approach aimed at evaluating the diagnosability of regular systems under the PMC model is introduced. The diagnosability is defined as the ability to provide a correct diagnosis, although possibly incomplete. This concept is somehow intermediate between one-step diagnosability and sequential diagnosability. A lower bound to diagnosability is determined by lower bounding the minimum of a ''''syndrome-dependent'''' bound $t_\sigma$ over the set of all the admissible syndromes. In turn, $t_\sigma$ is determined by evaluating the cardinality of the smal\-lest consistent fault set containing an aggregate of maximum cardinality. The new approach, which applies to any regular system, relies on the ''''edge-isoperimetric inequalities'''' of connected components of units declaring each other non-faulty. This approach has been used to derive tight lower bounds to the diagnosability of toroidal grids and hypercubes, which improve the existing bounds for the same structures. TEL:: 0503152887 EMAIL:: caruso@iei.pi.cnr.it
Reconciling System Requirements and Runtime Behavior
Authors: M. S. Feather, S. Fickas, A. Van Lamsweerde, C. Ponsard
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

This paper considers the problem of runtime system deviations from requirements specifications. Such deviations may arise from lack of anticipation of possible behaviors of environment agents at specification time, or from evolving conditions in this environment. We discuss an architecture and a development process for monitoring system requirements at runtime to reconcile the requirements and the system's runtime behavior.This process is deployed on three scenarios of requirements-execution reconciliation for the Meeting Scheduler system. The work builds on our previous work on goal-driven requirements engineering and on runtime requirements monitoring.
Efficient Software Synchronization on Large Cache Coherent Multiprocessors
Authors: Peter Magnusson, Anders Landin, Erik Hagersten
Venue:  (1994)

Large-scale shared-memory multiprocessors typically have long latencies for remote data accesses. A key issue for execution performance of many common applications is the synchronization cost. The communication scalability of synchronization has been improved by the introduction of queue-based spin-locks instead of Test & (Test & Set). For architectures with long access latencies for global data, attention should also be paid to the number of global accesses that are involved in synchronization. We present a method to characterize the performance of proposed queue lock algorithms, and apply it to previously published algorithms. We also present two new queue locks, the LH lock and the M lock. We compare the locks in terms of performance, memory requirements, code size, and required hardware support. The LH lock is the simplest of all the locks, yet requires only an atomic swap operation. The M lock is superior in terms of global accesses needed to perform synchronization and still competitive in all other criteria. We conclude that the M lock is the best overall queue lock for the class of architectures studied.
The Effect of False-name Declarations in Mechanism Design: Towards Collective Decision Making on the Internet
Authors: Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

The purpose of this paper is to analyze a collective decision making problem in an open, dynamic environment, such as the Internet. More specifically, we study a class of mechanism design problems where the designer of a mechanism cannot completely identify the participants (agents) of the mechanism. A typical example of such a situation is Internet auctions.The main contributions of this paper are as follows: 1) We develop a formal model of a mechanism design problem in which false-name declarations are possible, and prove that the revelation principle still holds in this model.2) When false-name declarations and hiding are possible, we show that there exists no auction protocol that achieves Pareto efficient allocations in a dominant strategy equilibrium for all cases.3) We show a sufficient condition where the Clarke mechanism is robust against false-name declarations (the concavity of the maximal total utility of agents).
A Constructing Scheme for Autonomous Distributed Control Systems with Multi-Agent Society
Authors: S. Y. Huang, Y. Umetani, Y. Yamada
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

An autonomous distributed control (ADC), as a promising approach in dealing with complex control problems, is capturing the attentions of automation. Yet, there is still no available platform supporting its industrial applications. This paper introduce an ongoing project toward this goal carried out in our laboratory. In this work, we use agents and an agent society to model an ADC system. We propose a new agent architecture for intelligent machines, and a supervisor agent for human to provide a supervision control toagents. To facilitate the coordinating behaviors of agents, an agent communication language CCL is developed, and an object-oriented implementation of the agent system proposed is presented too, in this paper. Furthermore, the support system under development is introduced in simple. A case study concerning the shape control of a variable geometry truss is also given to show the availability of the agent system.
A Fault-Tolerant CORBA Name Server
Authors: Silvano Maffeis
Venue:  (1996)

OMG CORBA applications require a distributed naming service in order to install and to retrieve object references. High availability of the naming service is important as most CORBA applications need to access it at least once during their lifetime. Unfortunately, the OMG standards do not deal with availability issues, and the naming services of many of the commercially available CORBA object request brokers introduce single points of failure. In this paper we describe the design and implementation of a replicated, highly-available CORBA name server that adheres to the OMG Common Object Services Specification. Our naming service can be replicated at run-time, while many applications are installing and retrieving object references. We compare our approach with the approaches taken by the ILU, NEO, Orbix, and DOME object request brokers. The performance of our name server is measured for various replication degrees.
Modula and the Design of a Message Switching Communication System
Authors: Gregory R. Andrews
Venue:  (1978)

This report describes the functions of a message switching communications system and presents an implementation in terms of the Modula programming language. In particular, the report: (1) describes a representative application of the proposed new Department of Defense high order language; (2) presents a design technique for software specification; (3) develops Modula programs for each of the message switching components; and (4) evaluates the utility of Modula as a language for the design of large parallel systems.
Dynamic bandwidth allocation in broadband-ISDN using a multilevel optimal control approach
Authors: A. Pitsillides, J. Lambert, D. Tipper
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

This paper presents a novel scheme for the dynamic allocation of bandwidth at the virtual path level in B-ISDNs. A fluid flow model is developed to describe the time varying mean behaviour of a virtual path and serves as a state variable model. A multilevel optimal control theoretic approach is used in conjunction with the state model to derive a coordinated decentralised algorithm for virtual path bandwidth allocation. The performance of the proposed scheme is evaluated using simulation.
On Linear and Extended Linear Realization of Generalized Automata Extensions
Authors: Bolestaw Mikolajczak
Venue:  (1977)

The relation between ordinary automata, their fixed analogs of extensions, fixed analogs of generalized state-input extension with fixed mappings on input alphabet and characteristic semigroups are considered. The necessary and sufficient conditions for a fixed analog of an extension and generalized state-input extension with fixed mappings on input alphabets of the ordinary automaton to be linearly realizable over the field GF(p) are given. The equations describing fixed analogs of an extension and generalized state-input extension with fixed mappings on input alphabets are also stated.
BRITE: Universal Topology Generation from a User''s Perspective
Authors: Alberto Medina, Anukool Lakhina, Ibrahim Matta, John Byers
Venue:  (2001)

Abstract Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. Unfortunately, developing a deep understanding of these issues has proven to be a challenging task, since it in turn involves solving difficult problems such as mapping the actual topology, characterizing it, and developing models that capture its emergent behavior. Consequently, even though there are a number of topology models, it is an open question as to how representative the topologies they generate are of the actual Internet. Our goal is to produce a topology generation framework which improves the state of the art and is based on design principles which include representativeness, inclusiveness, and interoperability. Representativeness leads to synthetic topologies that accurately reflect many aspects of the actual Internet topology (e.g. hierarchical structure, degree distribution, etc.). Inclusiveness combines the strengths of as many generation models as possible in a single generation tool. Interoperability provides interfaces to widely-used simulation applications such as ns and SSF as well as visualization applications. We call such a tool a "universal topology generator". In this paper we discuss the design, implementation and usage of the BRITE universal topology generation tool that we have built. We also describe the BRITE Analysis Engine, BRIANA, which is an independent piece of software designed and built upon BRITE design goals of flexibility and extensibility. The purpose of BRIANA is to act as a repository of analysis routines along with a user--friendly interface that allows its use on different topology formats.
Platform-Based Design: A Path to Efficient Design Re-Use
Authors: Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

System design is undergoing a series of radical transformations to meet performance, quality, safety, cost and time-to-market constraints introduced by the pervasive use of electronics in everyday objects. An essential component of the new system design paradigm is the orthogonalization of concerns, i.e., the separation of the various aspects of design to allow more effective exploration of alternative solutions. Since the mask set and design cost for Deep Sub-Micron implementations is predicted to be overwhelming, it is important to find common architectures that can support a variety of applications. In this talk, we will explore methods for selecting families of software and hardware architectures that allow a substantial design re-use and some paradigms for embedded system designs that are likely to become the pillars of future tools and flows.
A Simplified Technique for Hidden-Line Elimination in Terrains
Authors: Franco P. Preparata, Jeffrey S Vitter
Venue:  (1991)

In this paper we give a simple and efficient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in $O((d + n)\log^2 n)$ time, where $d$ is the size of the final display. The main data structure maintains an implicit representation of the convex hull of a set of points that can be dynamically updated in $O(\log^2 n)$ time. It is especially simple and fast in our application since there are no rebalancing operations required in the tree.
Tackling the Abstraction Problem for Reverse Engineering in a System Re-engineering Approach
Authors: Hongji Yang, Xiaodong Liu, Hussein Zedan
Venue: Proceedings of the International Conference on Software Maintenance (1998)

It is widely accepted that reverse engineering has three components: restructuring, comprehension and production of formal specification. In this paper, we advocate that the three components could be achieved in a systematic approach by successfully applying a series of sound rules.The key approach to comprehension and the production of formal specification is a notion of abstraction. Abstraction is often interpreted as the act of hiding irrelevant details. What constitute as relevant details is often left open to different interpretations.A unified approach for reverse engineering is described within which the notion of abstraction is classified and precisely defined. Abstraction rules are given and applied to various small examples.
Fast Transforms for Multiple-Valued Input Binary Output PLI Logic
Authors: Bogdan J. Falkowski, Susanto Rahardja
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Fast forward and inverse transforms for multiple-valued input binary output PLI logic are derived. New matrix functions are introduced which allow feasible transformation of arbitrary q-valued input binary output functions. This allows representation of the function in the algebra of GF(2), where >. The representation of MVB functions in various functional bases having always-fast algorithms is the foundation for the efficient synthesis of PLI expansions of MVB functions. The computational complexity of such algorithms is essentially reduced when compared to standard matrix multiplication and inversion based methods of the earlier work in PLI logic.
Probabilistically Checkable Debate Systems and Nonapproximabilityof PSPACE-Hard Functions
Authors: Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
Venue:  (1995)

We initiate an investigation of probabilistically checkable debate systems (PCDS), a natural generalization of probabilistically checkable proof systems (PCPS). A PCDS for a language L consists of a probabilistic polynomial-time verifier V and a debate between player 1, who claims that the input x is in L, and player 0, who claims that the input x is not in L. We show that there is a PCDS for L in which V flips O(log n) random coins and reads O(1) bits of the debate if and only if L is in PSPACE. This characterization of PSPACE is used to show that certain PSPACE-hard functions are as hard to approximate closely as they are to compute exactly.
Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph
Authors: Ryuhei Uehara
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

We investigate structural parameters of a graph that express the boundary of the parallel complexity of the lexicographically first maximal independent set (LFMIS) problem. As a measure, we introduce the longest directed path length (LDPL). That is better than previously known one. The parallel complexity of the LFMIS problem on a graph gradually increases as the value measured on the graph grows: The LFMIS problem on a graph of LDPL O(\log^k n) is in NC^{k+1}, and the problem on a graph of LDPL \Theta(n^{\epsilon}) is P-complete.We also investigate the limit of the measure. We construct a kind of the lexicographically first maximal subgraph problems such that the problem is P-complete even if the LDPL of the input graph is restricted to 1.Finally we discuss the probability that a random graph has LDPL l and show that its threshold value is l/n. This implies that a random graph of which each edge exists with probability p has LDPL \Theta(np) with high probability. The result also show the limit of the LDPL on the average case.
The spectra of large Toeplitz band matrices with a randomly perturbed entry
Authors: A. Böttcher, M. Embree, V. I. Sokolov
Venue: Mathematics of Computation (2003)

This paper is concerned with the union spΩ(j,k) Tn(a) of all possible spectra that may emerge when perturbing a large n × n Toeplitz band matrix Tn(a) in the (j, k) site by a number randomly chosen from some set Ω. The main results give descriptive bounds and, in several interesting situations, even provide complete identifications of the limit of spΩ(j,k) Tn(a) as n → ∞. Also discussed are the cases of small and large sets Ω as well as the "discontinuity of the infinite volume case", which means that in general spΩ(j,k) Tn(a) does not converge to something close to spΩ(j,k) Tn(a) as n → ∞ where T(a) is the corresponding infinite Toeplitz matrix. Illustrations are provided for tridiagonal Toeplitz matrices, a notable special case.
On attaining maximal fitness or how to evolve virtual redwoods
Authors: Gary R. Greenfield
Venue: Proceedings of the eighth international conference on Artificial life (2002)

An understanding of the evolutionary mechanisms that lead to increased genome capabilities is essential for determining the potentials and limits of living systems. We evolve abstract aesthetic imagery on the basis of an image connectivity trait that has a theoretically determined maximum value. This trait can be influenced by "development" genes. We investigate simulated evolution when the development genes are not present, when they are fused with the existing genotype, and when they function semi-autonomously by residing in symbionts. Genome fusing initially impedes evolution while symbiosis initially accelerates evolution. Our findings suggest that symbiosis events play a more important role than genome fusion events for sustaining open-ended evolution.
Efficient Concurrency Control for Libraries of Typed Objects
Authors: Thomas Raeuchle
Venue:  (1986)

Concurrency control algorithms use a conflict detection strategy to determine operations that have to be delayed to provide a correct serialization order. To keep the cost of detecting conflicts feasible, most algorithms employ rather crude strategy that sometimes delays operations when in reality they could proceed concurrently. In an object oriented system where calls to objects can be nested this problem is exacerbated by the fact that a concurrency control decision is made at each level in the calling hierarchy. In this dissertation we address concurrency control issues in object oriented systems. We develop a model of execution for operations on objects, drawing on similar models developed for database systems. We propose a new serialization algorithm that keeps a partial history of operations at each site, and exploits semantic knowledge of operations to achieve a finer granularity of conflict detection. Conflict detection is based on user supplied conflict predicates, thus giving the user the option of fine grained concurrency control and the responsibility for the level of cost of the conflict detection strategy. We then show how to implement the algorithm in a distributed system where sites can fail and recover independently. Finally, we explore techniques to reduce the message overhead and latency for the algorithm in a distributed system.