2909470
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to efficient k-NN query processing is to fetch and check the distances of a minimum number of points from the database. For many applications, such as vehicle movement along road networks or rover and animal movement along terrain surfaces, the distance is only meaningful when it is along a valid movement path. For this type of k-NN queries, the focus of efficient query processing is to minimize the cost of computing distances using the environment data (such as the road network data and the terrain data), which can be several orders of magnitude larger than that of the point data. Efficient processing of k-NN queries based on the Euclidian distance or the road network distance has been investigated extensively in the past. In this paper, we investigate the problem of surface k-NN query processing, where the distance is calculated from the shortest path along a terrain surface. This problem is very challenging, as the terrain data can be very large and the computational cost of finding shortest paths is very high. We propose an efficient solution based on multiresolution terrain models. Our approach eliminates the need of costly process of finding shortest paths by ranking objects using estimated lower and upper bounds of distance on multiresolution terrain models.
195597740
Workshop Organizers' Message
International Workshop on Privacy-Preserving Data Analysis (PPDA) 2009 took place at Brisbane, Australia on 21st April, 2009. There were two sessions for this workshop with 2 paper presentations in the first session and 3 presentations in the second session. 
 
With the advancement of information technology and declining hardware price, organizations and companies are able to collect large amount of personal data. Moreover, advanced data analysis and mining techniques have been proposed to derived patterns hidden in data. However, the increasing power in data processing and analysis also raises concerns over the proper usage of personal information. Without proper treatment of the threat of sensitive information leakage, organizations would be reluctant to disclose their data even when there may be great potential gains from the data exploration. Therefore research in the area of privacy preservation is deemed important for both theoretical and practical reasons. PPDA 2009 was held in conjunction with DASFAA 2009 conference, and aims to bring together researchers in different fields related to privacy preserving data analysis and to provide a forum where researchers and practitioners can share and exchange their knowledge and experiences.
26591056
Biomedical Information Visualization
The ongoing developments in the fields of molecular biology, genetics, and medical sciences have recently generated an explosion of information collected from living organisms. For the scientist who analyzes these huge amounts of data, information visualization can be a very useful tool.
14631116
Seeing more than the graph: evaluation of multivariate graph visualization methods
Many real-world networks are multivariate, i.e., they have attributes associated with nodes and/or edges. Examples include social networks whose nodes represent people and edges represent relationships. There is usually information about each person (such as name, age, and gender) and the relationship (such type, duration, and strength). Besides common graph analysis tasks (such as identifying the most influential or structurally important nodes), there are more complex analyses for multivariate networks. One of these is the multivariate graph clustering, i.e., identifying clusters formed by nodes that have similar attributes and are close to each other in terms of graph distance. For instance, in social network analysis, it is interesting to sociologists whether or not people with similar characteristics (node attributes) are also connected to each other. Currently there are very few visualization methods available for such analysis.
 Graph and multivariate visualization have been well studied separately in the literature. Herman et al. summarized the recent work on graph visualization [3], and Wong and Bergeron covered the development in multivariate visualization [4]. However, there is relatively less work available on multivariate network visualization. Two types of approaches are commonly used. The first one is the mapping approach, which maps attributes to visual elements of a node or edge. A simple example is to map one attribute to node size and another to node color [2]. A more advanced mapping approach uses glyphs to represent node or edge attributes. One such example is to use the length and width of a rectangle node glyph to represent two node attributes [1]. The second one is the 2.5D approach: it uses the third dimension to present the multivariate information, while the graph is shown on a 2D plane. Examples include the recently proposed "GraphScape" [5], which adopts a landscape metaphor: each attribute is represented by a two-and-a-half- dimensional surface, whose height indicates its value.
 Each approach has its strength and weakness. The mapping approach is effective of showing numerical value using visual element such as size, but it can be difficult to compare the value of attributes represented by different elements such as size and color. The problem is alleviated by a carefully designed glyph, but visual complexity increases quickly as the number of attributes that a glyph needs to represent grows. The 2.5D approach is good at showing the distribution of attribute values over the network, but the attribute surface could introduce occlusion and affect the visibility of underlying network.
 In this paper, we present a study evaluating the effectiveness of these two approaches for different analysis tasks. We compare the performance of mapping and 2.5D approach in a controlled lab environment. We included both simple tasks (such as identifying nodes with the largest attribute value) and complex tasks (such as multivariate graph clustering). The performance is measured both in terms of accuracy and completion time. The results indicate that statistically mapping approach performs better for the simple tasks, while the 2.5D approach is favored in the complex task. The outcomes from this study provide some guidelines for the design of effective multivariate graph visualization for different analysis tasks.
795323
Multiresolution Spatial Databases: Making Web-Based Spatial Applications Faster
Spatial data has now been used extensively in the Web environment, providing online customized maps and supporting map-based applications. The full potential of Web-based spatial applications, however, has yet to be achieved due to performance issues related to the large sizes and high complexity of spatial data. In this paper, we introduce a multiresolution approach to spatial data management and query processing such that the database server can choose spatial data at the right resolution level for different Web applications. One highly desirable property of the proposed approach is that the server-side processing cost and network traffic can be reduced when the level of resolution required by applications are low. Another advantage is that our approach pushes complex multiresolution structures and algorithms into the spatial database engine. That is, the developer of spatial Web applications needs not to be concerned with such complexity. This paper explains the basic idea, technical feasibility and applications of multiresolution spatial databases.
7264645
A Multiresolution Terrain Model for Efficient Visualization Query Processing
Multiresolution triangular mesh (MTM) models are widely used to improve the performance of large terrain visualization by replacing the original model with a simplified one. MTM models, which consist of both original and simplified data, are commonly stored in spatial database systems due to their size. The relatively slow access speed of disks makes data retrieval the bottleneck of such terrain visualization systems. Existing spatial access methods proposed to address this problem rely on main-memory MTM models, which leads to significant overhead during query processing. In this paper, we approach the problem from a new perspective and propose a novel MTM called direct mesh that is designed specifically for secondary storage. It supports available indexing methods natively and requires no modification to MTM structure. Experiment results, which are based on two real-world data sets, show an average performance improvement of 5-10 times over the existing methods
748697
A mass-spring model for surface mesh deformation based on shape matching
In this paper, we propose a mass-spring model based on shape matching for real-time deformable modeling in virtual reality systems. By defining a rigid core for surface mesh model and adding a new generalized spring for each mass, our surface mesh model can preserve its original geometric features such as volume and shape. Then, we use shape matching approaches to update the rigid core of the model dynamically so as to simulate global deformations. At last, we adopt an inverse dynamics technique to deal with the resulting deformations. We correct the non-real "super-elastic" effect for linear elastic models so that the visual reality is improved.
10094785
Design and Integration of a Telerobotic System for Minimally Invasive Surgery of the Throat
In this paper we present the clinical motivation, design specifications, kinematics, statics, and actuation compensation for a newly constructed telerobotic system for Minimally Invasive Surgery (MIS) of the throat. A hybrid dual-arm telesurgical slave, with 20 joint-space Degrees-of-Freedom (DoFs), is used in this telerobotic system to provide the necessary dexterity in deep surgical fields such as the throat. The telerobotic slave uses novel continuum robots that use multiple super-elastic backbones for actuation and structural integrity. We present the kinematics of the telesurgical slave and methods for actuation compensation to cancel the effects of backlash, friction, and flexibility of the actuation lines. A method for actuation compensation is presented in order to overcome uncertainties of modeling, friction, and backlash. This method uses a tiered hierarchy of two novel approaches of actuation compensation for remotely actuated snake-like robots. The tiered approach for actuation compensation uses compensation in both joint space and configuration space of the continuum robots. These hybrid actuation compensation schemes use intrinsic model information and external data through a recursive linear estimation algorithm and involve compensation using configuration space and joint space variables. Experimental results validate the ability of our integrated telemanipulation system through experiments of suturing and knot tying in confined spaces.
3358927
Actuation compensation for flexible surgical snake-like robots with redundant remote actuation
This paper presents two actuation compensation methods for a snake-like robot implementing multi flexible backbones and actuation redundancy. This snake-like robot is designed for distal dexterity enhancement in MIS surgery of the throat. Actuation compensation is required to account for the flexibility of the actuation lines that connect this snake-like robot with its remote actuation units. The paper presents both a naive model-based compensation approach and a combined model-based recursive linear-estimation approach that uses data gathered from external measurements of the snake-like unit configuration such as vision. The kinematic and static model of this multi-backbone snake-like unit is reviewed and a simplified redundancy resolution is implemented in the error compensation model. The results show that the performance of the snake-like unit is significantly improved when compensation is implemented. The combined model-based recursive linear estimation method showed 1deg accuracy in path tracking. Finally, an updated Jacobian that accounts for the required compensation is presented. All the work done here strides the crucial step towards a successful clinical task such as suturing in the throat
14395125
Monitoring with behavior view diagrams for debugging
UML sequence diagrams are widely used during requirements analysis and design for specifying the expected message exchanges among a set of objects in various scenarios for the program to perform a certain task. In this paper, we present the behavior view diagrams, a type of extended sequence diagrams, to facilitate execution monitoring during debugging. Using a behavior view diagram, software developers can precisely specify the runtime objects whose behaviors will be monitored during debugging. Software developers can also specify the important message exchanges to be observed among these objects during the progress of various scenarios, and may further define the monitoring actions to be performed for inspecting the program state when a message exchange is observed. We also present a debugger that can automatically monitor the program execution using the information specified in a behavior view diagram. Through this monitoring, the debugger can not only check whether the scenarios are progressed as intended, but also check whether the actions performed by the program have the the desired effects on the program states. Therefore, it will be useful for detecting and localizing bugs.
13846032
An Investigation of the Intrinsic Force Sensing Capabilities of Continuum Robots
This paper presents the theoretical analysis and the experimental validation of the force sensing capabilities of continuum robots. These robots employ superelastic NiTi backbones and actuation redundancy. The paper uses screw theory to analyze the limitations and provide geometric interpretation to the sensible wrenches. The analysis is based on the singular value decomposition of the Jacobian mapping between the configuration space and the twist space of the end effector. The results show that the sensible wrenches belong to a 2-D screw system and the insensible wrenches belong to a 4-D screw system. The theory presented in this paper is validated through simulations and experiments. It is shown that the force sensing errors have an average of 0.34 g with a standard deviation of 0.83 g. Another experiment of generating the stiffness map of a silicone strip suggests possible medical application of palpation for tumor detection. The presented study allows force sensing in challenging environments where placing force sensors at the distal end of a robot is not possible due to limitations such as size and MRI compatibility.