Live cell imaging of heavy-ion-induced radiation responses by beamline microscopy

To study the dynamics of protein recruitment to DNA lesions, ion beams can be used to generate extremely localized DNA damage within restricted regions of the nuclei. This inhomogeneous spatial distribution of lesions can be visualized indirectly and rapidly in the form of radiation-induced foci using immunocytochemical detection or GFP-tagged DNA repair proteins. To analyze faster protein translocations and a possible contribution of radiation-induced chromatin movement in DNA damage recognition in live cells, we developed a remote-controlled system to obtain high-resolution fluorescence images of living cells during ion irradiation with a frame rate of the order of seconds. Using scratch replication labeling, only minor chromatin movement at sites of ion traversal was observed within the first few minutes of impact. Furthermore, time-lapse images of the GFP-coupled DNA repair protein aprataxin revealed accumulations within seconds at sites of ion hits, indicating a very fast recruitment to damaged sites. Repositioning of the irradiated cells after fixation allowed the comparison of live cell observation with immunocytochemical staining and retrospective etching of ion tracks. These results demonstrate that heavy-ion radiation-induced changes in sub-nuclear structures can be used to determine the kinetics of early protein recruitment in living cells and that the changes are not dependent on large-scale chromatin movement at short times postirradiation. © 2005 by Radiation Research Society.

A theory for execution-time derivation in real-time programs

We provide an abstract command language for real-time programs and outline how a partial correctness semantics can be used to compute execution times. The notions of a timed command, refinement of a timed command, the command traversal condition, and the worst-case and best-case execution time of a command are formally introduced and investigated with the help of an underlying weakest liberal precondition semantics. The central result is a theory for the computation of worst-case and best-case execution times from the underlying semantics based on supremum and infimum calculations. The framework is applied to the analysis of a message transmitter program and its implementation. (c) 2005 Elsevier B.V. All rights reserved.

Direct mesh: A multiresolution approach to terrain visualization

Terrain can be approximated by a triangular mesh consisting millions of 3D points. Multiresolution triangular mesh (MTM) structures are designed to support applications that use terrain data at variable levels of detail (LOD). Typically, an MTM adopts a tree structure where a parent node represents a lower-resolution approximation of its descendants. Given a region of interest (ROI) and a LOD, the process of retrieving the required terrain data from the database is to traverse the MTM tree from the root to reach all the nodes satisfying the ROI and LOD conditions. This process, while being commonly used for multiresolution terrain visualization, is inefficient as either a large number of sequential I/O operations or fetching a large amount of extraneous data is incurred. Various spatial indexes have been proposed in the past to address this problem, however level-by-level tree traversal remains a common practice in order to obtain topological information among the retrieved terrain data. A new MTM data structure called direct mesh is proposed. We demonstrate that with direct mesh the amount of data retrieval can be substantially reduced. Comparing with existing MTM indexing methods, a significant performance improvement has been observed for real-life terrain data.

Efficient spatial clustering algorithm using binary tree

In this paper we present an efficient k-Means clustering algorithm for two dimensional data. The proposed algorithm re-organizes dataset into a form of nested binary tree*. Data items are compared at each node with only two nearest means with respect to each dimension and assigned to the one that has the closer mean. The main intuition of our research is as follows: We build the nested binary tree. Then we scan the data in raster order by in-order traversal of the tree. Lastly we compare data item at each node to the only two nearest means to assign the value to the intendant cluster. In this way we are able to save the computational cost significantly by reducing the number of comparisons with means and also by the least use to Euclidian distance formula. Our results showed that our method can perform clustering operation much faster than the classical ones. © Springer-Verlag Berlin Heidelberg 2005