7188468
GPGPU supported cooperative acceleration in molecular dynamics
Molecular dynamics simulations have become a significant computational approach to study complicated physical phenomena at the atomic level. Nevertheless, accurate simulations are limited in size and timescale by the available computing resources, which make the simulations very time-consuming. This consequentially leads to tremendous computational requirements. Therefore, the need for speeding up this process is crucial. In this paper, we present a novel implementation to accelerate molecular dynamics simulations with GPGPU (General Purpose Graphics Processing Unit). Our goal is to reduce the total computational time of MD simulations at a very high performance/cost ratio with the introduction of the GPGPU algorithm. This is motivated by their enhanced programmability, attractive cost/performance ratio and incredible growth in speed. To demonstrate that GPGPUs already provide an inexpensive alternative to scientific applications, we have used AMD's Brook+ streaming programming environment to implement a new parallel algorithm. Our experimental results show the novel approach achieves speedup by the factor of fifteen compared to the corresponding sequential implementation.
16070632
Prototyping system of codec for novel 2-D continuous barcode
To address the limits of capacity and the disadvantages of motional scanning capability of traditional two-dimensional (2-D) barcodes, a novel 2- D continuous barcode (2-D CoBe) with improving the structure of traditional 2-D barcodes is proposed. The novel barcode not only enable to store a large mount of data with indefinitive capacity, but also support realtime decoding. Furthermore, a prototyping system of codec including encoding sub-system and decoding sub-system is examined and implemented. In this codec system, 2-D CoBe can be generated and printed on papers by encoding software sub-system. Besides, it can be recognized and decoded by a hand-held device with decoding sub-system in real-time. Based on the experimental results of encoding binary voice data into 2-D CoBe and decoding it with a hand-held device, it is verified that the codec system for 2-D CoBe is practical and effective.
16001718
Fine-Grained Progressive Algorithm Based on HMJ
Wide-area distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imbalances, and temporary outages. Non-blocking joining query execution is a promising approach to coping with unpredictability in such environments because of reactively scheduling background processing. Classical non-blocking two-way joining technique based on hash-merge (HMJ), however, fail to deliver acceptable performance in such a scenario where relatively short intermittent delay exists in the gross. We have developed a fairly fine-grained hash-merge join, called HMJ-FG, which has employed a replacement selection tree, allowing many disparted segments to be active in parallel. Using the optimization implementation along with simulation obtained by Tao, we show that HMJ-FG is an effective solution for providing fast query responses to users even in the presence of the longer-term of data sources appeared as unavailability. Theory and experimental results show that our technique delivers results significantly fast under unreliable network.
42670703
A Latent Image Semantic Indexing Scheme for Image Retrieval on the Web
In this paper, we present a novel latent image semantic indexing scheme for efficient retrieval of WWW images. We present a hierarchical image semantic structure called HIST, which captures image semantics in an ontology tree and visual features in a set of specific semantic domains. The query algorithm works in two phases. First, the ontology is used for quickly locating the relevant semantic domains. Second, within each semantic domain, the visual features are extracted, and similarity techniques are exploited to break the “dimensionality curse”. The target images can then be efficiently retrieved with high precision. The experimental results show that HIST achieves good query performance. Therefore, our method is promising in diverse Web image retrieval.
15892947
Torsional Pile Subjected to Transient Loading in Viscoelastic Poroelastic Medium
Considering viscoelastic saturated soil, The transient dynamic response of an elastic pile is studied. The pile-soil system is divided into thin layers, the control equations of the soil are solved respectively by using Laplace transform. Considering the mixed boundary-value conditions at the interface of pile and soil, expression is derived to describe the relationship between the inner force and the displacement of the pile segment. Then the expressions of all pile segments are integrated to form the stiffness matrix of pile. Considering the transient torsional loading at the pile head, the pile displacement in time domain is calculated by numerical method, with the result showing the influence of various pile parameters.
3870686
An improved dead reckoning method for mobile robot with redundant odometry information
Dead reckoning is an important method for mobile robot. If its accuracy can be improved, navigation tasks will be simplified. The mobile robot concerned in this paper is with five wheels, in which there are dual driving wheels and a castor. A measurement wheel with encoder is fixed beside each driving wheel. There are two encoders fixed on the castor. One measures the castor's movement, and another indicates the angle of yawing. A new kind of kinematics equations derived from the robot's turning radius and angle of movement trajectory is presented. We can get a group of turning radius and angle from the data of four encoders, in which there are four different values for radius and six different values for angle. The estimated values of radius and angle can be gotten by fusion using fuzzy algorithm. The improved dead reckoning method has the advantages of simplicity, less computation cost, cheapness and good performance in uneven road. The simulation shows its effectiveness.
5919440
MIME: A Dynamic Index Scheme for Multi-dimensional Query in Mobile P2P Networks
Nowadays, as the mobile services become widely used, there is a strong demand for mobile support in P2P search techniques. In this paper, we introduce a new cost model for searching multi-dimensional data in mobile P2P environment and propose a novel multi-dimensional MP2P search scheme MIME. MIME models the physical node layout in a two-dimensional plane and keeps records of the locations of the nodes to construct a proximity-aware P2P overlay. MIME also incorporates two adaptive features: an update algorithm that makes dynamic updates to the overlay, and a cache mechanism that reduces the load of data migration during the updates. Experiment results show that MIME achieves significant performance improvements in point/range queries compared to the conventional system.