Given a collection of boolean spatial features, the co-location pattern discovery process nds the subsets of features frequently located together. For example, the analysis of an ecology dataset may reveal the frequent co-location of a re ignition source feature with a needle vegetation type feature and a drought feature. The spatial co-location rule problem is diierent from the association rul...

This paper provides several ideas how to improve the performance of PDG-based code clone detection techniques. We suggest an efficient way to handle the subgraph isomorphism problem without losing precision and present an algorithm that avoids the unnecessary matching effort for subclones of larger clones.

Development of multithreaded applications is particularly tricky because of their non-deterministic execution behaviors. Tools that support the debugging and performance tuning of such applications are needed. Key to the construction of such tools is the ability to repeat the nondeterministic execution behavior of a multithreaded application. A clean separation between the application and the s...

Parallel simulation has been an active research area for more than a decade and several parallel simulation algorithms have been proposed. To evaluate parallel simulation environments there is a need for a common benchmark suite. Such benchmarks should allow the designer of simulation kernels to: (i) evaluate how efficiently the simulation kernel runs on specific architectures: and (ii) evaluat...

This paper discusses the parallelisation and performance tuning of a typical computer algebra algorithm, LinSolv, using evaluation strategies. We present three steps in the parallelisation process starting with a naive parallel version. As this algorithm uses innnite data structures as intermediate values it is necessary to deene very sophisticated strategies in order to improve parallel perfor...

Object-oriented programming, design patterns, and frameworks are abstraction techniques that have been used to reduce the complexity of sequentialion techniques that have been used to reduce the complexity of sequential programming. The CO2P3S parallel programming system provides a layered development process that applies these three techniques to the more difficult domain of parallel programmi...

Compiler optimization techniques have been applied to facilitate development and performance tuning of non-real-time systems. Unfortunately, regular compiler optimization can complicate the analysis and destroy timing properties of real-time systems. This paper discusses the di culties of performing compiler optimization in distributed real-time systems. An algorithm is presented to apply machi...

In this paper, we present an efficient rapid system design framework for fuzzy systems. Considering hardware and software capability, the given system specification is broken into two components: conceptual and parameter specifications. The conceptual specification contains the system core, which is unchanged throughout the simulation phase and can be implemented in hardware at an early stage. ...

Abstract-This paper suggests an inverse optimal PID control design method for mechanical manipulators. We find the Lyapunov function and the control law satisfying the disturbance input-to-state stability by using the characteristics of Lagrange system. Also, we show that the inverse optimal PID controller satisfies the HamiltonJacobi-Isaacs equation. Hence, the inverse optimality of the closed...

This paper describes Paj e, an interactive visualization tool for displaying the execution of parallel applications where a potentially large number of communicating threads of various life-times execute on each node of a distributed memory parallel system. Paj e is capable of representing a wide variety of interactions between threads. The main characteristics of Paj e, interactivity and scala...