ppxscal/embedding_network huggingface dataset:
A Framework for Integrating Data Alignment, Distribution, and Redistribution in Distributed Memory Multiprocessors
Authors: Jordi Garcia, Eduard Ayguadé
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Parallel architectures with physically distributed memory provide a cost-effective scalability to solve many large scale scientific problems. However, these systems are very difficult to program and tune. In these systems, the choice of a good data mapping and parallelization strategy can dramatically improve the efficiency of the resulting program. In this paper, we present a framework for automatic data mapping in the context of distributed memory multiprocessor systems. The framework is based on a new approach that allows the alignment, distribution, and redistribution problems to be solved together using a single graph representation. The Communication Parallelism Graph (CPG) is the structure that holds symbolic information about the potential data movement and parallelism inherent to the whole program. The CPG is then particularized for a given problem size and target system and used to find a minimal cost path through the graph using a general purpose linear 0-1 integer programming solver. The data layout strategy generated is optimal according to our current cost and compilation models.
Dynamic personalization and information integration in multi-channel data dissemination enviroments
Authors: Koichi Goto, Yahiko Kambayashi
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

We have been developing mobile passenger support systems for the public transportation. In this application field, various kinds of data must be handled and integrated. Examples of such data are route information, fare information, area map, station map, planned operation schedule, real-time operation schedule, vehicle facilities etc. Depending on the user situation, different information should be supplied and personalized. In this paper we propose the human support system used in the multi-channel data dissemination environments. There are two kinds of data dissemination sources in the proposed system, fixed and moving. The moving sources are transportation vehicles such as trains and buses. Although most of user requests are processed by means of integrating information transmitted by data dissemination method, on-demand process should be also required. As the system must be used in the case of emergency when the system load is expected to be very high, we will not use a centralized system. Integrated personalization and filtering are performed at each terminal. In this paper we will discuss efficient procedure to handle dynamic integration, dynamic personalization and dynamic filtering using multiple data dissemination channels and on-demand data channels. Current prototype system developed to be used visually handicapped passengers is also shown.
General Form of Non-Symmetric Spin Models
Authors: Takuya Ikuta, Kazumasa Nomura
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

A spin model (for link invariants) is a square matrix i>W with non-zero complex entries which satisfies certain axioms. Recently (Jaeger and Nomura, i>J. Alg. Combin. 10 (1999), 241&ndash;278) it was shown that i>tWW&minus;1 is a permutation matrix (the order of this permutation matrix is called the &ldquo;index&rdquo; of i>W), and a general form was given for spin models of index 2. In the present paper, we generalize this general form to an arbitrary index i>m. In particular, we give a simple form of i>W when i>m is a prime number.
A short study of notation efficiency
Authors: Howard J. Smith
Venue: Communications of the ACM (1960)

This comparison indicates that an 8-bit character set, with provision for storing two 4-bit decimal digits in one character position, is a more efficient form of representation than the 6-bit character set, at least for a majority of common applications. This 8(4) representation has several other advantages.
A technique for computer detection and correction of spelling errors
Authors: Fred J. Damerau
Venue: Communications of the ACM (1964)

The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition. The unidentified input word is compared to the dictionary again, testing each time to see if the words match&mdash;assuming one of these errors occurred. During a test run on garbled text, correct identifications were made for over 95 percent of these error types.
Visual models for spatial knowledge discovery
Authors: Nelly M. Kovalevskaya, Georgy L. Gimel'farb
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

The paper demonstrates a new application of computer vision to digital image libraries for GIS the use of image texture for description of content. Our goal was to use a scheme that is able to automatically decide on the image features and based upon psychophysical studies of human perception nature and computer vision models.
Weighted ENO Schemes for Hamilton--Jacobi Equations
Authors: Guang-Shan Jiang, Danping Peng
Venue: SIAM Journal on Scientific Computing (1999)

In this paper, we present a weighted ENO (essentially nonoscillatory) scheme to approximate the viscosity solution of the Hamilton--Jacobi equation: $$ \phi_t + H(x_1,\ldots,x_d,t,\phi,\phi_{x_1},\ldots,\phi_{x_d}) = 0. $$ This weighted ENO scheme is constructed upon and has the same stencil nodes as the third order ENO scheme but can be as high as fifth order accurate in the smooth part of the solution. In addition to the accuracy improvement, numerical comparisons between the two schemes also demonstrate that the weighted ENO scheme is more robust than the ENO scheme.
Performance of height-balanced trees
Authors: P. L. Karlton, S. H. Fuller, R. E. Scroggs, E. B. Kaehler
Venue: Communications of the ACM (1976)

This paper presents the results of simulations that investigate the performance of height-balanced (HB[k]) trees. It is shown that the only statistic of HB[1] trees (AVL trees) that is a function of the size of the tree is the time to search for an item in the tree. For sufficiently large trees, the execution times of all procedures for maintaining HB[1] trees are independent of the size of the tree. In particular, an average of .465 restructures are required per insertion, with an average of 2.78 nodes revisited to restore the HB[1] property; an average of .214 restructures are required per deletion, with an average of 1.91 nodes revisited to restore the HB[1] property. Moreover, the execution times of procedures for maintaining HB[k] trees, for k > 1, are also independent of the size of the tree except for the average number of nodes revisited on a delete operation in order to restore the HB[k] property on traceback. The cost of maintaining HB[k] trees drops sharply as the allowable imbalance (k) increases. Both analytical and experimental results that show the cost of maintaining HB[k] trees as a function of k are discussed.
High speed compilation of efficient object code
Authors: C. W. Gear
Venue: Communications of the ACM (1965)

A three-pass compiler with the following properties is briefly described: The last two passes scan an intermediate language produced by the preceding pass in essentially the reverse of the order in which it was generated, so that the first pass is the only one which has to read the relatively bulky problem-oriented input. The double scan, one in either direction, performed by the first two passes, allows the compiler to remove locally constant expressions and recursively calculable expressions from loops and to do the important part of common subexpression recognition. Optimization such as the effective use of index registers, although as important, is not discussed since the object code which would be most efficient is highly machine dependent. The discussion is in terms of a FORTRAN-like language, although the technique is applicable to most algebraic languages.
Java Runtime Systems: Characterization and Architectural Implications
Authors: Ramesh Radhakrishnan, N. Vijaykrishnan, Lizy Kurian John, Anand Sivasubramaniam, Juan Rubio, Jyotsna Sabarinathan
Venue: IEEE Transactions on Computers (2001)

The Java Virtual Machine (JVM) is the cornerstone of Java technology and its efficiency in executing the portable Java bytecodes is crucial for the success of this technology. Interpretation, Just-In-Time (JIT) compilation, and hardware realization are well-known solutions for a JVM and previous research has proposed optimizations for each of these techniques. However, each technique has its pros and cons and may not be uniformly attractive for all hardware platforms. Instead, an understanding of the architectural implications of JVM implementations with real applications can be crucial to the development of enabling technologies for efficient Java runtime system development on a wide range of platforms. Toward this goal, this paper examines architectural issues from both the hardware and JVM implementation perspectives. The paper starts by identifying the important execution characteristics of Java applications from a bytecode perspective. It then explores the potential of a smart JIT compiler strategy that can dynamically interpret or compile based on associated costs and investigates the CPU and cache architectural support that would benefit JVM implementations. We also study the available parallelism during the different execution modes using applications from the SPECjvm98 benchmarks. At the bytecode level, it is observed that less than 45 out of the 256 bytecodes constitute 90 percent of the dynamic bytecode stream. Method sizes fall into a trinodal distribution with peaks of 1, 9, and 26 bytecodes across all benchmarks. The architectural issues explored in this study show that, when Java applications are executed with a JIT compiler, selective translation using good heuristics can improve performance, but the saving is only 10-15 percent at best. The instruction and data cache performance of Java applications are seen to be better than that of C/C++ applications except in the case of data cache performance in the JIT mode. Write misses resulting from installation of JIT compiler output dominate the misses and deteriorate the data cache performance in JIT mode. A study on the available parallelism shows that Java programs executed using JIT compilers have parallelism comparable to C/C++ programs for small window sizes, but falls behind when the window size is increased. Java programs executed using the interpreter have very little parallelism due to the stack nature of the JVM instruction set, which is dominant in the interpreted execution mode. In addition, this work gives revealing insights and architectural proposals for designing an efficient Java runtime system.
Efficient Linear Solution of Exterior Orientation
Authors: Paul D. Fiore
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

This paper concerns an efficient algorithm for the solution of the exterior orientation problem. Orthogonal decompositions are used to first isolate the unknown depths of feature points in the camera reference frame, allowing the problem to be reduced to an absolute orientation with scale problem, which is solved using the SVD. The key feature of this approach is the low computational cost compared to existing approaches.
Automating first-order relational logic
Authors: Daniel Jackson
Venue: ACM SIGSOFT Software Engineering Notes (2000)

An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a model when the original formula has a model within a given scope (that is, involving no more than some finite number of atoms). Because the satisfiable formulas that occur in practice tend to have small models, a small scope usually suffices and the analysis is efficient. The paper presents a simple logic and gives a compositional translation scheme. It also reports briefly on experience using the Alloy Analyzer, a tool that implements the scheme.
Advanced module systems (invited talk): a guide for the perplexed
Authors: Robert Harper, Benjamin C. Pierce
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

The past three decades have seen a plethora of language features for large-scale software composition. Some of these are fairly simple, others quite sophisticated. Each embodies an implicit claim that its particular combination of features is both necessary and sufficient for some problem domain. But there have been few attempts to compare module systems, or to explain the practical and theoretical issues that motivate the choices they embody. This can make it difficult to evaluate which features are really needed for a given setting, and which may be overkill.
The Mathematics of Infectious Diseases
Authors: Herbert W. Hethcote
Venue: SIAM Review (2000)

Many models for the spread of infectious diseases in populations have been analyzed mathematically and applied to specific diseases. Threshold theorems involving the basic reproduction number $R_{0}$, the contact number $\sigma$, and the replacement number $R$ are reviewed for the classic SIR epidemic and endemic models. Similar results with new expressions for $R_{0}$ are obtained for MSEIR and SEIR endemic models with either continuous age or age groups. Values of $R_{0}$ and $\sigma$ are estimated for various diseases including measles in Niger and pertussis in the United States. Previous models with age structure, heterogeneity, and spatial structure are surveyed.
Application of Lie Algebras to Visual Servoing
Authors: Tom Drummond, Roberto Cipolla
Venue: International Journal of Computer Vision (2000)

A novel approach to visual servoing is presented, which takes advantage of the structure of the Lie algebra of affine transformations. The aim of this project is to use feedback from a visual sensor to guide a robot arm to a target position. The target position is learned using the principle of &lsquo;teaching by showing&rsquo; in which the supervisor places the robot in the correct target position and the system captures the necessary information to be able to return to that position. The sensor is placed in the end effector of the robot, the &lsquo;camera-in-hand&rsquo; approach, and thus provides direct feedback of the robot motion relative to the target scene via observed transformations of the scene. These scene transformations are obtained by measuring the affine deformations of a target planar contour (under the weak perspective assumption), captured by use of an active contour, or snake. Deformations of the snake are constrained using the Lie groups of affine and projective transformations. Properties of the Lie algebra of affine transformations are exploited to provide a novel method for integrating observed deformations of the target contour. These can be compensated with appropriate robot motion using a non-linear control structure. The local differential representation of contour deformations is extended to allow accurate integration of an extended series of small perturbations. This differs from existing approaches by virtue of the properties of the Lie algebra representation which implicitly embeds knowledge of the three-dimensional world within a two-dimensional image-based system. These techniques have been implemented using a video camera to control a 5 DoF robot arm. Experiments with this implementation are presented, together with a discussion of the results.
Accelerated rendering in stereo-based projections (poster session)
Authors: Stanislav L. Stoev, Tobias Hüttner, Wolfgang Straßer
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

In this work, we present a new method for displaying stereo scenes, which speeds up the rendering time of complex geometry. We first discuss a scene splitting strategy, allowing us to partition objects to the distant background or the near foreground. Furthermore, wededuce a computation rule for positioning a cutting plane in the scene.
A new approach to automatic scanning of contour maps
Authors: M. Mor, T. Lamdan
Venue: Communications of the ACM (1972)

The problem of automatic digitizing of contour maps is discussed. The structure of a general contour map is analyzed, and its topological properties are utilized in developing a new scanning algorithm. The problem of detection and recognition of contour lines is solved by a two color labeling method. It is shown that for maps containing normal contour lines only, it suffices to distinguish between so-called &ldquo;even&rdquo; and &ldquo;odd&rdquo; lines. The &ldquo;tangency problem&rdquo; involved in practical scanning is discussed, and a solution based on minimizing computer memory space and simplifying control program is suggested.
A rapid method for digital filtering
Authors: John R. B. Whittlesey
Venue: Communications of the ACM (1964)

Since much of the computer time spent in time-series analysis is used for multiplications, a minimum multiplication method was devised for digital filtering, with the expectation that it would be useful in the online, real-time analysis of biological data. The filters are constructed from a succession of readily analyzable components in a manner that facilitates cascading. The repertoire of frequency response curves includes relatively good low-pass and band-pass designs. Programs are available for implementing both the synthesis of these filters, and their application on computers whose assemblers allow the definition of recursive macros.
Application of perfect numerical "Vyazankas" for computer engineering (abstract only)
Authors: Volodymyr Ryznyk
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

The paper presents new mathematical principle of systems development, namely the concept of Perfect Numerical &ldquo;Vyazankas&rdquo; (PNV) relating to the optimal placement of structural elements in computer hardware for improving the quality indices of the hardware with respect to performance reliability and transmission speed.
Innovative system-level design environment based on FORM for transport processing system
Authors: K. Higuchi, K. Shirakawa
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a system-level design environment for data transport processing systems. In this environment, designers can easily verify system behavior by formally defining data structures and their related actions, without considering detailed timing. In addition, the verified specification can be translated into synthesizable RTL descriptions by a dedicated RTL generator. Thus, using lower-level EDA tools, actual hardware can be obtained directly from a system-level specification.
An Analysis of Edge Detection by Using the Jensen-Shannon Divergence
Authors: Juan Francisco Gómez-Lopera, José Martínez-Aroza, Aureliano M. Robles-Pérez, Ramón Román-Roldán
Venue: Journal of Mathematical Imaging and Vision (2000)

This work constitutes a theoretical study of the edge-detection method by means of the Jensen-Shannon divergence, as proposed by the authors. The overall aim is to establish formally the suitability of the procedure of edge detection in digital images, as a step prior to segmentation. In specific, an analysis is made not only of the properties of the divergence used, but also of the method's sensitivity to the spatial variation, as well as the detection-error risk associated with the operating conditions due to the randomness of the spatial configuration of the pixels. Although the paper deals with the procedure based on the Jensen-Shannon divergence, some problems are also related to other methods based on local detection with a sliding window, and part of the study is focused to noisy and textured images.
On the distributions of significant digits and roundoff errors
Authors: Nai-Kuan Tsao
Venue: Communications of the ACM (1974)

Generalized logarithmic law is derived for the distribution of the first t significant digits of a random digital integer. This result is then used to determine the distribution of the roundoff errors in floating-point operations, which is a mixture of uniform and reciprocal distributions.
Image Editing in the Contour Domain
Authors: James H. Elder, Richard M. Goldberg
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Image editing systems are essentially pixel-based. In this paper, we propose a novel method for image editing in which the primitive working unit is not a pixel but an edge. The feasibility of this proposal is suggested by recent work showing that a gray-scale image can be accurately represented by its edge map if a suitable edge model and scale selection method are employed [1]. In particular, an efficient algorithm has been reported to invert such an edge representation to yield a high-fidelity reconstruction of the original image [2], [3]. We have combined these algorithms together with an efficient method for contour grouping and an intuitive user interface to allow users to perform image editing operations (crop, paste, delete) directly in the contour domain. Experimental results suggest that this novel combination of vision algorithms may increase the efficiency of certain classes of image editing operations.
An approach to incremental design of distributed embedded systems
Authors: Paul Pop, Petru Eles Traian Pop Zebo Peng
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

In this paper we present an approach to incremental design of dis-tributed embedded systems for hard real-time applications. We start from an already existing system running a set of applications and the design problem is to implement new functionality so that the already running applications are not disturbed and there is a good chance that, later, new functionality can easily be added to the resulted sys-tem. The mapping and scheduling problem are considered in the con-text of a realistic communication model based on a TDMA protocol.
Composing contracts: an adventure in financial engineering (functional pearl)
Authors: Simon Peyton Jones, Jean-Marc Eber, Julian Seward
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

Financial and insurance contracts do not sound like promising territory for functional programming and formal semantics, but in fact we have discovered that insights from programming languages bear directly on the complex subject of describing and valuing a large class of contracts.We introduce a combinator library that allows us to describe such contracts precisely, and a compositional denotational semantics that says what such contracts are worth. We sketch an implementation of our combinator library in Haskell. Interestingly, lazy evaluation plays a crucial role.
RT-CRM: Real-Time Channel-Based Reflective Memory
Authors: Chia Shen, Ichiro Mizunuma
Venue: IEEE Transactions on Computers (2000)

In this paper, we propose and present Real-Time Channel-based Reflective Memory (RT-CRM)¿a useful programming model and middleware communication service for constructing distributed real-time applications on platforms, open systems. RT-CRM provides remote real-time data reflection abstraction using a simple writer-push model. This writer-push approach enables us to easily decouple the QoS characteristics of the writers from that of the readers. This decoupling is crucial in supporting different kinds of remote data transfer and access needs that one often finds in distributed real-time systems. We will describe the design of RT-CRM, along with a set of easy-to-use API to access the RT-CRM service. We have implemented RT-CRM as part of a larger real-time middleware project, MidART. We address many of the important implementation issues, including buffer management and QoS support. We demonstrate the feasiblity of RT-CRM through a discussion of our application programming support and performance data.