ppxscal/embedding_network huggingface dataset:
CASS: an efficient task management system for distributed memory architectures
Authors: Jing-Chiou Liou, M. A. Palis
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the application characteristics. On the other hand, the task of limiting the parallelism in a chosen parallel algorithm is best handled by the compiler or operating system for the target MPP machine. Toward this end, we have developed CASS (for Clustering And Scheduling System), a task management system that provides facilities for automatic granularity optimization and task scheduling of parallel programs on distributed memory parallel architectures. Our tool environment, CASS, consists of a two-phase method of compiler-lime scheduling in which task clustering is performed prior to the actual scheduling process. The clustering module identifies the optimal number of processing nodes that the program will require to obtain maximum performance on the target parallel machine. The scheduling module maps the clusters onto a fixed number of processors and determines the order of execution of tasks in each processor.
Composite freeform surface reconstruction using recursive interpolating subdivision scheme
Authors: B. Y. Ren, I. Hagiwara
Venue: Computers in Industry (2003)

Composite freeform surface reconstruction from 3D scanned data of a physical model has become a more and more important topic in the field of CAD/CAE/CAM. By repeated application of a fixed set of recursive interpolation subdivision schemes on the initial mesh of the 3D sparse scanned data of a physical model, a polygonal model of composite freeform surface can be constructed. In the paper, the algorithm for constructing the initial triangular mesh from 3D sparse scanned data is presented. The unified recursive interpolating subdivision scheme for triangular mesh is proposed. A special quad-tree data structure is suggested to store all the necessary information of the vertices and elements of the polygonal model. Examples of composite surface reconstruction are provided to explain the distinguished superiority of subdivision scheme for reconstructing the arbitrary topological complex surface.
Bisimulation for probabilistic transition systems: a coalgebraic approach
Authors: E. P. Vink, J. J.M.M. Rutten
Venue:  (1998)

The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendler in terms of a set functor, which associates to a set its collection of simple probability distributions. This coalgebraic formulation makes it possible to generalize the concepts of discrete probabilistic transition system and probabilistic bisimulation to a continuous setting involving Borel probability measures. A functor M is introduced that yields for a metric space its collection of Borel probability measures. Under reasonable conditions, this functor exactly captures generalized probabilistic bisimilarity. Application of the final coalgebra paradigm to a functor based on M then yields an internally fully abstract semantical domain with respect to probabilistic bisimulation, which is therefore well-suited for the interpretation of probabilistic specification and stochastic programming concepts.
Coding and geometrical shapes innanostructures: A fractal DNA-assembly
Authors: Alessandra Carbone, Nadrian C. Seeman
Venue: Natural Computing: an international journal (2003)

Fractal patterns represent an important class of aperiodic arrangements. Generating fractal structures by self-assembly is a major challenge for nanotechnology. The specificity of DNA sticky-ended interactions and the well-behaved structural nature of DNA parallelogram motifs has previously led to a protocol that appears likely to be capable of producing fractal constructions [A. Carbone and N.C. Seeman, A route to fractal DNA assembly, Natural Computing 1, 469&ndash;480, 2002]. That protocol depends on gluing the set of tiles with special `glue tiles' to produce the fractal structure. It is possible to develop a fractal-assembly protocol that does not require the participation of gluing components. When designed with similar DNA parallelogram motifs, the protocol involves sixteen specific tiles, sixteen closely related tiles, and a series of protecting groups that are designed to be removed by the introduction of specific strands into the solution. One novel aspect of the construction on the theoretical level is the interplay of both geometry and coding in tile design. A second feature, related to the implementation, is the notion of generalized protecting groups.
The designer's perspective to noncooperative networks
Authors: Y. A. Korilis, A. A. Lazar, A. Orda
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

A noncooperative network is considered, in which each user routes its flow in a way that optimizes its individual performance objective. Nash equilibria characterize the operating points of the network. The network designer aims to allocate link capacities, so that the resulting Nash equilibria are efficient, according to some system-wide performance criterion. In a noncooperative setting, the solution of such design problems is, in general, complex and at times counterintuitive, since adding link capacity might lead to degradation of user performance. For systems of parallel links, it is shown that such paradoxes do not occur and that the capacity allocation problem has a simple and intuitive optimal solution, that coincides with the solution in the single-user case. Extensions to general network topologies are also derived.
Model-Based Visual Tracking for Outdoor Augmented Reality Applications
Authors: Reinhold Behringer, Jun Park, Venkataraman Sundareswaran
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Outdoor Augmented Reality (AR) applications rely on hybrid tracking (GPS, digital compass, visual) for registration. RSC has developed a real-time visual tracking system that uses visual cues of buildings in an urban environment for correcting the results of a conventional tracking system. This approach relies on knowledge of a CAD model of the building. It not only provides motion estimation, but also absolute orientation/position. It is based on the "Visual Servoing" approach, originally developed for robotics tasks. We have demonstrated this approach in real-time at a building on the NRL campus This poster shows the approach and results. The concept can be generalized to any scenario where a CAD model is available. This system is being prepared for integration into the NRL system BARS (Battlefield Augmented Reality System).
Automatic 3D Registration of Lung Surfaces in Computed Tomography Scans
Authors: Margrit Betke, Harrison Hong, Jane Ko
Venue:  (2001)

Abstract We developed an automated system that registers chest CT scans temporally. Our registration method matches corresponding anatomical landmarks to obtain initial registration parameters. The initial point-to-point registration is then generalized to an iterative surface-to-surface registration method. Our ``goodness-of-fit'''' measure is evaluated at each step in the iterative scheme until the registration performance is sufficient. We applied our method to register the 3D lung surfaces of 11 pairs of chest CT scans and report promising registration performance.
Will selection for mutational robustness significantly retard evolutionary innovation on neutral networks?
Authors: Seth Bullock
Venue: Proceedings of the eighth international conference on Artificial life (2002)

As a population evolves, its members are under selection both for rate of reproduction (fitness) and mutational robustness. For those using evolutionary algorithms as optimisation techniques, this second selection pressure can sometimes be beneficial, but it can also bias evolution in unwelcome and unexpected ways. Here, the role of selection for mutational robustness in driving adaptation on neutral networks is explored. The behaviour of a standard genetic algorithm is compared with that of a search algorithm designed to be immune to selection for mutational robustness. Performance on an RNA folding landscape suggests that selection for mutational robustness, at least sometimes, will not unduly retard the rate of evolutionary innovation enjoyed by a genetic algorithm. Two classes of random landscape are used to explore the reasons for this result.
Fido: A Cache That Learns To Fetch
Authors: Mark Palmer, Stanley B. Zdonik
Venue:  (1991)

Accurately fetching data objects or pages in advance of their use is a powerful means of improving performance, but this capability has been difficult to realize. Current OODBs maintain object caches that employ fetch and replacement policies derived from those used for virtual-memory demand paging. These policies usually assume no knowledge of the future. Object cache managers often employ demand fetching combined with data clustering to effect prefetching, but cluster prefetching can be ineffective when the access patterns serviced are incompatible. This paper describes FIDO, an experimental {\em predictive cache} that predicts access for individuals during a session by employing an associative memory to assimilate regularities in the access pattern of an individual over time. By dint of continual training, the associative memory adapts to changes in the database and in the user''s access pattern, enabling on-line access predictions for prefetching. We discuss two salient components of Fido: \begin{enumerate} \item MLP, a replacement policy for managing pre-fetched objects. \item Estimating Prophet, an associative memory that recognizes patterns in access sequences adaptively over time and provides on-line predictions used for prefetching. \end{enumerate} We then present some early simulation thatts which suggest that predictive caching works well, especially for sequential access patterns, and conclude that predictive caching holds great promise.
Distributed splitting of constraint satisfaction problems
Authors: Farhad Arbab, Eric B.G. Monfroy
Venue:  (2000)

Constraint propagation aims to reduce a constraint satisfaction problem into an equivalent but simpler one. However, constraint propagation must be interleaved with a splitting mechanism in order to compose a complete solver. In~\cite{monfroy:sac2000} a framework for constraint propagation based on a control-driven coordination model was presented.\\ In this paper we extend this framework in order to integrate a distributed splitting mechanism. This technique has three main advantages: 1)\,in a single distributed and generic framework, propagation and splitting can be interleaved in order to realize complete distributed solvers, 2)\, by changing only one agent, we can perform different kinds of search, and 3)\, splitting of variables can be dynamically triggered before the fixed point of a propagation is reached.
A New GA Approach for the Vehicle Routing Problem
Authors: Ang Juay Chin, Ho Wee Kit, Andrew Lim
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper focuses on the study of a hybrid of two search heuristics, Tabu Search (TS) and Genetic Algorithm (GA) on Vehicle Routing Problem with Time-Windows (VRPTW). TS is a local search technique that has been successfully applied to many NP-complete problems. On the other hand, GA which is capable of searching multiple search areas in a search space is good in diversification. We shall investigate whether a hybrid of the two heuristic outperforms the individual heuristics alone.
Representing Visual Programs with Object-Graphs
Authors: Eric J. Golin, Steven P. Reiss
Venue:  (1989)

We consider the development of a representation for programs in a visual programming environment. Abstract syntax trees are generally used to represent textual programs, but tree-based structures are inadequate as a basis for representing visual programs. We generalize abstract syntax trees to abstract syntax graphs and introduce object-graphs as a definition. We show how object-graphs can be used to represent visual programs.
Conic Representation of a Rational Cubic Spline
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

A rational cubic spline, with on family of shape parameters, has been discussed with the view to its application in Computer Graphics. It incorporates both conic sections and parametric cubic curves as special cases. The parameters (weights), in the description of the spline curve can be used to modify the shape of the curve, locally and globally, at the knot intervals. The rational cubic spline attains parametric C2 smoothness whereas the stitching of the conic segments preserves visually reasonable smoothness at the neighboring knots. The curve scheme is interpolatory and can plot parabolic, hyperbolic, elliptic, and circular splines independently as well as bits and pieces of a rational cubic spline. 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
Interleaved Backtracking in Distributed Constraint Networks
Authors: Youssef Hamadi
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the potential speed up of a parallel exploration in the processing of distributed problems. This paper extends DIBT, a distributed search procedure operating in distributed constraint networks.The extension is twofold. First the procedure is up dated to face delayed information problems upcoming in heterogeneous systems. Second, the search is extended to simultaneously explore independent parts of a distributed search tree. By this way we introduce parallelism into distributed search, which brings to Interleaved Distributed Intelligent BackTracking (IDIBT). Our results show that 1) insoluble problems do not greatly degrade performance over DIBT and 2) super linear speed up can be achieved when the distribution of solution is nonuniform.
Quantum cryptography in practice
Authors: Chip Elliott, David Pearson, Gregory Troxel
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

BBN, Harvard, and Boston University are building the DARPA Quantum Network, the world's first network that delivers end-to-end network security via high-speed Quantum Key Distribution, and testing that Network against sophisticated eavesdropping attacks. The first network link has been up and steadily operational in our laboratory since December 2002. It provides a Virtual Private Network between private enclaves, with user traffic protected by a weak-coherent implementation of quantum cryptography. This prototype is suitable for deployment in metro-size areas via standard telecom (dark) fiber. In this paper, we introduce quantum cryptography, discuss its relation to modern secure networks, and describe its unusual physical layer, its specialized quantum cryptographic protocol suite (quite interesting in its own right), and our extensions to IPsec to integrate it with quantum cryptography.
Proprietà dielettriche dei tessuti umani: definizioni, modello parametrico, codici di calcolo.
Authors: Daniele Andreuccetti, Roberto Fossi
Venue:  (2000)

Definitions and basic theory of the dielectric properties of biological tissues are recalled. Mathematical and computational codes and various on-line and off-line applications are presented, based on the Gabriel's parametric model.
Evolution and Errors: An Empirical Example
Authors: C. R. Douce, P. J. Layzell
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

An empirical study is presented that explores how dangerous errors can be introduced into software by the simplest of maintenance tasks. Six different maintenance problems were given to eight intermediate level programmers. Each maintenance problem was coded using the C++ language and were selected from a domain that was deemed to be familiar to all subjects. An alarming level of error was discovered. Analysis of the maintained software showed that one third of all the resulting programs contained an error of some form. Reasons why the error rates were so high are considered and two broad approaches to the reduction of maintenance error are described.
Circular and Axial Birefringence Due to Net Angular Momentum
Authors: M. W. Evans
Venue:  (1990)

Circular and axial birefringence due to net angular momentum is introduced in analogy with the Faraday and Wagniere/Meier effects. Spin induced circular birefringence conserves reversality and parity in both achiral and chiral ensembles, whereas the axial counterpart violates parity in achiral ensembles, and is supported in consequence only in a chiral molecular material. The new effects are treated with novel molecular property tensors in the non-relativistic approximation, and distinguished carefully from the relativistic phenomenon of rotational aether drag.
Internet Safety
Authors: Josepha Sherman
Venue:  (2003)

:The Internet offers its users the opportunity to learn, communicate, and have fun online. To navigate this electronic world safely, there are many things that Internet users need to know, such as selecting a good password. This book discusses the possible hazards of e-mail, chat rooms, instant messaging, and online sites and provides information on how to avoid common safety problems.
Named Disjunctions and Lazy Evaluation for Syntactic Ambiguities
Authors: Philippe Blache
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Ambiguity is one of the main sources of complexity in natural language processing. We propose in this paper an original solution relying on the use of named disjunctions which are set of ordered formulae linked by a name. This representation is implemented within a constraint logic programming paradigm (allowing the use of underspecified structures) by means of lazy evaluation techniques. This approach avoid the expansion of the disjunctions into a normal form and allows in some cases to compute a partial syntactic structure without disambiguating.
Translating UAN into CSP
Authors: Ian MacColl, David Carrington
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

In this paper we define a translation from the User Action Notation (UAN) to the process algebra Communicating Sequential Processes (CSP). UAN is an informal notation, used for task modeling and design. Translating a UAN task description to CSP provides a basis for rigorous development of an interactive system. The resulting CSP description is a suitable abstract starting point for development, as it describes externally visible behaviour with no mention of presented or underlying state. Our translation covers all UAN constructs except for waiting, interruptibility and true concurrency, which cannot be expressed in interleaving, untimed CSP. Our approach integrates task models, typically based on user-oriented concerns, into rigorous development, which is typically system-oriented. It provides a basis for a framework for formal development of interactive systems.
On-Line Planarity Testing
Authors: Giuseppe D Battista, Roberto Tamassia
Venue:  (1989)

The {\em on-line planarity testing} problem consists of performing the following operations on a planar graph $G$ with $n$ vertices: \begin{enumerate} \item testing if a new edge can be added to {\em G} so that the resulting graph is itself planar; \item adding vertices and edges such that planarity is preserved. \end{enumerate} We present an efficient technique for on-line planarity testing that uses $O(n)$ space and supports tests and insertions of vertices and edges in $O(\log n)$ time. The bounds for queries and vertex insertions are worst-case and the bound for edge insertions is amortized.
FDOD Function and the Information Discrepancy Contained in Multiple Probability Distributions
Authors: Weiwu Fang
Venue:  (1997)

The concept of Shonnon information has played a significant role in a variety of scientific and engineering areas. The question naturally arises: how can we measure information discrepancy contained in two or more probability distributions? The answer to this problem will be very interesting in both theory and practice. Some measures for the cases of two or three distributions have presented by the pioneers, but these measures have some disadvantages; moreover, there doesn''t exist a measure for $n$ distributions so far. A FDOD function with many good properties has been introduced in the study of information discrepancy of judgments of multiple experts ( FW 1994). In this paper, based on the ideas concerned with Shannon information and measures of difference, we propose an axiom set for measuring the information discrepancy contained in a group of distributions, and prove that the only function satisfying the axiom set is of the FDOD form. The final results and even the intermediate results in deed show the close connection of the FDOD function with Shannon information and the measures of difference in statistics.
Time-Varying z-Transform for the Analysis of Discrete-Time Linear Time Periodic Systems
Authors: A. Garcia Iturricha, J. Sabatier, A. Oustaloup
Venue: Journal of Dynamical and Control Systems (2003)

This article deals with a new representation of linear discrete-time periodic systems. This representation, based on the time-varying z-transform, turns out to be highly efficient in the field of automatic control, when an appropriate choice of the sampling period is made. This representation permits to extend many well-known theorems, in particular, the initial- and final-value theorems, to the case of these systems and to predict the presence of limit cycles. Finally, this representation can be used to establish an extension of the Nyquist criterion to the feedback discrete-time periodic systems.
On the Fine Structure of Large Search Spaces
Authors: Carla Gomes, Bart Selman
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, often outperform deterministic strategies. In this paper, we relate the performance of randomized methods to geometric properties of the underlying search space. In particular, our study reveals the inherent fractal nature of the search space, at different length scales, for a range of combinatorial problems. We also discuss the impact of these results on the design of better search methods.
A Wearable Computer System with Augmented Reality to Support Terrestrial Navigation
Authors: Bruce Thomas, Wayne Piekarski, David Hepworth, Bernard Gunther, Victor Demczuk
Venue: Proceedings of the 2nd IEEE International Symposium on Wearable Computers (1998)

To date augmented realities are typically operated in only a small defined area, in the order of a large room. This paper reports on our investigation into expanding augmented realities to outdoor environments. The project entails providing visual navigation aids to users. A wearable computer system with a see-through display, digital compass, and a differential GPS are used to provide visual cues while performing a standard orienteering task. This paper reports the outcomes of a set of trials using an off the shelf wearable computer, equipped with a custom built navigation software package, ``map-in-the-hat.''