Wim H. Hesselink

Parallel and Distributed Processing and Applications

Keynote Speech.- Self-stabilizing Distributed Algorithms for Networks.- Feature Extraction and Coverage Problems in Distributed Sensor Networks.- Peer-to-Peer Computing: From Applications to Platform.- Algorithms and Applications.- A Self-stabilizing Algorithm For 3-Edge-Connectivity.- Number of Processors with Partitioning Strategy and EDF-Schedulability Test: Upper and Lower Bounds with Comparison.- Architecture-Based Optimization for Mapping Scientific Applications to Imagine.- Implementation and Optimization of Sparse Matrix-Vector Multiplication on Imagine Stream Processor.- A Mutual Exclusion Algorithm for Mobile Agents-Based Applications.- A Distributed Metaheuristic for Solving a Real-World Scheduling-Routing-Loading Problem.- Cellular ANTomata.- Key-Attributes Based Optimistic Data Consistency Maintenance Method.- Parallelization Strategies for the Points of Interests Algorithm on the Cell Processor.- RWA Algorithm for Scheduled Lightpath Demands in WDM Networks.- Optimizing Distributed Data Access in Grid Environments by Using Artificial Intelligence Techniques.- Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors.- Distributed Memorization for the k -Vertex Cover Problem.- MADARP: A Distributed Agent-Based System for On-Line DARP.- An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs.- Efficient Multidimensional Data Redistribution for Resizable Parallel Computations.- Distributed Local 2-Connectivity Test of Graphs and Applications.- Architectures and Systems.- Comparing Direct-to-Cache Transfer Policies to TCP/IP and M-VIA During Receive Operations in MPI Environments.- Virtual Distro Dispatcher: A Costless Distributed Virtual Environment from Trashware.- A Parallel Infrastructure on Dynamic EPIC SMT and Its Speculation Optimization.- An SRP Target Mode to Improve Read Performance of SRP-Based IB-SANs.- An FPGA Design to Achieve Fast and Accurate Results for Molecular Dynamics Simulations.- Performance and Complexity Analysis of Credit-Based End-to-End Flow Control in Network-on-Chip.- An QoS Aware Mapping of Cores Onto NoC Architectures.- Latency Optimization for NoC Design of H.264 Decoder Based on Self-similar Traffic Modeling.- Hardware Implementation of Common Protocol Interface for a Network-Based Multiprocessor.- Datamining and Databases.- A Distributed Hebb Neural Network for Network Anomaly Detection.- Processing Global XQuery Queries Based on Static Query Decomposition.- Formal Verification and Performance Evaluation of User Query Pattern-Based Relational Schema-to-XML Schema Translation Algorithm.- Adaptive Processing for Continuous Query over Data Stream.- Parallel Computation of Closed Itemsets and Implication Rule Bases.- An Optimal Share Transfer Problem on Secret Sharing Storage Systems.- Deadline and Throughput-Aware Control for Request Processing Systems.- Cluster Recovery for Fault Tolerance of Spatial Database Cluster in Sensor Networks.- Fault Tolerance and Security.- A Secure Energy-Efficient Routing Protocol for WSN.- Designing Scalable Self-healing Key Distribution Schemes with Revocation Capability.- Key Predistribution Using Partially Balanced Designs in Wireless Sensor Networks.- An Efficient ID-Based Authenticated Key Agreement Protocol with Pairings.- Leveraging Many Simple Statistical Models to Adaptively Monitor Software Systems.- Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology.- Eventually Perfect Failure Detectors Using ADD Channels.- Stochastic Communication Delay Analysis of Adaptive Wormhole-Switched Routings in Tori with Faults.- An Efficient Fault-Tolerant Routing Methodology for Fat-Tree Interconnection Networks.- On the Optimality of Rollback-Recovery Protocol Preserving Session Guarantees.- Middleware and Cooperative Computing.- A Replication Software Architecture(RSA) for Supporting Irregular Applications on Wide-Area Distributed Computing Environments.- Cooperative Grid Jobs Scheduling with Multi-objective Genetic Algorithm.- A Pro-middleware for Grids Computing.- On Formal MOM Modeling.- Performability Analysis of Grid Architecture Via Queueing Networks.- An Effective Approach Based on Rough Set and Topic Cluster to Build Peer Communities.- Evaluation on the UbiMDR Framework.- Distributing Fixed Time Slices in Heterogeneous Networks of Workstations (NOWs).- A Grid Resources Valuation Model Using Fuzzy Real Option.- Enhancing Data Replication with Greedy Pipeline-Based Aggressive Copy Protocol in Data Grids.- A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers.- An Enhanced Approach for PDA and Cellular Clients to Submit and Monitor Applications in the Mobile Grid.- GiPS: A Grid Portal for Executing Java Applications on Globus-Based Grids.- Advanced Grid DataBase Management with the GRelC Data Access Service.- A Generic Distributed Monitor Construct for Programming Process Synchronization in Distributed Systems.- Networks.- Low Latency Vertical Handover Using MIH L2-Trigger Algorithm in Mobile IP Networks.- SPACC: A Simple Positioning and Coverage Control Solution for Wireless Sensor Networks.- Research of Routing Algorithm in Hierarchy-Adaptive P2P Systems.- Bandwidth Degradation Policy for Adaptive Multimedia Services in Mobile Cellular Networks.- On the System Performance vs. User Movement with Systematic Simulation in Mobile Cellular Networks.- Channel Assignment and Spatial Reuse Scheduling to Improve Throughput and Enhance Fairness in Wireless Mesh Networks.- Effects of Mobility on Membership Estimation and Routing Services in Ad Hoc Networks.- Hamiltonicity and Pancyclicity of Binary Recursive Networks.- Strategies for Traffic Grooming over Logical Topologies.- Implementing IPv4+4 Addressing Architecture with IPv4 LSRR Option for Seamless Peer-to-Peer (P2P) Communication.- Dynamic Handover Mechanism Using Mobile SCTP in Contention Based Wireless Network.- A Clustering-Based Channel Assignment Algorithm and Routing Metric for Multi-channel Wireless Mesh Networks.- A Hierarchical Care-of Prefix with BUT Scheme for Nested Mobile Networks.- Some Properties of WK-Recursive and Swapped Networks.- Design and Analysis of Multicast Communication in Multidimensional Mesh Networks.- Zone Based Data Aggregation Scheduling Scheme for Maximizing Network Lifetime.- A Robust Scalable Cluster-Based Multi-hop Routing Protocol for Wireless Sensor Networks.- Qos Provisioning in Mobile Networks Based on Aggregate Bandwidth Reservation.- A Network Performance Sensitivity Metric for Parallel Applications.- The Influence of Interference Networks in QoS Parameters in a WLAN 802.11g Environment.- Software and Languages.- Instruction Selection for Subword Level Parallelism Optimizations for Application Specific Instruction Processors.- High Performance 3D Convolution for Protein Docking on IBM Blue Gene.- KSEQ: A New Scalable Synchronous I/O Multiplexing Mechanism for Event-Driven Applications.- A Synchronous Mode MPI Implementation on the Cell BETM Architecture.

A General Algorithm for Computing Distance Transforms in Linear Time

A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorithm can be easily parallelized on shared memory computers. The algorithm can be used for the computation of the exact Euclidean, Manhattan (L 1 norm), and chessboard distance (L ∞ norm) transforms.

Optical dephasing and vibronic relaxation in molecular mixed crystals: A picosecond photon echo and optical study of pentacene in naphthalene and p-terphenyl

Picosecond photon echo and spectroscopic measurements have been used to establish that optical dephasing in the pure electronic and several vibronic transitions of pentacene in naphthalene is induced by pseudolocal phonon scattering in the ground and excited state. The frequency and low‐temperature lifetime of this local phonon are 18 cm−1 and 3.5 ps in the groundstate and 13.8 cm−1 and 11 ps in the excited state (vibron independent). The deuterium isotope effect on the local phonon frequency demonstrates its molecular character and suggests its assignment as an in‐plane librational mode. For the system pentacene in p‐terphenyl photon echo measurements indicate the existence of a librational mode of ?30 cm−1 with a ?1.5 ps lifetime. Line shift measurements on both mixed crystal systems further show that the observed temperature induced shift is due to a difference in quadratic electron–bandphonon coupling of the ground and excited state and crystal anharmonicity (thermal expansion). We further report for ...

Generic properties of the pole placement problem

Abstract In this paper it will be shown that q(m + p - 1) + mp ≥ n is a necessary condition for generic pole placement for an n - th order (real) linear dynamical system with m-inputs and p-outputs by means of a q - th order (real) stationary linear feedback controller. This establishes mp ≥ n as a necessary condition for generic pole placement by means of a memoryless controller. It is shown that this condition is not sufficient. This is contrary to what one could have conjectured from counting the number of equations and unknowns or from considering the complex case.

Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform

A general algorithm for computing Euclidean skeletons of 2D and 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. We prove a number of fundamental properties of the IMA skeleton, and compare these with properties of the CMD (centers of maximal disks) skeleton. Several pruning methods for IMA skeletons are introduced (constant, linear and square-root pruning) and their properties studied. The algorithm for computing the IMA skeleton is based upon the feature transform, using a modification of a linear-time algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity which is linear in the number of input points, and can be easily parallelized. We present experimental results for several data sets, looking at skeleton quality, memory usage and computation time, both for 2D images and 3D volumes.

Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines

Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm which achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings and thickenings, based on Salembiers Max-Trees and Min-trees. The image or volume is first partitioned in multiple slices. We then compute the Max-trees of each slice using any sequential Max-Tree algorithm. Subsequently, the Max-trees of the slices can be merged to obtain the Max-tree of the image. A C-implementation yielded good speed-ups on both a 16-processor MIPS 14000 parallel machine, and a dual-core Opteron-based machine. It is shown that the speed-up of the parallel algorithm is a direct measure of the gain with respect to the sequential algorithm used. Furthermore, the concurrent algorithm shows a speed gain of up to 72% on a single-core processor, due to reduced cache thrashing.

PHOTON-ECHOES STIMULATED FROM AN ACCUMULATED GRATING - THEORY OF GENERATION AND DETECTION

We present a theoretical description of the generation and detection of photon echoes, stimulated from an accumulated frequency grating in the inhomogeneous distribution. We show that detection of the echoes takes place via interference in the sample between a properly phased and directed probe pulse and the echo polarization. In this description the echo phenomenon emerges as an induced transparency of the sample rather than a burst of coherent radiation. By solving simultaneously the optical Bloch and Maxwell equations, an expression is obtained which correlates quantitatively the echo intensity to the decay parameters, pulse intensity, and the transition moment. As an application of the theory we present results on the intersystem crossing of pentacene in naphthalene at 1.5 K.

Polarizations in the classical groups

So we only consider polarizations of nilpotent elements. A more general definition leads to questions which are usually first reduced to the nilpotent case, cf. the proof of [3] (5.16). The structure of Pol(x) is interesting for the infinite-dimensional representation theory, cf. [7] and [1] (6.3).

An algorithm for the asynchronous Write-All problem based on process collision

Summary. The problem of using P processes to write a given value to all positions of a shared array of size N is called the Write-All problem. We present and analyze an asynchronous algorithm with work complexity

Full Anisotropy of the Stark Effect on the 1B2u ← 1Ag Electronic Transitions of Tetracene and Pentacene in a p-Terphenyl Host Crystal

{\cal O}(N\cdot P^{\log(\frac{x+1}{x})})