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

Keyword Search Result

[Keyword] system(3183hit)

1241-1260hit(3183hit)

  • 2-Dimensional Imaging of Human Bodies with UWB Radar Using Approximately Uniform Walking Motion along a Straight Line with the SEABED Algorithm

    Takuya SAKAMOTO  Toru SATO  

     
    PAPER-Sensing

      Vol:
    E91-B No:11
      Page(s):
    3695-3703

    UWB (Ultra Wide-Band) pulse radar is a promising candidate for surveillance systems designed to prevent crimes and terror-related activities. The high-speed SEABED (Shape Estimation Algorithm based on BST and Extraction of Directly scattered waves) imaging algorithm, is used in the application of UWB pulse radar in fields that require realtime operations. The SEABED algorithm assumes that omni-directional antennas are scanned to observe the scattered electric field in each location. However, for surveillance systems, antenna scanning is impractical because it restricts the setting places of the devices. In this paper, movement of a body is used to replace antenna scanning. The instantaneous velocity of any given motion is an unknown variable that changes as a function of time. A pair of antennas is used to analyze delay time to estimate the unknown motion. We propose a new algorithm to estimate the shape of a human body using data obtained from a human body passing stationary antennas.

  • Context-Aware Users' Preference Models by Integrating Real and Supposed Situation Data

    Chihiro ONO  Yasuhiro TAKISHIMA  Yoichi MOTOMURA  Hideki ASOH  Yasuhide SHINAGAWA  Michita IMAI  Yuichiro ANZAI  

     
    PAPER-Knowledge Acquisition

      Vol:
    E91-D No:11
      Page(s):
    2552-2559

    This paper proposes a novel approach of constructing statistical preference models for context-aware personalized applications such as recommender systems. In constructing context-aware statistical preference models, one of the most important but difficult problems is acquiring a large amount of training data in various contexts/situations. In particular, some situations require a heavy workload to set them up or to collect subjects capable of answering the inquiries under those situations. Because of this difficulty, it is usually done to simply collect a small amount of data in a real situation, or to collect a large amount of data in a supposed situation, i.e., a situation that the subject pretends that he is in the specific situation to answer inquiries. However, both approaches have problems. As for the former approach, the performance of the constructed preference model is likely to be poor because the amount of data is small. For the latter approach, the data acquired in the supposed situation may differ from that acquired in the real situation. Nevertheless, the difference has not been taken seriously in existing researches. In this paper we propose methods of obtaining a better preference model by integrating a small amount of real situation data with a large amount of supposed situation data. The methods are evaluated using data regarding food preferences. The experimental results show that the precision of the preference model can be improved significantly.

  • An Evaluation System for End-User Computing Capability in a Computing Business Environment

    Chui Young YOON  

     
    PAPER-Knowledge Representation

      Vol:
    E91-D No:11
      Page(s):
    2607-2615

    We describe an evaluation system consisting of an evaluation and interpretation model to totally assess and interpret an end-user's computing capability. It includes four evaluation factors and eighteen items, the complex indicators, an evaluation process, and method. We verified the model construct was verified by factor analysis and reliability analysis through a pilot test. We confirmed the application of the developed system by applying the model to evaluating end-users in a computing business environment and presenting the results. This system contributes to developing a practical system for evaluating an end-user's computing capability and hence for improving computing capability of end-users.

  • Exact Cost Performance Analysis of Piecewise Affine Systems

    Ravi GONDHALEKAR  Jun-ichi IMURA  

     
    PAPER

      Vol:
    E91-A No:11
      Page(s):
    3253-3260

    A method for the exact cost performance analysis of autonomous discrete-time piecewise affine systems is presented. Cost performance refers to the average trajectory cost over the entire region of attraction of the origin. The trajectory cost is based on the infinite-horizon cost. First, a reverse reachability algorithm which constructs the explicit piecewise quadratic trajectory cost function over the entire region of attraction of the origin is presented. Then, an explicit expression for the integral of a quadratic function over a simplex of arbitrary dimension is derived. Thus, the piecewise quadratic trajectory cost function can be integrated exactly and efficiently in order to determine the cost performance of the system as a whole. This alleviates the need to perform a large number of simulations.

  • An OFDM-Based Speech Encryption System without Residual Intelligibility

    Der-Chang TSENG  Jung-Hui CHIU  

     
    LETTER-Speech and Hearing

      Vol:
    E91-D No:11
      Page(s):
    2742-2745

    Since an FFT-based speech encryption system retains a considerable residual intelligibility, such as talk spurts and the original intonation in the encrypted speech, this makes it easy for eavesdroppers to deduce the information contents from the encrypted speech. In this letter, we propose a new technique based on the combination of an orthogonal frequency division multiplexing (OFDM) scheme and an appropriate QAM mapping method to remove the residual intelligibility from the encrypted speech by permuting several frequency components. In addition, the proposed OFDM-based speech encryption system needs only two FFT operations instead of the four required by the FFT-based speech encryption system. Simulation results are presented to show the effectiveness of this proposed technique.

  • Fuzzy Logic-Based Quantized Event Filter for RFID Data Processing

    Sung Ho JANG  Hi Sung CHOUN  Heung Seok CHAE  Jong Sik LEE  

     
    PAPER

      Vol:
    E91-B No:11
      Page(s):
    3560-3568

    RFID event filtering is an important issue of RFID data management. Tag read events from readers have some problems like unreliability, redundancy, and disordering of tag readings. Duplicated events lead to performance degradation of RFID systems with a flood of similar tag information. Therefore, this paper proposes a fuzzy logic-based quantized event filter. In order to reduce duplicated tag readings and solve disordering of tag readings, the filter applies a fuzzy logic system to control a filtering threshold by the change in circumstances of readers. Continuous tag readings are converted into discrete values for event generation by the filtering threshold. And, the filter generates as many events as the discrete values at a point of event generation time. Experimental results comparing the proposed filter with existing RFID event filters, such as the primitive event filter and the smoothing event filter, verify effectiveness and efficiency of the fuzzy logic-based quantized event filter.

  • Sampled-Data Event Control of Hybrid Systems for Control Specifications Given by Predicate

    Yoshiyuki TSUCHIE  Toshimitsu USHIO  

     
    PAPER-Concurrent Systems

      Vol:
    E91-A No:11
      Page(s):
    3365-3373

    We consider a hybrid system controlled by a sampled-data controller whose action is periodically time-driven, that is, the control inputs can change only at the particular time instants. Then, we introduce transition systems as semantics of the controlled hybrid systems and consider a control specification given by a predicate. First, we derive a necessary and sufficient condition for the predicate to be control-invariant. Next, we show that there always exists the supremal control-invariant subpredicate for any predicate. Finally, we propose a procedure to compute it and obtain a sampled-data event controller which satisfies it.

  • Performance Evaluation of Workflows Using Continuous Petri Nets with Interval Firing Speeds

    Kunihiko HIRAISHI  

     
    PAPER

      Vol:
    E91-A No:11
      Page(s):
    3219-3228

    In this paper, we study performance evaluation of workflow-based information systems. Because of state space explosion, analysis by stochastic models, such as stochastic Petri nets and queuing models, is not suitable for workflow systems in which a large number of flow instances run concurrently. We use fluid-flow approximation technique to overcome this difficulty. In the proposed method, GSPN (Generalized Stochastic Petri Nets) models representing workflows are approximated by a class of timed continuous Petri nets, called routing timed continuous Petri nets (RTCPN). In RTCPN models, each discrete set is approximated by a continuous region on a real-valued vector space, and variance in probability distribution is replaced with a real-valued interval. Next we derive piecewise linear systems from RTCPN models, and use interval methods to compute guaranteed enclosures for state variables. As a case study, we solve an optimal resource assignment problem for a paper review process.

  • Automatic Generation of User Manuals without Automation Surprises for Human-Machine Systems Modeled by Discrete Event Systems

    Toshimitsu USHIO  Satoshi TAKAHASHI  

     
    PAPER

      Vol:
    E91-A No:11
      Page(s):
    3237-3244

    In human-machine systems, a user gets abstracted information of a machine via an interface and operates it referring to a manual. If a manual has an erroneous description leading to automation surprises, the user may be lost in his/her operations so that he/she may make a serious human error. In this paper, we propose an algorithm for generating a manual by which automation surprises never occur. We model the machine and the interface as a discrete event system and a mapping from machine's state to a display of the interface, respectively. First, we represent a manual as a finite language and model behavior of the system operated by the user with the manual as a tree called an operational tree. Next, we characterize three automation surprises using the tree. Finally, we propose an algorithm for generating an operational tree by which the machine reaches a target state.

  • Research of Practical Indoor Guidance Platform Using Fluorescent Light Communication

    Xiaohan LIU  Hideo MAKINO  Suguru KOBAYASHI  Yoshinobu MAEDA  

     
    PAPER

      Vol:
    E91-B No:11
      Page(s):
    3507-3515

    This article presents an indoor positioning and communication platform, using fluorescent lights. We set up a practical implementation of a VLC (Visible Light Communication) system in a University building. To finalize this work, it is important that we analyze the properties of the reception signal, especially the length of the data string that can be received at different walking speed. In this paper, we present a model and a series of formulae for analyzing the relationship between positioning signal availability and other important parameters, such as sensor angle, walking speed, data transmission rate, etc. We report a series of real-life experiments using VLC system and compare the results with those generated by the formula. The outcome is an improved design for determination of the reception area with more than 97% accurate signals, and an optimal transmission data length, and transmission rate.

  • A Cell-Based Hybrid Indexing Scheme for Energy Conserving k Nearest Neighbor Search on Air

    SeokJin IM  Hee Yong YOUN  

     
    LETTER-Broadcast Systems

      Vol:
    E91-B No:11
      Page(s):
    3799-3802

    This letter proposes a Cell-based Hybrid Index (CHI) for energy conserving k Nearest Neighbor search on air. The proposed CHI provides global knowledge on data distribution for fast decision of the search space and local knowledge for efficient pruning of data items. Simulations show that CHI outperforms the existing indexing schemes in terms of tuning time and energy efficiency. With respect to access time, it outperforms them except the distributed indexing scheme optimized for access time.

  • Capacity Analysis of MIMO Rayleigh Channel with Spatial Fading Correlation

    Ha Duyen TRUNG  Watit BENJAPOLAKUL  Kiyomichi ARAKI  

     
    PAPER-Communication Theory

      Vol:
    E91-A No:10
      Page(s):
    2818-2826

    MIMO (Multiple Input Multiple Output) communications systems equipped with array antennas at both the transmitter and receiver sides are a promising scheme to realize higher rate and/or reliable data transmission. In this paper, capacity analysis of MIMO Rayleigh channel with spatial correlation at the receiver of multipath taken into account is presented. In general, a model configuration of local scattering around a mobile station in MIMO environment is carried out by simulation to examine spatial correlation coefficients. Based on statistical properties of the eigenvalues of correlated complex random Wishart matrices, the exact closed-form expressions of distribution of the eigenvalues are investigated. Then, the general closed-form evaluation of integral form is proposed based on Meijer's G-function. The results demonstrate that the ergodic capacities are improved by increasing the number of the antennas and the SNR's. Compared with i.i.d. (independent identically distributed) Rayleigh channel, the incremental improvement of correlated Rayleigh channel is reduced by spatial fading correlation. The analytical results validated by Monte-Carlo simulations show a good agreement.

  • Masking Property Based Residual Acoustic Echo Cancellation for Hands-Free Communication in Automobile Environment

    Yoonjae LEE  Seokyeong JEONG  Hanseok KO  

     
    LETTER-Speech and Hearing

      Vol:
    E91-D No:10
      Page(s):
    2528-2531

    A residual acoustic echo cancellation method that employs the masking property is proposed to enhance the speech quality of hands-free communication devices in an automobile environment. The conventional masking property is employed for speech enhancement using the masking threshold of the desired clean speech signal. In this Letter, either the near-end speech or residual noise is selected as the desired signal according to the double-talk detector. Then, the residual echo signal is masked by the desired signal (masker). Experiments confirm the effectiveness of the proposed method by deriving the echo return loss enhancement and by examining speech waveforms and spectrograms.

  • Feedback Error Learning with Insufficient Excitation

    Basel ALALI  Kentaro HIRATA  Kenji SUGIMOTO  

     
    LETTER-Systems and Control

      Vol:
    E91-A No:10
      Page(s):
    3071-3075

    This letter studies the tracking error in Multi-input Multi-output Feedback Error Learning (MIMO-FEL) system having insufficient excitation. It is shown that the error converges to zero exponentially even if the reference signal lacks the persistently excitation (PE) condition. Furthermore, by making full use of this fast convergence, we estimate the plant parameter while in operation based on frequency response. Simulation results show the effectiveness of the proposed method compared to a conventional approach.

  • Downlink Multihop Transmission Technique for Asymmetric Traffic Accommodation in DS-CDMA/FDD Cellular Communications

    Kazuo MORI  Katsuhiro NAITO  Hideo KOBAYASHI  

     
    PAPER

      Vol:
    E91-B No:10
      Page(s):
    3122-3131

    This paper proposes an asymmetric traffic accommodation scheme using a multihop transmission technique for CDMA/FDD cellular communication systems. The proposed scheme exploits the multihop transmission to downlink packet transmissions, which require the large transmission power at their single-hop transmissions, in order to increase the downlink capacity. In these multihop transmissions, vacant uplink band is used for the transmissions from relay stations to destination mobile stations, and this leads more capacity enhancement in the downlink communications. The relay route selection method and power control method for the multihop transmissions are also investigated in the proposed scheme. The proposed scheme is evaluated by computer simulation and the results show that the proposed scheme can achieve better system performance.

  • Gramian-Preserving Frequency Transformation for Linear Discrete-Time State-Space Systems

    Shunsuke KOSHITA  Satoru TANAKA  Masahide ABE  Masayuki KAWAMATA  

     
    PAPER-Systems and Control

      Vol:
    E91-A No:10
      Page(s):
    3014-3021

    This paper proposes the Gramian-preserving frequency transformation for linear discrete-time state-space systems. In this frequency transformation, we replace each delay element of a discrete-time system with an allpass system that has a balanced realization. This approach can generate transformed systems that have the same controllability/observability Gramians as those of the original system. From this result, we show that the Gramian-preserving frequency transformation gives us transformed systems with different magnitude characteristics, but with the same structural property with respect to the Gramians as that of the original system. This paper also presents a simple method for realization of the Gramian-preserving frequency transformation. This method makes use of the cascaded normalized lattice structure of allpass systems.

  • Balancing Uplink and Downlink under Asymmetric Traffic Environments Using Distributed Receive Antennas

    Illsoo SOHN  Byong Ok LEE  Kwang Bok LEE  

     
    PAPER

      Vol:
    E91-B No:10
      Page(s):
    3141-3148

    Recently, multimedia services are increasing with the widespread use of various wireless applications such as web browsers, real-time video, and interactive games, which results in traffic asymmetry between the uplink and downlink. Hence, time division duplex (TDD) systems which provide advantages in efficient bandwidth utilization under asymmetric traffic environments have become one of the most important issues in future mobile cellular systems. It is known that two types of intercell interference, referred to as crossed-slot interference, additionally arise in TDD systems; the performances of the uplink and downlink transmissions are degraded by BS-to-BS crossed-slot interference and MS-to-MS crossed-slot interference, respectively. The resulting performance unbalance between the uplink and downlink makes network deployment severely inefficient. Previous works have proposed intelligent time slot allocation algorithms to mitigate the crossed-slot interference problem. However, they require centralized control, which causes large signaling overhead in the network. In this paper, we propose to change the shape of the cellular structure itself. The conventional cellular structure is easily transformed into the proposed cellular structure with distributed receive antennas (DRAs). We set up statistical Markov chain traffic model and analyze the bit error performances of the conventional cellular structure and proposed cellular structure under asymmetric traffic environments. Numerical results show that the uplink and downlink performances of the proposed cellular structure become balanced with the proper number of DRAs and thus the proposed cellular structure is notably cost-effective in network deployment compared to the conventional cellular structure. As a result, extending the conventional cellular structure into the proposed cellular structure with DRAs is a remarkably cost-effective solution to support asymmetric traffic environments in future mobile cellular systems.

  • Space-Time Block Codes with Limited Feedback Using Antenna Grouping

    Chan-Byoung CHAE  Seijoon SHIM  Robert W. HEATH,Jr.  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E91-B No:10
      Page(s):
    3387-3390

    We propose an antenna grouping method that improves the error rate performance of space-time codes in a wide range of mobility environments. The idea is to group symbols to antennas based on limited feedback from the mobile station to utilize all antennas. Our approach requires only two bits of feedback information to achieve better link performance and full rate for a certain four transmit antenna system. Numerical results confirm the bit/frame error gains over the Alamouti-based space-time block code and antenna subset selection strategies.

  • S3: Smart Session Selection for Voice Communications in Next Generation Wireless Network

    Tein-Yaw CHUNG  Fong-Ching YUAN  Yung-Mu CHEN  Baw-Jhiune LIU  

     
    PAPER-Mobile Mulimedia Communication

      Vol:
    E91-A No:10
      Page(s):
    2995-3002

    Selecting transparently a proper network connection for voice communication will be a fundamental requirement in future multi-mode heterogeneous wireless network. This paper presented a smart session selection (S3) scheme to meet this requirement. Instead of selecting a best access network as in conventional Always Best Connected (ABC) paradigm, S3 enables users to select a best network connection, which consists of source and destination access network pair, to satisfy quality constraint and users' preference. To support S3, we develop a user profile to specify network connection priority. Meanwhile IP multimedia subsystem (IMS) is extended to make smart decision for users. Finally, Analytic Hierarchy Process (AHP) is used to recommend a network connection with assistance of user profile and IMS signaling. An example is illustrated to show that AHP can successfully select a good network connection that fulfills the requirement of users.

  • All Pairings Are in a Group

    Chang-An ZHAO  Fangguo ZHANG  Jiwu HUANG  

     
    LETTER-Cryptography and Information Security

      Vol:
    E91-A No:10
      Page(s):
    3084-3087

    In this paper, we suggest that all pairings are in a group from an abstract angle. Based on the results, some new pairings with the short Miller loop are constructed for great efficiency. It is possible that our observation can be applied into other aspects of pairing-based cryptosystems.

1241-1260hit(3183hit)