ppxscal/embedding_network huggingface dataset:
Self-organization in ad hoc sensor networks: an empirical study
Authors: Elaine Catterall, Kristof Van Laerhoven, Martin Strohbach
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Research in classifying and recognizing complex concepts has been directing its focus increasingly on distributed sensing using a large amount of sensors. The colossal amount of sensor data often obstructs traditional algorithms in centralized approaches, where all sensor data is directed to one central location to be processed. Spreading the processing of sensor data over the network seems to be a promising option, but distributed algorithms are harder to inspect and evaluate. Using self-sufficient sensor boards with short-range wireless communication capabilities, we are exploring approaches to achieve an emerging distributed perception of the sensed environment in real-time through clustering. Experiments in both simulation and real-world platforms indicate that this is a valid methodology, being especially promising for computation on many units with limited resources.
A New Paradigm of User Intention Preservation in Realtime Collaborative Editing Systems
Authors: Du Li, Limin Zhou, Richard R. Muntz
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The concept of time and ordering of events are correlated key issues in distributed computing as well as computer-supported collaborative work (CSCW) systems. This paper revisits some of the assumptions that have generally been made regarding time and event ordering in distributed systems and argues that they are no longer appropriate if the goal is to faithfully preserve user intentions in CSCW systems. In particular, the following contributions are made in the context of collaborative editing systems. First, we discuss how the user intentions might be impacted when the finite duration of drawing operations are considered. Secondly, we propose that total ordering of events should give the users the right of participation instead of being solely determined mechanically by the system. Thirdly, a new concept of active whiteboard} is proposed which supports various integrity constraints on objects and object groups to maintain user intentions in a more sophisticated way. Additionally, for the sake of completeness, the problem of maintaining consistency in the face of unreliable and high-latency communication channels is also covered.
On The Shuffle-Exchange Permutation Network
Authors: Douglas W. Bass, I. Hal Sudborough
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of (5/8)n^2 + O(n), where n is the length of the permutation. (This improves on a (9/8)n^2 routing algorithm described earlier [5].) Thus, the diameter of SEPn is at most (5/8)n^2 + O(n). We also show that the diameter is at least (n^2)/2 - O(n). We demonstrate that SEPn has a Hamilton cycle, for n >= 3, left open in [5], and describe embeddings of variable degree Cayley networks, such as bubble-sort networks , star networks and pancake networks into SEPn. Our embeddings for these networks are substantial improvements of earlier results.
Diagnosis of Component Failures in the Space Shuttle Maine Engines Using Bayesian Belief Networks: A Feasibility Study
Authors: Edwina Liu, Du Zhang
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Although the Space Shuttle is a high reliability system, the health of the Space Shuttle must be accurately diagnosed in real-time. Two problems current plague the system, false alarms that may be costly, and missed alarms which may be not only expensive, but also dangerous to the crew. This paper describes the results of a feasibility study where a multivariate state estimation technique is coupled with a Bayesian Belief Network to provide both fault detection and fault diagnostic capabilities for the Space Shuttle Main Engines (SSME). Five component failure modes and several single sensor failures are simulated in our study and correctly diagnosed. The results indicate that this is a feasible fault detection and diagnosis technique and fault detection and diagnosis can be made earlier than standard redline methods allow.
Optimal agendas for multi-issue negotiation
Authors: Shaheen Fatima, Michael Wooldridge, Nicholas R. Jennings
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

There are two ways of handling bilateral multi-issue negotiations -- one is to negotiate all the issues together, and the other is to negotiate them one by one. The order in which issues are negotiated in issue-by-issue negotiation is specified by the agenda, which can be defined in two ways. One way is to decide it exogenously, i.e., before negotiation begins. The other way is to let the players decide which issue they will negotiate next, during the process of negotiation, i.e., the agenda is determined endogenously. Against this background, this paper studies the effect of combining the exogenous and endogenous agendas on the players' utilities. More specifically, we determine whether, decomposing a set of N issues into k stages (for 1 ≤ k ≤ N), determining the issues to be negotiated at each stage exogenously, and negotiating each stage sequentially using an endogenous agenda can improve an agent's utility relative to the utility it gets if the agenda for all the N issues is defined endogenously. For each agent, we find the expected utility for each value of k between 1 and N. The value of k that gives an agent maximum utility is its optimal number of stages.Our study shows that, in some negotiation scenarios, the optimal value of k is identical for the two players, and is greater than one. In other words, in some negotiation scenarios, both the agents can improve their utilities by using the k-stage negotiation relative to the single stage negotiation. However, since the players have incomplete information about the negotiation parameters, they cannot identify such scenarios. We therefore present an extended alternating offers protocol, that allows the agents to identify such scenarios through a mediator, thereby resulting in improved utility to both the agents.
COMPUTATION OF THE SOUND GENERATED BY ISOTROPIC TURBULENCE
Authors: S. Sarkar, M. Y. Hussaini
Venue:  (1993)

The acoustic radiation from isotropic turbulence is computed numerically. A hybrid direct numerical simulation approach which combines direct numerical simulation (DNS) of the turbulent flow with the Lighthill acoustic analogy is utilized. It is demonstrated that the hybrid DNS method is a feasible approach to the computation of sound generated by turbulent flows. The acoustic efficiency in the simulation of isotropic turbulence appears to be substantially less than that in subsonic jet experiments. The dominant frequency of the computed acoustic pressure is found to be somewhat larger than the dominant frequency of the energy-containing scales of motion. The acoustic power in the simulations is proportional to M_t^5where is the turbulent dissipation rate and M_t is the turbulent Mach number. This is in agreement with the analytical result of Proudman (1952), but the constant of proportionality is smaller than the analytical result. Two different methods of computing the acoustic power from the DNS data bases yielded consistent results.
Adaptive Environment Observation for Distributed, Agents Moving in a Lattice World
Authors: Takashi Watanabe, Masuhiro Mizuno, Tadanori Mizuno
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

In a distributed cooperative system, each agent has to observe its environment in order to create an adequate subgoal. This paper discusses tradeoff between cost of observation and achievement of the shared final goal of agents moving in a lattice world. The model is referred to as the restricted Tower of Babel. A cooperation mechanism called LM-DMax is evaluated through simulation against observation interval, the number of agents and moving area site. We find that the model has an optimal observation interval, an optimal area size to minimize the total cost. Then three adaptive policies which modifies the observation interval of each agent are proposed. They are geometrical policy, arithmetical policy and slow-start policy. Slow-start policy shows the best result among them. Though the discussion is restricted to the specific model, it is directly applicable to a vehicle scheduling problem and a robot planning problem.
Effects of Desktop 3D World Design on User Navigation and Search Performance
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Desktop virtual reality (VR) offers a powerful environment for visualizing structure in large information sets. In well-designed virtual worlds, users can employ skills from wayfinding in the real world. This paper reports the development and testing of a series of prototype VR worlds, designed to support navigation during information visualization and retrieval. Results indicated that users subjectively preferred naturalistic environments over abstract ones, but that users objectively searched better in environments that had rigorous hierarchical structure, and support for both overview and detail. In comparison with a hypertext interface, the final virtual world design elicited more enjoyment, without worsening search performance significantly, when appropriate training time was allowed. This prototype shows the potential value of navigable VR that is engaging and useful for everyday information exploration.
Family Values: A Behavioral Notion of Subtyping
Authors: Barbara Liskov, Jeannette M. Wing
Venue:  (1993)

and all of CMU-CS-93-149. The document is a union of papers. Keywords: Subtype, object-oriented design, abstraction function, extensible types, mutable types, specifications, semantics 34 pages [FTP: CMU-CS-93-187.ps] The use of hierarchy is an important component of object-oriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of how subtypes and supertypes are related. This paper takes the position that the relationship should ensure that any property proved about supertype objects also holds for its subtype objects. It presents two ways of defining the subtype relation, each of which meets this criterion, and each of which is easy for programmers to use. The paper also discusses the ramifications of this notion of subtyping on the design of type families.
Embedded Platforms for Distributed Real-Time Computing: Challenges and Results
Authors: José Rufino, Guilherme Arroz, Paulo Veríssimo
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Object-oriented techniques have been along the last decade one of the most useful programming paradigms. However, for distributed embedded systems the semantic gap between the object-orientationlayer and the underlying infrastructure is extremely large. This gap can be narrowed, should the embedded system platform provide semantically rich communication and management services. This paper outlines our research effort in the provision of such services by CAN-based (Controller Area Network) systems.
Mining First-order Knowledge Bases for Association Rules
Authors: Hasan M. Jamil
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

Data mining from relational databases has recently become a popular way of discovering hidden knowledge. Methods such as association rules, chi square rules, ratio rules, implication rules, etc. that have been proposed in several contexts offer complimentary choices in rule induction in this model. Other than inductive and abductive logic programming, research into data mining from knowledge bases has been almost non-existent, because contemporary methods involve inherent procedurality which is difficult to cast into the declarativity of knowledge base systems. In this paper, we propose a logic-based technique for association rule mining from declarative knowledge which does not rely on procedural concepts such as candidate generation. This development is significant as this empowers the users with the capability to explore knowledge bases by mining association rules in a declarative and ad hoc fashion.
VirtualWire: A Fault Injection and Analysis Tool for Network Protocols
Authors: Pradipta De, Anindya Neogi, Tzi-cker Chiueh
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

The prevailing practice for testing protocol implementationsis direct code instrumentation to trigger specificstates in the code. This leaves very little scope forreuse of the test cases. In this paper, we present thedesign, implementation, and evaluation of VirtualWire,a network fault injection and analysis system designedto facilitate the process of testing network protocol implementations.VirtualWire injects user-specified networkfaults and matches network events against anticipatedresponses based on high-level specifications written in adeclarative scripting language. With VirtualWire, testingrequires no code instrumentation and fault specificationscan be reused across versions of a protocol implementation.We illustrate the effectiveness of VirtualWire withexamples drawn from testing Linux's TCP implementationand a real-time Ethernet protocol called Rether. Ineach case, 10 to 20 lines of script is sufficient to specifythe test scenario. VirtualWire is completely transparentto the protocols under test, and additional overhead inprotocol processing latency it introduces is below 10%of the normal.
Annotating Software With Arbitrary Performance Characteristics
Authors: Scott Meyers
Venue:  (1989)

Characterizations of software performance are usually restricted to discussions of the software''s size and speed, but these two criteria fail to take into account other important aspects of software performance, such as reliability, portability, and robustness. In this paper, we present a methodology for annotating software with arbitrary performance characteristics, and we describe how such annotations might be used as the basis for a system that could automatically select optimal implementations for software abstractions. The selection of optimal implementations requires that fundamentally incomparable criteria (such as speed and portability) be unified, and we develop a convention for achieving this unification. We also discuss how the idea of using arbitrary performance characterizations can be applied to other domains, including hardware design and general-purpose planning.
Modeling Bayesian Estimation for Deformable Contours
Authors: Stan. Z. Li, Juwei Lu
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

A novel trainable snake model, called EigenSnake, is presented in the Bayesian framework. In the EigenSnake, prior knowledge of a specific object shape, such as that of face outlines and facial features, is derived from a training set of the shape and incorporated into a Bayesian snake model in the form of the prior distribution. Further, a "shape space", which is constructed on the basis of a set of eigenvectors obtained from principle component analysis, is used to restrict and stabilize the search for the optimal solution. The effectiveness is demonstrated by experiments, which shows that the EigenSnake produces more reliable and accurate results than existing models.
Merging on Parallel Models of Computation
Authors: Allan B. Borodin, John E. Hopcroft
Venue:  (1981)

A variety of models have been proposed for the study of synchronous parallel computation. We review these models and study further some prototype problems. Within a spectrum of shared memory models, we show that $\log \log n$ is asymtotically optimal for $n$ processors to merge two sorted lists containing $n$ elements.
Extremal weight enumerators and ultraspherical polynomials
Authors: Iwan Duursma
Venue: Discrete Mathematics (2003)

We establish an upper bound for the minimum distance of a divisible code in terms of its dual distance. The bound generalizes the Mallows-Sloane bounds for self-dual codes. We obtain a linear recurrence for the distance distribution components of codes that attain the bound. From this we derive known conditions for the existence of extremal self-dual codes in a much simpler way. In the second half of the paper, we determine zeta functions for the codes that attain our new bound. Zeta functions for linear codes are defined in Duursma (Trans. Amer. Math. Soc. 351(9) (1999) 3609). Using properties of ultraspherical polynomials, we show that the zeta function of a quaternary extremal self-dual code has its zeros on the circle |T|= q-1/2 in analogy with the zeta function of an algebraic curve.
SpaceTree: Supporting Exploration in Large Node Link Tree, Design Evolution and Empirical Evaluation
Authors: Catherine Plaisant, Jesse Grosjean, Benjamin B. Bederson
Venue: Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02) (2002)

We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previouslyvisited nodes and estimation of overall tree topology.
A note on inverses of non-decreasing L\\\\351vy processes
Authors: J. A. Ferreira
Venue:  (2001)

We show that, apart from deterministic processes, compound Poisson processes with exponential jumps are the only (shifted) non-decreasing L\''{e}vy processes whose inverses are also (shifted) non-decreasing L\''{e}vy processes.
Set-Systems with Restricted Multiple Intersections and Explicit Ramsey Hypergraphs
Authors: Grolmusz Vince
Venue:  (2001)

We give generalizations for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if ${\cal H}$ is a set-system, which satisfies that for some $k$, that the $k$-wise intersections occupy only $\ell$ residue-classes modulo a $p$ prime, while the sizes of the members of ${\cal H}$ are not in these residue classes, then the size of ${\cal H}$ is at most $$(p-1)(k-1)\sum_{i=1}^{|L|}{n\choose i}$$ This result strengthtens a result of F\"uredi (1983), and gives partial answer to a question of T. S\''os (1976). As an application, we give explicit constructions for (multi-colored) Ramsey hypergraphs. By our best knowledge, this is the first explicit construction of a Ramsey-hypergraph in the literature.
Improvements in Throughput Maximization for Real-Time Scheduling
Authors: Berman Piotr, DasGupta Bhaskar
Venue:  (1999)

We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the versions of the problem discussed here were already treated by Bar-Noy et al.(Proc. 31st ACM STOC, 622-631, 1999). Our main contribution is to provide algorithms that do not use linear programming, are simple and much faster than the corresponding ones proposed in Bar-Noy et al., while either having the same quality of approximation or improving it. More precisely, compared to the results of in Bar-Noy et al., our pseudo-polynomial algorithm for multiple unrelated machines and all of our strongly-polynomial algorithms have better performance ratios, all of our algorithms run much faster, are combinatorial in nature and avoid linear programming. Finally, we show that algorithms with better performance ratios than 2 are possible if the stretch factors of the jobs are bounded.
An Experiment in Identifying Persistent Objects in Large Systems
Authors: Aniello Cimitile, Andrea de Lucia, Giuseppe A. di Lucca
Venue: Proceedings of the International Conference on Software Maintenance (1998)

We present an experiment in identifying coarse-grained persistent objects in a legacy system of an Italian public organisation. Object methods are searched for at the program level driven by the minimisation of the coupling between objects. This strategy is useful in incremental migration projects requiring the identification of largely independent subsystems needing low re-engineering and de-coupling costs to be first encapsulated in different wrappers and then selectively replaced. The aim of the experiment was to evaluate the feasibility of this approach when applied to large software systems.
A hardware architecture for implementing protection rings
Authors: Michael D. Schroeder, Jerome H. Saltzer
Venue: ACM SIGOPS Operating Systems Review (1972)

Protection of computations and information is an important aspect of a computer utility. In a system which uses segmentation as a memory addressing scheme, protection can be achieved in part by associating concentric rigns of decreasing access privilege with a computation. The mechanisms allow cross-ring calls and subsequent returns to occur without trapping to the supervisor. Automatic hardware validation of references across ring boundaries is also performed. Thus, a call by a user procedure to a protected subsystem (including the supervisor) is identical to a call to a companion user procedure. The mechanisms of passing and referencing arguments are the same in both cases as well.
A Systolic Architecture for the Singular Value Decomposition
Authors: Richard P. Brent, Franklin T. Luk
Venue:  (1982)

We propose a systolic architecture for computing a singular value decomposition of an m x n matrix, where $m \geq n$. Our algorithm is stable and requires only $O(mn)$ time on a linear array of $O(n)$ processors. Extensions to algorithms for two-dimensional arrays are also discussed. Key Words and Phrases: Systolic arrays, singular value decomposition, Hestenes method, threshold Jacobi method, real-time computation.
Block coded modulation based ARQ schemes with blocks combining
Authors: A. M. Al-Sanie
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

In this paper, we present a new type-II hybrid ARQ scheme. This scheme employs block coded modulation (BCM) for error-correction and a linear block code for error-detection. This scheme is referred to as the BCM-ARQ scheme. Rate 1/2 block code with QPSK as error-correction code is considered. Computer simulation is used to evaluate the throughput of the proposed scheme. In comparison with the classical ARQ schemes, the proposed ARQ scheme provides enhanced throughput under high probability of error conditions without any increase in the bandwidth. A BCM-ARQ scheme with combining of successive received blocks is also introduced. In this scheme, the decoder for error correction operates on combination of all received sequences for a block, rather than only on the most recent received one. It is shown that blocks combining further improves the throughput of the BCM-ARQ scheme for higher channel error rate.