ppxscal/embedding_network huggingface dataset:
A model for I/O in equational languages with don''t care non-determinism
Authors: H. R. Walters, Jasper F.T Kamperman
Venue:  (1995)

Existing models for I/O in side-effect free languages focus on functional languages, which are usually based on a largely deterministic reduction strategy, allowing for a strict sequentialization of I/O operations. In concurrent logic programming languages a model is used which allows for don''t care non-determinism; the sequentialization of I/O is extensional rather than intensional. We apply this model to equational languages, which are closely related to functional languages, but exhibit don''t care non-determinism. The semantics are formulated as constrained narrowing, a relation that contains the rewrite relation, and is contained in the narrowing relation. We present constrained narrowing and some of its properties; a constructive method to transform conventional term rewriting systems to constrained narrowing systems; and a discussion on requirements for an implementation.
Performance Evaluation of Location Information Distribution Strategies for Mobility Tracking
Authors: Zuji Mao, Christos Douligeris
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In this paper, a user location information distribution strategy is proposed for mobile systems. Local anchors (LAs), replicated databases, and forwarding pointers are applied in an integrated way that greatly reduces the location update rate and the call delivery cost incurred by location tracking. In particular, the visitor location registers (VLRs) associated with a user's home and workplace is selected as the user's LAs, which are connected by a forwarding pointer chain. When the user changes registration area (RA) within a local signal transfer point (LSTP) region, the new location is updated at one of the LAs. Otherwise, the new location is reported to the home location register (HLR) and the replicas. In the call delivery procedure, if a call originates from one of the LAs or replicas, the HLR does not need to be queried. An analytic model is developed and numerical examples are given to compare the performance of the proposed scheme, the standard scheme, the replication scheme, and the local anchoring scheme. Results show that the proposed strategy outperforms the other three strategies over a wide range of system parameters.
MultiMATLAB: MATLAB on Multiple Processors
Authors: Anne E. Trefethen, Vijay S. Menon, Chi Chang, Grzegorz Czajkowski, Chris Myers, Lloyd N. Trefethen
Venue:  (1996)

MATLAB, a commercial product of The MathWorks, Inc., has become one of the principal languages of desktop scientific computing. A system is described that enables one to run MATLAB conveniently on multiple processors. Using short, MATLAB-style commands like Eval, Send, Recv, Bcast, Min, and Sum, the user operating within one MATLAB session can start MATLAB processes on other machines and then pass commands and data between between these various processes in a fashion that maintains MATLAB''s traditional user-friendliness. Multi-processor graphics is also supported. The system currently runs under MPICH on an IBM SP2 or a network of Unix workstations, and extensions are planned to networks of PCs. MultiMATLAB is potentially useful for education in parallel programming, for prototyping parallel algorithms, and for fast and convenient execution of easily parallelizable numerical computations on multiple processors.
An Exception Handling Mechanism for Developing Dependable Object-Oriented Software Based on a Meta-Level Approach
Authors: Alessandro F. Garcia, Delano M. Beder, Cecilia M. F. Rubira
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

The current lack of effective error-handling techniques for developing dependable object-oriented software produces software components which are usually difficult to understand, to change and to maintain in the presence of faults. Ideally such components should incorporate their exceptional activity in a structured and transparent manner so that the abnormal code would not be amalgamated to the normal code. In this context, we propose the design and implementation of an object-oriented exception handling mechanism based on a meta-level approach. The goal of our work is twofold: (i) to define an exception handling model which supports a clear and transparent separation of the normal activity of a component from its exceptional activity, and (ii) to provide a meta-level architecture which implements such mechanism. This mechanism does not require any special language support and was implemented within the Java programming language without any changes to the language itself by means of a meta-object protocol.
Compiling Polymorphism Using Intensional Type Analysis
Authors: Robert Harper, Greg Morrisett
Venue:  (1994)

Types have been used to describe the size and shape of data structures at compile time. In polymorphic languages or languages with abstract types, this is not possible since the types of some objects are not known at compile time. Consequently, most implementations of polymorphic languages box data (i.e., represent an object as a pointer), leading to inefficiencies. We introduce a new compilation method for polymorphic languages that avoids the problems associated with boxing data. The fundamental idea is to relax the requirement that code selection for primitive, polymorphic operations, such as pairing and projection, must be performed at compile time. Instead, we allow such operations to defer code selection until link- or even run-time when the types of the values are known. We formalize our approach as a translation into an explicitly-typed, predicative polymorphic lambda-calculus with intensional polymorphism. By "intensional polymorphism", we mean that constructors and terms can be constructed via structural recursion on types. The form of intensional analysis that we provide is sufficiently strong to perform non-trivial type-based code selection, but it is sufficiently weak that termination of operations that analyze types is assured. This means that a compiler may always "open code" intensionally polymorphic operations as soon as the type argument is known @y(M) the properties of the target language ensure that the specialization will always terminate. We illustrate the use of intensional polymorphism by considering a "flattening" translation for tuples and a "marshalling" operation for distributed computing. We briefly consider other applications including type classes, Dynamic types, and "views".
Why the Mean is Inadequate for Accurate Scheduling Decisions
Authors: Taylor Kidd, Debra Hensgen
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

In a distributed environment, the generalized scheduling problem attempts to optimize some performance criteria by assigning tasks to resources and by determining the order in which those tasks will be executed. Although most resource management systems in use today have the goal of maximizing the use of idle processors, several, such as LSF and SmartNet, attempt to minimize the time at which the last job, in each set of jobs, completes. They attempt to deliver better quality of service to jobs by using scheduling heuristics that calculate schedules based upon the expected run-times of each job on each machine. This paper analyzes an exhaustive scheduling algorithm that minimizes the time at which the last job completes, if all jobs execute for exactly their expected run-times. The authors show that if this assumption is violated, that is, if jobs do not execute for exactly their expected run-times, then this algorithm will underestimate the time at which the last job is expected to finish, sometimes substantially. The authors conclude that an algorithm that uses not only the expected run-times, but also their distributions, can obtain better schedules.
Automatic Mesh Partitioning
Authors: Gary L. Miller, Shang Teng, William Thurston, Stephen A. Vavasis
Venue:  (1992)

This paper describes an efficient approach to partitioning unstructured meshes that occur naturally in the finite element and finite difference methods. The approach makes use of the underlying geometric structure of a given mesh and finds a provably good partition in random O(n) time. It applies to meshes in both two and three dimensions. The new method has applications in efficient sequential and parallel algorithms for large-scale problems in scientific computing. This is an overview paper written with emphasis on the algorithmic aspects of the approach. Many detailed proofs can be found in companion papers.
Shape-based calculation and visualisation of general cross-sections through biological data
Authors: R. Durikovic, T. Yauchi, K. Kaneda, H. Yamashita
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The paper reports a solution to the problem of image interpolation for generating, with high precision, an arbitrary cross-section from a series of slices. Shape-based interpolation as proposed allows the interpolation process to be influenced by the shape of the object. It is accomplished first by creating reconstructed shapes of the objects from a series of slices. Correspondence vectors distributed along the object surface are then generated from the reconstructed shapes. These vectors ensure the correct image interpolation on the boundaries of objects. Next, the correspondence vectors are interpolated to every image point within the new cross-section in process, and the image points at the start and end of a vector are linearly interpolated. Places where the correspondence vectors cannot be (branching or holes in the object shape) are treated separately. Results are presented from biological data obtained using an optical microscope. The data indicate that the proposed method produces more accurate results than commonly used interpolation methods, although at the cost of increased computation.
Agent Migration Between Incompatible Agent Platforms
Authors: Pauli Misikangas, Kimmo Raatikainen
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Several agent platforms of general purpose exist - for example, Voyager, Jade, and Grasshopper - each of which provide an environment for building and executing software agents. Unfortunately, the platforms are usually incompatible with each other. Thus, agents built for one platform cannot be used in another platform, nor can they interact with agents in other platforms. Some effort is put into standardizing agent communication and migration in FIPA and in OMG, but these standards are not yet supported by most of the existing platforms. Therefore, we should find some other ways to allow interaction between agents in different platforms.In this paper we will show that it is possible to make platform independent agents that are able to migrate between incompatible platforms. We will also describe how messages can be delivered to agents in other platforms, and show how to build platform independent service agents that are used via method calls. The ideas have been tested in practice with Voyager, Jade, and Grasshopper platforms.
Overflow behavior in queues with many long-tailed inputs
Authors: Michel R.H. Mandjes, Simon C. Borst
Venue:  (1999)

We consider a fluid queue fed by a superposition of $n$ homogeneous on-off sources with generally distributed on- and off-periods. We scale buffer space $B$ and link rate $C$ by $n$, such that we get $nb$ and $nc$, respectively. Then we let $n$ grow large. In this regime, the overflow probability decays exponentially in the number of sources $n$; we specifically examine the situation in which also $b$ is large. We explicitly compute asymptotics for the case in which the on-periods have a subexponential distribution, e.g., Pareto, Lognormal, or Weibull. We provide a detailed interpretation of our results. Crucial is the shape of the function $v(t) := - log Pr( A^* < t )$ for large~$t$, $A^*$ being the residual on-period. If $v(.)$ is slowly varying (e.g., Pareto, Lognormal), then, during the trajectory to overflow, the input rate will only slightly exceed the link rate. Consequently, the buffer will fill `slowly'', and the typical time to overflow will be `more than linear'' in the buffer size. In contrast, if $v(.)$ is regularly varying of index strictly between 0 and 1 (e.g., Weibull), then the input rate will significantly exceed the link rate, and the time to overflow is essentially proportional to the buffer size. In both cases there is a substantial fraction of the sources that remain in the on-state during the entire path to overflow, while the other sources contribute at mean rate. These observations lead to straightforward approximations for the overflow probability. These approximations can be extended to the case of heterogeneous sources; the results provide further insight into the so-called reduced-load approximation.
Game Programming Tricks of the Trade
Authors: Lorenzo Phillips
Venue:  (2002)

:Get on the inside track with Game Programming Tricks of the Trade! This book is a necessity for game programmers of all skill levels because it provides a single source of information that covers a broad range of topics. From mathematics and physics to Artificial Intelligence and multiplayer game programming you will be given a series of articles covering the topic, plus code examples. The CD includes trial versions of Paint Shop Pro 7, a compiler, a 3D modeling tool (i.e., Rhinoceros3D), Winzip8.0, 2D artwork and 3D models, sounds/music, Microsoft DirectX8 SDK, and FastGraph Light 6.0. 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
Fast Parallel Matrix and GCD Computations
Authors: Allan B. Borodin, Joachim Von zur Gathen, John E. Hopcroft
Venue:  (1982)

We present parallel algorithms to compute the determinant and characteristic polynomial of n x n-matrices and the gcd of polynomials of degree $\leq$n. The algorithms use parallel time $O(\log^{2}n)$ and a polynomial number of processors. We also give a fast parallel Monte Carlo algorithm for the rank of matrices. All algorithms work over arbitrary fields.
Efficient Techniques for Distributed Implementation of Search-Based AI Systems
Authors: Gopal Gupta, Enrico Pontelli
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a modification of the well-known stack-copying technique for environment representation, that can be used for exploiting or-parallelism efficiently from AI systems on distributed-memory machines. Stack-splitting coupled with appropriate scheduling strategies leads to: (i) reduced communication during distributed execution; and, (ii) distribution of larger grain-sized work to processors. The modified technique can also be implemented on shared memory machines and should be quite competitive with existing methods. Indeed, an implementation has been carried out on shared memory machines. The results suggest that stack-splitting is an effective technique for obtaining high performance on shared-memory as well as distributed memory multiprocessors.
Trends in Low Power Digital System-on-Chip Designs
Authors: G. Lim
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

A study of the future trends in low-power System-on-Chip (SOC) designs is presented, based on the recently announced ITRS-2001 technology characteristics for both high-performance and low-power devices from 2001 to 2016. We forecast the logic/memory composition of a reference low-power PDA design with an area constraint of 1cm2 using both a bottom-up, power dissipation-constrained chip model and a top-down, design resource-constrained model. Together, these analyses indicate that without accelerated improvements in both chip design productivity and leakage power management, future SOC designs will be comprised of 80-90% memory, with the remaining logic blocks composed of special-purpose reusable IP cores, and a smaller fraction of the chip containing newly designed logic.
Procedure Cloning and Integration for Converting Parallelism from Coarse to Fine Grain
Authors: Won So, Alex Dean
Venue: Proceedings of the Seventh Workshop on Interaction between Compilers and Computer Architectures (2003)

This paper introduces a method for improvingprogram run-time performance by gathering work inan application and executing it efficiently in anintegrated thread. Our methods extend whole-programoptimization by expanding the scope of the compilerthrough a combination of software thread integrationand procedure cloning. In each experiment weintegrate a frequently executed procedure with itselftwice or thrice, creating two clones. Then, based onprofile data we select at compile time the fastestversion (original or clone) and modify call sites asneeded.We demonstrate our technique by cloning andintegrating three procedures from cjpeg and djpeg atthe C source code level, compiling with four compilersfor the Itanium EPIC architecture and measuring theperformance with the on-chip performancemeasurement units. For cjpeg, which is notsignificantly constrained by the i-cache, we findintegration consistently improves code generated by allcompilers but one, with a mean program speedup of11.9%.
Formally Verified Byzantine Agreement in Presence of Link Faults
Authors: ULRICH SCHMID, BETTINA WEISS, JOHN RUSHBY
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of (Gray, 1978). Instead of usingrandomization, we overcome this impossibility by moderately restricting the inconsistency that link faults may cause system-wide. Relying upon a novel hybrid fault model that provides different classes of faults for both nodes and links, we provide a formally verified proof that the m + 1-round Byzantine agreement algorithm OMH (Lincoln & Rushby, 1993) requiresn
The Terminological Image Data Model
Authors: Carlo Meghini, Fabrizio Sebastiani, Umberto Straccia
Venue:  (1996)

This study addresses the problem of injecting semantics into image retrieval by presenting an image data model in which images are represented both at the form and at the content level. The data model is logic-based, in the sense that the representation of image content is based on a {\em description logic} (DL). Features of images pertaining to form impact on retrieval through a mechanism of procedural attachments, which implements the connection between (logical) reasoning about content and (non-logical) reasoning about form. The DL-based query language of the model thus allows the expression of image retrieval requests addressing both visual and conceptual similarity, and its underlying logic permits, among other things, to bring to bear domain and contextual knowledge in the retrieval process. The model is extensible, in that the set of symbols representing similarity can be enriched at will. TEL:: +39.050.593404 EMAIL:: straccia@iei.pi.cnr.it
Web Theory
Authors: Robert Burnett, David Marshall, P. David Marshall
Venue:  (2002)

:Web Theory explores the shifts in society, culture and the media which have been brought about by the growth of the World Wide Web. It identifies significant readings, Web sites and hypertext archive sources that illustrate the critical discussion about the Internet and it mediates these discussions, indicating key positions within each debate and pointing the reader to key texts.
An Object Model of Autonomous Control Processor and the Message Selection Method
Authors: Takeiki Aizono, Katsumi Kawano, Masahiro Ohashi, Makoto Kogure
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

This paper describes new fault-tolerant technology using a simple object-based Autonomous Decentralized System (ADS) model. Recent advances in processor technology have made it possible to connect not only computers but also devices to networks resulting in an increasing number of nodes in a system. Control logic of a computer or a controller has become widely distributed among a huge number of devices, such as sensors and actuators. More flexible and lower cost systems are required because of the downsizing of control systems. In order to achieve these requirements, the Structured Autonomous Control Processor (SACP) model and a message selection method has been proposed. This model and method show how scalable fault-tolerance and increased maintainability of device-level distributed computing systems can be achieved. SACP and the message selection method are applied to a SACP chip and the effectiveness has been verified. Some SACP functions have become the defacto standard for communication protocol used in manufacturing systems and have started to be used wide world.
Online Social Sciences
Authors: Bernad Batinic, Ulf-Dietrich Reips, Michael Bosnjak
Venue:  (2002)

:Ever more researchers in the social sciences and market research are interested in using the benefits of the internet to obtain data, and as this book shows online studies can address many questions that are asked by social scientists. This unique text provides comprehensive and up-to-date information, from the basics upwards about online research methods, technical approaches to data collection, and the quality and limitations of data collected online. Included among the twenty-three chapters, written by leading online researchers from Europe and North America are ones investigating the implementation of both reactive and non-reactive methods of data collection. The studies reported utilize Web-based questionnaires, web experiments, observations of virtual worlds, case narrations, content analyses, and analysis of mailing-lists and other log data. In addition to featuring various fields of research in the online environment and reporting the results of such studies, this book also seeks to bridge a gap between internet scientists in Europe and the US. In the past, researchers have tended to work on similar projects without collaboration: this book represents a joint effort among these researchers.
Multi-Valued Flip-Flop with Neuron-CMOS NMIN Circuits
Authors: Motoi Inaba, Koichi Tanno, Okihiko Ishizuka
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

In this paper, the implementation and verification of the fundamentalflip-flops for the voltage-mode multi-valued logic circuits on aconventional CMOS VLSI chip are presented.Using the quantized NMINcircuits and the analog NMIN circuits, two types of the multi-valued R-Sflip-flop are designed like a wide-use R-S flip-flop with NAND circuits andare applied to the D-flip-flop for the multi-valued memory.In verificationthrough HSPICE simulation, the proposed flip-flops perform good results suchas high noise margins and low power consumption.