ppxscal/embedding_network huggingface dataset:
Characterization and Enhancement of Dynamic Mapping Heuristics for Heterogeneous Systems
Authors: Vladimir Yarmolenko, Jose Duato, Dhabaleswar K. Panda, P. Sadayappan
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Clusters of heterogeneous PCs/workstations have become attractive systems to execute a set of computationally intensive independent tasks. This paper focuses on scheduling schemes in a dynamic context - i.e. where scheduling decisions are made periodically as jobs arrive, in contrast to static scheduling where scheduling is performed after all jobs have been submitted. This paper characterizes different scheduling schemes with respect to varying arrival rates and burstiness in the job arrival rate. Using the insights gained by the characterization, a set of approaches is proposed to improve the previously developed strategies with respect to turn-around time. Simulation results indicate improvements of up to 40% in turnaround time by using the proposed enhancements.
On the Efficiency of Optimising Shallow Backtracking in Prolog
Authors: Mats Carlsson
Venue:  (1990)

The cost of backtracking has been identified as one of the bottlenecks in achieving peak performance in compiled Prolog programs. Much of the backtracking in Prolog programs is shallow, i.e. is caused by unification failures in the head of a clause when there are more alternatives for the same procedure, and so special treatment of this form of backtracking has been proposed as a significant optimisation. This paper describes a modified WAM which optimises shallow backtracking. Four different implementation approaches are compared. A number of benchmark results are presented, measuring the relative tradeoffs between compilation time, code size, and run time. The results show that the speedup gained by this optimisation can be significant.
Java Oracle Database Development
Authors: David Gallardo
Venue:  (2002)

The hands-on tutorial for Java developers who want to integrate their applications with the industy leading Oracle 8i and 9i databases. Provides an introduction to database design, including the essentials of SQL, to get Java programmers started with Oracle comfortably, confidently and quickly! Covers important Java database technologies, such as JDBC and JDO-step-by-step, with examples. Covers both Oracle 8i and 9I-including new 9i features, such as object-relational features, all highlighted with examples.
Performance Analysis Tool for Cache-Based Real-Time Systems with Preemptions
Authors: Jonathan Simonson, Janak H. Patel
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

This research was supported in part by a grant from the National Aeronautics and Space Administration under contract NASA NAG-1-613. Dependable real-time systems are essential to time-critical applications. The systems that run these applications require high degrees of performance and predictability. Although memory caching has long been known as a means of increasing system performance, it is typically unpredictable in nature. This paper presents a technique of using preferred preemption points to increase the predictability and performance of cache-based real-time systems and describes a performance analysis tool and methodology designed to select and evaluate preemption points. Performance results obtained by using the tool are presented for various system configurations. System configurations are defined by such parameters as cache type and preemption frequency. In some instances, results have shown a 10% reduction in execution time with preferred preemption points. Such savings in execution time provide greater flexibility in scheduling and increase throughput of time-critical tasks. Use of the technique increases the ability to calculate system preemption overhead. This leads to greater determinism and consequently performance, and provides for tighter bounds on calculated worst-case execution times.
MOrpho-LEXical Analysis for Correcting OCR-Generated Arabic Words (MOLEX)
Authors: Toufik Sari, Mokhtar Sellami
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper we present a contextual-based method for correcting Arabic words generated by OCR systems. This technique operates as a post-processor and it wants to be universal. Itcorrects substitution and rejection errors. The Arabic language properties are very useful in morpho-lexical analysis and therefore they are strongly exploited in the development of themethod. The substitution errors, the most frequently ommitted ones by the OCR systems, are rewritten in production rules to be used by a rule-based system for correcting Arabi words. The first version of the developed method operates only at the morpho-lexical level, the extension to the other levels of language analysis is considered in perspectives.
Conjugacy and episturmian morphisms
Authors: G. Richomme
Venue: Theoretical Computer Science (2003)

Episturmian morphisms generalize Sturmian morphisms. Here, we study some intrinsic properties of these morphisms: invertibility, presentation, cancellativity, unitarity, characterization by conjugacy. Most of them are generalizations of known properties of Sturmian morphisms. But we present also some results on episturmian morphisms that have not already been stated in the particular case of Sturmian morphisms: characterization of the episturmian morphisms that preserve palindromes, new algorithms to compute conjugates.We also study the conjugation of morphisms in the general case and show that the monoid of invertible morphisms on an alphabet containing at least three letters is not finitely generated.
Decomposition Techniques for Planning in Stochastic Domains
Authors: Thomas Dean, Shieu Lin
Venue:  (1995)

This paper is concerned with modeling planning problems involving uncertainty as discrete-time, finite-state stochastic automata. Solving planning problems is reduced to computing policies for Markov decision processes. Classical methods for solving Markov decision processes cannot cope with the size of the state spaces for typical problems encountered in practice. As an alternative, we investigate methods that decompose global planning problems into a number of local problems, solve the local problems separately, and then combine the local solutions to generate a global solution. We present algorithms that decompose planning problems into smaller problems given an arbitrary partition of the state space. The local problems are interpreted as Markov decision processes and solutions to the local problems are interpreted as policies restricted to the subsets of the state space defined by the partition. One algorithm relies on constructing and solving an abstract version of the original decision problem. A second algorithm iteratively approximates parameters of the local problems to convrge to an optimal solution. We show how properties of the specified partition impact on the time and storage required for these algorithms.
An image transport protocol for the Internet
Authors: S. Raman, H. Balakrishnan, M. Srinivasan
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Images account for a significant and growing fraction of Web downloads. The traditional approach to transporting images uses TCP, which provides a generic reliable, in-order byte-stream abstraction, but which is overly, restrictive for image data. We analyze the progression of image quality at the receiver with time and show that the in-order delivery abstraction provided by a TCP-based approach prevents the receiver application from processing and rendering portions of an image when they, actually, arrive. The end result is that an image is rendered in bursts interspersed with long idle times rather than smoothly. This paper describes the design, implementation, and evaluation of the Image Transport Protocol (ITP) for image transmission over loss-prone congested or wireless networks. ITP improves user-perceived latency using application level framing (ALF) and out-of-order pplication data unit (ADU) delivery achieving significantly better interactive performance as measured by the evolution of peak signal-to-noise ratio (PSNR) with time at the receiver ITP runs over UDP, incorporates receiver-driven selective reliability uses the congestion manager (CM) to adapt to network congestion, and is customizable for specific image formats (e.g., JPEG and JPEG2000). ITP enables a variety of new receiver post-processing algorithms such as error concealment that further improve the interactivity and responsiveness of reconstructed images. Performance experiments using our implementation across a variety of loss conditions demonstrate the benefits of ITP in improving the interactivity of image downloads at the receiver.
Efficient Inter-Device Data-Forwarding in the Madeleine Communication Library
Authors: Olivier Aumage, Lionel Eyraud
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

Interconnecting multiple clusters with a high speed networkto form a single heterogeneous architecture (i.e. acluster of clusters) is currently a hot issue. Consequently,new runtime systems that are able to simultaneously dealwith multiple high speed networks within the same applicationhave to be designed. This paper presents how wedid extend an existing multi-device communication librarywith fast internal data-forwarding capabilities on gatewaynodes. On top of that, efficient high-level routing mechanismscan be implemented. Our approach is easily applicableto many network protocols and is completely in-pendantfrom the application code. Efficiency is achievedby avoiding extra data copies when possible and by usingpipelining techniques. The preliminary experiments showthat the observed inter-cluster bandwidth is close to the onethat can be delivered by the hardware.
Addressing the complexity of patient monitoring with multiagents and modular logic
Authors: Susan L. Mabry, Timothy Etters, Troy Schneringer, Naomi Edwards, Caleb Hug
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

While there is a recognized need among medical clinicians for assistance in monitoring and diagnostic tasks, the domain is extremely complex. Teams of distributed agents and interchangeable logic modules can address practical issues in a fielding of MAS technology. IM-Agents employ dynamic inference through a hybrid approach of fuzzy logic, connection networks, trend analysis and qualitative logic. Decision functionality in test cases involves emergency trauma scenarios, with particular focus on stabilizing hemorrhagic shock.
A finitary version of the calculus of partial inductive definitions
Authors: Lars Eriksson
Venue:  (1992)

The theory of partial inductive definitions is a mathematical formalism which has proved to be useful in a number of different applications. The fundamentals of the theory is shortly described. Partial inductive definitions and their associated calculi are essentially infinitary. To implement them on a computer, they must be given a formal finitary representation. We present such a finitary representation, and prove its soundness. The finitary representation is given in a form with and without variables. Without variables, derivations are unchanging entities. With variables, derivations can contain logical variables that can become bound by a binding environment that is extended as the derivation is constructed. The variant with variables is essentially a generalization of the pure GCLA programming language.
More comments on 'A cohesion measure for object-oriented classes' by Heung-Seok Chae, Yong-Rae Kwon and Doo-Hwan Bae
Authors: Baowen Xu, Yuming Zhou
Venue: Software&mdash;Practice Experience (2003)

Chae et al. believe that the improved CBMC measures class cohesion from the viewpoint of the usage criteria of instance variables and that it cannot allow meaningful interpretations about classes. This paper exemplifies that it characterizes the interaction patterns better than the original one does and that it could also be used as a guideline for quality evaluation so as to enable the restructuring of poorly designed classes.
Fast Compiled Logic Simulation Using Linear BDDs
Authors: Sudeep Gupta, Keshav Pingali
Venue:  (1995)

This paper presents a new technique for compiled zero delay logic simulation, and includes extensive experiments that demonstrate its performance on standard benchmarks. Our compiler partitions the circuit into fanout-free regions (FFRs), transforms each FFR into a linear sized BDD, and converts each BDD into executable code. In our approach, the computation is sublinear in the number of variables within each partition because only one path, from root to leaf, of the BDD is executed; therefore in many cases, substantial computation is avoided. In this way, our approach gets some of the advantages of oblivious as well as demand-driven evaluation. We investigated the impact of various heuristics on performance, and based on this data, we recommend good values for design parameters. A performance improvement of up to 67% over oblivious simulation is observed for our benchmarks.
On the implementation of a prototype for performance management services
Authors: T. K. Apostolopoulos, V. C. Daskalou
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

This paper presents a prototype for management services which enables the performance monitoring and control of resources in a TCP/IP network. A time reference information model required to accomplish the different needs of performance management functions, is also described. This temporal model can be used not only to provide a diachronic view of the management information, but also to define a set of measures needed to observe the performance of network elements. The performance management application is implemented using a distributed architecture. It provides facilities to dynamically create aggregate managed objects, to collect the management information and to store the collected data in a database. The database schema is designed to follow the proposed time reference information model and also the structure of the MIB. Finally, the architecture of the prototype and the supported facilities are also illustrated in this paper.
A Progressive Software Development Lifecycle
Authors: Russell Turpin
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Traditional software lifecycles put significant effort in analysis, design, and implementation before their results can be tested. The start of testing late in the lifecycle often uncovers flaws from these early phases that require significant rework of analysis and design. We describe a software lifecycle where each phase of development is followed by an execution test of the results of that phase. This lifecycle is progressive in the sense that it does not require significant "backing up" to earlier phases of development. The use of this lifecycle requires tool support that is just now becoming available. We examine this lifecycle and its implications for embedded software development.
Hierarchical and Geometrical Methods in Scientific Visualization
Authors: Gerald E. Farin
Venue:  (2003)

:This book emerged from a DoE/NSF-sponsored workshop, held in Tahoe City, California, October 2000. About fifty invited participants presented state-of-the-art research on topics such as: - terrain modeling - multiresolution subdivision - wavelet-based scientific data compression - topology-based visualization - data structures, data organization and indexing schemes for scientific data visualization. All invited papers were carefully refereed, resulting in this collection. The book will be of great interest to researchers, graduate students and professionals dealing with scientific visualization and its applications.
A parallel implementation of the three-fields algorithm on a HP-Convex exemplar SPP1600
Authors: Nicoletta Fornasari, Gianna Gazzaniga, Sergio Rovida, Giovanni Sacchi
Venue:  (1997)

This work deals with the parallel implementation of a non-overlapping Domain Decomposition method. We applied the so called Three-Fields algorithm to an advection/diffusion, strongly advection dominated, problem choosing the programming model suggested by the functional decomposition of the procedure. The considered algorithm was implemented on a HP-Convex Exemplar SPP1600, following the explicit message passing style and using PVM to perform interprocessor communication. We provide a careful analysis of execution times and parallel scalability, in order to highlight the performance of the algorithm on the considered parallel machine. In particular, we discuss communication and computation costs and investigate the influence on the achieved results of workload balancing and of architectural features such as interconnect network and cache memories. Finally, we also discuss the gains in performance provided by multilevel parallelism. EMAIL:: ian@microian.ian.pv.cnr.it
The Tracefile Testbed - A Community Repository for Identifying and Retrieving HPC Performance Data
Authors: Ken Ferschweiler, Scott Harrah, Dylan Keon, Mariacarla Calzarossa
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

HPC programmers utilize tracefiles, which record program behavior in great detail, as the basis for many performance analysis activities. The lack of generally accessible tracefiles has forced programmers to develop their own testbeds in order to study the basic performancecharacteristics of the platforms they use. Since tracefiles serve as input to performance analysis and performance prediction tools, tool developers have also been hindered by the lack of a testbed for verifying and fine-tuning tool functionality. We have created a community repository that meets the needs of both application and tool developers. In this paper, we describe how the Tracefile Testbed was designed to facilitate flexible searching and retrievalof tracefiles based on a variety of characteristics. Its Web-based interface provides a convenient mechanism for browsing, downloading, and uploading collections of tracefiles and tracefile segments, as well as viewing statistical summaries of performance characteristics.
Obstacles and Incentives in Introducing RE Research Results into RE Practice
Authors: Jawed Siddiqi
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

In the last decade, the notion of be-spoke software or requirements as contract has become less and less relevant. Is the dominant paradigm perhaps the Microsoft one? This is an environment in which software development proceeds on market driven criteria, Software development currently has to attempt overcome the obstacles of requirements evolution, schedule pressures, minimizing development costs etc. Does it now move to ¿He who delivers wins¿. The obstacles that make it difficult to introduce RE research results into mainstream RE practice is time and the incentive that will necessitate that it does occur is money.
Visualizing Diffusion Tensor Images of the Mouse Spinal Cord
Authors: David H. Laidlaw, Eric T. Ahrens, David Kremers, Matthew J. Avalos, Carol Readhead, Russell E. Jacobs
Venue:  (1998)

Within biological systems water molecules undergo continuous stochastic Brownian motion. The rate of this diffusion can give clues to the structure of underlying tissues. In some tissues the rate is anisotropic - faster in some directions than others. Diffusion-rate images are second-order tensor fields and can be calculated from diffusion-weighted magnetic resonance images. A 2D diffusion tensor image (DTI) and an associated anatomical scalar field, created during the tensor calculation, define seven dependent values at each spatial location. Understanding the interrelationships among these values is necessary to understand the data. We present two new methods for visually representing DTIs. The first method displays an array of ellipsoids where the shape of each ellipsoid represents one tensor value. The novel aspect of this representation is that the ellipsoids are all normalized to approximately the same size so that they can be displayed in context. The second method uses concepts from oil painting to represent the seven-valued data with multiple layers of varying brush strokes. Both methods successfully display most or all of the information in DTIs and provide exploratory methods for understanding them. The ellipsoid method has a simpler interpretation and explanation than the painting-motivated method; the painting-motivated method displays more of the information and is easier to read quantitatively. We demonstrate the methods on images of the mouse spinal cord. The visualizations show significant differences between spinal cords from mice suffering from Experimental Allergic Encephalomyelitis (EAE) and spinal cords from wild-type mice. The differences are consistent with pathology differences shown histologically and suggest that our new non-invasive imaging methodology and visualization of the results could have early diagnostic value for neurodegenerative diseases.
LOGO and Java - One Happy Marriage
Authors: Zoran Putnik, Marijana Grabovac
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Computer graphics has entered all aspects of programming especially after introduction ofWorld Wide Web into everyday life and increase of the number of people who are using it. This emphasized the need and the quantity of graphics that we are all faced with.Here Java is the language of our choice since it is already enriched with built-in classes for platformindependent graphical user interface, and that it supports picture, animation, sound andnetwork capabilities.Turtle graphics has been implemented in a Java programming languageas a Java applet.The implementation of turtle graphics in Java is important because it bringsthe expressiveness of LOGO to Java language.
The bakery protocol: a comparative case-study in formal verification
Authors: W. O. D Griffioen, Henri P. Korver
Venue:  (1995)

A Comparative Case-Study in Formal Verification Groote and the second author verified (a version of) the Bakery Protocol in $\muCRL$. Their process-algebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new correctness proof by using I/O-automata theory and discuss the relative merits of both approaches. Subject classification:
Partial Traces and the Semantics and Logic of CCS-Like Languages
Authors: Bard Bloom
Venue:  (1989)

We consider the theory of CCS-Like languages when partial traces (simply finite sequences of actions that the process may perform) are the only observation. We characterize process equivalence, giving relational, logical, and operational definitions and showing that they coincide. This relation is adequate for all languages defined by a class of CCS-like rules; it is fully abstract for any language including process copying and controlled communication poeration. We also give a complete inequational axiom system for this notion of process equivalence for finite processes.