The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] (42807hit)

11781-11800hit(42807hit)

  • Analysis of Two-Dimensional Photonic Crystal Optical Power Splitter with Microcavity

    Yoshihiro NAKA  Yusui NAKAMURA  

     
    BRIEF PAPER-Periodic Structures

      Vol:
    E96-C No:1
      Page(s):
    73-76

    An efficient 12 optical power splitter constructed by a two-dimensional photonic crystal has been analyzed using the finite difference time domain (FD-TD) method. The power splitter has a microcavity which is coupled to an input and two output waveguides. We have confirmed that all optical power is transmitted into output waveguides due to resonant tunneling caused by the microcavity.

  • Evaluation of Cascaded Multi-Keyhole Channels in Cooperative Diversity Wireless Communications

    Yi ZHOU  Yusheng JI  Weidong XIANG  Sateesh ADDEPALLI  Aihuang GUO  Fuqiang LIU  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E96-B No:1
      Page(s):
    223-232

    To accurately evaluate and manage future distributed wireless networks, it is indispensable to fully understand cooperative propagation channels. In this contribution, we propose cascaded multi-keyhole channel models for analyzing cooperative diversity wireless communications. The cascaded Wishart distribution is adopted to investigate the eigenvalue distribution of the multi-keyhole MIMO (multiple input multiple output) channel matrix, and the capacity performance is also presented for the wireless systems over such channels. A diversity order approximation method is proposed for better evaluating the eigenvalue and capacity distributions. The good match of analytical derivations and numerical simulations validates the proposed models and analysis methods. The proposed models can provide an important reference for the optimization and management of cooperative diversity wireless networks.

  • An Online Bandwidth Allocation Scheme Based on Mechanism Design Model

    Sungwook KIM  

     
    LETTER-Network

      Vol:
    E96-B No:1
      Page(s):
    321-324

    In this paper, a new bandwidth allocation scheme is proposed based on the Mechanism Design (MD); MD is a branch of game theory that stimulates rational users to behave cooperatively for a global goal. The proposed scheme consists of bandwidth adaptation, call admission control and pricing computation algorithms to improve network performance. These algorithms are designed based on the adaptive online approach and work together to maximize bandwidth efficiency economically. A simulation shows that the proposed scheme can satisfy contradictory requirements and so provide well-balanced network performance.

  • Minimizing False Peak Errors in Generalized Cross-Correlation Time Delay Estimation Using Subsample Time Delay Estimation

    SooHwan CHOI  DooSeop EOM  

     
    PAPER-Digital Signal Processing

      Vol:
    E96-A No:1
      Page(s):
    304-311

    The Generalized cross-correlation (GCC) method is most commonly used for time delay estimation (TDE). However, the GCC method can result in false peak errors (FPEs) especially at a low signal to noise ratio (SNR). These FPEs significantly degrade TDE, since the estimation error, which is the difference between a true time delay and an estimated time delay, is larger than at least one sampling period. This paper introduces an algorithm that estimates two peaks for two cross-correlation functions using three types of signals such as a reference signal, a delayed signal, and a delayed signal with an additional time delay of half a sampling period. A peak selection algorithm is also proposed in order to identify which peak is closer to the true time delay using subsample TDE methods. This paper presents simulations that compare the algorithms' performance for varying amounts of noise and delay. The proposed algorithms can be seen to display better performance, in terms of the probability of the integer TDE errors, as well as the mean and standard deviation of absolute values of the time delay estimation errors.

  • Scalable Privacy-Preserving Data Mining with Asynchronously Partitioned Datasets

    Hiroaki KIKUCHI  Daisuke KAGAWA  Anirban BASU  Kazuhiko ISHII  Masayuki TERADA  Sadayuki HONGO  

     
    PAPER-Public Key Based Protocols

      Vol:
    E96-A No:1
      Page(s):
    111-120

    In the Naive Bayes classification problem using a vertically partitioned dataset, the conventional scheme to preserve privacy of each partition uses a secure scalar product and is based on the assumption that the data is synchronized amongst common unique identities. In this paper, we attempt to discard this assumption in order to develop a more efficient and secure scheme to perform classification with minimal disclosure of private data. Our proposed scheme is based on the work by Vaidya and Clifton [2], which uses commutative encryption to perform secure set intersection so that the parties with access to the individual partitions have no knowledge of the intersection. The evaluations presented in this paper are based on experimental results, which show that our proposed protocol scales well with large sparse datasets*.

  • Rogue Key Attacks on Lu et al.'s Verifiably Encrypted Signature Scheme

    Bennian DOU  Hong ZHANG  Chun-Hua CHEN  Chungen XU  

     
    LETTER

      Vol:
    E96-A No:1
      Page(s):
    242-243

    At Eurocrypt'2006, Lu et al. proposed a pairing based verifiably encrypted signature scheme (the LOSSW-VES scheme) without random oracles. In this letter, we show that the LOSSW-VES scheme does not have opacity against rogue-key attacks.

  • Traffic Flow Simulator Using Virtual Controller Model

    Haijun LIANG  Hongyu YANG  Bo YANG  

     
    LETTER-Intelligent Transport System

      Vol:
    E96-A No:1
      Page(s):
    391-393

    A new paradigm for building Virtual Controller Model (VCM) for traffic flow simulator is developed. It is based on flight plan data and is applied to Traffic Flow Management System (TFMS) in China. The problem of interest is focused on the sectors of airspace and how restrictions to aircraft movement are applied by air traffic controllers and demand overages or capacity shortfalls in sectors of airspace. To estimate and assess the balance between the traffic flow and the capacity of sector in future, we apply Virtual Controller model, which models by the sectors airspace system and its capacity constraints. Numerical results are presented and illustrated by applying them to air traffic data for a typical day in the Traffic Flow Management System. The results show that the predictive capabilities of the model are successfully validated by showing a comparison between real flow data and simulated sector flow, making this method appropriate for traffic flow management system.

  • A Thermal-Aware High-Level Synthesis Algorithm for RDR Architectures through Binding and Allocation

    Kazushi KAWAMURA  Masao YANAGISAWA  Nozomu TOGAWA  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E96-A No:1
      Page(s):
    312-321

    With process technology scaling, a heat problem in ICs is becoming a serious issue. Since high temperature adversely impacts on reliability, design costs, and leakage power, it is necessary to incorporate thermal-aware synthesis into IC design flows. In particular, hot spots are serious concerns where a chip is locally too much heated and reducing the peak temperature inside a chip is very important. On the other hand, increasing the average interconnect delays is also becoming a serious issue. By using RDR architectures (Regular-Distributed-Register architectures), the interconnect delays can be easily estimated and their influence can be much reduced even in high-level synthesis. In this paper, we propose a thermal-aware high-level synthesis algorithm for RDR architectures. The RDR architecture divides the entire chip into islands and each island has uniform area. Our algorithm balances the energy consumption among islands through re-binding to functional units. By allocating some new additional functional units to vacant areas on islands, our algorithm further balances the energy consumption among islands and thus reduces the peak temperature. Experimental results demonstrate that our algorithm reduces the peak temperature by up to 9.1% compared with the conventional approach.

  • Compact Tunable Isolator with a Variable Capacitor

    Takayuki FURUTA  Atsushi FUKUDA  Hiroshi OKAZAKI  Shoichi NARAHASHI  

     
    PAPER-Microwaves, Millimeter-Waves

      Vol:
    E96-C No:1
      Page(s):
    84-92

    This paper presents a novel isolator that employs a varactor that tunes the operating frequency for use in future multi-band mobile handsets. The proposed isolator employs only one varactor for compactness and has a three-fold symmetric structure to reduce the parasitic reactance at each port. Analytical and experimental results clarify the tuning range of the proposed isolator. This paper presents the fundamental characteristics of the proposed isolator such as the insertion loss, isolation, and adjacent channel leakage ratio (ACLR) using a W-CDMA signal. The impact of the proposed isolator on the system performance is described based on experimental evaluation of the ACLR with a multi-band transmission system consisting of a power amplifier and the proposed isolator.

  • Robust Buffered Clock Tree Synthesis by Sensitivity Based Link Insertion

    Joon-Sung YANG  Ik Joon CHANG  

     
    BRIEF PAPER-Electronic Circuits

      Vol:
    E96-C No:1
      Page(s):
    127-131

    Clock network synthesis is one of the most important and limiting factors in VLSI designs. Hence, the clock skew variation reduction is one of the most important objectives in clock distribution methodology. Cross-link insertion is proposed in [1], however, it is based on empirical methods and does not use variation information for link insertion location choice. [17] considers the delay variation, but it is slow even for small clock trees. In this paper, we propose a fast link insertion algorithm that considers the delay variation information directly during link selection process. Experimental results show that our algorithm is very fast and achieves better skew variability reduction while utilizing considerably lesser routing resources compared with existing methods.

  • Checkpoint Time Arrangement Rotation in Hybrid State Saving with a Limited Number of Periodical Checkpoints

    Ryo SUZUKI  Mamoru OHARA  Masayuki ARAI  Satoshi FUKUMOTO  Kazuhiko IWASAKI  

     
    LETTER-Dependable Computing

      Vol:
    E96-D No:1
      Page(s):
    141-145

    This paper discusses hybrid state saving for applications in which processes should create checkpoints at constant intervals and can hold a finite number of checkpoints. We propose a reclamation technique for checkpoint space, that provides effective checkpoint time arrangements for a rollback distance distribution. Numerical examples show that when we cannot use the optimal checkpoint interval due to the system requirements, the proposed technique can achieve lower expected overhead compared to the conventional technique without considering the form of the rollback distance distribution.

  • Electrostatic Solution for Broadside-Coupled Striplines in a Shield

    Juncheol PARK  Dohoon KIM  Hyo Joon EOM  Sangbong JEON  

     
    LETTER-Antennas and Propagation

      Vol:
    E96-B No:1
      Page(s):
    325-328

    The electrostatic characteristics of broadside-coupled striplines in a shield are investigated with the mode-matching method. The Fourier series is employed to describe electrostatic potential distributions. Numerical results are shown for coupled transmission line cell applications.

  • Facial Micro-Expression Detection in Hi-Speed Video Based on Facial Action Coding System (FACS)

    Senya POLIKOVSKY  Yoshinari KAMEDA  Yuichi OHTA  

     
    PAPER-Pattern Recognition

      Vol:
    E96-D No:1
      Page(s):
    81-92

    Facial micro-expressions are fast and subtle facial motions that are considered as one of the most useful external signs for detecting hidden emotional changes in a person. However, they are not easy to detect and measure as they appear only for a short time, with small muscle contraction in the facial areas where salient features are not available. We propose a new computer vision method for detecting and measuring timing characteristics of facial micro-expressions. The core of this method is based on a descriptor that combines pre-processing masks, histograms and concatenation of spatial-temporal gradient vectors. Presented 3D gradient histogram descriptor is able to detect and measure the timing characteristics of the fast and subtle changes of the facial skin surface. This method is specifically designed for analysis of videos recorded using a hi-speed 200 fps camera. Final classification of micro expressions is done by using a k-mean classifier and a voting procedure. The Facial Action Coding System was utilized to annotate the appearance and dynamics of the expressions in our new hi-speed micro-expressions video database. The efficiency of the proposed approach was validated using our new hi-speed video database.

  • Effect of Environmental Factors on System Capacity and Coverage of Femtocell Networks

    Hoon KIM  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E96-B No:1
      Page(s):
    201-207

    Recently much attention is being devoted to a femtocell's potential for improving indoor cellular coverage with the provision of high data rate services in a wireless environment. Femtocells are usually deployed in homes and buildings and overlay existing macrocells, or microcells which cover wider service areas. In such an overlaid network structure, one of the important issues in network planning is the analysis of system capacity achievable by femtocells, which could be significantly affected by indoor radio propagation properties. This paper addresses a typical environmental scenario where a detailed indoor radio propagation model can be adopted. Moreover, a performance evaluation of embedded femteocell networks reflecting various environmental scenarios and factors is provided by the metrics of outage probability, dynamic range of spectral efficiency, and required separation distances for various wall structures, distance, and the number of walls between the home femtocell and the user. Our computer simulation and numerical analysis indicate an outage probability of 1%∼58%, dynamic range of spectral varies from around 2.2 to 7, while the required separation from the macrocell station is 25 m ∼ 327 m. This information could be useful for femtocell network planning.

  • Numerical Methods for Composite Dielectric Gratings Embedded with Conducting Strips Using Scattering Factors

    Hideaki WAKABAYASHI  Masamitsu ASAI  Keiji MATSUMOTO  Jiro YAMAKITA  

     
    PAPER-Periodic Structures

      Vol:
    E96-C No:1
      Page(s):
    19-27

    We propose a new analytical method for a composite dielectric grating embedded with conducting strips using scattering factors in the shadow theory. The scattering factor in the shadow theory plays an important role instead of the conventional diffraction amplitude. By specifying the relation between scattering factors and spectral-domain Green's functions, we derive expressions of the Green's functions directly for unit surface electric and magnetic current densities, and apply the spectral Galerkin method to our formulation. From some numerical results, we show that the expressions of the Green's functions are valid, and analyze scattering characteristics by composite gratings.

  • Near-An-Lattice Sphere Decoding Technique Assisted Optimum Detection for Block Data Transmission Systems

    Mahmoud A.M. ALBREEM  Mohd Fadzli Mohd SALLEH  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E96-B No:1
      Page(s):
    356-359

    This letter proposes the use of a new near-An-lattice sphere decoding (LSD) technique for optimum detection in block-data transmission systems instead of the traditional LSD technique. The proposed channel matrix mimics the generator matrix of an An lattice. The condition number (λ) of the proposed channel matrix is less than those of traditional LSD matrices and the initial radius (d) is deterministic, thus the proposed technique achieves significant improvement in performance and complexity reduction.

  • ISP-Driven Delay Insertion for P2P Traffic Localization

    HyunYong LEE  Akihiro NAKAO  

     
    PAPER

      Vol:
    E96-B No:1
      Page(s):
    40-47

    We introduce a new kind of P2P traffic localization technique, called Netpherd, benefiting from the network virtualization technique for its successful deployment. Netpherd exploits one feature of P2P applications, a peer selection adaptation (i.e., preferring peers who are likely to provide better performance) for the traffic localization. Netpherd tries to enable local peers (i.e., peers in target network domain) to communicate with each other by affecting the peer selection adaptation. To affect the peer selection adaptation, Netpherd adds artificial delay to inter-domain traffic going to local peers. Our experiment conducted over Internet testbed verifies that Netpherd achieves the traffic localization and also improves the content download performance with the network delay insertion. In addition, we show that how the network virtualization technique can be utilized for efficient and graceful implementation of Netpherd.

  • Boomerang Distinguishers on MD4-Based Hash Functions: First Practical Results on Full 5-Pass HAVAL Compression Function

    Yu SASAKI  

     
    PAPER-Hash Functions

      Vol:
    E96-A No:1
      Page(s):
    131-140

    In this paper, we study a boomerang attack approach on MD4-based hash functions, and present a practical 4-sum distinguisher against the compression function of the full 5-pass HAVAL. Our approach is based on the previous work by Kim et al., which proposed the boomerang distinguisher on the encryption mode of MD4, MD5, and HAVAL in the related-key setting. Firstly, we prove that the differential path for 5-pass HAVAL used in the previous boomerang distinguisher contains a critical flaw and thus the attack cannot work. We then search for new differential paths. Finally, by using the new paths, we mount the distinguisher on the compression function of the full 5-pass HAVAL which generates a 4-sum quartet with a complexity of approximately 211 compression function computations. As far as we know, this is the first result on the full compression function of 5-pass HAVAL that can be computed in practice. We also point out that the 4-sum distinguisher can also be constructed for other MD4-based hash functions such as MD5, 3-pass HAVAL, and 4-pass HAVAL. Our attacks are implemented on a PC and we present a generated 4-sum quartet for each attack target.

  • Spatially Adaptive Logarithmic Total Variation Model for Varying Light Face Recognition

    Biao WANG  Weifeng LI  Zhimin LI  Qingmin LIAO  

     
    LETTER-Image Recognition, Computer Vision

      Vol:
    E96-D No:1
      Page(s):
    155-158

    In this letter, we propose an extension to the classical logarithmic total variation (LTV) model for face recognition under variant illumination conditions. LTV treats all facial areas with the same regularization parameters, which inevitably results in the loss of useful facial details and is harmful for recognition tasks. To address this problem, we propose to assign the regularization parameters which balance the large-scale (illumination) and small-scale (reflectance) components in a spatially adaptive scheme. Face recognition experiments on both Extended Yale B and the large-scale FERET databases demonstrate the effectiveness of the proposed method.

  • Kernel-Based On-Line Object Tracking Combining both Local Description and Global Representation

    Quan MIAO  Guijin WANG  Xinggang LIN  

     
    LETTER-Image Recognition, Computer Vision

      Vol:
    E96-D No:1
      Page(s):
    159-162

    This paper proposes a novel method for object tracking by combining local feature and global template-based methods. The proposed algorithm consists of two stages from coarse to fine. The first stage applies on-line classifiers to match the corresponding keypoints between the input frame and the reference frame. Thus a rough motion parameter can be estimated using RANSAC. The second stage employs kernel-based global representation in successive frames to refine the motion parameter. In addition, we use the kernel weight obtained during the second stage to guide the on-line learning process of the keypoints' description. Experimental results demonstrate the effectiveness of the proposed technique.

11781-11800hit(42807hit)