ppxscal/embedding_network huggingface dataset:
Initial Experiments in the Integration of ParaScope and Lambda
Authors: Donna Bergmark, David Presberg
Venue:  (1993)

This document describes the incorporation of the Lambda loop transformation Toolkit into the ParaScope parallel programming environment. The goal was to extend the functionality of ParaScope, to determine the usefulness of the Lambda Toolkit in environments other than that of its original development, and to evaluate the quality of code generation before and after incorporation of Lambdabased analysis and transformation. We learned that ParaScope could be extended, but only by very brave people; we learned that the Lambda Toolkit could be used by other programming systems to good effect; we also compared two different proposed interfaces for the Lambda Toolkit.
Specification, Safety and Reliability Analysis Using Stochastic Petri Net Models
Authors: Frederick T. Sheldon, Stefan Grenier, Matthias Benzinger
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

In this study, we focus on the specification and assessment of Stochastic Petri net (SPN) models to evaluate the design of an embedded system for reliability and availability. The system provides dynamic driving regulation (DDR) to improve vehicle derivability (anti-skid, -slip and steering assist). A functional SPN abstraction was developed for each of three subsystems that incorporate mechanics, failure modes/effects and model parameters. The models are solved in terms of the subsystem and overall system reliability and availability. Four sets of models were developed. The first three sets include subsystem representations for the TC (Traction Control), AB (Antilock Braking) and ESA (Electronic Steering Assistance) systems. The last set combines these systems into one large model. We summarize the general approach and provide sample Petri net graphs and reliability charts that were used to evaluate the design of the DDR in parts and as a whole.
An Integrated Tool for Analog Test Generation and Fault Simulation
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

High levels of design integration and increasing number of analog blocks within a system necessitate auto-mated system-level analog test generation and fault simulation tools. We outline a methodology and toolset for specification-based automated test generation and fault simulation for analog circuits. Test generation is targeted at providing the highest coverage for each specified parameter. The flexibility of assigning analog test attributes is utilized for merging tests leading to test time reduction with no loss in test coverage. Further optimization in test time is obtained through fault simulations by selecting tests that provide adequate coverage in terms of several components and dropping the ones that do not provide additional coverage. The generated test set, fault and yield coverages in terms of each targeted parameter, and testability problems are reported by the tool.
A New Approach for Load Balancing Using Differential Load Measurement
Authors: Parag Kulkarni, Indranil Sengupta
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

In distributed systems, uneven arrival of the tasks may overload few hosts keeping rest of the hosts lightly loaded or even idle. This results in overall poor system performance in spite of the system capabilities. To make utilization of capabilities of the distributed systems load balancing can be used. Load balancing always comes with lot of overheads. Here we propose an algorithm based on Differential Load Measurement (DLM) for the load balancing. This algorithm helps us in selecting proper hosts for load balancing which can lead us to performance improvement of the system.
Formal Description and Validation of an Interaction policy in an Object-Oriented Framework
Authors: Alessandro Fantechi, Stefania Gnesi, Laura Semini
Venue:  (1999)

Formal methods are increasingly used to validate the design of software and hardware components of safety critical systems. We describe here a case study where a formal verification method was applied in practice. As a case study we have considered a safe interaction policy between communicating objects, the Multiple Levels of Integrity policy. This policy can be seen as a communication protocol that guarantees the integrity of sensible data. Formal specification is given using a process algebra, and validation is done following a model checking approach. EMAIL:: gnesi@iei.pi.cnr.it
A Tool For Understanding Multi-Language Program Dependencies
Authors: Panagiotis K. Linos, Zhi-hong Chen, Seth Berrier, Brian O'Rourke
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

This paper describes a prototype tool that facilitates the process of understanding and managing multi-language program dependencies. More specifically the software tool maintains a repository of host-to-foreign language dependencies between C/C++ and Java code. We describe some program comprehension features of the tool and we discuss a preliminary case study performed in order to verify its functionality and validate its usefulness. Based on the results of this study we continue improving the tool.
Asymptotic behavior of generalized processor sharing with long-tailed traffic sources
Authors: Simon C. Borst, Onno J. Boxma, P. R. Jelenkovic
Venue:  (1999)

We analyze the asymptotic behavior of long-tailed traffic sources under the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing, have emerged as an important mechanism for achieving differentiated quality-of-service in integrated-services networks. Under certain conditions, we prove that in an asymptotic sense an individual source with long-tailed traffic characteristics is effectively served at a {\em constant} rate, which may be interpreted as the maximum feasible average rate for that source to be stable. Thus, asymptotically, the source is only affected by the traffic characteristics of the other sources through their average rate. In particular, the source is essentially immune from excessive activity of sources with `heavier''-tailed traffic characteristics. This suggests that GPS-based scheduling algorithms provide an effective mechanism for extracting high multiplexing gains, while protecting individual connections.
Overlook: Scalable Name Service on an Overlay Network
Authors: Marvin Theimer, Michael B. Jones
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

This paper indicates that a scalable fault-tolerant name service can be provided utilizing an overlay network and that such a name service can scale along a number of dimensions: it can be sized to support a large number of clients, it can allow large numbers of concurrent lookups on the same name or sets of names, and it can provide name lookup latencies measured in seconds. Furthermore, it can enable updates to be made pervasively visible in times typically measured in seconds for update rates of up to hundreds per second. We explain how many of these scaling properties for the name service are obtained by reusing some of the same mechanisms that allowed the underlying overlay network to scale. Finally, we observe that the overlay network is sensitive to bandwidth and CPU limitations.
On the Rationality of Profit Sharing in Multi-Agent Reinforcement Learning
Authors: Kazuteru Miyazaki, Shigenobu Kobayashi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Reinforcement learning is a kind of machine learning.It aims to adapt an agent to anUnknown environment according to rewards.Traditionally, from the vertical point of view,many reinforcement learning systems assume that environment has Markovian properties.However it is important to treat non-Markovian environments in multi-agent reinforcement Learning systems.In this paper, we use Profit Sharing (PS) as a reinforcement learningSystem and discuss the rationality of PS in multi-agent environments.Especially, we Classify non-Markovian environments and discuss how to share a reward among Reinforcement learning agents.Through cranes control problem, we confirm the effectiveness of PS in multi-agent environments.
A topology-independent fair queueing model in ad hoc wireless networks
Authors: Haiyun Luo, Songwu Lu
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as location-dependent contention, spatial channel reuse, conflicts between ensuring fairness and maximizing channel utilization, and distributed fair scheduling. In this paper we propose a new topology-independent fair queueing model for a shared-medium ad hoc network. Our model ensures coordinated fair channel access among spatially contending flows while seeking to maximize spatial channel reuse. We describe packetized algorithms that realize the fluid fairness model with analytically provable performance bounds. We further design distributed implementations that approximate the ideal centralized algorithm. We evaluate our design through both simulations and analysis.
Representation and reasoning for DAML-based policy and domain services in KAoS and nomads
Authors: J. Bradshaw, A. Uszok, R. Jeffers, N. Suri, P. Hayes, M. Burstein, A. Acquisti, B. Benyo, M. Breedy, M. Carvalho, D. Diller, M. Johnson, S. Kulkarni, J. Lott, M. Sierhuis, R. Van Hoof
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

To increase the assurance with which agents can be deployed in operational settings, we have been developing the KAoS policy and domain services. In conjunction with Nomads strong mobility and safe execution features, KAoS services and tools allow for the specification, management, conflict resolution, and enforcement of DAML-based policies within the specific contexts established by complex organizational structures. In this paper, we will discuss results, issues, and lessons learned in the development of these representations, tools, and services and their use in military and space application.
A Generalized Reinforcement-Learning Model: Convergence and Applications
Authors: Michael L. Littman, Csaba Szepesva\''ri
Venue:  (1996)

Reinforcement learning is the process by which an autonomous agent uses its experience interacting with an environment to improve its behavior. The Markov decision process (MDP) model is a popular way of formalizing the reinforcement-learning problem, but it is by no means the only way. In this paper, we show how many of the important theoretical results concerning reinforcement learning in MDPs extend to a generalized MDP model that includes MDPs, two-player games and MDPs under a worst-case optimality criterion as special cases. The basis of this extension is a stochastic-approximation theorem that reduces asynchronous convergence to synchronous convergence. Keywords: Reinforcement learning, Q-learning convergence, Markov games
Nogood Recording for Valued Constraint Satisfaction Problems
Authors: P. Dago, G. Verfailllie
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In the frame of classical Constraint Satisfaction Problems (CSPs), the backtrack tree search, combined with learning methods, presents a double advantage: for static solving, it improves the search speed by avoiding redundant explorations; for dynamic solving (after a slight change of the problem), it reuses the previous searches to build a new solution quickly. Backtrack reasoning concludes the reject of certain combinatorial choices. Nogood Recording memorizes these choices in order not to reproduce.We aim to use Nogood Recording in the wider scope of the Valued CSP framework (VCSP) to enhance the branch and bound algorithm. Therefore, nogoods are used to increase the lower bound used by the branch and bound to prune the search. This issue leads to the definition of the "Valued Nogoods" and their use.This study focuses particularly on penalty and dynamic VCSPs which require special developments. However; our results give an extension of the Nogood Recording to the general VCSP framework.
An Efficient Sorting Algorithm for a Sequence of Kings in a Tournament
Authors: Wu Jie, Sheng Li
Venue:  (2000)

A king $u$ in a tournament is a player who beats ($\rightarrow$) any other player $v$ {\em directly or indirectly}. That is, either $u \rightarrow v$ or there exists a third player $w$ such that $u \rightarrow w$ and $w \rightarrow v$. A sorting sequence of kings in a tournament of $n$ players is a sequence of players, $S=(u_1$, $u_2$, ..., $u_n)$, such that $u_i \rightarrow u_{i+1}$ and $u_i$ in a king in the sub-tournament $T_{u_i}$ induced by $u_i, u_{i+1}, ..., u_n$ for $i=1, 2,..., n-1$. The existence of a sorting sequence of kings in any tournament is shown \cite{LouW00} where a sorting algorithm with a complexity of $\Theta(n^{3})$ is given. In this paper, we present a constructive proof for the existence of a sorting sequence of kings of a tournament and propose an efficient algorithm with a complexity of $\Theta(n^2)$.
A polynomial-time optimal synchronous bandwidth allocation scheme for the timed-token MAC protocol
Authors: Ching-Chih Han, K. G. Shin
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Numerous methods have been proposed to integrate real-time and non-real-time services of the timed-token medium access control (MAC) protocol. One of the key issues in tailoring the timed-token MAC protocol for real-time applications is the synchronous bandwidth allocation (SEA) problem whose objective is to meet both the protocol and deadline constraints. Several non-optimal local SEA schemes and an optimal global scheme have been proposed previously. Local SEA schemes use only information available locally to each node, and are thus preferred to global schemes because of their lower network-management overhead. Unfortunately it has been formally proved in Han et al. (1995) that there does not exist any optimal local SEA scheme. Chen et al. [1992] proposed the only-known optimal global SEA scheme which is based on an iterative approach. However, their algorithm may not terminate theoretically. The present authors give an optimal global SEA scheme of polynomial-time worst-case complexity.
Combination of Multiple Classifiers for Handwritten Word Recognition
Authors: Wenwei Wang, Anja Brakensiek, Gerhard Rigoll
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Because of large shape variations in human handwriting, recognition accuracy of cursive handwritten word is hardly satisfying using a single classifier. In this paper we introduce a framework to combine results of multiple classifiers and present an intuitive run-time weighted opinion pool (RWOP) combination approach for recognizing cursive handwritten words with a large size vocabulary. The individual classifiers are evaluated run-time dynamically. The final combination is weighted according to their local performance. For an open vocabulary recognition task, we use the ROVER algorithm to combine the different strings of characters provided by each classifier. Experimental results for recognizing cursive handwritten words demonstrate that our new approach achieves better recognition performance and reduces the relative error rate significantly.
Automatic Unit Test Data Generation Using Mixed-Integer Linear Programming and Execution Trees
Authors: S. Lapierre, E. Merlo, G. Savard, G. Antoniol, R. Fiutem, P. Tonella
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

This paper presents an approach to automatic unit test data generation for branch coverage using mixed-integer linear programming, execution trees, and symbolic execution. This approach can be useful to both general testing and regression testing after software maintenance and reengineering activities.Several strategies, including original algorithms, to move towards practical test data generation have been investigated in this paper. Methods include: - the analysis of minimum path-length partial execution trees for unconstrained arcs, thus increasing the generation performance and reducing the difficulties originated by infeasible paths - the reduction of the difficulties originated by non-linear path conditions by considering alternative linear paths - the reduction of the number of test cases, which are needed to achieve the desired coverage, based on the concept of unconstrained arcs in a control flow graph - the extension of symbolic execution to deal with dynamic memory allocation and deallocation, pointers and pointers to functionsExecution trees are symbolically executed to produce Extended Path Constraints (EPC), which are then partially mapped by an original algorithm into linear problems whose solutions correspond to the test data to be used as input to cover program branches. Partially mapping this problem into a linear optimization problem avoids infeasible and non-linear path problems, if a feasible linear alternate path exists in the same execution tree.The presented approach has been implemented in C++ and tested on C-language programs on a Pentium/Linux system. Preliminary results are encouraging and show that a high percentage of the program branches can be covered by the test data automatically produced. The approach is flexible to branch selection criteria coming from general testing as well as regression testing.
E-Business Innovation and Change Management
Authors: Di Waddell
Venue:  (2003)

Demonstrating how organizations around the world are capitalizing on new technologies such as the Internet and the World Wide Web to develop e-business, this book shows how evolving e-business models, integrated solutions, and improved technological infrastructure are continuously changing the way business is conducted. This discusses the ways in which the e-business revolution brings new ways of dealing with customers and business partners, new revenue streams, new ways of processing information, and new organization structures. In addition, advice is provided on developing new skill sets, electronic supply chains, new standards and policies, new collaborations and adaptable business strategies. --This text refers to the Paperback edition. 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
Measuring Convexity for Figure/Ground Separation
Authors: H. Pao, D. Geiger, N. Rubin
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

In human perception, convex surfaces have a strong tendency to be perceived as the "figure". Convexity has a stronger influence on figural organization than other global shape properties, such as symmetry ([9]). And yet, there has been very little work on convexity properties in computer vision.We present a model for figure/ground segregation which exhibits a preference for convex regions as the figure (i.e., the foreground). The model also shows a preference for smaller regions to be selected as figures, which is also known to hold for human visual perception (e.g., Koffka [11]). The model is based on the machinery of Markov random fields/random walks/diffusion processes, so that the global shape properties are obtained via local and stochastic computations. Experimental results demonstrate that our model performs well on ambiguous figure/ground displays which were not captured before. In particular, in ambiguous displays where neither region is strictly convex, the model shows preference to the "more convex" region, thus offering a continuous measure of convexity in agreement with human perception.
A unified taxonomic framework for information visualization
Authors: Darius Pfitzner, Vaughan Hobbs, David Powers
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

We present a taxonomy for Information Visualization (IV) that characterizes it in terms of data, task, skill and context, as well as a number of dimensions that relate to the input and output hardware, the software tools, as well as user interactions and human perceptual abilities. We illustrate the utility of the taxonomy by focusing particularly on the information retrieval task and the importance of taking into account human perceptual capabilities and limitations. Although the relevance of Psychology to IV is often recognised, we have seen relatively little translation of psychological results and theory to practical IV applications.This paper targets the better development of information visualizations through the introduction of a framework delineating the major factors in interface development. We believe that higher quality visualizations will result from structured developments that take into account these considerations and that the framework will also serve to assist the development of effective evaluation and assessment processes.
Nomad: A Scalable Operating System for Clusters of Uni and Multiprocessors
Authors: Eduardo Pinheiro, Ricardo Bianchini
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

The recent improvements in workstation and interconnection network performance have popularized the clusters of off-the-shelf workstations. However, the usefulness of these clusters is yet to be fully exploited, mostly due to the inadequate management of cluster resources implemented by current distributed operating systems. In order to eliminate this problem and approach the computational power of large clusters of workstations, in this paper we propose Nomad, an efficient operating system for clusters of uni and/or multiprocessors. Nomad includes several important characteristics for modern cluster-oriented operating systems: scalability, efficient resource management across the cluster, efficient scheduling of parallel and distributed applications, distributed I/O, fault detection and recovery, protection, and backward compatibility. Some of the mechanisms used by Nomad, such as process checkpointing and migration, can be found in previously proposed systems. However, our system stands out for its strategy for disseminating information across the cluster and its efficient management of all cluster resources. In addition, Nomad is highly scalable as it uses neither centralized control nor extra messages to implement its functionality, taking advantage of the I/O traffic associated with its distributed file system. Our preliminary evaluation of the load balancing aspect of Nomad shows that the pattern of file accesses in our distributed file system allows for efficient and scalable load balancing. Our main conclusion is that the complete implementation of Nomad will most likely be efficient and will be a nice platform for future research on operating systems for clusters of workstations.
Improving speaker identification in noise by subband processing and decision fusion
Authors: R. I. Damper, J. E. Higgins
Venue: Pattern Recognition Letters (2003)

We investigate speaker identification in narrowband noise using subband processing. The output of each subband is used to train and test individual hidden Markov models (HMMs), each making a preliminary decision on speaker identity. Subsequently, these are combined to produce a final decision. For sufficient numbers of filters, subband processing outperforms traditional wideband techniques by an enormous margin.