Jan 2016, Volume 17 Issue 1
    

  • Select all
  • Kun JIANG,Yue-xiang YANG
    2016, 17(1): 1-14.

    Inverted index traversal techniques have been studied in addressing the query processing performance challenges of web search engines, but still leave much room for improvement. In this paper, we focus on the inverted index traversal on document-sorted indexes and the optimization technique called dynamic pruning, which can efficiently reduce the hardware computational resources required. We propose another novel exhaustive index traversal scheme called largest scores first (LSF) retrieval, in which the candidates are first selected in the posting list of important query terms with the largest upper bound scores and then fully scored with the contribution of the remaining query terms. The scheme can effectively reduce the memory consumption of existing term-at-atime (TAAT) and the candidate selection cost of existing document-at-a-time (DAAT) retrieval at the expense of revisiting the posting lists of the remaining query terms. Preliminary analysis and implementation show comparable performance between LSF and the two well-known baselines. To further reduce the number of postings that need to be revisited, we present efficient rank safe dynamic pruning techniques based on LSF, including two important optimizations called list omitting (LSF_LO) and partial scoring (LSF_PS) that make full use of query term importance. Finally, experimental results with the TREC GOV2 collection show that our new index traversal approaches reduce the query latency by almost 27% over the WAND baseline and produce slightly better results compared with the MaxScore baseline, while returning the same results as exhaustive evaluation.

  • Orginal Article
    Dipayan DEV, Ripon PATGIRI

    In this Exa byte scale era, data increases at an exponential rate. This is in turn generating a massive amount of metadata in the file system. Hadoop is the most widely used framework to deal with big data. Due to this growth of huge amount of metadata, however, the efficiency of Hadoop is questioned numerous times by many researchers. Therefore, it is essential to create an efficient and scalable metadata management for Hadoop. Hash-based mapping and subtree partitioning are suitable in distributed metadata management schemes. Subtree partitioning does not uniformly distribute workload among the metadata servers, and metadata needs to be migrated to keep the load roughly balanced. Hash-based mapping suffers from a constraint on the locality of metadata, though it uniformly distributes the load among NameNodes, which are the metadata servers of Hadoop. In this paper, we present a circular metadata management mechanism named dynamic circular metadata splitting (DCMS). DCMS preserves metadata locality using consistent hashing and locality-preserving hashing, keeps replicated metadata for excellent reliability, and dynamically distributes metadata among the NameNodes to keep load balancing. NameNode is a centralized heart of the Hadoop. Keeping the directory tree of all files, failure of which causes the single point of failure (SPOF). DCMS removes Hadoop’s SPOF and provides an efficient and scalable metadata management. The new framework is named ‘Dr. Hadoop’ after the name of the authors.

  • Hao XIE,Ruo-feng TONG
    2016, 17(1): 32-40.

    Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., definition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to find a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it difficult to find a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to finer ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.

  • Orginal Article
    Shao-fan WANG, Chun LI, De-hui KONG, Bao-cai YIN

    We propose a framework of hand articulation detection from a monocular depth image using curvature scale space (CSS) descriptors. We extract the hand contour from an input depth image, and obtain the fingertips and finger-valleys of the contour using the local extrema of a modified CSS map of the contour. Then we recover the undetected fingertips according to the local change of depths of points in the interior of the contour. Compared with traditional appearance-based approaches using either angle detectors or convex hull detectors, the modified CSS descriptor extracts the fingertips and finger-valleys more precisely since it is more robust to noisy or corrupted data;moreover, the local extrema of depths recover the fingertips of bending fingers well while traditional appearance-based approaches hardly work without matching models of hands. Experimental results show that our method captures the hand articulations more precisely compared with three state-of-the-art appearance-based approaches.

  • Qi-yan TIAN,Jian-hua WEI,Jin-hui FANG,Kai GUO
    2016, 17(1): 55-66.

    This paper presents a velocity controller for the cutting system of a trench cutter (TC). The cutting velocity of a cutting system is affected by the unknown load characteristics of rock and soil. In addition, geological conditions vary with time. Due to the complex load characteristics of rock and soil, the cutting load torque of a cutter is related to the geological conditions and the feeding velocity of the cutter. Moreover, a cutter’s dynamic model is subjected to uncertainties with unknown effects on its function. In this study, to deal with the particular characteristics of a cutting system, a novel adaptive fuzzy integral sliding mode control (AFISMC) is designed for controlling cutting velocity. The model combines the robust characteristics of an integral sliding mode controller with the adaptive adjusting characteristics of an adaptive fuzzy controller. The AFISMC cutting velocity controller is synthesized using the backstepping technique. The stability of the whole system including the fuzzy inference system,integral sliding mode controller, and the cutting system is proven using the Lyapunov theory. Experiments have been conducted on a TC test bench with the AFISMC under different operating conditions. The experimental results demonstrate that the proposed AFISMC cutting velocity controller gives a superior and robust velocity tracking performance.

  • Gang DONG,Wei XIONG,Zhao-yao WU,Yin-tang YANG
    2016, 17(1): 67-73.

    We present an antenna-in-package system integrated with a meander line antenna based on low temperature co-fired ceramic (LTCC) technology. The proposed system employs a meander line patch antenna, a packaging layer, and a laminated multi-chip module (MCM) for integration of integrated circuit (IC) bare chips.A microstrip feed line is used to reduce the interaction between patch and package. To decrease electromagnetic coupling, a via hole structure is designed and analyzed. The meander line antenna achieved a bandwidth of 220 MHz with the center frequency at 2.4 GHz, a maximum gain of 2.2 dB, and a radiation efficiency about 90% over its operational frequency. The whole system, with a small size of 20.2 mm×6.1 mm×2.6 mm, can be easily realized by a standard LTCC process. This antenna-in-package system integrated with a meander line antenna was fabricated and the experimental results agreed with simulations well.

  • Qing-feng LI,Shao-bo CHEN,Wei-ming WANG,Hong-wei HAO,Lu-ming LI
    2016, 17(1): 74-82.

    Thin metal sheets are often located in the coupling paths of magnetic coupling energy transfer (MCET) systems. Eddy currents in the metals reduce the energy transfer efficiency and can even present safety risks. This paper describes the use of etched fractal patterns in the metals to suppress the eddy currents and improve the efficiency. Simulation and experimental results show that this approach is very effective. The fractal patterns should satisfy three features, namely, breaking the metal edge, etching in the high-intensity magnetic field region, and etching through the metal in the thickness direction. Different fractal patterns lead to different results. By altering the eddy current distribution, the fractal pattern slots reduce the eddy current losses when the metals show resistance effects and suppress the induced magnetic field in the metals when the metals show inductance effects. Fractal pattern slots in multilayer high conductivity metals (e.g., Cu) reduce the induced magnetic field intensity significantly. Furthermore,transfer power, transfer efficiency, receiving efficiency, and eddy current losses all increase with the increase of the number of etched layers. These results can benefit MCET by efficient energy transfer and safe use in metal shielded equipment.