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

Author Search Result

[Author] (42848hit)

1-20hit(42848hit)

  • An Efficient Handover Control Scheme Supporting Micro-Mobility in MPLS-Based Wireless Internet

    SuKyoung LEE  

     
    LETTER

      Vol:
    E88-B No:4
      Page(s):
    1511-1516

    A Realization of mobile All-IP networks calls not only for seamless handover protocols, but also fast processing, especially for real-time IP traffic flows. In this paper, we propose to exploit pre-established label switched paths with the aim to reduce handover processing latency which is one of the most critical performance metrics in micro-mobility environment. Thus, our proposed scheme has an advantage of offering micro-mobility to Mobile IP (MIP) with lower-latency handover as compared with the several existing MPLS-based MIP approaches. A detailed analytic model of setting up LSPs for fast handover processing is presented. Further, we do not only investigate the performance of our model but also propose detailed signaling steps so that our proposed scheme could be run on MPLS-based MIP system.

  • On the Spectral Representation and Related Properties of Periodically Correlated Stochastic Process

    Ikuji HONDA  

     
    PAPER-Mathematics

      Vol:
    E65-E No:12
      Page(s):
    723-729

    Some properties of periodically correlated stochastic processes such as the mean ergodicity and asymptotic befavior of the periodgram of the processes are studied in this paper. A periodically correlated process (PC-process) is also called periodic nonstationary process, cyclo stationary process and even periodic stationary process although the process may not be stationary, and these are mainly studied as models of signals especially as pulse trains in the communication theory. Although many of interesting results obtained so far are important from the theoretical point of view, they are rather intuitively derived. Therefore we reformulate the process in a rigorous manner, introduce the spectral representation of it when the process is harmonizable in Loève's sense and study mainly about the mean ergodic properties and the limiting behavior of the mean periodgram of the process. Furthermore we study some pulse train processes as particular examples and we show simple examples of nonharmonizable PC-processes which had been thought of as unusual. We point out that by such a theoretical treatment, the position of PC-processes in the theory of nonstatonary processes will be better recognizable and the results obtained here will be useful as the foundation of practical time series and signal analysis in the communication and information theories.

  • CDV Reduction Shaping Algorithm in ATM Networks

    Kan TOYOSHIMA  

     
    LETTER-Communication Networks and Services

      Vol:
    E79-B No:4
      Page(s):
    602-604

    This letter proposes a new shaping algorithm (CRSA: CDV Reduction Shaping Algorithm) that can freely reduce the maximum CDV value of a cell stream to any predetermined value. There is a trade off between shaping delay and the maximum CDV value reduction achieved when using CRSA. The shaper using CRSA (CR-shaper) output satisfies the Peak Cell Rate Reference Algorithm set with the CR-shaper parameters.

  • Sparse Graph Codes for Channels with Synchronous Errors

    Ryohei GOTO  Kenta KASAI  

     
    PAPER-Coding theory and techniques

      Vol:
    E101-A No:12
      Page(s):
    2064-2071

    In this paper, we deal with coding for synchronous errors. We introduce a synchronously erroneous finite state Markov channel model whose SIR is computable. We apply density evolution analysis [1] and the extended version for FSMC [2] to the channel Numerical experiments demonstrated spatially-coupled codes approach the SIR of the channel.

  • A Multipurpose Image Watermarking Method for Copyright Notification and Protection

    Zhe-Ming LU  Hao-Tian WU  Dian-Guo XU  Sheng-He SUN  

     
    LETTER-Applications of Information Security Techniques

      Vol:
    E86-D No:9
      Page(s):
    1931-1933

    This paper presents an image watermarking method for two purposes: to notify the copyright owner with a visible watermark, and to protect the copyright with an invisible watermark. These two watermarks are embedded in different blocks with different methods. Simulation results show that the visible watermark is hard to remove and the invisible watermark is robust.

  • Kernel Based Asymmetric Learning for Software Defect Prediction

    Ying MA  Guangchun LUO  Hao CHEN  

     
    LETTER-Software Engineering

      Vol:
    E95-D No:1
      Page(s):
    267-270

    A kernel based asymmetric learning method is developed for software defect prediction. This method improves the performance of the predictor on class imbalanced data, since it is based on kernel principal component analysis. An experiment validates its effectiveness.

  • Recursive Construction of the Systems Interpolating 1st- and 2nd-Order Information

    Kazumi HORIGUCHI  

     
    LETTER-Systems and Control

      Vol:
    E79-A No:1
      Page(s):
    134-137

    We present a recursive algorithm for constructing linear discrete-time systems which interpolate the desired 1st-and 2nd-order information. The recursive algorithm constructs a new system and connects it to the previous system in the cascade form every time new information is added. These procedures yield a practical realization of all the interpolants.

  • BLOCKSUM is NP-Complete

    Kazuya HARAGUCHI  Hirotaka ONO  

     
    PAPER

      Vol:
    E96-D No:3
      Page(s):
    481-488

    BLOCKSUM, also known as KEISANBLOCK in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BLOCKSUM has a solution or not is NP-complete.

  • Efficient Generation of Plane Triangulations with Specified Maximum Degree

    Hiroyuki TANAKA  Shin-ichi NAKANO  

     
    PAPER

      Vol:
    E87-D No:2
      Page(s):
    330-336

    A "based" plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations having exactly n vertices and with the maximum degree exactly D. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications.

  • Revisiting the Rich Club of the Internet AS-Level Topology

    Yangyang WANG  Jun BI  Jianping WU  

     
    LETTER-Network

      Vol:
    E96-B No:3
      Page(s):
    900-904

    We evaluate the rich-club property of the Internet topology at the autonomous system (AS) level by comparing the Internet AS graphs of traceroute and BGP, and the synthetic graphs of PFP model. The results indicate that, for rich-club coefficient, PFP model can exactly match traceroute AS graphs in the early years around 2002, but it has significantly deviated from the grown AS graphs since about 2010.

  • Context-Free Grammars with Memory

    Etsuro MORIYA  

     
    PAPER-Automaton, Language and Theory of Computing

      Vol:
    E75-D No:6
      Page(s):
    847-851

    CFGs (context-free grammars) with various types of memory are introduced and their generative capacities are investigated. For an automata-theoretic characterization, a new type of automaton called partitioning automaton is introduced and it is shown that the class of languages generated by CFGs with memory type X is equal to the class of languages accepted by partitioning automata of type X.

  • A New Method to Represent Sets of Products: Ternary Decision Diagrams

    Koichi YASUOKA  

     
    PAPER

      Vol:
    E78-A No:12
      Page(s):
    1722-1728

    This paper presents Ternary Decision Diagrams which represent sets of products. This paper also presents manipulating methods for sum-of-products forms and ringsum-of-products forms using Ternary Decision Diagrams, and gives comparison results between Ternary Decision Diagrams and Binary Decision Diagrams.

  • A Current-Mode Circuit of a Chaotic Neuron Model

    Nobuo KANOU  Yoshihiko HORIO  Kazuyuki AIHARA  Shogo NAKAMURA  

     
    PAPER-Neural Networks

      Vol:
    E76-A No:4
      Page(s):
    642-644

    A model of a single neuron with chaotic dynamics is implemented with current-mode circuit design technique. The existence of chaotic dynamics in the circuit is demonstrated by simulation with SPICE3. The proposed circuit is suitable for implementing a chaotic neural network composed of such neuron models on a VLSI chip.

  • Industrial Applications of FOG

    Tatsuya KUMAGAI  Wataru OHNUKI  

     
    INVITED PAPER-Fiber Optic Gyroscope

      Vol:
    E83-C No:3
      Page(s):
    378-383

    In this paper, we review recent developments in interferometric fiber-optic gyroscopes for industrial applications. These gyroscopes use only elliptical-jacket or elliptical-core polarization-maintaining-fibers to make their optical systems immune to environmental effects, and they use open-loop or closed-loop signal processing circuitry. We have begun mass production of a gyroscope for automotive navigation and location systems. The more accurate gyroscopes have been applied to a number of consumer applications such as attitude control systems of unmanned agricultural helicopter, pipe-mapping and north-finding systems. For further enhancement in terms of size, cost, and accuracy, we have developed an application specific integrated circuit and an integrated optical circuit.

  • Efficient Key Exchange and Authentication Protocols Protecting Weak Secrets

    Taekyoung KWON  Jooseok SONG  

     
    PAPER-Information Security

      Vol:
    E81-A No:1
      Page(s):
    156-163

    We propose new key exchange and authentication protocols, which are efficient in protecting a poorly-chosen weak secret from guessing attacks, based on the use of a one-time pad and a strong one-way hash function. Cryptographic protocols assume that a strong secret should be shared between communication participants for authentication, in the light of an ever-present threat of guessing attacks. Cryptographically long secret would be better for security only if ordinary users could remember it. But most users choose an easy-to-remember password as a secret and such a weak secret can be guessed easily. In our previous work, we made much of introducing a basic concept and its application. In this paper, we describe our idea in more detail and propose more protocols which correspond to variants of our basic protocol using well-defined notations. Formal verification and efficiency comparison of the proposed protocols are also presented. By our scheme the password guessing attacks are defeated efficiently, and a session key is exchanged and participants are authenticated securely.

  • Iterative Decomposition Method with Mesh Refinements for Numerical Solution of Nonlinear Two-Point Boundary Value Problems

    Kiyotaka YAMAMURA  Shin'ichi OISHI  Kazuo HORIUCHI  

     
    LETTER-Mathematics

      Vol:
    E68-E No:6
      Page(s):
    382-383

    An iterative decomposition method with mesh refinement strategies is presented for the numerical solution of nonlinear two-point boundary value problems. It is shown that this method is more efficient than the traditional finite difference methods and shooting methods.

  • Matching Josephson Junctions with Microstrip Lines for SFQ Pulses and Weak Signals

    Nikolai JOUKOV  Yoshihito HASHIMOTO  Vasili SEMENOV  

     
    PAPER-Digital Devices and Their Applications

      Vol:
    E85-C No:3
      Page(s):
    636-640

    We report recent achievements in interfacing Josephson junction circuits with superconductor MicroStrip Lines (MSLs). We studied basic techniques that allow satisfactory operation of different devices with MSLs. Successful operation of the interfaces with very low error rate has been demonstrated even at the MSL resonant frequency.

  • A Theorem on an Ω-Matrix Which is a Generalization of the P-Matrix

    Tetsuo NISHI  

     
    PAPER-Nonlinear Circuits and Bifurcation

      Vol:
    E79-A No:10
      Page(s):
    1522-1529

    The author once defined the Ω-matrix and showed that it played an important role for estimating the number of solutions of a resistive circuit containing active elements such as CCCS's. The Ω-matlix is a generalization of the wellknown P-matrix. This paper gives the necessary and sufficient conditions for the Ω-matrix.

  • Focused-Beam-Induced Diffraction Rings from an Absorbing Solution

    Yasuo YOKOTA  Kazuhiko OGUSU  Yosuke TANAKA  

     
    PAPER-Quantum Electronics

      Vol:
    E81-C No:3
      Page(s):
    455-461

    We present an experimental and theoretical study of multiple diffraction rings of a cw Ar+ laser beam from a nitrobenzene solution of BDN (bis-(4-dimethylaminodithiobenzil)-nickel) caused by the spatial self-phase modulation. We examine in detail the effect of the intensity and phase shift profiles of the beam in the nonlinear medium by comparing the measured ring patterns with the theoretical results based on the Fraunhofer diffraction. Although the thickness of the sample is only 180 µm in our experiment, it is found that the intensity and phase shift profiles are broadened owing to the self-defocusing effect. It is also found that the phase shift profile is further broadened by the thermal diffusion. These two effects become remarkable when the focused beam is used.

  • Representation of Coupling Characteristics of Crossing Striplines by Poynting Vector

    Shoichi KOIKE  Norinobu YOSHIDA  Ichiro FUKAI  

     
    LETTER-Microwaves

      Vol:
    E69-E No:6
      Page(s):
    713-715

    The analysis of the coupling characteristics between lines becomes more important because of the progress of high density wiring and large integration. The problems can be treated as energy flow which is represented by the Poynting vector. On this view point, we present the variation of the Poynting vector for crossing striplines on time and space.

1-20hit(42848hit)