ppxscal/embedding_network huggingface dataset:
A Generalized Approach for Transferring Data-Types with Arbitrary Communication Libraries
Authors: Martial Michel, Judith Ellen Devaney
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

We present a generalized algorithm for implementing a communications library for dynamic data structures created with heterogeneous composed data types such as multiple Constructs, and where the data-types may be nested and may contain pointers. This algorithm is divided into an absolute part that is the same for all instantiations, and a relative part that is specific to the communications mechanism used, such as PVM or MPI. We describe the algorithm in terms of our AutoMap/AutoLink implementation in C/MPI. First, we will talk of the MPI case and of the AutoMap and AutoLink solutions (with ideas from version 3.0). Then we discuss what is to be followed in order to generalize the data-types transfer concepts presented in this article. With this addition to AutoMap/AutoLink we can extend the functions provided from the current send and receive functions (blocking and non blocking) available for any data-types, to any kind of transfer function; from broadcast to reduce (as long as the reduce called process is ¿message aware¿). This will also simplify the extension of this work to data-types load balancing.
A Scenario-Based Approach to Hierarchical State Machine Design
Authors: F. Bordeleau, J. P. Corriveau, B. Selic
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

One of the most crucial and complicated phases of real-time system development lies in the transition from system behavior (generally specified using scenario models) to the behavior of interacting components (typically captured by means of communicating hierarchical finite state machines). It is commonly accepted that a systematic approach is required for this transition.In this paper, we overview such an approach, which we root in a hierarchy of "behavior integration patterns" we have elaborated. The proposed patterns guide the structuring of a component's behavior, and help in integrating the behavior associated with new scenarios into the existing hierarchical finite state machine of a component. One of these patterns is discussed at length here.
Line-crawling robot navigation: a rough neurocomputing approach
Authors: J. F. Peters, T. C. Ahn, M. Borkowski, V. Degtyaryov, S. Ramanna
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter considers a rough neurocomputing approach to the design of the classify layer of a Brooks architecture for a robot control system. This paradigm for neurocomputing that has its roots in rough set theory, works well in cases where there is uncertainty about the values of measurements used to make decisions. In the case of the line-crawling robot (LCR) described in this chapter, rough neurocomputing works very well in classifying noisy signals from sensors. The LCR is a robot designed to crawl along high-voltage transmission lines where noisy sensor signals are common because of the electro-magnetic field surrounding conductors. In rough neurocomputing, training a network of neurons is defined by algorithms for adjusting parameters in the approximation space of each neuron. Learning in a rough neural network is defined relative to local parameter adjustments. Input to a sensor signal classifier is in the form of clusters extracted from convex hulls that "enclose" similar sensor signal values. This chapter gives a fairly complete description of a LCR that has been developed over the past three years as part of a Manitoba Hydro research project. This robot is useful in solving maintenance problems in power systems. A description of the locomotion features of a line-crawling robot and the basic architecture of a rough neurocomputing system for robot navigation are given. A brief description of the fundamental features of rough set theory used in the design of a rough neural network is included in this chapter. A sample sensor signal classification experiment using a recent implementation of rough neural networks is also given.
Communication and Memory Requirements as the Basis for Mapping Task and Data Parallel Programs
Authors: Jaspal Subhlok, David R. O''Hallaron, Thomas Gross, Peter A. Dinda, Jon Webb
Venue:  (1994)

For a wide variety of applications, both task and data parallelism must be exploited to achieve the best possible performance on a multicomputer. Recent research has underlined the importance of exploiting task and data parallelism in a single compiler framework, and such a compiler can map a single source program in many different ways onto a parallel machine. There are several complex tradeoffs between task and data parallelism, depending on the characteristics of the program to be executed, most significantly the memory and communication requirements, and the performance parameters of the target parallel machine. In this paper, we isolate and examine the specific characteristics of programs that determine the performance for different mappings on a parallel machine, and present a framework for obtaining a good mapping. The framework is applicable to applications that process a stream of input, and whose computation structure is fairly static and predictable. We describe three applications that were developed with our compiler: fast Fourier transforms, narrowband tracking radar and multibaseline stereo, examine the tradeoffs between various mappings for them, and show how the framework was used to obtain efficient mappings. The automation of this framework is described in related publications.
The Computational Behaviour of Girard''s Paradox
Authors: Douglas J. Howe
Venue:  (1987)

In their paper ``Type'''' Is Not a Type, Meyer and Reinhold argued that serious pathologies can result when a type of all types is added to a programing language with dependent types. Central to their argument is the claim that by following the proof of Girard''s paradox it is possible to construct in their calculus $\lambda^{\tau \tau}$ a term having a fixed-point property. Because of the tremendous amount of formal detail involved, they were unable to establish this claim. We have made use of the Nuprl proof development system in constructing a formal proof of Girard''s paradox and analysing the resulting term. We can show that the term does not have the desired fixed-point property, but does have a weaker form of it that is sufficient to establish some of the results of Meyer and Reinhold. We believe that the method used here is in itself of some interest, representing a new kind of application of a computer to a problem in symbolic logic. 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
2.25 N-Lower Bound on the Combinational Complexity of Boolean Functions
Authors: Wolfgang J. Paul
Venue:  (1974)

Consider the combinational complexity L(f) of Boolean functions over the basis $\Omega = \{f|f:\{0,1\}^{2} \rightarrow \{0,1\}\}$. A new Method for proving linear lower bounds of size 2n is presented. Combining it with methods presented in [7] and [9], we establish for a special set of functions $f^{n}:\{0,1\} : 2.25n \leq L(f) \leq 6n$.
Applications of Pyramid Structures to Multiscale Optical Flow
Authors: Ted Camus
Venue:  (1990)

An important problem in machine vision is the description of motion of a 3-D world as projected on a 2-D retina (optical flow). Most current optical flow algorithms are not suited for practical implementations such as tracking because they require massively parallel supercomputers, highly specialized hardware, or up to an hour with a scientific workstation. This paper solves this problem in three ways. First, we provide a fast serial implementation for a recent optical flow algorithm that can run up to ten frames per second for practical image sizes on a conventional workstation. Second, an efficient method for abstracting a high-level description of the motion in an image is described, along with an application for tracking. Finally, we provide a heuristic that speeds up the original optical flow algorithm by a factor of three using a pyramid architecture.
The Hybridation of the Selfish Gene Algorithm
Authors: Rustem Popa
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper proposes an improvement of a new general approach for optimization algorithms in the Evolutionary Computation field. The approach is inspired by the Selfish Gene Theory, an interpretation of the Darwinian theory given by the biologist Richard Dawkins, in which thebasic element of evolution is the gene, rather than the individual. The paper analyses the performances of this algorithm, and proposes a method of improvement of these performances by hybridation with a Simulated Annealing technique. We tested the approach by implementing a Hybridated Selfish Gene Algorithm on a case study, and we found better results than those provided by the Selfish Gene Algorithm, on the same problem and with the same fitness function. 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
Convergent multi-path routing
Authors: J. A. Cobb
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors which are used as next-hops to reach the destination. This set is known as the successor set. Collectively, the successor sets from all processes in the network with respect to a given destination form a spanning, destination, and acyclic graph, whose only sink is the given destination. The protocol we present has two interesting properties. First the graph is maintained acyclic at all times, even though the successor set is dynamic. Second, the protocol tolerates all types of transient faults, even those which may not be detected. Therefore, if the protocol is started from an arbitrary initial state, it will converge to a normal operating state in which a spanning, directed, and acyclic graph is obtained and subsequently maintained.
Policy Disputes in Path-Vector Protocols
Authors: Timothy G. Griffin, F. Bruce Shepherd, Gordon Wilfong
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

The Border Gateway Protocol, BGP, is currently the only inter-domain routing protocol employed on the Internet. As required of any inter-domain protocol, BGP allows policy-based metrics to override distance-based metrics and enables each autonomous system to independently define its routing policies with little or no global coordination. Varadhan et al. have shown that there are collections of routing policies that together are not safe in the sense that they can cause BGP to diverge. That is, an unsafe collection of routing policies can result in some autonomous systems exchanging BGP routing messages indefinitely, without ever converging to a set of stable routes. In this paper we present sufficient conditions on routing policies that guarantee BGP safety.We use a new formalism, called the Simple Path Vector Protocol (SPVP), that is designed to capture the underlying semantics of any path vector protocol such as BGP. We identify a certain circular set of relationships between routing policies at various autonomous systems that we call a dispute cycle. We show that systems with no dispute cycles are guaranteed to be safe. While these include systems whose policies are consistent with shortest paths under some link metric, the class of systems with no dispute cycles is strictly larger.
Nearly optimal FIFO buffer management for two packet classes
Authors: Zvi Lotker, Boaz Patt-Shamir
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. We assume that each packet has value which is either 1 or α, for some α > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bound, and to the FIFO order of sent packets. We consider push-out buffers, where the algorithm may eject packets from anywhere in the buffer. The best lower bound on the competitive ratio of on-line algorithms for buffer management is approximately 1.28. In this paper we present an on-line algorithm whose competitive ratio is approximately 1.30 for the worst case α. The best previous general upper bound was about 1.888.
A Language-Based Framework for a Form Processor
Authors: B. Eilouti, E.-G. Vakal
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Based on the analogy of architectural composition as a formal language, a form processor is developed and tested. The proposed processor addresses a universal language of architectural form. It aims to facilitate the manipulation of forms in a manner similar to that in which a word processor manipulates words in natural languages. Based on the ontological assumption of structuralism, epistemological assumption of rationality, and the methodological assumption of representation, the research described in this paper identifies the rudimentary elements underlying all architectural forms, and the steps needed to aggregate them into more complex compositions. The theoretical foundation of the form processor employs concepts of formal languages, the theory of reduction, and Aristotle's theory of animal shape variation. More specifically, this paper discusses a form language that is based on the concepts of context-free and attributed grammars. It presents the development of a computational framework, the goal of which is to test the plausibility of the theoretical one. In turn, the computational framework is tested and illustrated by a case study.
Cover Model: A Framework for Design and Execution of Distributed Applications
Authors: V. P. Ivannikov, K. V. Dyshlevoi, V. E. Kamensky, A. V. Klimov, S. G. Manzheley, V. A. Omelchenko, L. B. Solovskaya, A. A. Vinokurov
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Bol. Kommunisticheskaya Many problems of distributed object-oriented applications can be uniformly resolved in the frame of approach based on the concept of cover. The cover is defined as an environment that transparently controls all aspects of object's community life: creation, interaction etc. To enable transparency, an object-oriented application must obey a principle of late binding, a reference to server object being obtained by the client at run time from a system environment. To implement cover services, the technique of metaobject control is applied, which provides extensions of program's semantics without changing the program code, by means of attaching additional method calls to each application object invocation. A special language (TL) in which the user can incrementally define new metaservices is described and illustrated by numerous examples.
Building a Visual Database for Example-based Graphics Generation
Authors: Michelle X. Zhou, Min Chen, Ying Feng
Venue: Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02) (2002)

Example-based graphics generation systems automatically create new information visualizations by learning from existing graphic examples. As part of the effort on developing a general-purpose example-based generation system, we are building a visual database of graphic examples. In this paper, we address two main issues involved in constructing such a database: example selection and example modeling. As a result, our work offers three unique contributions: First, we build a visual database that contains a diverse collection of well-designed examples. Second, we develop a feature-based scheme to model all examples uniformly and accurately. Third, our visual database brings several important implications to the area of information visualization.
An Analogy-based Approach to Lexicon Acquisition
Authors: Nicoletta Calzolari, Stefano Federici, Simonetta Montemagni, Vito Pirrelli
Venue:  (1997)

The Analogy-Based Lexical Acquisition System that we describe in this report belongs to a by now big family of NLP systems which are able to classify linguistic objects on the basis of instances of already acquired Knowledge (Federici and Pirrelli 1994, Montemagni et al. 1996, Pirrelli and Federici 1995, Yvon 1997). TEL:: +39 50 560481
An Efficient Middleware Architecture Supporting Time-Triggered Message-Triggered Objects and an NT-based Implementation
Authors: K. H. (Kane) Kim, Masaki Ishida, Juqiang Liu
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

The time-triggered message-triggered object (TMO) structuring scheme has been established to remove the limitation of conventional object structuring techniques in developing applications containing real-time (RT) distributed computing components. It is a natural and syntactically small but semantically powerful extension of the object oriented (OO) design and implementation techniques which allows the system designer to abstractly and yet accurately specify timing characteristics of data and function components of high-level distributed computing objects. It is a unified approach for design and implementation of both RT and non-RT distributed applications. A cost-effective way to support TMO-structured distributed RT programming is to build a TMO execution engine as a middleware running on well established commercial software/hardware platforms. In this paper, we present an efficient middleware architecture named TMO Support Middleware (TMOSM) which can be easily adapted to many commercial-off-the-shelf (COTS) platforms. The performance of a prototype implementation of TMOSM running on Windows NT platforms is also discussed.
Development of parsing tools for CASL using generic language technology
Authors: Mark Brand, Jeroen Scheerder
Venue:  (2000)

An environment for the Common Algebraic Specification Language CASL consists of independent tools. A number of CASL have been built using the algebraic formalism ASF+SDF and the +SDF Meta-Environment. CASL supports -defined syntax which is non-trivial to : ASF+SDF offers a powerful parsing (Generalized LR). Its interactive environment facilitates rapid complemented by early detection correction of errors. A number of core developed for the ASF+SDF -Environment can be reused in the context CASL. Furthermore, an instantiation of a format developed for the representation ASF+SDF specifications and terms provides a -specific exchange format.
On selfish routing in internet-like environments
Authors: Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing networks (e.g., Detour or RON). Such approaches result in selfish routing, because routing decisions are no longer based on system-wide criteria but are instead designed to optimize host-based or overlay-based metrics. A series of theoretical results showing that selfish routing can result in suboptimal system behavior have cast doubts on this approach. In this paper, we use a game-theoretic approach to investigate the performance of selfish routing in Internet-like environments. We focus on intra-domain network environments and use realistic topologies and traffic demands in our simulations. We show that in contrast to theoretical worst cases, selfish routing achieves close to optimal average latency in such environments. However, such performance benefit comes at the expense of significantly increased congestion on certain links. Moreover, the adaptive nature of selfish overlays can significantly reduce the effectiveness of traffic engineering by making network traffic less predictable.
Efficient and Accurate Ethernet Simulation (revised)
Authors: Jia Wang, Srinivasan Keshav
Venue:  (1999)

The Internet is increasingly being called upon to provide different levels of service to different applications and users. A practical problem in doing so is that although Ethernet is one of the hops for nearly all communication in the Internet, it does not provide any QoS guarantees. A natural question, therefore, is the effect of offered load on Ethernet throughput and delay. In this paper, we present several techniques for accurately and efficiently modeling the behavior of a heavily loaded Ethernet link. We first present a distributed approach to exact simulation of Ethernet. Then, we describe an efficient distributed simulation model, called Fast Ethernet Simulation, that empirically models an Ethernet link to quickly and accurately simulate it. By eliminating the implementation of CSMA/CD protocol, our approach reduces computational complexity drastically while still maintaining desirable accuracy. Performance results show that our techniques not only add very little overhead (less than 5% in our tests) to the basic cost of simulating an Ethernet link, but also closely match real-world measurements. We also present efficient techniques for compressing cumulative distributions using hyperbolic curves and for monitoring the load on a heavily loaded link. Finally, we show applications to illustrate the potential usage of the Fast Ethernet Simulation.
Challenges in Location-Aware Computing
Authors: Cynthia A. Patterson, Richard R. Muntz, Cherri M. Pancake
Venue: IEEE Pervasive Computing (2003)

This invited, non-peer-reviewed piece summarizes a report entitled IT Roadmap to a Geospatial Future, which was recently published by the US National Research Council. The lead author, Cynthia Patterson, was the NRC study director for the report. Dick Muntz chaired the committee that produced the report, and committee member Cherri Pancake led the integration of report components into a cohesive whole. I asked the authors to summarize those aspects of the report most relevant to pervasive computing. Our goal in publishing this summary is to interest you in reading the full NRC report at www.cstb.org/project_geospatial.html. M. Satyanarayanan
Object representation on a heterogeneous network
Authors: C. Gray Girling
Venue: ACM SIGOPS Operating Systems Review (1982)

This paper documents some of the author's recent research into representation and naming in local area communication networks. It outlines a simple and practical method of providing what could be called 'network capabilities', an effort being made to keep this topic distinct from those of data security, data communication, network configurations and protocols.
Force XXI LandWarrior: Implementing Spoken Commands for Soldier Wearable Systems
Authors: Gary Cleveland, Linda McNinch
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Implementing effective control systems for wearable computers presents numerous design challenges, especially when the end users are soldiers who need to use their hands to control weapons rather than computers. This paper describes the work performed and the results achieved by the System Voice Control team on the Force XXI Land Warrior (FXXI LW) project at Motorola. This team integrated Motorola's CVoxCon speech recognition system into an existing soldier computer system. The successful CVoxCon implementation suggests guidance for other efforts and areas for future investigation.