System supports for protocol and application adaptation in vertical handoffs

In overlay networks, the network characteristics before and after a vertical handoff would be drastically different. Consequently, in this paper, we propose an end‐to‐end based scheme to support protocol and application adaptation in vertical handoffs. First, we proposed a Vertical‐handoff Aware TCP, called VA‐TCP. VA‐TCP can identify the packet losses caused by vertical handoffs. If segments losses are due to vertical handoffs, VA‐TCP only retransmits the missing segments but does not invoke the congestion control procedure. Moreover, VA‐TCP dynamically estimates the bandwidth and round‐trip time in a new network. Based on the estimated bandwidth and round‐trip time, VA‐TCP adjusts its parameters to respond to the new network environment. Second, during a vertical handoff, applications also need to be adapted accordingly. Therefore, we design a programming interface that allows applications to be notified upon and adapt to changing network environments. To support our interface, we utilize the signal mechanism to achieve kernel‐to‐user notification. Nevertheless, signals cannot carry information. Thus, we implement the shared memory mechanism between applications and the kernel to facilitate parameters exchange. Finally, we also provide a handoff‐aware CPU scheduler so that tasks that are interested in the vertical‐handoff event are given preference over other processes to attain a prompt response for new network conditions. We have implemented a prototype system on the Linux kernel 2.6. From the experimental results, our proposed protocol and application adaptation mechanisms are shown to effectively improve the performance of TCP and applications during vertical handoffs. Copyright © 2008 John Wiley & Sons, Ltd.     

Flow simulations in arbitrarily complex cardiovascular anatomies – An unstructured Cartesian grid approach

Image guided computational fluid dynamics is attracting increasing attention as a tool for refining in vivo flow measurements or predicting the outcome of different surgical scenarios. Sharp interface Cartesian/Immersed-Boundary methods constitute an attractive option for handling complex in vivo geometries but their capability to carry out fine-mesh simulations in the branching, multi-vessel configurations typically encountered in cardiovascular anatomies or pulmonary airways has yet to be demonstrated. A major computational challenge stems from the fact that when such a complex geometry is immersed in a rectangular Cartesian box the excessively large number of grid nodes in the exterior of the flow domain imposes an unnecessary burden on both memory and computational overhead of the Cartesian solver without enhancing the numerical resolution in the region of interest. For many anatomies, this added burden could be large enough to render comprehensive mesh refinement studies impossible. To remedy this situation, we recast the original structured Cartesian formulation of Gilmanov and Sotiropoulos [Gilmanov A, Sotiropoulos F. A hybrid Cartesian/immersed boundary method for simulating flows with 3D, geometrically complex, moving bodies. J Comput Phys 2005;207(2):457–92] into an unstructured Cartesian grid layout. This simple yet powerful approach retains the simplicity and computational efficiency of a Cartesian grid solver, while drastically reducing its memory footprint. The method is applied to carry out systematic mesh refinement studies for several internal flow problems ranging in complexity from flow in a 90° pipe bend to flow in an actual, patient-specific anatomy reconstructed from magnetic resonance images. Finally, we tackle the challenging clinical scenario of a single-ventricle patient with severe arterio-venous malformations, seeking to provide a fluid dynamics prospective on a clinical problem and suggestions for procedure improvements. Results from these simulations demonstrate very complex cardiovascular flow dynamics and underscore the need for high-resolution simulations prior to drawing any clinical recommendations.     

Using phrases as features in email classification

In this paper, we report our experience on the use of phrases as basic features in the email classification problem. We performed extensive empirical evaluation using our large email collections and tested with three text classification algorithms, namely, a naive Bayes classifier and two k-NN classifiers using TF-IDF weighting and resemblance respectively. The investigation includes studies on the effect of phrase size, the size of local and global sampling, the neighbourhood size, and various methods to improve the classification accuracy. We determined suitable settings for various parameters of the classifiers and performed a comparison among the classifiers with their best settings. Our result shows that no classifier dominates the others in terms of classification accuracy. Also, we made a number of observations on the special characteristics of emails. In particular, we observed that public emails are easier to classify than private ones.     

Linkless Octree Using Multi‐Level Perfect Hashing

The standard C/C++ implementation of a spatial partitioning data structure, such as octree and quadtree, is often inefficient in terms of storage requirements particularly when the memory overhead for maintaining parent‐to‐child pointers is significant with respect to the amount of actual data in each tree node. In this work, we present a novel data structure that implements uniform spatial partitioning without storing explicit parent‐to‐child pointer links. Our linkless tree encodes the storage locations of subdivided nodes using perfect hashing while retaining important properties of uniform spatial partitioning trees, such as coarse‐to‐fine hierarchical representation, efficient storage usage, and efficient random accessibility. We demonstrate the performance of our linkless trees using image compression and path planning examples.     

Procedural Synthesis using Vortex Particle Method for Fluid Simulation

We propose a fast and effective technique to improve sub‐grid visual details of the grid based fluid simulation. Our method procedurally synthesizes the flow fields coming from the incompressible Navier‐Stokes solver and the vorticity fields generated by vortex particle method for sub‐grid turbulence. We are able to efficiently animate smoke which is highly turbulent and swirling with small scale details. Since this technique does not solve the linear system in high‐resolution grids, it can perform fluid simulation more rapidly. We can easily estimate the influence of turbulent and swirling effect to the fluid flow.     

Roaming across wireless local area networks using SIM-based authentication protocol

Wireless local area networks provide high speed data transferring rate to a mobile device. And it is crucial to integrate together two critical issues, the authentication and roaming in heterogeneous networks. For this, Tsai and Chang proposed a SIM-based authentication mechanism for wireless local area networks in 2006. Tsai and Chang's scheme provides an integration method of mobile cellular networks and wireless local area networks. Unfortunately, we found that there are some weaknesses existing in their scheme. In this paper, we propose an improved version for a user roaming in heterogeneous networks. Besides, we also proposed a mobile IP model to provide a better efficiency for a mobile user in WLAN environment.     

Tool support for learning Büchi automata and linear temporal logic

We introduce a graphical interactive tool, named GOAL, that can assist the user in understanding Büchi automata, linear temporal logic, and their relation. Büchi automata and linear temporal logic are closely related and have long served as fundamental building blocks of linear-time model checking. Understanding their relation is instrumental in discovering algorithmic solutions to model checking problems or simply in using those solutions, e.g., specifying a temporal property directly by an automaton rather than a temporal formula so that the property can be verified by an algorithm that operates on automata. One main function of the GOAL tool is translation of a temporal formula into an equivalent Büchi automaton that can be further manipulated visually. The user may edit the resulting automaton, attempting to optimize it, or simply run the automaton on some inputs to get a basic understanding of how it operates. GOAL includes a large number of translation algorithms, most of which support past temporal operators. With the option of viewing the intermediate steps of a translation, the user can quickly grasp how a translation algorithm works. The tool also provides various standard operations and tests on Büchi automata, in particular the equivalence test which is essential for checking if a hand-drawn automaton is correct in the sense that it is equivalent to some intended temporal formula or reference automaton. Several use cases are elaborated to show how these GOAL functions may be combined to facilitate the learning and teaching of Büchi automata and linear temporal logic. This work was partially supported by the National Science Council, Taiwan (R.O.C.) under grants NSC94-2213-E-002-089, NSC95-2221-E-002-127, NSC95-3114-P-001-001-Y02 (iCAST 2006), NSC96-3114-P-001-002-Y (iCAST 2007), and NSC97-2221-E-002-074-MY3.     

Design and fabrication of novel micro electromagnetic actuator

This study designs, fabricates, and characterizes a novel micro electromagnetic actuator comprising a PDMS diaphragm, a polyimide-coated copper micro coil, and a permanent magnet. When an electrical current is passed through the micro coil, a magnetic force is induced between the coil and the magnet which causes the diaphragm to deflect, thereby creating an actuation effect. The experimental results demonstrate that the diaphragm deflection can be accurately controlled by regulating the current passed through the micro coil. It is shown that the maximum diaphragm deflection within elastic limits is 150 μm; obtained by passing a current of 0.6 A through a micro coil with a line width of 100 μm. The micro actuator proposed in this study is easily fabricated and is readily integrated with existing bio-medical chips due to its planar structure.     

Experimental verification of an out-of-plane repulsive-force electrostatic actuator using a macroscopic mechanism

A macroscopic mechanism is developed to verify a repulsive-force electrostatic actuator, which consists of an array of fixed finger electrodes and an array of moving finger electrodes. The actuator is able to generate an asymmetric electric field surrounding the top and bottom surfaces of each moving finger electrode to push the moving finger up and away from the fixed fingers. The macroscopic mechanism consists of a macro repulsive force actuator, a high voltage power supply, a z-stage, a high precision balance and a LCR meter. The force and capacitance characteristic curves of the actuator are obtained using the macro mechanism. The 3-stage force (repulsive, zero and attractive forces) of the actuator is verified, as well as the effects of the moving finger width on the actuator’s performance. Experimental tests show that the macro repulsive-force actuator can generate a repulsive force of 3,000 μN with a maximum gap of 9.5 mm for generating a repulsive force.