ppxscal/embedding_network huggingface dataset:
Hybrid Computation with an Attractor Neural Network
Authors: James A. Anderson
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

This paper discusses the properties of a controllable, flexible, hybrid parallel computingarchitecture that potentially merges pattern recognition and arithmetic. Humans perform integer arithmetic in a fundamentally different way than logic-based computers. Even though the human approach to arithmetic is slow and inaccurate for purely arithmetic computation, it can have substantial advantages when useful approximations ("intuition") are more valuablethan high precision. Such a computational strategy may be particularly useful when computers based on nanocomponents become feasible because it offers a way to make use of the potential power of these massively parallel systems.
Design of a Framework for Electronic Commerce Brokers
Authors: Nadia Bouassida, Thouraya Ayadi, Hanêne Ben-Abdallah, Faïez Gargouri
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

The abundance of specialized electronic brokers (e-brokers) combined with the complexity of their design phase reinforce the need for a reusable design for e-brokers.This paper presents an e-broker framework: a reusable object-oriented design that captures several e-brokers' behaviours. The framework is expressed in F-UML, a design language that visually distinguishes between the parts common in all e-broker applications and the parts adaptable when deriving a specific e-broker from the framework. The paper briefly presents F-UML. It then focuses on the design process. Finally, it highlights the difficulties, the advantages and limits of the proposed design method.
The Sparse Cyclic Distribution against its Dense Counterparts
Authors: Gerardo Bandera, Manuel Ujaldon, María A. Trenas, Emilio L. Zapata
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real applications, however, deal with both kind of data jointly. This paper presents techniques for integrating dense and sparse array accesses in a way that optimizes locality and further allows an efficient loop partitioning within a data-parallel compiler.Our approach is evaluated through an experimental survey with several compilers and parallel platforms. The results prove the benefits of the BRS sparse distribution when combined with CYCLIC in mixed algorithms and the poor efficiency achieved by well-known distribution schemes when sparse elements arise in the source code.
Minimizing Congestion in General Networks
Authors: Harald Räcke
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performance of distributed applications. In this paper we introduce a framework for solving on-line problems that aim to minimize the congestion (i.e. the maximum load of a network link) in general topology networks.We apply this framework to the problem of on-line routing of virtual circuits and to a dynamic data management problem. For both scenarios we achieve a competitive ratioof O(log3n) with respect to the congestion of the network links.Our on-line algorithm for the routing problem has the remarkable property that it is oblivious, i.e., the path chosen for a virtual circuit is independent of the current network load. Oblivious routing strategies can easily be implemented in distributed environments and have thereforebeen intensively studied for certain network topologies as e.g. meshes, tori and hypercubic networks. This is the first oblivious path selection algorithm that achieves a polylogarithmiccompetitive ratio in general networks.
Improving the Performance of Multi-Dimensional Access Structures Based on k-d-Trees
Authors: Andreas Henrich
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In recent years, various k-d-tree based multi-dimensional access structures have been proposed. All these structures share an average bucket utilization of at most ln 2 (about 69.3 %). In this paper we present two algorithms which perform local redistributions of objects to improve the storage utilization of these access structures. We show that under fair conditions a good improvement algorithm can save up to 20 % of space and up to 15 % of query processing time. On the other hand we also show that a local redistribution scheme designed without care, can improve the storage utilization and at the same time worsen the performance of range queries drastically. Furthermore we show the dependencies between split strategies and local redistribution schemes and the general limitations which can be derived from these dependencies.
Mapping Media Streams onto a Network of Servers
Authors: Reinhard Lüling
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficient management of a network of media servers. This network of servers can be implemented on top of a closely connected network of workstations as well as on a wide area network of media servers. The problem studied here addresses the management of media assets on such a network, i.e. the placement/replication of media assets on a net- work of media servers taking the user requests, storage capacity and bandwidth limitations of the server network into account. The algorithms presented for the solution of the S-MAMP problem make efficient use of the ability of audio/ video encoding standards such as MPEG to encode one stream in different bitrates providing scalable service quality to the user in this way.
Distributed Objects in Telecommunications
Authors: Gerard Meszaros
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

The telephone network could be called the world's first distributed object computer system. The high reliability, availability and capacity requirements of the telephone network have force the telecommunications industry to solve a number of key challenges. This paper discusses the applicability of these solutions to other areas of distributed object computing using the concept of "design patterns" as a way of describing how these problems are solved.
On Accessing and Customizing Cultural Heritage Objects in Tiscover
Authors: Birgit Pröll, Jürgen Palkoska
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Web-based tourism information systems should not only provide access to various tourism products, but should also present accompanying destination information, comprising among others information on cultural heritage. The generic platform for web-based destination information systems Tiscover tries to cope with this need. Tiscover supports three different access paradigms together with appropriate web patterns, allowing to conveniently access not only tourism products, but also a huge amount of destination information. Furthermore, customization mechanisms are provided, allowing adaptation of destination informationwith respect to both, structural aspects in terms of describing attributes and presentation aspects in terms of layout properties.
Beta-Connection: An Approach to Generate Families of Models from Planar Sections
Authors: Alex J. Quadros Vargas, Luis Gustavo Nonato, Rosane Minghim, Maria Cristina F. De Oliveira
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. A new three-dimensional reconstruction technique is presented that uses an integer control parameter, denoted β, to produce a family of models from a given set of planar cross-sections. Parameter β supports multiple choices for solving the correspondence problem, i.e., the problem of deciding which regions from two consecutive cross-sections must be connected into a single component. Thus, unlike current reconstruction methods, the beta-connection algorithm enables the consideration of multiple alternatives when establishingregion correspondence. In addition to this flexibility, which is useful in creating models with complex topologies, the algorithm produces PL-manifolds and respects the re-sampling condition, thus providing an interesting reconstruction solution for many practical visualization and numerical simulation applications.
Representing Temporal Data in Non-Temporal OLAP Systems
Authors: Johann Eder, Christian Koncilia
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Multidimensional data warehouses and OLAP systems do not provide adequate means for dealing with changes in dimension data, changes appearing frequently in dynamic application areas as current business systems. As data warehouses and OLAP tools serve as decision support systems they have to reflect such changes. Temporal data warehouses propose sophisticated modelling tools for covering any changes in dimension data but cannot be used with current OLAP systems. In this paper we show some techniques to incorporate temporal dimension data into multidimensional OLAP systems. In particular we show how to superimpose conventional multidimensional data warehouses with temporal master data, enabling queries to span multiple periods and to return correct answers.
A parallel algorithm for fault simulation based on PROOFS
Authors: Steven Parkes, Prithviraj Banerjee, Janak Patel
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Fault simulation for sequential circuits numbers among the highly compute intensive tasks in the integrated circuit design process. In the quest for rapid design turn around, parallelization has been proposed to speed fault simulation. We introduce ProperPROOFS, a parallel extension of the PROOFS fault simulation package. ProperPROOFS exploits parallelism based on fault partitioning, incorporating static and dynamic partitioning schemes and a new asynchronous and distributed method of fault redistribution. We present results for circuits in the ISCAS-89 benchmark set across several parallel architectures. A detailed evaluation of results provides new insight into the use of fault partitioning to parallelize high performance serial fault simulation applications.
On the Decidability of Self-Assembly of Infinite Ribbons
Authors: Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical world. A systematic study of self-assembly as a mathematical process has been initiated. The individual components are modelled as square tiles on the infinite two-dimensional plane. Each side of a tile is covered by a specific "glue", and two adjacent tiles will stick if they have matching glues on their abutting edges. Tiles that stick to each other may form various two-dimensional "structures" such as squares, rectangles, or may cover the entire plane. In this paper we focus on a special type of structure, called ribbon: A non-self-crossing sequence of tiles on the plane, in which successive tiles are adjacent along an edge, and abutting edges of consecutive tiles have matching glues. We prove that it is undecidable whether an arbitrary finite set of tiles with glues (infinite supply of each tile type available) can be used to assemble an infinite ribbon. The proof is based on a construction, due to Robinson, of a special set of tiles that allow onlyaperiodic tilings of the plane. This construction is used to create a special set of directed tiles (tiles with arrows painted on the top) with the "strong plane-filling property" - a variation of the "plane-filling property" previously defined by J. Kari. A construction of "sandwich" tiles is then used in conjunction with this special tile set, to reduce the well-known undecidable Tiling Problem to the problem of the existence of an infinite directed zipper (a special kind of ribbon). A "motif" construction is then introduced that allows one tile system to simulate another by using geometry to represent glues. Using motifs, the infinite directed zipper problem is reduced to the infinite ribbon problem, proving the latter undecidable.The result settles an open problemformerly known as the "unlimited infinite snake problem". Moreover, an immediate consequence is the undecidability of the existence of arbitrarily large structures self-assembled using tiles from a given tile set.
Localization of Brazilian Vehicles Plates Using Frequency Analysis
Authors: B. Borba, C. Vasconcelos, Marcelo Albuquerque, Márcio Albuquerque, I. A. Esquef, José Manoel Seixas
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This work aims the implementation of the Brazilian vehicle plate localization using image processing techniques. In this paper, we present how to find the horizontal position of the plate based on its frequency characteristics in the whole vehicle image. Preliminary results show efficiencies above 96% for images in good illumination conditions.
Business Rules Specification, Enforcement and Distribution for Heterogeneous Environments
Authors: Daniela Rosca, John D'Attilio
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Business rules are statements about the enterprise's way of doing business. They become requirements that govern the operational system of the enterprise and determine constraints for any system developed or procured for an enterprise. This paper addresses an architecture for the specification, enforcement and distribution of business rules, as a way of achieving the interoperability of distributed information systems that support an enterprise. We explore the XML encoding of business rules, which allows their multiple representations, necessary for dealing with the heterogeneity of software and platforms inherent in large companies, or in e-commerce applications. Our ideas are illustrated with examples implemented in Oracle's framework for developing e-business solutions.
More Versatile Scientific Document
Authors: Richard J. Fateman
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The electronic representation of scientific documents: journals, technical reports, program documentation, laboratory notebooks, etc. present challenges in several distinct communities. We see five distinct groups concerned with electronic versions of scientific documents:* Publishers of journals, texts, reference works, and their authors.* Software publishers for OCR/ document analysis, document formatting.* Software publishers whose products access ``contents semantics'' from documents, including library keyword search programs, natural language search programs, data-base systems, visual presentation systems, mathematical computation systems, etc.* Institutions maintaining access to electronic libraries, which must be broadly construed to include data and programs of all sorts. %Universities, Computer centers* Individuals and their programs acting as their agents who need to use these libraries, to identify, locate, and retrieve relevant documents.It would be good to have a convergence in design and standards for encoding new or pre-existing (typically paper-based) documents in order to meet the needs of all these groups. Various efforts, some loosely coordinated, but just as often competing, are trying to set standards and build tools. Where are we headed?
RAL: an Algebra for Querying RDF
Authors: Flavius Frasincar, Geert-Jan Houben, Richard Vdovjak, Peter Barna
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

To make the WWW machine-understandable there is astrong demand both for languages describing metadata andfor languages querying metadata. The Resource DescriptionFramework (RDF), a language proposed by W3C, canbe used for describing metadata about (Web) resources.RDF Schema (RDFS) extends RDF by providing meansfor creating application specific vocabularies (ontologies).While the two above languages are widely acknowledgedas a standard means for describing Web metadata, a standardizedlanguage for querying RDF metadata is still anopen issue. Research groups coming from both industry andacademia are presently involved in proposing several RDFquery languages. Due to the lack of an RDF algebra suchquery languages use APIs to describe their semantics andoptimization issues are mostly neglected. This paper proposesRAL, an RDF algebra suitable for defining (and comparing)the semantics of different RDF query languages and(at a future stage) for performing algebraic optimizations.After the definition of the data model we present the operatorsby means of which the model can be manipulated.The operators come in three flavors: extraction operatorsretrieve the needed resources from the input RDF model,loop operators support repetition, and construction operatorsbuild the resulting RDF model.
C&acirc;mbio: Realistic Three Dimensional Simulation of Humanoids based on Computer Vision and Robotics
Authors: Claus C. Aranha, Schubert R. Carvalho, Luiz M. G. Gonçalvez
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We introduce concepts and algorithms for control of visual motor commands and realistic simulation of basic abilities as visual servoing and perception for robotics simulation. The introduced tools can also be used in a straightforward way to build computer animated devices as virtual agents, and avatars. We use the tools to build part of a humanoid (arms and head) robot, effectively named "Câmbio". We will describe Câmbio's design, providing an overview on the most used feature extraction techniques for perception, discussing implementation issues. We intend to show the usefulness of a simulated platform as an inexpensive alternative for testing and developing computer vision algorithms in real-time robotics applications and its possible extensions to computer animated agents and avatars.
Performance Modeling and Composition: A Case Study in Cell Simulation
Authors: Steve G. Steinberg, Jun Yang, Katherine A. Yelick
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We present a case study in the use of performance modeling for parallel application development, with a biological cell simulation as our target application. We show that a simple performance model is adequate for determining data layout for arrays and linked structures, and validate our model against experimental results for some application kernels. We quantify the importance of optimizing across program components using information about machine performance and input characteristics. The cell simulation application has two phases, one regular and one irregular. The model closely predicts actual performance within the regular phase and allows for qualitative design comparisons in the irregular one. The resulting application is written in Split-C and runs on multiple platforms.
An Approximate String Match for Garbled Text with Various Accuracy
Authors: Atsuhiro Takasu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a fast approximate string matching method. In constructing information spaces such as digital libraries, we have to collect vast amount of information and convert it into uniformly organized data. Since much of the information must be converted from various media automatically, the space contains garbled text with various accuracy. For utilizing these texts, we need to satisfy the three requirements, i.e., high recall, high precision and fast matching process. In order to satisfy these requirements, we have been developing a two-phase matching system. The presented method is used for fast and high recall candidate word selection in the first phase. The key idea of the method is to use a portion of characters of a word and a distance pattern in order to use current index techniques. By experiments, we confirm that the presented method achieves high recall even for the poorly recognized texts.
Performance Analysis and Simulation of Multicast Networks
Authors: Yuanyuan Yang, Jianchao Wang
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper, we look into the issue of supporting multicast in the well-known three-stage Clos network or v(m,n,r) network. We first develop an analytical model for the blocking probability of the v(m,n,r) multicast network, and then study the blocking behavior of the network under various routing control strategies through simulations. Our analytical and simulation results show that a v(m,n,r) network with a small number of middle switches m, such as m=n+c or dn, where c and d are small constants, is almost nonblocking for multicast connections, although theoretically it requires m \geq \Theta (n \frac{\log r}{\log \log r}) to achieve nonblocking for multicast connections. We also demonstrate that routing control strategies are effective for reducing the blocking probability of the multicast network. The best routing control strategy can provide a factor of 2 to 3 performance improvement over random routing. The results indicate that a v(m,n,r) network with a comparable cost to a permutation network can provide cost-effective support for multicast communication.
Inventory Record Keeping for Historical Artefacts
Authors: Petr Miksovský, Zdenek Kouba, Jan Uhlír
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The paper describes a project aimed at development of a software system enabling inventory record keeping as well as inventory taking of movable assets located in castles and other historical buildings in the Czech Republic. The introductory part of the paper describes thesystem context and requirements while the second part is devoted to the description of the implementation.
Practical Algorithms for Selection on Coarse-Grained Parallel Computers
Authors: Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. Experimental results on the CM-5 demonstrate that randomized algorithms are superior to their deterministic counterparts.