An index selection method without repeated optimizer estimations

The index selection problem (ISP) concerns the selection of an appropriate index set to minimize the total cost for a given workload containing read and update queries. Since the ISP has been proven to be an NP-hard problem, most studies focus on heuristic algorithms to obtain approximate solutions. However, even approximate algorithms still consume a large amount of computing time and disk space because these systems must record all query statements and frequently request from the database optimizers the cost estimation of each query in each considered index. This study proposes a novel algorithm without repeated optimizer estimations. When a query is delivered to a database system, the optimizer evaluates the costs of various query plans and chooses an access path for the query. The information from the evaluation stage is aggregated and recorded with limited space. The proposed algorithm can recommend indexes according to the readily available information without querying the optimizer again. The proposed algorithm was tested in a PostgreSQL database system using TPC-H data. Experimental results show the effectiveness of the proposed approach.     

Impacts of geographical knowledge, spatial ability and environmental cognition on image searches supported by GIS software

Google Earth search function was used to study the impacts of small-scale spatial ability, large-scale environmental cognition, and geographical knowledge on new technology usage. The participants were 153 junior high students from central Taiwan. Geography grades served as indicators of prior knowledge, mental rotation and abstract reasoning skills as indicators of spatial ability, and sketch maps of school neighborhoods as indicators of environmental cognition (including landmark representation, intersection representation, and frame of reference). Lastly, the authors announced the landmarks searching worksheet and asked the participants to accomplish 16 familiar and unfamiliar landmark searching tasks using Google Earth with keyword search function disabled. The result showed the strongest predictor of landmark searching performance is ‘frame of reference’ in environmental cognition, followed by ‘mental rotation’ of spatial ability, ‘landmark representation’ of environmental cognition, and geographical knowledge. Google Earth landmark searches require complex cognitive processing; therefore, our conclusion is that GIS-supported image search activities give students good practice of active knowledge construction.     

A personal Web page tailoring toolkit for mobile devices

It is common to browse web pages via mobile devices. However, most of the web pages were designed for desktop computers equipped with big screens. When browsing on mobile devices, a user has to scroll up and down to find the information they want because of the limited screen size. Some commercial products reformat web pages. However, the result pages still contain irrelevant information. We propose a system to personalize users’ mobile web pages. A user can determine which blocks in a web page should be retained. The sequence of these blocks can also be altered according to individual preferences.     

A blind watermarking method using maximum wavelet coefficient quantization

This paper proposes a blind watermarking algorithm based on maximum wavelet coefficient quantization for copyright protection. The wavelet coefficients are grouped into different block size and blocks are randomly selected from different subbands. We add different energies to the maximum wavelet coefficient under the constraint that the maximum wavelet coefficient is always maximum in a block. The watermark is embedded the local maximum coefficient which can effectively resist attacks. Also, using the block-based watermarking, we can extract the watermark without using the original image or watermark. Experimental results show that the proposed method is quite robust under either non-geometry or geometry attacks.     

Slippage control in soft finger grasping and manipulation

Handling objects with robotic soft fingers without considering the odds of slippage are not realistic. Grasping and manipulation algorithms have to be tested under such conditions for evaluating their robustness. In this paper, a dynamic analysis of rigid object manipulation with slippage control is studied using a two-link finger with soft hemispherical tip. Dependency on contact forces applied by a soft finger while grasping a rigid object is examined experimentally. A power-law model combined with a linear viscous damper is used to model the elastic behavior and damping effect of the soft tip, respectively. In order to obtain precise dynamic equations governing the system, two second-order differential equations with variable coefficients have been designed to describe the different possible states of the contact forces accordingly. A controller is designed based on the rigid fingertip model using the concept of feedback linearization for each phase of the system dynamics. Numerical simulations are used to evaluate the performance of the controller. The results reveal that the designed controller shows acceptable performance for both soft and rigid finger manipulation in reducing and canceling slippage. Furthermore, simulations indicate that the applied force in the soft finger manipulation is considerably less than the rigid “one.”.     

Stereoscopic image generation with depth image based rendering

In this paper, we proposed stereoscopic image generation methods of adjusting the depth value of edge pixels and improved hole filling procedures. For the conventional system, the smooth of depth map can reduce the incidence of image holes, but cause geometric distortions of the image depth. To solve the problems, the depth map is first expanded to refine the accuracy of image depth and the quality of images. Next, we derive a hardware-oriented method for 3D warping. Finally, appropriate blocks are searched to enhance the performance of image by improving hole-filling procedures. The experimental results demonstrate the proposed methods have great performance and practicability.     

GPU accelerated tensor contractions in the plaquette renormalization scheme

We use the graphical processing unit (GPU) to accelerate the tensor contractions, which is the most time consuming operations in the variational method based on the plaquette renormalized states. Using a frustrated Heisenberg J₁–J₂ model on a square lattice as an example, we implement the algorithm based on the compute unified device architecture (CUDA). For a single plaquette contraction with the bond dimensions C = 3 of each rank of the tensor, results are obtained 25 times faster on GPU than on a current CPU core. This makes it possible to simulate systems with the size 8 × 8 and larger, which are extremely time consuming on a single CPU. This technology successfully relieves the computing time dependence with C, while in the CPU serial computation, the total required time scales both with C and the system size.     

On constructing an optimal consensus clustering from multiple clusterings

Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mining. In this paper, we formalize a set-theoretic model for computing such a similarity measure. Roughly speaking, in this model we have k>1 partitions (clusters) of the same data set each containing the same number of sets and the goal is to align the sets in each partition to minimize a similarity measure. For k=2, a polynomial-time solution was proposed by Gusfield (Information Processing Letters 82 (2002) 159-164). In this paper, we show that the problem is MAX-SNP-hard for k=3 even if each partition in each cluster contains no more than 2 elements and provide a -approximation algorithm for the problem for any k.     

Design of an adaptive self-organizing fuzzy neural network controller for uncertain nonlinear chaotic systems

Though the control performances of the fuzzy neural network controller are acceptable in many previous published papers, the applications are only parameter learning in which the parameters of fuzzy rules are adjusted but the number of fuzzy rules should be determined by some trials. In this paper, a Takagi–Sugeno-Kang (TSK)-type self-organizing fuzzy neural network (TSK-SOFNN) is studied. The learning algorithm of the proposed TSK-SOFNN not only automatically generates and prunes the fuzzy rules of TSK-SOFNN but also adjusts the parameters of existing fuzzy rules in TSK-SOFNN. Then, an adaptive self-organizing fuzzy neural network controller (ASOFNNC) system composed of a neural controller and a smooth compensator is proposed. The neural controller using the TSK-SOFNN is designed to approximate an ideal controller, and the smooth compensator is designed to dispel the approximation error between the ideal controller and the neural controller. Moreover, a proportional-integral (PI) type parameter tuning mechanism is derived based on the Lyapunov stability theory, thus not only the system stability can be achieved but also the convergence of tracking error can be speeded up. Finally, the proposed ASOFNNC system is applied to a chaotic system. The simulation results verify the system stabilization, favorable tracking performance, and no chattering phenomena can be achieved using the proposed ASOFNNC system.