ppxscal/embedding_network huggingface dataset:
The Barrier Synchronization Impact on the MPI-Programs Performance Using a Cluster of Workstations
Authors: Martha Torres, Sergio Takeo Kofuji
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The aim of this work is to measure the barrier synchronization influence on the overall performance of several application programs. In order to do that, we use the MPICH implementation version 1.1 of the MPI library. Moreover, we choose two barrier synchronization solutions: the MPICH software solution, i.e. the MPI_Barrier routine, and the TTL_PAPERS hardware solution. The last one was implemented as a collective operation in MPICH we called MPI_Papers. Finally, we compare the execution time of MPI programs using the MPI_Barrier and MPI_Papers routines. Our testing environment consists of a cluster of 8 Dual Pentium Pro processors interconnected via both 10Mb/s ethernet network and a TTL_PAPERS prototype. We use two kinds of MPI programs: test programs that perform few messages into the network and local calculations, and scientific calculation programs that carry out date exchange and local calculations.
Combinatorial Optimization through Statistical Instance-Based Learning
Authors: Orestis Telelis, Panagiotis Stamatopoulos
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

Different successful heuristic approaches have been proposed for solving combinatorial optimization problems. Commonly, each of them is specialized to serve a different purpose or address specific difficulties. However, most combinatorial problems that model real world applications have a priori well known measurable properties. Embedded machine learning methods may aid towards the recognition and utilization of these properties for the achievement of satisfactory solutions. In this paper, we present a heuristic methodology which employs the instance-based machine learning paradigm. This methodology can be adequately configured for several types of optimization problems which are known to have certain properties. Experimental results are discussed concerning two well known problems, namely the knapsack problem and the set partitioning problem. These results show that the proposed approach is able to find significantly better solutions compared to intuitive search methods based on heuristics which are usually applied to the specific problems.
A knowledge plane for the internet
Authors: David D. Clark, Craig Partridge, J. Christopher Ramming, John T. Wroclawski
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as requirements change, automatically discover when something goes wrong, and automatically fix a detected problem or explain why it cannot do so.We further argue that to achieve this goal, it is not sufficient to improve incrementally on the techniques and algorithms we know today. Instead, we propose a new construct, the Knowledge Plane, a pervasive system within the network that builds and maintains high-level models of what the network is supposed to do, in order to provide services and advice to other elements of the network. The knowledge plane is novel in its reliance on the tools of AI and cognitive systems. We argue that cognitive techniques, rather than traditional algorithmic approaches, are best suited to meeting the uncertainties and complexity of our objective.
Parallel Computations in Information Retrieval
Authors: Gerard Salton, D. Bergmark
Venue:  (1980)

Conventional information retrieval processes are largely based on data movement, pointer manipulations and integer arithmetic; more refined retrieval algorithms may in addition benefit from substantial computational power. In the present study a number of parallel processing methods are described that serve to enhance retrieval services. In conventional retrieval environments parallel list processing and parallel search facilities are of greatest interest. In more advanced systems, the use of array processors also proves beneficial. Various information retrieval processes are examined and evidence is given to demonstrate the usefulness of parallel processing and fast computational facilities in information retrieval.
Exploiting Virtual Synchrony in Distributed Systems
Authors: Kenneth P. Birman, Thomas A. Joseph
Venue:  (1987)

We describe applications of a new software abstraction called the virtually synchronous process group. Such a group consists of a set of processes that cooperate to implement some distributed behavior in an environment where events like broadcasts to the group as an entity, process failures, and process recoveries appear to occur synchronously. The utility of this approach is illustrated by solving a number of classical problems using our methods. Many are problems that are quite difficult in the absence of some sort of support, and all are easily solved in the context of the mechanisms we propose here. We then describe a new version of the ISIS system, which is based on this abstraction. $ISIS_{2}$ provides a number of high level mechanisms that facilitate the use of process groups in application software design, including addressing support for atomic communication with the members of a single or several groups (even when their membership is changing), group RPC constructs, a package of distributed programming tools, a fault-tolerant asynchronous bulletin board mechanism, and resilient objects.
Fundamental Principles of Software Engineering
Authors: P. Bourque, R. Dupuis
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

This workshop aims to bring together people interested in participating in an active debate on the fundamental principles that underlie software engineering standards. What exactly are the basis on which those standards are or should be built? What should be such principles? What lessons can we draw from experience? How can we demonstrate empirically the value of industry practices or concepts related to these fundamental principles? In the 50 year history of software development, various methodologies, methods and techniques have been proposed to facilitate the development of software responsive to needs. At this point in history, enough such examples of methodologies, methods and techniques have accumulated that we can begin to perceive underlying principles that may, in fact, be fundamental, hence enduring in applicability. This workshop has the objective of identifying some of these fundamental principles, and will build upon the results of a first workshop on this topic held during SES '96. Position papers and workshop report for this fist workshop can be found at : http://saturne.info.uqandLabo_RecherchdL.rgUses96/
Behavior Patterns for Mobile Agent Systems from the Development Process Viewpoint
Authors: Yasuyuki Tahara, Akihiko Ohsuga, Shinichi Honiden
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

As wide-area open networks like the Internet and intranets grow larger, mobile agent technology is attracting more attention. Agents are units of software that can deal with environmental changes and the various requirements of open networks through features such as autonomy, mobility, intelligence, cooperation, and reactivity. However, since the usual development methods of the agent systems are not sufficiently investigated, the technology is not yet widespread. In the previous papers, we introduced behavior patterns for mobile agent systems and the development method. The behavior patterns represent typical and recurring structures and behaviors of agents. The patterns are classified according to their appropriate architectural levels and the degree to which they depend on specific agent platforms. In this paper, we evaluate the advantages of our method from the development process viewpoints. Our evaluation focuses on the development efficiency, the applicability, the extensibility and the understandability of our method.
Evolving Neural Networks for Chlorophyll-a Prediction
Authors: Yong Liu, Xin Yao
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper studies the application of evolutionary artificial neural networks to chlorophyll-a prediction in Lake Kasumigaura.Unlike previous applications of artificial neural networks in this field, the architecture of the artificial neural network is evolved automatically rather than designed manually.The evolutionary system is able to find a near optimal architecture of the artificial neural network for the prediction task Our experimental results have shown that evolved artificial neural networks are very compact and generalize well.The evolutionary system is able to explore a large space of possible artificial neural networks and discover novel artificial neural networks for solving a problem.
Formalization of Isabelle Meta Logic in NuPRL
Authors: Pavel Naumov
Venue:  (1999)

NuPRL and Isabelle are two general purpose theorem provers. Both of them are based on a version of Constructive Higher Order Type Theory. In an earlier work the author has proposed an informal semantics of Isabelle Meta Logic in an extension of NuPRL Type Theory. An automated converter, based on this semantics, has been developed, that translates Isabelle theorem statements into NuPRL. This work presents a formalization of the above semantics in NuPRL. It starts with a deep embedding of Isabelle type and term syntax into NuPRL Constructive Type Theory. Next, two internal NuPRL functions are defined. One of them maps Isabelle types into NuPRL types and the other maps Isabelle terms into elements of appropriate NuPRL types. These two functions provide an interpretation of Isabelle in NuPRL. Finally, interpretations of all Isabelle Meta Logic rules are proven as theorems in some classical extension of NuPRL Type Theory. This formalization is aimed to provide a more secure foundation for the interaction between two systems.
Predicate Locking for Nested Transaction Systems
Authors: Kyu L Lee
Venue:  (1993)

This paper presents an algorithm that combines the predicate locking algorithm of Gray et al. with Moss'' two phase locking algorithm for nested transactions. This provides a solution to the phantom problem for nested transaction systems. We prove the correctness of our algorithm, using a "user''s view" definition of correctness due to Lynch and Merritt. The verification involves showing how to relate the new algorithm to the commutativity-based locking of Fekete et al..
Switch-Level Model and Simulator for MOS Digital Systems
Authors: Randal E. Bryant
Venue:  (1983)

The switch-level model describes the logical behavior of digital systems implemented in metal oxide semiconductor (MOS) technology. In this model a network consists of a set of nodes connected by transistor "switches" with each node having a state 0, 1, or X (for invalid or uninitialized), and each transistor having a state "open", "closed", or "indeterminate". Many characteristics of 140S circuits can be modeled accurately, including: ratioed, complementary, and precharged logic-, dynamic and static storage; (bidirectional) pass transistors; busses; charge sharing; and sneak pa ths. In this paper we present a formal development of the switch-level model starting from a description of circuit behavior in terms of switch graphs. Then we describe an algorithm for a logic simulator based on the switch-level model which computes the new state of the network by solving a set of equations in a simple, discrete algebra. This algorithm has been implemented in the simulator MOSSIM II and has been used to simulate circuits containing over 10,000 transistors. By developing a formal theory of MOS logic circuits, we have achieved a greater degree of generality and accuracy than is found in other logic simulators for MOS.
NinjaMail: the Design of a High-Performance Clustered, Distributed E-mail System
Authors: J. Robert von Behren, Steven Czerwinski, Anthony D. Joseph, Eric A. Brewer, John Kubiatowicz
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

In today's Internet era, electronic mail is replacing telephony and postal mail as the primary means of communication for hundreds of millions of individuals. Free e-mail services, such as Microsoft's Hotmail and Yahoo's Yahoo! Mail, each has tens of millions of subscribers. However, these and other current e-mail systems unfortunately are not capable of handling the scale of Internet e-mail use, while still providing reliable, high performance and feature-rich services to users. This limitation is the result both of sub-optimal use of cluster computing resources, and of highly variable performance of wide-area connections over the Internet. This paper presents NinjaMail, a novel geographically distributed, cluster-based e-mail system built on top of UC Berkeley's Ninja cluster architecture and OceanStore wide-area data storage architecture. NinjaMail is unique in that it uses a collection of clusters distributed through the wide-area to provide users with highly available, scalable and feature-rich services via a wide variety of access methods.
Territory formation in mobile robots
Authors: Amelie Schmolke, Hanspeter A. Mallot
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Animals navigate through their environment using diverse strategies. These navigation strategies might be highly dependent on the animal's ecological niche. Though a lot of work is focused on biological navigation mechanisms, the cognitive ecology of spatial memory is poorly understood. The performances of different navigation mechanisms in the context of a biologically relevant behavior can be assessed by using mobile robots. For this task, territorial behavior was built on Khepera miniature robots. Territoriality is strongly dependent on spatial learning and thus provides a powerful context for testing of sensory and computational complexity needed by animals solving special tasks. Simultaneously, the principles underlying the establishment of territories in a previously uninhabited area and how it is dependent on environmental parameters can be investigated. In the present paper, territoriality in robots is introduced. The robots navigate by relying on poor sensor input anda representation of the environment of a low complexity. Qualitative results show that territories form. Subsequently, the consequences of the introduction of a newcomer in already established territories are presented.
Performance Analysis of Two Rate Punctured Convolutional Code Scheme for Wireless ATM Networks
Authors: Zhenqiang Sun, Shigetomo Kimura, Yoshihiko Ebihara
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In wireless asynchronous transfer mode (ATM), the affect of a channel bit error varies significantly from the header to various payloads of a cell. Hence, to make the best available use of the limited channel coding redundancy, we proposed a two-rate punctured convolutional code (PCC) scheme with flexible unequal error protection (UEP) to apply to wireless ATM cell. In this paper, their performance on Gaussian, Rayleigh and Ricean fading channels is deeply analyzed further, which shows PCC schemes make significant reductions in cell loss rate (CLR) and good balances for CLR and the payload bit error rate (BER). The paper contains a detailed study of the effect of the code and channel parameters and the contrasting performance of hard and soft decisions on the received symbols. The study clearly highlights the need for soft decisions and channel state information (CSI) to extract the maximum benefit from Viterbi decoding on a fading channel.
Data and Metadata for Finding and Reminding
Authors: James Gheel
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper discusses the benefits of using document metadata that exists as part of the document and which is also generated by its use, to assist users in retrieving the document and remembering what it contains. By extracting valuable descriptive information from a document, and analysing what a user does, such as the files they open, when they are used and for how long, a repository of information can be built up to help users with the tasks of finding and reminding. Since such a vast quantity of raw metadata can be acquired, visualisation is needed to elicit meaning from it.
Support for System Evolution through Separating Business and Technology issues in a Banking System
Authors: John Edwards, Ian Coutts, Stuart McLeod
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

It is commonly accepted that there is a need to create IT systems that adapt easily and indefinitely to changing business requirements. Contemporary software design approaches often mix business issues with IT implementation issues to form monolithic systems that are no more responsive to change than their predecessors are. This paper introduces an approach, which seeks to separate a description of the business system from the technological issues within an IT implementation. Such a separation can serve to handle legacy IT systems today, while providing a strategy for migrating towards systems where business and IT issues are de-coupled and thereby provide improved conditions for system maintenance. The paper demonstrates how a model of the business, software design patterns, contemporary tools and emerging object standards can be used to create the separation. It provides detail of the many issues raised when moving from laboratory-based proof of concept systems to a system integrated with existing IT in a prestigious financial institution in the City of London.
Batched Circuit Switched Routing for Efficient Service of Requests
Authors: Aaron Harwood, Hong Shen
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Circuit switching protocols were largely developed in light of ATM virtual circuits and also for the case of all-optical networks. The merging of ATM and IP packet switching technology may banish true circuit switching in the digital domain due to fast switching networks using TDM. Even so, the characteristics of all-optical light paths (an optical circuit switched path) are so desirable that digital WAN's using ATM may eventually be completely augmented by optical WAN's using a hybrid opto-electronic or complete optical switching fabric. Afundamental problem is servicing a large number of requests while maintaining a low blocking probability where a request is blocked if the path it requires is in use by a circuit. We present a simple routing method, namely Batched Circuit Switching (BCS), that batches requests according to the rate of arrival and service time. Compared to orthodox Circuit Switching (CS), BCS provides superior request service times due to the observation that many requests may traverse the same circuit (or channel) during the batch time interval, rather than being blocked by preceding requests (as is the case for CS). Thus, BCS exhibits better utilization of thenetwork resources than CS. We demonstrate the requirements for this system to be stable, namely that the batch size must not increase to infinity before being serviced and the relationship between \lambda (the arrival rate of requests) and µ (the service rate ofrequests) to ensure stability.
Graphic Data Display for Cardiovascular System Case Study
Authors: James Agutter, Noah Syroid, Frank Drews, Dwayne Westenskow, Julio Bermudez, David Strayer
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

Our multi-disciplinary group has developed a visual representation for cardiovascular physiological variables. This enhances a clinician's ability to detect and rapidly respond to critical events. The integrated and intuitive display communicates a patient's cardiovascular state so that it is easily and quickly understood without prior training. The display is designed to show patterns of functional relationships that aid in the detection, diagnosis, and treatment of a critical event.
Context Triggered Visual Episodic Memory Prosthesis
Authors: Jyrki Hoisko
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

This paper briefly describes a context sensitive recorder and replay system that supports retrospective episodic memory. The concept has been explored by implementing a prototype system, which utilizes simple context information based on infrared beacons to store and retrieve images taken with a wearable camera. Presenting visual content about a user's life, in mobile use, should help memory to recall other facts about the user's context.
A genetic algorithm for decomposition type choice in OKFDDs
Authors: R. Drechsler, B. Becker, N. Gockel, A. Jahnke
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

A genetic algorithm (GA) is applied to find decomposition type lists (DTLs) that minimize the size of ordered Kronecker functional decision diagrams (OKFDDs). OKFDDs are a data structure for representation and manipulation of Boolean functions. The choice of the DTL largely influences the size of the OKFDD, i.e. its size may vary from polynomial to exponential. In Dreschsler, Becker, and Jahnke (1995) heuristic methods have been presented. In this paper the authors show by experiments that better results can be obtained by using GAs.
An Imprecise Algorithm for Real-Time Compressed Image and Video Transmission
Authors: Xiao Chen, Albert Mo Kim Cheng
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

One major requirement for multimedia systems is the efficient transmission of multimedia information over a communication or computer network. Several commercial products have been developed to apply compression techniques to images and videos in order to reduce their transmission time. Sufficient available time and bandwidth lead to satisfactory results, but image/video loss occurs if these resources are insufficient. Using imprecise computation theory, we can achieve a good tradeoff between the quality of the transmitted image/video and the available resources such as time for transmission. However, for a compressed image file, this very flexible technique cannot be easily applied since a compressed file cannot be uncompressed if it is not transmitted completely. This paper proposes an imprecise compressed image/video transmission technique which combines the advantages of both compression and imprecise computation for the first time. Our experimental results show that the proposed algorithm has better results compared to simply using compression or imprecise transmission techniques, and has a good potential for commercial use. *This material is based upon work supported in part by the National Science Foundation under Award No. CCR-9111563, and IRI-9526004, by the Texas Advanced Research Program under Grant No. 3652270, and the University of Houston Institute of Space Systems Operations.