ppxscal/embedding_network huggingface dataset:
Web Operation Recorder and Player
Authors: Yoshinori Aoki, Fumio Ando, Amane Nakajima
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

This paper describes mechanisms for recording and playing back Web browser operations. A recorder detects a user's operations on a Web browser and saves them as an event sequence called a scenario. A player plays back the scenario by controlling an actual Web browser. In addition, the recorder and player allow a user to add explanations to existing HTML contents by making ¿ink¿ annotations and attaching text, images, and hyperlinks on a Web page. The recorder and player not only enable a Web site owner to gather users' behavior at his or her Web site, but also make it easy to create a Web-based automatic presentation scenario, which can be played back later. The recorder and player run in a Java-enabled Web browser. Users do not have to prepare the Web contents to be recorded; they can work with ordinary Web pages.
Fully Dynamic Techniques for Reachability in Planar sT-graphs
Authors: S. Sairam, Robert F. Cohen, Roberto Tamassia, Jeffrey S. Vitter
Venue:  (1990)

We present fully dynamic techniques to solve the reachability problem in single-source multi-sink planar {\em st-}graphs ({\em sT-}graphs). We provide an {\em O(n)} space data structure which supports transitive closure queries in $O( \log ^ 2 n )$ time. We then show how to maintain this data structure under updates (insertion of an edge and expansion of a vertex, and their inverses) to the graph {\em G}, in time $O ( \log n ) $.
Virtual Reality and Augmented Reality as a Training Tool for Assembly Tasks
Authors: A. C. Boud
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

In this paper we investigate whether Virtual Reality (VR) and Augmented Reality (AR) offer potential for the training of manual skills, such as for assembly tasks, in comparison to conventional media.We present results from experiments that compare assembly completion times for a number of different conditions. We firstly investigate completion times for a task where participants can study an engineering drawing and an assembly plan and then conduct the task. We then investigate the task under various VR conditions and context-free AR.We discuss the relative advantages and limitations of using VR and AR as training media for investigating assembly operations, and we present the results of our experimental work.
Cluster and Calendar Based Visualization of Time Series Data
Authors: Jarke J. Van Wijk, Edward R. Van Selow
Venue: Proceedings of the 1999 IEEE Symposium on Information Visualization (1999)

A new method is presented to get insight into univariate time series data. The problem addressed here is how to identify patterns and trends on multiple time scales (days, weeks, seasons) simultaneously. The solution presented is to cluster similar daily data patterns, and to visualize the average patterns as graphs and the corresponding days on a calendar. This presentation provides a quick insight into both standard and exceptional patterns. Furthermore, it is well suited to interactive exploration. Two applications, numbers of employees present and energy consumption, are presented.
Patient Privacy in Electronic Prescription Transfer
Authors: Edward Ball, David W. Chadwick, Darren Mundy
Venue: IEEE Security and Privacy (2003)

The authors describe an electronic prescription transfer system that protects patient privacy.
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
Authors: Fan Ye, Gary Zhong, Jesse Cheng, Songwu Lu, Lixia Zhang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In this paper we present PEAS, a robust energy-conserving protocol that can build long-lived, resilientsensor networks using a very large number of small sensors with short battery lifetime. PEAS extends the network lifetime by maintaining a necessary set of workingnodes and turning off redundant ones. PEAS operations are based on individual node's observation of thelocal environment and do not require anynode to maintain per neighbor node state. PEAS performance possesses a high degree ofrobustness in the presence of bothnode power depletions and unexpected failures. Oursimulations and analysis show that PEAS can maintain an adequate working node density in the face ofup to 38% node failures, and it can maintain roughly aconstant overhead level under various deployment conditions ranging from sparse to very dense node deployment by using less than 1% of total energy consumption. As a result, PEAS can extend a sensor network'sfunctioning time in linear proportion to the deployedsensor population.
The Architecture of OCMP and its Evaluation
Authors: Keizo Saisho, Takeshi Sano, Keniti Iwata, Akira Fukuda
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

By gathering multiple processors in one LSI chip, communication delay between processors becomes shortening and then efficient fine/medium grain parallel processing can be realized. The authors propose new processor architecture called "OCMP (On-Chip Multi-Processing Architecture)". OCMP has two characteristics; one is the instruction level dispatching mechanism, and the other is the divided cache system. OCMP employs fork-join type parallel processing model in order to simplify the dispatching mechanism. By dividing cache system into shared cache and private one, the cache coherence problem between processors in a same chip is removed and access conflict on shared cache is also relaxed. OCMP is evaluated with the instruction level simulator which developed by the authors. Two type of instruction level dispatching mechanisms are compared with each other. Memory access mechanism is evaluated with various parameters such as memory access cost, the degree of simultaneous access to shared cache, and so on.
Hyper-elastic constitutive equations of conjugate stresses and strain tensors for the seth-hill strain measures
Authors: K. Farahani, H. Bahai
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Use of hypo-elastic constitutive equations for large strains in nonlinear finite element applications usually needs special considerations. For example, the strain doesn't vanish in some elastic loading and unloading closed cycles, and they need objective rate tensors, and incrementally objective algorithm for numerical application and integration. Hyper-elastic constitutive equation in comparison, don't need these considerations. However, their behaviour for large elastic strains is important, and may differ in tension and compression. In the present work, Hyperelastic constitutive equations for the Seth-Hill strains and their conjugate stresses are explored as a natural generalisation of Hook's law for finite elastic deformations. Based on the uniaxial and simple shear tests, the response of the material for different constitutive equations is examined. Together with an objective rate model, the effect of different constitutive laws on Cauchy stress components is compared. It is shown that the logarithmic strain and its conjugate stress give answers nearer to that of the rate model. In addition, use of Biot stress-strain pairs for a bar element, results in an elastic spring which obeys the hook's law even for large deformations and behaves the same in tension and compression. The volume change of material is another factor which is noticed.
Towards a Dynamic Optimal Alphabetic Tree
Authors: A. B Ahmed, S. S Mohamed, M. A Shymaa
Venue:  (1999)

Optimal alphabetic binary trees have a wide variety of applications in computer science and information systems. Fast algorithms for building such trees in O(n log n) do exist. However, no existing algorithm makes it possible to insert in (or delete from) the tree without losing its optimality. In this paper, we propose an algorithm to insert into or delete from an optimal binary alphabetic tree in linear time keeping the tree optimal after insertion or deletion. We show that both insertion and deletion of a node can be done in O(n) time provided its weight is not bigger than the higher weight of its two neighbouring nodes. This algorithm makes it possible to have a dynamic optimal alphabetic tree with reasonable complexity and allows us to expand the domain of weight sequences whose optimal alphabetic trees can be obtained in linear time. Key words: Optimal alphabetic tree, insertion and deletion, linear-time alphabetic trees.
Computational model for analysis of bending fatigue in gears
Authors: J. Kramberger, M. Šraml, S. Glodež, J. Flašker, I. Potrč
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A computational model for determination of service life of gears in regard to bending fatigue in a gear tooth root is presented. The fatigue process leading to tooth breakage is divided into crack initiation (Ni) and crack propagation (Np) period, where the complete service life is defined as N=Ni+Np . The strain-life method in the framework of the FEM method has been used to determine the number of stress cycles Ni required for the fatigue crack initiation. Gear tooth crack propagation was simulated using a FEM method based computer program which uses principles of linear elastic fracture mechanics. Paris equation is then used for the further simulation of the fatigue crack growth. The presented model is used for determination of service life of real spur gear made from through-hardened steel 42CrMo4.
A Class of Multistage Conference Switching Networks for Group Communication
Authors: Yuanyuan Yang, Jianchao Wang
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Many emerging network applications, such as teleconferencing and information services, require group communication, in which messages from one or more sender(s) are deliveredto a large number of receivers. In this paper, we consider efficient network support for a key type of group communication, conferencing. A conference refers to a group of members in a network who communicate with each other within the group. In our recent work [5], we proposed a design for a conference network which can support multiple disjoint conferences. The major component of the network is an enhanced multistage switching network which interconnects switch modules with fan-in and fan-out capability. The multistage network used is modified from an indirect binary cube network by relaying all internal outputs at each stage through multiplexers to the outputs of the network. Each conference is realized in an indirect binary cube-like subnetwork depending on its location. A natural question here is: Can wedirectly adopt a class of multistage networks such as a baseline, an omega, or an indirect binary cube network to obtain a conference network with more regular network structure, simpler self-routing algorithm and less hardware cost? This paper aims to answer this question. The key issue in designing a conference network is to determine the multiplicity of routing conflicts, which is the maximum number of conflict parties competing a single interstage link when multiple disjoint conferences simultaneously present in the network. Our results in this paper show that for a network of size n × n, the multiplicities of routing conflicts aresmall constants (between 2 and 4) for an omega network or an indirect binary cube network; while it can be as large as \frac{{\sqrt n}}{3} +1 for a baseline network. Thus, our design for conference networks is based on an omega network or an indirect binary cube networkbut not a baseline network. We also develop fast self-routing algorithms for setting up routing paths in the newly designed conference networks. As can be seen, such an n × n conference network has O(log n) routing time and communication delay and O(n log n) hardware cost. The conference networks are superior to existing designs in terms of routing complexity, communication delay and hardware cost. The conference network proposed is rearrangeably nonblocking in general, and is strictly nonblocking under some conference service policy. It can be used in applications that require efficient or real-time group communication.
Multiple Separatrix Crossing in Multi-degree-of-freedom Hamiltonian Flows: Global Geometry and Phase Space Transport Associated with Multiple Partial Barriers and Turnstiles
Authors: Darin Beigie
Venue:  (1994)

(The following contains mathematical formulae and symbols that may become distorted in ASCII text.) We study separatrix crossing in near-integrable k-degree-of-freedom Hamiltonian flows, 2<k<infinity , whose unperturbed phase portraits contain separatrices in n degrees-of-freedom, 1<n<k. Each of the unperturbed separatrices can be recast as a codimension-one separatrix in the 2k-dimensional phase space, and the collection of takes on a variety of geometrical possibilities in the reduced representation of a Poincar=E9 section on the energy surface. In general 0<=3Dl<=3Dn of the separatrices will be available to the Poincar=E9 section, and each separatrix may be completely isolated from all other separatrices, or intersect transversely with one or more of the other available separatrices. For completely isolated separatrices, transitions across broken separatrices are described for each separatrix by the single-separatrix crossing theory of Wiggins, as modified by Beigie. For intersecting separatrices, a possible violation of a normal hyperbolicity condition complicates the analysis by preventing the use of a persistence and smoothness theory for compact normally hyperbolic invariant manifolds and their local stable and unstable manifolds. For certain classes of multi-degree-of-freedom flows, however, a local persistence and smoothness result is straightforward, and we study the global implications of such a local result. In particular, we find codimension-one, partial barriers and turnstile boundaries associated with each partially destroyed separatrix. From the collection of partial barriers and turnstiles follows a rich phase space partitioning and transport formalism to describe the dynamics amongst the various degrees-of-freedom. A generalization of Wiggins'' higher-dimensional Melnikov theory to codimension-one surfaces in the multi-separatrix case allows one to uncover invariant manifold geometry. In the context of this perturbative analysis and detailed numerical computations, we study invariant manifold geometry, phase space partitioning, and phase space transport, with particular attention payed to the role of a vanishing frequency in the limit approaching the intersection of the partially destroyed separatrices. The class of flows under consideration include ones of basic physical relevance, such as those describing scattering phenomena. The analysis is illustrated in the context of a detailed study of a 3-degree-of-freedom scattering problem. 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
VisiTrack - Video Based Incremental Tracking in Real Time
Authors: Natalia Esau, Bernd Kleinjohann, Lisa Kleinjohann, Dirk Stichling
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

This paper presents VisiTrack, a novel approach for video based incremental tracking in real time. The major objectives in the development of VisiTrack was to design or select algorithms that are well suited for embedded realtime computation. We had a special focus on latency reduction and storage minimization since the algorithms should run on mobile devices like PDAs with the appropriate extension, i.e. mainly a camera, in real time. The image analysis, position localization and error minimization of VisiTrack are explained in detail. For the image analysis algorithms of VisiTrack two major principles, linear processing and incremental concurrency, were defined and applied in order to fulfill real time costraints and reduce system latency. In order to meet real time requirements the position localization is based on a linear transformation between 3D world coordinates and 2D image coordinates. Afterwards a real time error minimization based on the kalaman filter is applied successfully. VisiTrack is applied in the Augmented Reality domain and in the field of robotic self localization.
A Parallel Row Distributed Linear Algebra System (PRDLA Users'' Guide)
Authors: Zhijun Wu, Thomas Coleman
Venue:  (1992)

The purpose of this system is to provide an easy-to-use et of basic parallel matrix manipulation subroutines, in C, for use on the Intel iPSC/860 hypercube. Most of the subroutines exhibit good performance, but not necessarily optimal. Users are welcome to use these subroutines as building blocks in their own codes, to modify if the situation warrants this, or just to study the implementation to help guide their own programming. The subroutines all operate under the assumption that matrices are distributed by row in a natural wrap mapping. That is, if we assume p processors, row 1 is mapped to processor 0, row 2 is mapped to processor 1, row p is mapped to processor p-1, row p+1 is mapped to processor 0, etc. If this is deemed to restrictive, the user is welcome to use these codes as a starting point and develop their own codes (perhaps under less restrictive assumptions). The codes are not directly portable to other computer systems. However, the codes do use PICL (the portable instrumented communication library, developed at Oak Ridge National Laboratory); therefore, provided PICL is available the codes are easily ported.
Progetto di ristrutturazione della rete informatica
Authors: A. Agostini, L. Stefani
Venue:  (1999)

Not available.
Evolution of stable ecosystems in populations of digital organisms
Authors: Tim F. Cooper, Charles Ofria
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Competition for resources has long been believed to be fundamental to the evolution of diversity. However, the difficulty of working with natural ecosystems has meant that this theory has rarely been tested. Here, we use the Avida experimental platform to demonstrate the evolution of ecosystems composed of digital organisms. We show that stable ecosystems are formed during evolution in an environment where organisms must compete for limiting resources. Stable coexistence was not observed in environments where resource levels were not limiting, suggesting that competition for resources was responsible for coexistence. To test this, we restarted populations evolved in the resource-limited environment but increased resource levels to be non-limiting. In this environment, ecosystems previously supporting multiple genotypes could maintain only a single genotype. These results demonstrate the utility of the Avida platform for addressing ecological questions and demonstrate its potential in addressing questions involving ecosystem-level processes.
Due-giorni di algebra lineare computazionale
Authors: Mario Arioli, Valeria Simoncini
Venue:  (1997)

This report collects the abstracts of the talks given by the participants to the meeting of Numerical Linear Algebra held at IAN-CNR in Pavia during the spring ''97. EMAIL:: ian@microian.ian.pv.cnr.it
Replication in Spring: A New Subcontract
Authors: Joshua S. Spiewak
Venue:  (1995)

Replication in Spring: A New Subcontract Joshua S. Spiewak 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
Communication Networks: Fundamental Concepts and Key Architectures, 2 edition
Authors: Alberto Leon-Garcia, Indra Widjaja
Venue:  (2003)

:This new text is designed for introductory courses in communications in either electrical engineering or computer science programs. It can be used by undergraduate or first year graduate level programs Addressing networks from a top-down approach,this text shows students the big picture of networks in general so that they may see how the various parts of the network fit in to the picture. The book is organized into six sections that progressively consider the networking functions in greater level of detail. The book presents a balanced view of all important elements of networking and is organized so that all relevant topics can be covered at some minimum level of detail
Mixed discrete optimization of multiple-valued systems
Authors: A. Etzel
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

In this paper, a cutting-plane method is presented that has been applied to mixed multiple-valued optimization problems. In practice, the approach is faster than transforming mixed multiple-valued programs to mixed integer or zero-one integer programs. The approach can be used for fuzzy sets and industrial applications involving discrete intervals of feasible solutions. It has been applied to industrial power plants and flexible manufacturing systems.
A Graph Parsing Algorithm and Implementation
Authors: C. L. McCreary, A. Reed
Venue:  (1993)

This paper presents an algorithm for decomposing directed acyclic graphs (DAGs) into a hierarchy of subgraphs we call clans. The resulting parse tree is being used to partition and schedule program dependence graphs for efficient concurrent execution on a parallel system. The clans can be identified as able or unable to support parallel execution, and their connections with other clans is completely characterized in the parse tree.
An O(nloglogn) On-line Algorithm for the Insert-Exact Min Problem
Authors: P. Boas
Venue:  (1974)

Integers within the range 1,...,n are inserted in a set, and on several occasions the minimal element is extracted from the set. We present an algorithm to executee a sequence of O(n) of these instrucitions on-line in time O(nloglogn) on a Random Access Machine. The instruction repertoire can be extended by instructions like allmin(i) (delete all elements not greater than i), extract max, or predecessor (i) (find the largest element >i), without disturbing the O(loglogn) processing time per item. Whereas the off-line insert-extract min problem is known to be reducible to the on-line union-find problem, we prove that the off-line insert-allmin problem is equivalent to the off-line union-find problem, hence the off-line problems have faster algorithms. As an application we show that our algorithm can be used to process a sequence of O(n) instructions of the types: ``split an interval'''', ``unite two adjacent intervals'''', and ``find the interval currently containing element j'''', on-line in time O(nloglogn). Keywords: set-manipulation, Analysis of Algorithms, binary tree.
Hierarchical 3D-Torus Interconnection Network
Authors: S. Horiguchi, T. Ooki
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Three dimensional (So) stacked implementation has been proposed as a new technology for massively parallel computers. However, two major limitations have hindered the progress in this direction: the technology of vertical interconnects and the cost in terms of area for these vertical interconnects. Each vertical interconnect requires 300,um x 300µm area,thus liberal is prohibited. Clearly, an interconnection philosophy which minimizes these vertical links can contribute to the success of a 30 implementation. Hierarchical 3D-Torusnetwork, called H3D-torus has been proposed to reduce the number of vertical links in 3D stackedimplementation but keeping good network feature. This paper addresses the architectural details of HSD-torus network, and explores aspects such as the network diameter, the peak number of vertical links, and VLSI layout area for the HQD-torus network as well as forseveral commonly used networks for parallel computers.