the proceedings contain 52 papers. the topics discussed include: an unfolding algorithm for synchronous products of transition systems;expressiveness and distributed implementation of concurrent calculi with link mobi...
ISBN:
(纸本)3540664254
the proceedings contain 52 papers. the topics discussed include: an unfolding algorithm for synchronous products of transition systems;expressiveness and distributed implementation of concurrent calculi with link mobility;techniques for decidability and undecidability of bisimilarity;testing concurrent systems: a formal approach;computing minimum and maximum reachability times in probabilistic systems;automating modular verification;model checking of message sequence charts;synthesis of large concurrent programs via pairwise composition;approximative symbolic model checking of continuous-time Markov chains;from synchrony to asynchrony;model checking of time Petri Nets based on partial order semantics;generic process algebras for asynchronous communication;timed automata and the theory of real numbers;and localizability of fairness constraints and their distributed implementations.
the proceedings contain 137 papers. the special focus in this conference is on High-Level Parallel Programming Models and Supportive Environments. the topics include: Efficient program partitioning based communication...
ISBN:
(纸本)3540658319
the proceedings contain 137 papers. the special focus in this conference is on High-Level Parallel Programming Models and Supportive Environments. the topics include: Efficient program partitioning based communication;a flexible base for transparent shared memory programming models on clusters of PCs;flexible collective operations for distributed object groups;a framework for performance evaluation of scalable computing;recursive individually distributed objects;a flexible combination of on-stack execution and work-stealing;an automatic distribution front-end for java;concurrent language support for interoperable applications;on the distributed implementation of aggregate data structures by program transformation;a transformational framework for skeletal programs;implementing a non-strict functional programming language on a threaded architecture;the biological basis of the immune system as a model for intelligent agents;a formal definition of the phenomenon of collective intelligence and its IQ measure;implementation of data flow logical operations via self-assembly of DNA;a parallel hybrid evolutionary metaheuristic for the period vehicle routing problem;distributed scheduling with decomposed optimization criterion;a parallel genetic algorithm for task mapping on parallel machines;evolution-based scheduling of fault-tolerant programs on multiple processors;a genetic-based fault-tolerant routing strategy for multiprocessor networks;regularity considerations in instance-based locality optimization;parallel ant colonies for combinatorial optimization problems;an analysis of synchronous and asynchronous parallel distributed genetic algorithms with structured and panmictic islands and GA-based parallel image registration on parallel clusters.
the proceedings contain 44 papers. the special focus in this conference is on Data Structure, Parallel and distributedcomputing. the topics include: the engineering of some bipartite matching programs;a basic theory ...
ISBN:
(纸本)3540669167
the proceedings contain 44 papers. the special focus in this conference is on Data Structure, Parallel and distributedcomputing. the topics include: the engineering of some bipartite matching programs;a basic theory and calculus;static dictionaries supporting rank;multiple spin-block decisions;asynchronous random polling dynamic load balancing;hardness of approximating independent domination in circle graphs;constant-factor approximation algorithms for domination problems on circle graphs;ordered binary decision diagrams as knowledge-bases;the role of common knowledge in pattern formation by autonomous mobile robots;on-line load balancing of temporary tasks revisited;online routing in triangulations;the query complexity of program checking by constant-depth circuits;tree-like resolution is superpolynomially slower than dag-like resolution for the pigeonhole principle;efficient approximation algorithms for multi-label map labeling;approximation algorithms in batch processing;parallel algorithms for shortest paths and related problems on trapezoid graphs;approximation algorithms for some clustering and classification problems;how many people can hide in a terrain?;an online relocation problem on graphs;survivable networks with bounded delay;energy-efficient initialization protocols for ad-hoc radio networks;constructing the suffix tree of a tree with a large alphabet;further improved;a linear time algorithm for recognizing regular boolean functions;station layouts in the presence of location constraints;reverse center location problem;performance comparison of linear sieve and cubic sieve algorithms for discrete logarithms over prime fields and a new approximation algorithm for the capacitated vehicle routing problem on a tree.
A Markov decision process is a generalization of a Markov chain in which both probabilistic and nondeterministic choice coexist. Given a Markov decision process with costs associated withthe transitions and a set of ...
详细信息
ISBN:
(纸本)3540664254
A Markov decision process is a generalization of a Markov chain in which both probabilistic and nondeterministic choice coexist. Given a Markov decision process with costs associated withthe transitions and a set of target states, the stochastic shortest path problem consists in computingthe minimum expected cost of a control strategy that guarantees to reach the target. In this paper, we consider the classes of stochastic shortest path problems in which the costs are all non-negative, or all non-positive. Previously, these two classes of problems could be solved only under the assumption that the policies that minimize or maximize the expected cost also lead to the target with probability *** assumption does not necessarily hold for Markov decision processes that arise as model for distributed probabilistic systems. We present efficient methods for solving these two classes of problems without relying on additional assumptions. the methods are based on algorithms to transform the original problems into problems that satisfy the required assumptions. the methods lead to the efficient solution of two basic problems in the analysis of the reliability and performance of partially-specified systems: the computation of the minimum (or maximum) probability of reaching a target set, and the computation of the minimum (or maximum) expected time to reach the set.
this paper focuses on characterizing the internal intensity structure of pulmonary nodules in thin-section CT images for classification between benign and malignant nodules. this approach makes use of shape index curv...
详细信息
this paper focuses on characterizing the internal intensity structure of pulmonary nodules in thin-section CT images for classification between benign and malignant nodules. this approach makes use of shape index curvedness, and CT density to represent locally each voxel constructing the three-dimensional (3D) pulmonary nodule image. From the distribution of shape index, curvedness, and CT density over the 3D pulmonary nodule image a set of histogram features, and 3D texture features is computed to classify benign and malignant nodules. Linear discriminant analysis is used for classification and a receiver operating characteristic (ROC) analysis is used to evaluate the classification accuracy. the potential usefulness of the curvature-based features in the computer-aided differential diagnosis is demonstrated by using ROC curves as the performance measure.
this paper makes two contributions. First, we introduce a model for evaluating the performance of data allocation and replication algorithms in distributed databases. the model is comprehensive in the sense that it ac...
详细信息
this paper makes two contributions. First, we introduce a model for evaluating the performance of data allocation and replication algorithms in distributed databases. the model is comprehensive in the sense that it accounts for I/O cost, for communication cost, and, because of reliability considerations, for limits on the minimum number of copies of the object. the model captures existing replica-management algorithms, such as read-one-write-all, quorum-consensus, etc. these algorithms are static in the sense that, in the absence of failures,, the copies of each object are allocated to a fixed set of processors. In modern distributed databases, particularly in mobile computing environments, processors will dynamically store objects in their local database and will relinquish them. therefore, as a second contribution of this paper, we introduce an algorithm for automatic dynamic allocation of replicas to processors. then, using the new model, we compare the performance of the traditional read-one-write-all static allocation algorithm to the performance of the dynamic allocation algorithm. As a result, we obtain the relationship between the communication cost and I/O cost for which static allocation is superior to dynamic allocation, and the relationships for which dynamic allocation is superior.
Several tools have been developed for the estimation of soft- ware reliability. However, they are highly specialized in the approaches they implement and the particular phase of the software life-cycle in which they a...
详细信息
this paper discusses software reusability strategies for performance and reliability modeling tools. Special emphasis is on web-embedded tools, and the potential interaction between such tools. We present the system a...
详细信息
In this paper, we describe distributed algorithms for combinational fault simulation assuming the classical stuck-at fault model. Our algorithms have been implemented on a network of Sun workstations under the Paralle...
详细信息
ISBN:
(纸本)0818677554
In this paper, we describe distributed algorithms for combinational fault simulation assuming the classical stuck-at fault model. Our algorithms have been implemented on a network of Sun workstations under the Parallel Virtual Machine (PVM) environment. Two techniques are used for subdividing work among processors - test set partition and fault set partition. the sequential algorithm for fault simulation, used on individual nodes of the network, is based on a novel path compression technique proposed in this paper. We describe experimental results on a number of ISCAS '85 benchmark circuits.
暂无评论