ppxscal/embedding_network huggingface dataset:
On embedding 2--dimensional toroidal grids into de Bruijn graphs with clockedcongestion one
Authors: Thomas Andreae, Michael Nolle, Christof Rempel, Gerald Schreiber
Venue:  (1995)

For integers m,d,D with m ge 3, d ge 2, and D ge 2, let T (m) be a 2--dimensional quadratic toroidal grid with side length m and let B (d,D) be the base d, dimension D de Bruijn graph; assume that |T ( m ) | = | B (d,D ) |. The starting point for our inves-ti-ga-tions is the observation that, for m, D even, embeddings f : T (m) rightarrow B (d,D) with load 1, expansion 1, and dilation D/2 can easily be found (and have previously been described in the literature). In the present paper, we pose the question whether or not there exist embeddings f:T (m) rightarrow B (d,D) with these properties em and with clocked congestion 1. We prove results implying a positive answer to this question when d is greater than two. For d=2, we do not have a complete answer, but present partial results.
An explicit parallel procedure for nonlinear structural mechanics with distributed computing
Authors: M. L. Romero, J. I. Aliaga, J. L. Bonet, M. A. Fernandez, P. F. Miguel
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper an explicit parallel algorithm for the complete analysis of 3D high-rise frameworks on a distributed-memory cluster of personal computers is presented. The algorithm is based in the parallelisation of the arc-length method using the Schur complement. The domain is divided in N-1 equal and balanced subdomains, and a master node of the cluster computes the boundary degrees of freedom. The stiffness matrix, the resolution of partial displacements, and the calculation of internal equilibrium forces is obtained in a concurrent form. The number of communications between the nodes are reduced at maximum and are pivoting through the master node. They are implement with MPI paradigm for a Windows2000 cluster of personal computers.
Computational Architectures for Responsive Vision: the Vision Engine
Authors: James J. Little, Rod Barman, Stewart Kingdon, Jiping Lu
Venue:  (1991)

To respond actively to a dynamic environment, a vision system must process perceptual data in real time, and in multiple modalities. The structure of the computational load varies across the levels of vision, requiring multiple architectures. We describe the Vision Engine, a system with a pipelined early vision architecture, Datacube image processors, connected to a MIMD intermediate vision system, a set of Transputers. The system uses a controllable eye/head for tasks involving motion, stereo and tracking. \nA simple pipeline model describes image transformation through multiple functional stages in early vision. Later processing (e.g., segmentation, edge linking, perceptual organization) cannot easily proceed on a pipeline architecture. A MIMD architecture is more appropriate for the irregular data and functional parallelism of later visual processing. \nThe Vision Engine is designed for general vision tasks. Early vision processing, both optical flow and stereo, is implemented in near real-time using the Datacube, producing dense vector fields with confidence measures, transferred at near video rates to Transputer subsystem. We describe a simple implementation combining, in the Transputer system, stereo and motion information from the Datacube.
Efficient Computation of Voronoi Diagrams
Authors: Matthew C. Humphrey
Venue:  (1988)

Voronoi diagrams have advantages of representing geometric information in a compact form which makes them well suited for robot path planning. However, researchers have often found them too complex and inefficient. In this paper, two alternate views of Voronoi diagrams, the Standard [SHAMM75a] and the generalized [KIRKD79] are reviewed. A new method to approximate the Voronoi diagram is developed while showing how all three can be effectively used in applications. Finally, the three methods are compared showing their relative strengths and weaknesses for robot path planning.
Security and privacy issues of handheld and wearable wireless devices
Authors: Roberto Di Pietro, Luigi V. Mancini
Venue: Communications of the ACM (2003)

The distinguished capabilities of these devices are also the very reasons they require security and privacy protections of an unprecedented scale.
THE SWIFT/RAID DISTRIBUTED TRANSACTION DRIVER
Authors: Bruce R. Montague
Venue:  (1993)

This document describes a distributed transaction driver developed to support the reimplementation of Swift with added RAID (Redundant Arrays of Inexpensive Disks) functionality. Both a high-level overview and a low-level program description are provided. The Swift system was developed to investigate the use of disk striping to achieve high I/O performance. The transaction driver described here has been used to implement RAID-0, RAID-4, and RAID-5 Swift systems. Swift uses a network of workstations in a manner similar to a redundant disk array, i.e., an application on a client node requests I/O via library routines which evenly distribute I/O across multiple server nodes. Data blocks in RAID files are distributed over the servers. RAID-0 contains no redundancy/parity information, RAID-4 uses a dedicated parity node, and RAID-5 uses distributed parity. The original Swift system used a straight-forward RAID-0 scheme that did not readily scale to RAID-4 and RAID-5 implementations. The transaction driver described here was developed to cope with the distributed concurrent programming problems posed by these implementations. In principle, this transaction driver can be used for a wide variety of distributed concurrent programming problems.
A Gaussian Derivative Based Version of JPEG for Image Compression and Decompression
Authors: Alexander P. Morgan, Layne T. Watson, Richard A. Young
Venue:  (1995)

The compression and decompression of continuous-tone images is important in document management and transmission systems. This paper considers an alternative image representation scheme, based on Gaussian derivatives, to the standard discrete cosine transformation (DCT), within a JPEG framework. Depending on the computer arithmetic hardware used, the approach developed here might yield a compression/decompression technique twice as fast as the DCT and of (essentially) equal quality.
The Granularity of Parallel Homotopy Algorithms for Polynomial Systems of Equations
Authors: Donald C. S. Allison, S. Harimoto, Layne T. Watson
Venue:  (1988)

Polynomial systems consist of n polynomial functions in n variables, with real or complex coefficients. Finding zeros of such systems is challenging because there may be a large number of solutions, and Newton-type methods can rarely be guaranteed to find the complete set of solutions. There are homotopy algorithms for polynomial systems of equations that are globally convergent from an arbitrary starting point with probability one, are guaranteed to find all the solutions, and are robust, accurate, and reasonably efficient. There is inherent parallelism at several levels in these algorithms. Several parallel homotopy algorithms with different granularities are studied on several different parallel machines, using actual industrial problems from chemical engineering and solid modeling.
The New Implementation of Cassandra
Authors: I. D. Craig
Venue:  (1992)

This paper describes our new, EuLisp, implementation of our CASSANDRA multi-agent architecture. Starting with a basic collection of structures, we constructed a sequential, a concurrent and a fully distributed version of the architecture. Each version was tested using the word recognition problem of Rumelhart and McClelland (the same problem we used to test previous versions of the architecture). We report on each of these versions and briefly describe our approach and experiences.
Development of an advanced system for analysis and design of tensile structures
Authors: T. H. Zhang, S. L. McCabe
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper shows an advanced Windows-based analysis system developed for analysis and design of tensile structures. The analysis procedure includes Direct Stiffness and Finite Element Method formulations and is as an application in AutoCAD 2000. The geometric forms of tensile structures are found and applied by both methods. Three examples are presented to verify the program. The result is an analysis system that is freely integrated with AutoCAD and permits building the analysis model graphically and then viewing the results. Fabrication or shop drawings then are developed.
A Homotopy Approach for Solving Constrained Optimization Problems
Authors: G. Vasudevan, Layne T. Watson, F. H. Lutze
Venue:  (1988)

A homotopy approach for solving constrained parameter optimization problems is examined. The first order necessary conditions, with the complementavity conditions represented using a technique due to Mangasarian, are solved. The equations are augmented to avoid singularities which occur when the active constraint changes. The Chow -Torke algorithm is used to track the homotopy path leading to the solution to the desired problem at the terminal point. A simple example which illustrates the technique, and an application to a fuel optimal orbital transfer problem are presented.
From Local to Global Illumination and Back
Authors: Alain Fournier
Venue:  (1995)

The following being musings about illumination problems and illumination answers, more particularly about the evolution and the interplay between local and global illumination concerns. 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
Designing business processes and communication structures for e-business using ontology-based enterprise models with mathematical models
Authors: Henry M. Kim, K. Donald Tham
Venue: Enterprise information systems IV (2003)

Organizations are apprehensive about developing e-business systems because the endeavor is novel. If e-business is considered as the conduct of business using the Internet--a network of networks--then e-business systems design can be represented as a network design problem. This paper outlines an approach for analysis and design of business process and communications structure networks for e-business. Network design alternatives are generated by applying best practices and design principles to business requirements, using ontology-based enterprise models. Alternatives then are modeled mathematically for analysis and comparison. Domains relevant for e-business systems design are described, formally and systematically, using this approach. These formal descriptions are general axioms, used to logically and mathematically infer prescriptions for specific design problems. These descriptions and prescriptions are sharable and reusable. The mathematical models are developed using known algorithms, heuristics, and formulae. Therefore, fidelity of prescriptions based on these models can be objectively justified. Due to these characteristics, models developed using this technique are especially useful for developing novel e-business systems. An example application of this technique is presented, and research questions addressed using the approach are discussed.
Bayesian data mining and knowledge discovery
Authors: Eitel J. M. Lauria, Giri Kumar Tayi
Venue: Data mining: opportunities and challenges (2003)

One of the major problems faced by data-mining technologies is how to deal with uncertainty. The prime characteristic of Bayesian methods is their explicit use of probability for quantifying uncertainty. Bayesian methods provide a practical method to make inferences from data using probability models for values we observe and about which we want to draw some hypotheses. Bayes' Theorem provides the means of calculating the probability of a hypothesis (posterior probability) based on its prior probability, the probability of the observations, and the likelihood that the observational data fits the hypothesis.The purpose of this chapter is twofold: to provide an overview of the theoretical framework of Bayesian methods and its application to data mining, with special emphasis on statistical modeling and machine-learning techniques; and to illustrate each theoretical concept covered with practical examples. We will cover basic probability concepts, Bayes' Theorem and its implications, Bayesian classification, Bayesian belief networks, and an introduction to simulation techniques.
AUTOMATED TERMINATION ANALYSIS FOR LOGIC PROGRAMS (Ph.D. Thesis)
Authors: Kirack Sohn
Venue:  (1993)

The question of whether logic programs with function symbols terminate in a top-down (Prolog-like) execution is considered. Automated termination analysis is an essential tool for generating a suitable control in modern deductive database systems, such as LDL and NAIL! We describe a method of identifying a nonnegative linear combination of bound argument sizes, which (if found) strictly decreases in a top-down execution of logic programs. Testing a termination condition is transformed to a feasibility problem of linear inequalities using duality theory of linear programming. For nontrivial termination proofs, we often need to know the relationship among argument sizes of a predicate. We formalize the relationship by a fixpoint of ``recursive transformation" mimicking immediate consequence operator. Since the transformation sometimes fails to finitely converge, we provide some practical techniques to resolve this problem. We also need to indicate which arguments are bound to ground terms during goal reduction. A method for deriving such binding information is described in the framework of abstract interpretation. Positive propositional formula are used to represent groundness dependency among arguments of a predicate. This methodology can handle nonlinear recursion, mutual recursion, and cases in which no specific argument is certain to decrease. Several programs that could not be shown to terminate by earlier published methods are handled successfully.
A Grassroots Approach to Graduate Teaching Assistant Mentoring
Authors: Kevin A. Mayo, Steven A. Wake
Venue:  (1993)

Graduate students, whether master''s or doctoral candidates, benefit greatly from their academic experiences. However, graduate school is not limited to course work and research, but it also includes teaching experiences as graduate teaching assistants (GTAs). Although GTAs are technically proficient in course materials, other factors can cause teaching experiences to go awry for them, their students, or the course supervisor. These factors arise out of a need for quality training on issues including pedagogy, interaction resolution, organizational concerns, and professional matters. This paper provides a grassroots approach to improve teachine techniques through GTA mentoring. GTAs are encouraged, with materials supplied here, to seek out and consult with more experienced GTAs who will serve as their mentors.
Computing System Descriptions for Systems Software
Authors: Mark W. Bailey, Jack W. Davidson
Venue:  (1995)

The proliferation of high-performance microprocessors in recent years has made the development of systems software, such as compilers, assemblers, linkers, debuggers, simulators, and other related tools, more challenging than ever. When a new processor is introduced, each of these applications must be rewritten or retargeted to the new machine. This paper describes a description system, called CSDL, that permits the specification--in a concise, easily understood notation--of all aspects of a computing system that must be known in order to automate the construction of high-quality systems software. Unlike past machine description languages, and as the term computing system indicates, this new description system spans the boundary between hardware and software. CSDL descriptions are modular and extensible, providing a flexible system for specifying computing system information that can be shared among many different applications
GENETIC SIMULATED ANNEALING AND APPLICATION TO NON-SLICING FLOORPLAN DESIGN
Authors: Seiichi Koakutsu, Maggie Kang, Wayne W Dai
Venue:  (1995)

We propose a new optimization method, named genetic simulated annealing (GSA), which combines the local stochastic hill climbing features from simulated annealing (SA) and the global crossover operations from genetic algorithm (GA). We demonstrated the advantages of GSA by solving one of the most difficult problems in layout --- the non-slicing floorplan design problem. Given the same amount of computing resources, our experimental results showed that GSA consistently obtained better results than SA, in terms of both the chip area and the total wire length. We also applied GSA to timing driven floorplan design and experimental results indicated that it achieved the specified wire length bounds for the critical nets with small penalty on the chip area and the total wire length.
Distance Metric Between 3D Models and 2D Images for Recognition and Classification
Authors: R. Basri, D. Weinshall
Venue:  (1994)

Similarity measurements between 3D objects and 2D images are useful for the tasks of object recognition and classification. We distinguish between two types of similarity metrics: Metrics computed in image-space (image metrics) and metrics computed in transformation-space (transformation metrics). Existing methods typically use image metrica; namely, metrics that measure the difference in the image between the observed image and the nearest view of the object. Example for such a measure is the Euclidean distance between feature points in the image and their corresponding points in the nearest view. (This measure can be computed by solving the exterior orientation calibration problem.) In this paper we introduce a different type of metrics: transformation metrics. These metrics penalize for the deformations applied to the object to produce the observed image. We present a transformation metric that optimally penalizes for ``affine deformations'''' under weak-perspective. A closed-form solution, together with the nearest view according to this metric, are derived. The metric is shown to be equivalent to the Euclidean image metric, in the sense that they bound each other from both above and below. For the Euclidean image metric we offer a sub-optimal closed-form solution and an iterative scheme to compute the exact solution.
Verifying Out-of-Order Executions
Authors: W. Damm, A. Pnueli
Venue:  (1997)

The paper presents an approach to the specification and verification of out-of-order execution in the design of micro-processors. Ultimately, the appropriate statement of correctness is that the out-of-order execution produces the same final state as a purely sequential machine running the same program.
Randomly Sampling Unlabelled Structures
Authors: Leslie A Goldberg
Venue:  (1999)

Informally, an "unlabelled combinatorial structure" is an object such as an unlabelled graph (in which the vertices are indistinguishable) or a structural isomer in chemistry (in which different atoms of the same type are indistinguishable). Computational experiments such as those described in this volume often rely on random sampling to generate inputs for the experiments. This paper surveys work on the problem of efficiently sampling unlabelled combinatorial structures from a uniform distribution.
Fallstudie zur Informationssicherheit
Authors: Marcus Holthaus, Stephanie Teufel
Venue:  (1998)

Unternehmerische Informationssicherheit ist ein soziales und organisatorisches Problem, welches durch technologische Entwicklungen stark beeinflusst wird. Bei der Erhebung der Infrastruktur, bei der Massnahmenplanung und -umsetzung muessen deshalb verschiedene Interessengruppen innerhalb der Unternehmung mit einbezogen werden. Sie haben sehr unterschiedlichen Einfluss auf einen erfolgreichen Projektabschluss. Es entstehen Konflikte, welche der Beauftragte fuer Informationssicherheit erkennen und loesen muss. Nur so kann ein ganzheitliches Sicherheitskonzept erarbeitet und umgesetzt werden. In dieser Fallstudie werden die organisatorischen und sozialen Probleme betrachtet. Dazu werden fuenf Rollen definiert, welche von den Teilnehmern eines Workshops gespielt werden. Die Rollen sind in einer fiktiven Treuhand- und Revisionsgesellschaft angesiedelt und enthalten angenommene Meinungen und Verhaltensweisen des Geschaeftsfuehrers, der Leiter von Revision und Informatik, der Benutzer und des Informationssicherheitsbeauftragten. Die Erfahrungen zeigen, dass sich die Fallstudie v.a. fuer Gruppen von 12 bis 25 Teilnehmern eignet. Die sozialen und psychologischen Probleme, welche die Erstellung und Umsetzung eines Sicherheitskonzepts mit sich bringen, treten deutlich zutage, waehrend technische Aspekte weitgehend in den Hintergrund treten.
NOC Application programming interfaces: high level communication primitives and operating system services for power management
Authors: Zhonghai Lu, Raimo Haukilahti
Venue: Networks on chip (2003)

Due to its heterogeneous and distributed nature, programming NoC communications may be very complicated if we treat NoC as individual elements of resources, switches, and interfaces. To mitigate the complexity, we raise the abstraction level and take NoC as a whole. To this end we propose a concept of NoC Assembler Language (NoC-AL) which serves as an interface between NoC implementations and applications, very similar to the instruction set of a traditional CPU. A central part of NoC-AL will be communication primitives for both message passing and shared memory. Starting with a NoC programmer model, this chapter discusses NoC-AL, and in particular the communication primitives. Moreover, we discuss NoC Operating System (NoC-OS) which is the underlying layer below NoC-AL. As power consumption has become one of the primary design constraints, we give an overview of low power techniques at the operating system level and demonstrate how process migration can improve the effectiveness of the techniques. At the end, we propose an API for power management of NoCs.
A geometric interpretation of speech features
Authors: Gareth Lee, Mike Alder
Venue:  (1993)

Previous publications have concentrated on graphically representing features produced from speech as spectrograms. We present a new geometric interpretation of speech features. This is implemented in the form of the `fview'' program which has been placed in the public domain. We use `fview'' to consider the problem of generating effective feature sequences.