ppxscal/embedding_network huggingface dataset:
A Distributed Computing Model and Its Application
Authors: Chunlin Li, Zhengding Lu, Layuan Li
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper presents a Java -based distributed computing model for deploying networking system. The proposed model can raise the level of abstraction for network or distributed system programming, from network protocol level to the object interface level, it provides a mechanism to enable smooth adding, removal, and finding of software components and services on the network. The software components providers use this distributed model toadvertise complex descriptions of available or already running services, while clients use the model to compose complex queries for locating these software components. The provider ofsoftware components or services needs not agree on network level protocols that allow their software components to interact. In this paper, the framework of the proposed model is described, and the processes for implementing the model are given, which can consists of three processes. The availability and efficiency of the model have been verified by illustrating an example. Finally, some remarks and conclusions are given.
Multi-Level Shared State for Distributed Systems
Authors: DeQing Chen, Chunqiang Tang, Xiangchuan Chen, Sandhya Dwarkadas, Michael L. Scott
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

As a result of advances in processor and network speeds, more and more applications can productively be spread across geographically distributed machines. In this paper we present a transparent system for memory sharing, InterWeave, developed with such applications in mind. InterWeave can accommodate hardware coherence and consistency within multiprocessors (level-1 sharing), software distributed shared memory (S-DSM) within tightly coupled clusters (level-2 sharing), and version-based coherence and consistency across the Internet (level-3 sharing). InterWeave allows processes written in multiple languages, running on heterogeneous machines, to share arbitrary typed data structures as if they resided in local memory. Application-specific knowledge of minimal coherence requirements is used to minimize communication. Consistency information is maintained in a manner that allows scaling to large amounts of shared data. In C, operations on shared data, including pointers, take precisely the same form as operations on non-shared data. We demonstrate the ease of use and efficiency of the system through an evaluation of several applications. In particular, we demonstrate that InterWeave's support for sharing at higher (more distributed) levels does not reduce the performance of sharing at lower (more tightly coupled) levels.
A Framework for Assessing Dependability in Distributed Systems with Lightweight Fault Injectors
Authors: David T. Stott, Benjamin Floering, Zbigniew Kalbarczyk, Ravishankar K. Iyer
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

Many fault injection tools are available for dependability assessment. Although these tools are good at injecting a single fault model into a single system, they suffer from two main limitations for use in distributed systems: (1) no single tool is sufficient for injecting all necessary fault models; (2) it is difficult to port these tools to new systems. NFTAPE, a tool for composing automated fault injection experiments from available lightweight fault injectors, triggers, monitors, and other components, helps to solve these problems.We have conducted experiments using NFTAPE with several types of lightweight fault injectors, including driver-based, debugger-based, target-specific, simulation-based, hardware-based, and performance-fault injections. Two example experiments are described in this paper. The first uses a hardware fault injector with a Myrinet LAN; the other uses a Software Implemented Fault Injection (SWIFI) fault injector to target a space-imaging application.
A standards-based agent framework for instantiating adaptive agents
Authors: Riza Cenk Erdur, Oguz Dikenelli
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we introduce the agent framework that we have developed for the instantiation of adaptive agents. We use the term "adaptive agent" for agents that adapt their internal knowledge and behavior when an ontology in the system is changed or a new ontology is added to the system at run time. The main contribution of this framework is the existence of an additional layer that contains the actions that enable the instantiated agents to adapt themselves to the dynamically changing ontologies in the environment. In our approach, successful adaptation depends on the ontology transfer at run time. By transferring ontologies, an agent can adapt its internal knowledge and behavior using the predefined ontology dependent actions that are specifically defined for adaptive behavior. Besides its adaptive characteristics, the developed framework is FIPA-compliant and supports current Web standards such as "Resource Description Framework (RDF)" and agent content language standards such as "FIPA-rdf" content language.
A method for estimating optimal unrolling times for nested loops
Authors: A. Koseki, H. Komastu, Y. Fukazawa
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not only the innermost loop but also outer loops greatly expands the scope for reusing data and parallelizing instructions. Nested-loop unrolling is therefore a very effective way of obtaining a higher degree of parallelism. However, we need a method for measuring the efficiency of loop unrolling that takes account of both the reuse of data and the parallelism between instructions. This paper describes a heuristic algorithm for deciding the number of times and the directions in which loops should be unrolled, through the use of information such as dependence, reuse, and machine resources. Our method is evaluated by applying benchmark tests.
A Stochastic Evaluation Of The Spatial Moments Of A Contaminant Plume In Porous Media
Authors: D. W. Dean
Venue:  (2000)

In a previous report, a method of deriving statistical moment information was developed using a Hilbert space version of Ito''s formula. This approach was used to develop a system of partial differential equations in which the first and second moments of the concentration distribution appear as independent variables. It was shown there that the system of moment equations appearing in Graham and McLaughlin can be derived in this manner. The present report expands on some of the material presented in previous reports and provides a method of determining the statistical moments of a contaminant plume from the usual spatial moment formulations. Specifically, the Lagrangian concept of computing along the particle path of a fluid particle is used to develop a transformation that transforms a function $g(\vec{x}) \in L^1(\Re^d)$ defined on all of $\Re^d$, an Eulerian concept, to a function $g(\vec{X}_T(t, \omega; \vec{x}_0, t_0))$, defined along the fluid particle trajectory, $\vec{X}_T(t, \omega; \vec{x}_0, t_0)$, a Lagrangian concept. The transformation is then used to convert the 0, 1 and 2 Eulerian spatial moments to their Lagrangian counterparts.
Restructuring Parallel Programs by Transformation of Point-To-Point Interactions into Collective Communication
Authors: Beniamino Di Martino, Antonino Mazzeo, Nicola Mazzocca, Umberto Villano
Venue: Proceedings of the 7th International Workshop on Program Comprehension (1999)

In this paper we present an approach for supporting the reenginering of legacy message passing parallel programs based on point-to-point communication primitives. The objective is to obtain structured, portable, and, possibly, more efficient versions of the same programs through the use of collective communication constructs.The restructuring process relies on a technique capable of detecting typical interaction patterns within programs based on point-to-point communications. Successively, the code excerpts corresponding to the detected patterns are automatically replaced with suitable collective primitives.
A case study of cartoon visualisation using AspectJ
Authors: Rilla Khaled, James Noble, Robert Biddle
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

In this paper, we present a real-time visualisation of a port simulation program. It makes use of cartoon visualisation and was created using InspectJ, our AspectJ-driven visualisation framework. AspectJ is an aspect-oriented extension to Java that allows concerns that cut across a program to be addressed explicitly in aspect components, thereby supporting a novel approach to visualisation control. InspectJ renders visualisations on a Tk canvas. The combination of using AspectJ for program monitoring and the Tk canvas made creation of the visualisation reasonably fast and fairly straightforward. We discuss interesting issues related to the visualisation of frameworks, as well as future directions for framework visualisation, such as the web-based visualisation creation systems. We also discuss cartoon animation as a means of visualisation, along with its potential applications.
Confessions of a formal methodist
Authors: Michael G. Hinchey
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

The author, a confirmed formal methodist, while not abandoning his adherence to this "religion," concedes that formal methods alone will not save the day, and that a number of other approaches have been, must be, and will continue to be, of relevance in the development of safetycritical systems. These, however, are not incongruous or antithetical to the application of formal methods.
Multimedia Processor Architecture
Authors: T. Ikedo, W. Martens
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

This paper describes trends in the development of multimedia processor architecture that may be predicted on the basis of the availability of an ASIC with 10s of millions of gates. Multimedia processing based upon multi-granular parallelism for diverse media needs supercomputing power for multi-threaded, process-level execution. Due to the appearance of large scale integration (LSI) for what has been termed {\em system on silicon}, a new scheme for building the multimedia-centric processor will be realized. This paper proposes advanced implementation technologies for multimedia acceleration employing a reconfigurable architecture and using hundreds of processing elements embedded within an ASIC. Accelerated functions considered in this proposal include 3D graphic and 3D audio rendering, and implementation of video and audio codecs. Computational efficiency for advanced applications, such as walk-through virtual reality (VR), is maximized by sharing the results of geometric calculations that are required both for graphics and audio rendering.
HARP: The Hybrid Automated Reliability Predictor
Authors: B J Dugan, S K Trivedi, K M Smotherman, M R Geist
Venue:  (1985)

In this paper we present an overview of the Hybrid Automated Reliability Predictor (HARP), under development at Duke University and Clemson University. The HARP approach to reliability prediction is characterized by a decomposition of the overall model into distinct fault-occurrence/repair and fault/error-handling submodels. The fault-occurrence/repair model can be cast as either a fault tree or as a Markov chain, and is solved analytically. Both exponential and Weibull time to failure distributions are allowed. There are a variety of choices available for the specification of the fault/error-handling behavior, that may be solved analytically or simulated. Both graphical and textual interfaces are provided to HARP.
Issues in Reliability Modeling of Fault-Tolerant Systems
Authors: S K Trivedi, B J Dugan, Robert Geist, Mark Smotherman
Venue:  (1984)

Four key issues in reliability modeling of fault-tolerant systems (imperfect coverage, large state space, non-exponential behavior and error estimation) are discussed. Some general methods as well as HARP (The Hybrid Automated Reliability Predictor) methods of dealing with these problems are outlined. An annotated bibliography provides pointers to the literature for further information.
Concurrent Garbage Collection of Persistent Heaps
Authors: Scott Nettles, James O''Toole, David Gifford
Venue:  (1993)

We describe the first concurrent compacting garbage collector for a persistent heap. Client threads read and write the heap in primary memory, and can independently commit or abort their write operations. When write operations are committed they are preserved in stable storage and thus survive system failures. Clients can freely access the heap during a garbage collection because a replica of the heap is created by the stable replica collector. A log is maintained to capture client write operations. This log is used to support both the transaction system and the replication-based garbage collection algorithm. Experimental data from our implementation was obtained from a transactional version of the SML/NJ compiler and modified versions of the TPC-B and OO1 database benchmarks. The pause time latency results show that the prototype implementation provides significantly better latencies than stop-and-copy collection. For small transactions, throughput is limited by the logging bandwidth of the underlying log manager. The results provide strong evidence that the replication copying algorithm imposes less overhead on transaction commit operations than other algorithms.
Augmented Transition Networks as Video Browsing Models for Multimedia Databases and Multimedia Information Systems
Authors: Shu-Ching Chen, Srinivas Sista, Mei-Ling Shyu, R. L. Kashyap
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In an interactive multimedia information system, users should have the flexibility to browse and choose various scenarios they want to see. This means that two-way communications should be captured by the conceptual model. Digital video has gained increasing popularity in many multimedia applications. Instead of sequential access to the video contents, the structuring and modeling of video data so that users can quickly and easily browse and retrieve interesting materials becomes an important issue in designing multimedia information systems. An abstract semantic model called the augmented transition network (ATN), which can model video data and user interactions, is proposed in this paper. An ATN and its sub-networks can model video data based on different granularities such as scenes, shots and key frames. Multimedia input strings are used as inputs for ATNs. The details of how to use multimedia input strings to model video data are also discussed. Key frame selection is based on temporal and spatial relations of semantic objects in each shot. The temporal and spatial relations of semantic objects are captured from our proposed unsupervised video segmentation method which considers the problem of partitioning each frame as a joint estimation of the partition and class parameter variables. Unlike existing semantic models which only model multimedia presentation, multimedia database searching, or browsing, ATNs together with multimedia input strings can model these three in one framework.
New Hybrid Genetic Algorithms for the Frequency Assignment Problem
Authors: Miguel Alabau, Lhassane Idoumghar, René Schott
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

This paper presents a new hybrid genetic algorithm used to solve a frequency assignment problem. The hybrid genetic algorithm presented in this paper uses two original mutation operators. The first mutation operator is based on a greedy algorithm and the second one on an original probabilistic tabu search. The results obtained by our algorithm are better than the best known results obtained by other methods like tabu search and hybrid genetic algorithm. Our results are validated in the field of radiobroadcasting and compared to the best existing solutions in this domain.
The base-matroid and inverse combinatorial optimization problems
Authors: Mauro Dell'Amico, Francesco Maffioli, Federico Malucelli
Venue: Discrete Applied Mathematics (2003)

A new matroid is introduced: this matroid is defined starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has application in the field of inverse combinatorial optimization problems. We discuss in detail the LP formulation of the inverse matroid optimization problem and we propose an efficient algorithm for computing its primal and dual solutions.
Mathematical Methods in Physics and Engineering with Mathematica
Authors: Ferdinand Cap
Venue:  (2003)

:More than ever before, complicated mathematical procedures are integral to the success and advancement of technology, engineering, and even industrial production. Knowledge of and experience with these procedures is therefore vital to present and future scientists, engineers and technologists. Mathematical Methods in Physics and Engineering with Mathematica clearly demonstrates how to solve difficult practical problems involving ordinary and partial differential equations and boundary value problems using the software package Mathematica (4.x). Avoiding mathematical theorems and numerical methods-and requiring no prior experience with the software-the author helps readers learn by doing with step-by-step recipes useful in both new and classical applications. Mathematica and FORTRAN codes used in the book's examples and exercises are available for download from the Internet. The author's clear explanation of each Mathematica command along with a wealth of examples and exercises make Mathematical Methods in Physics and Engineering with Mathematica an outstanding choice both as a reference for practical problem solving and as a quick-start guide to using a leading mathematics software package.
Broadcast Disks: Dissemination-based Data Management for Asymmetric Communication Environments
Authors: Swarup Acharya
Venue:  (1997)

The increasing ability to interconnect computers through internetworking, wireless networks, high-bandwidth satellite, and cable networks has spawned a new class of information-centered applications based on {\em data dissemination}. These applications, which often serve huge client populations, employ broadcast to efficiently deliver data to the clients. In data dissemination, the data transfer is initiated by the server, inverting the traditional relationship between the client and the server. This thesis proposes a novel ``multi-disk'''' framework for data dissemination called {\em Broadcast Disks}. The Broadcast Disks approach significantly improves upon the previous work in dissemination-based systems and raises a number of fundamentally new research challenges. In this thesis, we first motivate why the rise of {\em asymmetric} environments (i.e., networks which have a significantly higher bandwidth available from servers to clients than in the reverse direction) and the scale of the emerging distributed information systems is causing a shift from the traditional {\em pull-based} client-server model to a {\em push-based} dissemination model. Then, the Broadcast Disks model is introduced and explored using a simulation-based study and a working implementation. The bulk of this thesis uses simulation results to understand the basic tradeoffs in a dissemination framework. We demonstrate the performance benefits of the Broadcast Disks model over the traditional approach to structuring a dissemination program. We also introduce a new {\em cost-based} approach to client cache management and develop efficient algorithms for prefetching and dissemination of updates. Then, the thesis addresses the issues that arise in supporting clients using both push and pull-based data delivery. Finally, we describe our experience in building and testing a Broadcast Disks prototype. While the studies using the prototype validate the simulation-based intuitions, they also raise many new issues and highlight some of the shortcomings of the current technology for building push-based systems. The underlying theme driving the studies in this thesis is to develop techniques to improve system performance and scalability which adapt to the new tradeoffs in the emerging computing landscape.
Macromedia Flash MX Components Most Wanted: Ready Made Drag 'n' Drop Design Solutions, 1 edition
Authors: Wrox Pr, Paul Prudence, Todd Coulson
Venue:  (2003)

:Creating designs with Macromedia Flash MX can be a lot of fun, but there are always tasks that you'll want to do again and again. It's a bit of a hassle to have to keep recreating and tweaking the same old content or functionality in different projects, so why can't you just reuse what you've created? With Flash MX Components, you can do just that! Components form the essential building blocks of design and can easily be incorporated into any Flash project. They are flexible enough to take care of many different tasks and can be used over and over again. But wait, it gets better! Components can be used by anyone, not just the person who created them. So in this book, we've done all the hard work for you and collected together the Most Wanted components that will make your life easier. Here you'll find a great combination of creative and functional components from some of today's leading Flash designers and developers.
Sierpinski Gaskets for Logic Functions Representation
Authors: Denis V. Popel, Anita Dani
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

This paper introduces a new approach to represent logic functions in theform of Sierpinski Gaskets. The structure of thegasket allows to manipulate with the corresponding logic expression usingrecursive essence of fractals. Thus, theSierpinski gasket's pattern has myriad useful properties which can enhancepractical features of other graphic representations like decision diagrams.We have covered possible applications of Sierpinski gaskets in logic designand justified our assumptions in logic function minimization (both Booleanand multiple-valued cases). The experimental results on benchmarks withadvances in the novel structure are considered as well.