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

Keyword Search Result

[Keyword] RIN(2923hit)

1161-1180hit(2923hit)

  • Potential Game Approach for Spectrum Sharing in Distributed Cognitive Radio Networks

    I Wayan MUSTIKA  Koji YAMAMOTO  Hidekazu MURATA  Susumu YOSHIDA  

     
    PAPER

      Vol:
    E93-B No:12
      Page(s):
    3284-3292

    In a spectrum sharing system, lower-priority users are allowed to spatially reuse the spectrum allocated to higher-priority users as long as they do not disrupt communications of the latter. Therefore, to improve spectrum utilization, an important requirement for the former users is to manage the interference and ensure that the latter users can maintain reliable communications. In the present paper, a game theoretic framework of joint channel selection and power allocation for spectrum sharing in distributed cognitive radio networks is proposed. First, a utility function that captures the cooperative behavior to manage the interference and the satisfaction level to improve the throughput of the lower-priority users is defined. Next, based on the defined utility function, the proposed framework can be formulated as a potential game; thus, it is guaranteed to converge to a Nash equilibrium when the best response dynamic is performed. Simulation results show the convergence of the proposed potential game and reveal that performance improvements in terms of network throughput of the lower-priority users and outage probability of the higher-priority users can be achieved by the introduction of an adaptive coefficient adjustment scheme in the proposed utility function at the expense of the convergence to the Nash equilibrium.

  • Delay Time Determination for the Timed Petri Net Model of a Signaling Pathway Based on Its Structural Information

    Yoshimasa MIWA  Yuki MURAKAMI  Qi-Wei GE  Chen LI  Hiroshi MATSUNO  Satoru MIYANO  

     
    PAPER

      Vol:
    E93-A No:12
      Page(s):
    2717-2729

    This paper proposes a method to incorporate the concept of time for the inclusion of dynamics of signaling pathway in a Petri net model, i.e., to use timed Petri nets. Incorporation of delay times into a Petri net model makes it possible to conduct quantitative evaluation on a target signaling pathway. However, experimental data describing detailed reactions are not available in most cases. An algorithm given in this paper determines delay times of a timed Petri net only from the structural information of it. The suitability of this algorithm has been confirmed by the results of an application to the IL-1 signaling pathway.

  • Numerical Analysis of DWDD Disk with Control Layer

    Toshiaki KITAMURA  Yuya MATSUNAMI  

     
    BRIEF PAPER-Storage Technology

      Vol:
    E93-C No:12
      Page(s):
    1713-1716

    Scattering characteristics of a domain wall displacement detection (DWDD) disk with a control layer were investigated by finite-difference time-domain (FDTD) analysis. DWDD is one of the high-density storage technologies of magneto-optical (MO) disks and the control layer is used to suppress ghost signals due to a rear process. The effects of the control layer on the scattering characteristics were studied.

  • Accuracy Enhancement of Grid-Based SSTA by Coefficient Interpolation

    Shinyu NINOMIYA  Masanori HASHIMOTO  

     
    PAPER-Device and Circuit Modeling and Analysis

      Vol:
    E93-A No:12
      Page(s):
    2441-2446

    Statistical timing analysis for manufacturing variability requires modeling of spatially-correlated variation. Common grid-based modeling for spatially-correlated variability involves a trade-off between accuracy and computational cost, especially for PCA (principal component analysis). This paper proposes to spatially interpolate variation coefficients for improving accuracy instead of fining spatial grids. Experimental results show that the spatial interpolation realizes a continuous expression of spatial correlation, and reduces the maximum error of timing estimates that originates from sparse spatial grids For attaining the same accuracy, the proposed interpolation reduced CPU time for PCA by 97.7% in a test case.

  • Iterative Source-Channel Decoding Using Symbol-Level Extrinsic Information

    Chun-Feng WU  Wen-Whei CHANG  

     
    PAPER-Fundamental Theories for Communications

      Vol:
    E93-B No:12
      Page(s):
    3555-3563

    Transmission of convolutionally encoded source-codec parameters over noisy channels can benefit from the turbo principle through iterative source-channel decoding. We first formulate a recursive implementation based on sectionalized code trellises for MAP symbol decoding of binary convolutional codes. Performance is further enhanced by the use of an interpolative softbit source decoder that takes into account the channel outputs within an interleaving block. Simulation results indicate that our proposed scheme allows to exchange between its constituent decoders the symbol-level extrinsic information and achieves high robustness against channel noises.

  • The Gaussian MIMO Broadcast Channel under Receive Power Protection Constraints Open Access

    Ian Dexter GARCIA  Kei SAKAGUCHI  Kiyomichi ARAKI  

     
    PAPER

      Vol:
    E93-B No:12
      Page(s):
    3448-3460

    A Gaussian MIMO broadcast channel (GMBC) models the MIMO transmission of Gaussian signals from a transmitter to one or more receivers. Its capacity region and different precoding schemes for it have been well investigated, especially for the case wherein there are only transmit power constraints. In this paper, a special case of GMBC is investigated, wherein receive power constraints are also included. By imposing receive power constraints, the model, called protected GMBC (PGMBC), can be applied to certain scenarios in spatial spectrum sharing, secretive communications, mesh networks and base station cooperation. The sum capacity, capacity region, and application examples for the PGMBC are discussed in this paper. Sub-optimum precoding algorithms are also proposed for the PGMBC, where standard user precoding techniques are performed over a BC with a modified channel, which we refer to as the "protection-implied BC." In the protection-implied BC, the receiver protection constraints have been implied in the channel, which means that by satisfying the transmit power constraints on the protection implied channel, receiver protection constraints are guaranteed to be met. Any standard single-user or multi-user MIMO precoding scheme may then be performed on the protection-implied channel. When SINR-matching duality-based precoding is applied on the protection-implied channel, sum-capacity under full protection constraints (zero receive power), and near-sum-capacity under partial protection constraints (limited non-zero receive power) are achieved, and were verified by simulations.

  • Automatic Communication Synthesis with Hardware Sharing for Multi-Processor SoC Design

    Yuki ANDO  Seiya SHIBATA  Shinya HONDA  Hiroyuki TOMIYAMA  Hiroaki TAKADA  

     
    PAPER-High-Level Synthesis and System-Level Design

      Vol:
    E93-A No:12
      Page(s):
    2509-2516

    We present a hardware sharing method for design space exploration of multi-processor embedded systems. In our prior work, we had developed a system-level design tool named SystemBuilder which automatically synthesizes target implementation of a system from a functional description. In this work, we have extended SystemBuilder so that it can automatically synthesize an area-efficient implementation which shares a hardware module among different applications. With SystemBuilder, designers only need to enable an option in order to share a hardware module. The designers, therefore, can easily explore a design space including hardware sharing in short time. A case study shows the effectiveness of the hardware sharing on design space exploration.

  • A Survey of the Origins and Evolution of the Microwave Circuit Devices in Japan from the 1920s up until 1945

    Tosiro KOGA  

     
    INVITED SURVEY PAPER

      Vol:
    E93-A No:12
      Page(s):
    2354-2370

    We edit in this paper several archives on the research and development in the field of microwave circuit technology in Japan, that originated with the invention of Yagi-Uda antenna in 1925, together with generally unknown historical topics in the period from the 1920s up until the end of World War II. As the main subject, we investigate the origin and evolution of the Multiply Split-Anode Magnetron, and clarify that the basic magnetron technology had been established until 1939 under the direction of Yoji Ito in cooperation of expert engineers between the Naval Technical Institute (NTI) and the Nihon Musen Co., while the Cavity Magnetron was invented by Shigeru Nakajima of the Nihon Musen Co. in May 1939, and further that physical theory of the Multiply Split-Anode Cavity Magnetron Oscillation and the design theory of the Cavity Magnetron were established in collaboration between the world-known physicists and the expert engineers at the NTI Shimada Laboratory in the wartime. In addition, we clarify that Sin-itiro Tomonaga presented the Scattering Matrix representation of Microwave Circuits, and others. The development mentioned above was carried out, in strict secrecy, in an unusual wartime situation up until 1945.

  • A Load-Balance Clustering Mechanism Based on Location-Control for Wireless Sensor and Actor Networks

    Erica C. RUIZ  Luis VILLASENOR-GONZALEZ  Jose R. GALLARDO  Adolfo ESPINOZA-RUIZ  

     
    LETTER-Network

      Vol:
    E93-B No:11
      Page(s):
    3152-3155

    Wireless Sensor and Actor Networks (WSAN) are commonly used to monitor physical parameters and execute opportune actions in response to specific events. In order to achieve this goal it is necessary to implement efficient coordination and cooperation among the network nodes (i.e. sensors and actors) with the aim of reducing the energy consumption and improving the response time of the system. This work propose a clustering mechanism that organizes the sensor nodes to form clusters where the mobile actors nodes in the WSAN perform the cluster head role. The proposal considers the mobility aspect of the actor nodes and implements a mechanism to dynamically change the geographical location of the actors while trying to reduce the load in terms of the number of sensors within each cluster, all this with the aim of extending the network lifetime.

  • A Study about Wireless Network Communication Performance at the Coastal Area for Underwater Monitoring Sensor Networks

    Kuniaki KAWABATA  Takafumi KOBAYASHI  Fumiaki TAKEMURA  Hideo SATO  Tsuyoshi SUZUKI  

     
    LETTER

      Vol:
    E93-B No:11
      Page(s):
    2956-2958

    This manuscript reported basic examination results of the wireless network communication performance at the coast. We consider that underwater environment condition monitoring is a sort of likely typical application for ubiquitous sensor networks. The result of the experiment shows the performance of the wireless network communication at the coastal area.

  • 3D Sound Rendering for Multiple Sound Sources Based on Fuzzy Clustering

    Masashi OKADA  Nobuyuki IWANAGA  Tomoya MATSUMURA  Takao ONOYE  Wataru KOBAYASHI  

     
    PAPER

      Vol:
    E93-A No:11
      Page(s):
    2163-2172

    In this paper, we propose a new 3D sound rendering method for multiple sound sources with limited computational resources. The method is based on fuzzy clustering, which achieves dual benefits of two general methods based on amplitude-panning and hard clustering. In embedded systems where the number of reproducible sound sources is restricted, the general methods suffer from localization errors and/or serious quality degradation, whereas the proposed method settles the problems by executing clustering-process and amplitude-panning simultaneously. Computational cost evaluation based on DSP implementation and subjective listening test have been performed to demonstrate the applicability for embedded systems and the effectiveness of the proposed method.

  • PAW: A Pattern-Aware Write Policy for a Flash Non-volatile Cache

    Young-Jin KIM  Jihong KIM  Jeong-Bae LEE  Kee-Wook RIM  

     
    PAPER-Software System

      Vol:
    E93-D No:11
      Page(s):
    3017-3026

    In disk-based storage systems, non-volatile write caches have been widely used to reduce write latency as well as to ensure data consistency at the level of a storage controller. Write cache policies should basically consider which data is important to cache and evict, and they should also take into account the real I/O features of a non-volatile device. However, existing work has mainly focused on improving basic cache operations, but has not considered the I/O cost of a non-volatile device properly. In this paper, we propose a pattern-aware write cache policy, PAW for a NAND flash memory in disk-based mobile storage systems. PAW is designed to face a mix of a number of sequential accesses and fewer non-sequential ones in mobile storage systems by redirecting the latter to a NAND flash memory and the former to a disk. In addition, PAW employs the synergistic effect of combining a pattern-aware write cache policy and an I/O clustering-based queuing method to strengthen the sequentiality with the aim of reducing the overall system I/O latency. For evaluations, we have built a practical hard disk simulator with a non-volatile cache of a NAND flash memory. Experimental results show that our policy significantly improves the overall I/O performance by reducing the overhead from a non-volatile cache considerably over a traditional one, achieving a high efficiency in energy consumption.

  • A Data Cleansing Method for Clustering Large-Scale Transaction Databases

    Woong-Kee LOH  Yang-Sae MOON  Jun-Gyu KANG  

     
    LETTER-Data Engineering, Web Information Systems

      Vol:
    E93-D No:11
      Page(s):
    3120-3123

    In this paper, we emphasize the need for data cleansing when clustering large-scale transaction databases and propose a new data cleansing method that improves clustering quality and performance. We evaluate our data cleansing method through a series of experiments. As a result, the clustering quality and performance were significantly improved by up to 165% and 330%, respectively.

  • Application of Compressive Projection Principal Component Analysis to MIMO Channel Feedback Scheme

    Chenhao QI  Lenan WU  

     
    LETTER

      Vol:
    E93-A No:11
      Page(s):
    2193-2195

    In this letter, we apply recently proposed compressive projection principal component analysis (CPPCA) for MIMO channel feedback. A novel scheme with compressed feedback and efficient reconstruction is presented. Simulation results based on 3GPP spatial channel model (SCM) demonstrate the scheme is beneficial for large-scale MIMO systems.

  • Improving Efficiency of Self-Configurable Autonomic Systems Using Clustered CBR Approach

    Malik Jahan KHAN  Mian Muhammad AWAIS  Shafay SHAMAIL  

     
    PAPER-Computer System

      Vol:
    E93-D No:11
      Page(s):
    3005-3016

    Inspired from natural self-managing behavior of the human body, autonomic systems promise to inject self-managing behavior in software systems. Such behavior enables self-configuration, self-healing, self-optimization and self-protection capabilities in software systems. Self-configuration is required in systems where efficiency is the key issue, such as real time execution environments. To solve self-configuration problems in autonomic systems, the use of various problem-solving techniques has been reported in the literature including case-based reasoning. The case-based reasoning approach exploits past experience that can be helpful in achieving autonomic capabilities. The learning process improves as more experience is added in the case-base in the form of cases. This results in a larger case-base. A larger case-base reduces the efficiency in terms of computational cost. To overcome this efficiency problem, this paper suggests to cluster the case-base, subsequent to find the solution of the reported problem. This approach reduces the search complexity by confining a new case to a relevant cluster in the case-base. Clustering the case-base is a one-time process and does not need to be repeated regularly. The proposed approach presented in this paper has been outlined in the form of a new clustered CBR framework. The proposed framework has been evaluated on a simulation of Autonomic Forest Fire Application (AFFA). This paper presents an outline of the simulated AFFA and results on three different clustering algorithms for clustering the case-base in the proposed framework. The comparison of performance of the conventional CBR approach and clustered CBR approach has been presented in terms of their Accuracy, Recall and Precision (ARP) and computational efficiency.

  • Autonomous Traffic Engineering for Boosting Application Fidelity in Wireless Sensor Networks

    Md. Abdur RAZZAQUE  Choong Seon HONG  Sungwon LEE  

     
    PAPER-Network

      Vol:
    E93-B No:11
      Page(s):
    2990-3003

    This paper presents an autonomous traffic engineering framework, named ATE, a highly efficient data dissemination mechanism for multipath data forwarding in Wireless Sensor Networks (WSNs). The proposed ATE has several salient features. First, ATE utilizes three coordinating schemes: an incipient congestion inference scheme, an accurate link quality estimation scheme and a dynamic traffic diversion scheme. It significantly minimizes packet drops due to congestion by dynamically and adaptively controlling the data traffic over congested nodes and/or poorer quality links, and by opportunistically exploiting under-utilized nodes for traffic diversion, while minimizing the estimation and measurement overhead. Second, ATE can provide with high application fidelity of the network even for increasing values of bit error rates and node failures. The proposed link quality estimation and congestion inference schemes are light weight and distributed, improving the energy efficiency of the network. Autonomous Traffic Engineering has been evaluated extensively via NS-2 simulations, and the results have shown that ATE provides a better performance with minimum overhead than those of existing approaches.

  • Novel Electrochromic Polymer for Electronic Paper Open Access

    Yoshiro KONDO  Hirofumi TANABE  Tomiaki OTAKE  

     
    INVITED PAPER

      Vol:
    E93-C No:11
      Page(s):
    1602-1606

    Electrochromic (EC) type e-paper is attracted with colorfulness and clearness. We have been researching and developing the material for EC type e-paper. We developed novel EC Polymers for e-paper. Our EC polymers are kinds of conductive polymers (CP). CP has some characteristics. One is electrochromism, and the other is electrochemical polymerization. Electrochromism of CP has a good memory effect. And electrochemical polymerization is suitable for printable electronics, for instance, ink-jet, screen print, and so on. Our EC polymers are comprised with thiophene derivatives and pi-conjugated X unit. To our knowledge, this thiophene derivatives are novel structure for EC polymers. These EC polymers have the electrochromic characteristic which change from coloration state to clear state. And we can adjust the color which we want by changing only X unit. And we made segment matrix EC display with our EC polymers by ink-jet printing. Our EC polymers are suitable for printable electronics, flexible substrate, and roll-to-roll process. We introduce our developing technologies.

  • Forward-Secure Group Signatures from Pairings

    Toru NAKANISHI  Yuta HIRA  Nobuo FUNABIKI  

     
    PAPER-Cryptography and Information Security

      Vol:
    E93-A No:11
      Page(s):
    2007-2016

    To reduce the damage of key exposures, forward-secure group signature schemes have been first proposed by Song. In the forward-secure schemes, a secret key of a group member is updated by a one-way function every interval and the previous secret key is erased. Thus, even if a secret key is exposed, the signatures produced by the secret keys of previous intervals remain secure. Since the previous forward-secure group signature schemes are based on the strong RSA assumption, the signatures are longer than pairing-based group signatures. In addition, the complexity of the key update or signing/verification is O(T), where T is the total number of intervals. In this paper, a forward-secure group signature scheme from pairings is proposed. The complexity of our key update and signing/verification is O(log T).

  • Dispersion of Nanoparticles in Liquid Crystals by Sputtering and Its Effect on the Electrooptic Properties Open Access

    Hiroyuki YOSHIDA  Kosuke KAWAMOTO  Yuma TANAKA  Hitoshi KUBO  Akihiko FUJII  Masanori OZAKI  

     
    INVITED PAPER

      Vol:
    E93-C No:11
      Page(s):
    1595-1601

    The authors describe a method to produce gold nanoparticle-dispersed liquid crystals by means of sputtering, and discuss how the presence of gold nanoparticles affect the electro-optic response of the host liquid crystal. The method exploits the fact that liquid crystals possess low vapor pressures which allow them to undergo the sputtering process, and the target material is sputtered directly on the liquid crystal in a reduced air pressure environment. The sample attained a red-brownish color after sputtering, but no aggregations were observed in the samples kept in the liquid crystal phase. Polarization optical microscopy of the sample placed in a conventional sandwich cell revealed that the phase transition behaviour is affected by the presence of the nanoparticles and that the onset of the nematic phase is observed in the form of bubble-like domains whereas in the pure sample the nematic phase appears after the passing of a phase transition front. Transmission electron microscopy confirmed the presence of single nano-sized particles that were dispersed without forming aggregates in the material. The electro-optic properties of the nanoparticle-dispersed liquid crystal was investigated by measuring the threshold voltage for a twisted-nematic cell. The threshold voltage was found to depend on the frequency of the applied rectangular voltage, and at frequencies higher than 200 Hz, the threshold became lower than the pure samples.

  • Implementation of a WSN-Based Structural Health Monitoring Architecture Using 3D and AR Mode

    Bonhyun KOO  Taeshik SHON  

     
    LETTER

      Vol:
    E93-B No:11
      Page(s):
    2963-2966

    Recently wireless sensor networks (WSN) has risen as one of the advanced candidate technologies in order to provide more efficient structure health monitoring (SHM) solution in construction sites. In this paper, we proposed WSN monitoring framework in building sites based on 3D visualization and Augmented Reality (AR) in mobile devices. The proposed system applies 3D visualization and AR technology to camera-enabled mobile devices in WSN environment in order to gather much more information than before. Based on the proposed system, we made an experiment to validate the effectiveness of 3D and AR mode using collected data in IEEE 802.15.4-based WSN.

1161-1180hit(2923hit)