Hiroyuki SAKAI Shigeru MASUYAMA
We propose a method of assigning polarity to causal information extracted from Japanese financial articles concerning business performance of companies. Our method assigns polarity (positive or negative) to causal information in accordance with business performance, e.g. "zidousya no uriage ga koutyou: (Sales of cars are good)" (The polarity positive is assigned in this example). We may use causal expressions assigned polarity by our method, e.g., to analyze content of articles concerning business performance circumstantially. First, our method classifies articles concerning business performance into positive articles and negative articles. Using them, our method assigns polarity (positive or negative) to causal information extracted from the set of articles concerning business performance. Although our method needs training dataset for classifying articles concerning business performance into positive and negative ones, our method does not need a training dataset for assigning polarity to causal information. Hence, even if causal information not appearing in the training dataset for classifying articles concerning business performance into positive and negative ones exist, our method is able to assign it polarity by using statistical information of this classified sets of articles. We evaluated our method and confirmed that it attained 74.4% precision and 50.4% recall of assigning polarity positive, and 76.8% precision and 61.5% recall of assigning polarity negative, respectively.
Kenji SUGIYAMA Naoya SAGARA Yohei KASHIMURA
With DCT coding, block artifact and mosquito noise degradations appear in decoded pictures. The control of post filtering is important to reduce degradations without causing side effects. Decoding information is useful, if the filter is inside or close to the encoder; however, it is difficult to control with independent post filtering, such as in a display. In this case, control requires the estimation of the artifact from only the decoded picture. In this work, we describe an estimation method that determines the mosquito noise block and level. In this method, the ratio of spatial activity is taken between the mosquito block and the neighboring flat block. We test the proposed method using the reconstructed pictures which are coded with different quantization scales. We recognize that the results are mostly reasonable with the different quantizations.
Shinichiro MITO Jooyoung KIM Kwang Hyun CHUNG Hiroyuki TAKAGI Mitsuteru INOUE
We investigated an analogue modulation of magneto-optic spatial light modulator (MOSLM). For enhancement of the modulation from the voltage-driving MOSLM, magnetostriction and saturation magnetization of magnetic garnet films and piezoelectric constant of PZT films were investigated. The performance was expected to be improved by using Bismuth, Dysprosium and Aluminum substituted Yttrium Iron garnet, which effective magnetic field showed 20 times higher than Yttrium Iron garnet.
Nobuaki TOJO Nozomu TOGAWA Masao YANAGISAWA Tatsuo OHTSUKI
Recently, two-level cache, L1 cache and L2 cache, is commonly used in a processor. Particularly in an embedded system whereby a single application or a class of applications is repeatedly executed on a processor, its cache configuration can be customized such that an optimal one is achieved. An optimal two-level cache configuration can be obtained which minimizes overall memory access time or memory energy consumption by varying the three cache parameters: the number of sets, a line size, and an associativity, for L1 cache and L2 cache. In this paper, we first extend the L1 cache simulation algorithm so that we can explore two-level cache configuration. Second, we propose two-level cache design space exploration algorithms: CRCB-T1 and CRCB-T2, each of which is based on applying Cache Inclusion Property to two-level cache configuration. Each of the proposed algorithms realizes exact cache simulation but decreases the number of cache hit/miss judgments by a factor of several thousands. Experimental results show that, by using our approach, the number of cache hit/miss judgments required to optimize a cache configurations is reduced to 1/50-1/5500 compared to the exhaustive approach. As a result, our proposed approach totally runs an average of 1398.25 times faster compared to the exhaustive approach. Our proposed cache simulation approach achieves the world fastest two-level cache design space exploration.
Yanni ZHAO Jinian BIAN Shujun DENG Zhiqiu KONG Kang ZHAO
Despite the growing research effort in formal verification, industrial verification often relies on the constrained random simulation methodology, which is supported by constraint solvers as the stimulus generator integrated within simulator, especially for the large design with complex constraints nowadays. These stimulus generators need to be fast and well-distributed to maintain simulation performance. In this paper, we propose a dynamic method to guide stimulus generation by SAT solvers. An adjusting strategy named Tabu Search with Memory (TSwM) is integrated in the stimulus generator for the search and prune processes along with the constraint solver. Experimental results show that the method proposed in this paper could generate well-distributed stimuli with good performance.
In this paper, we propose an area-efficient design of Advanced Encryption Standard (AES) processor by applying a new common-expression-elimination (CSE) method to the sub-functions of various transformations required in AES. The proposed method reduces the area cost of realizing the sub-functions by extracting the common factors in the bit-level XOR/AND-based sum-of-product expressions of these sub-functions using a new CSE algorithm. Cell-based implementation results show that the AES processor with our proposed CSE method has significant area improvement compared with previous designs.
Toshihiro MATSUDA Shinsuke ISHIMARU Shingo NOHARA Hideyuki IWATA Kiyotaka KOMOKU Takayuki MORISHITA Takashi OHZONE
MOS capacitors with Si-implanted thermal oxide and CVD deposited oxide of 30 nm thickness were fabricated for applications of non-volatile memory and electroluminescence devices. Current-voltage (I-V) and I-V hysteresis characteristics were measured, and the hysteresis window (HW) and the integrated charge of HW (ICHW) extracted from the hysteresis data were discussed. The HW characteristics of high Si dose samples showed the asymmetrical double-peaks curves with the hump in both tails. The ICHW almost converged after the 4th cycle and had the voltage sweep speed dependence. All +ICHW and -ICHW characteristics were closely related to the static (+I)-(+VG) and (-I)-(-VG) curves, respectively. For the high Si dose samples, the clear hump currents in the static I-VG characteristics contribute to lower the rising voltage and to steepen the ICHW increase, which correspond to the large stored charge in the oxide.
In this paper, we demonstrate a 10.66 Gb/s bidirectional TDM over long-reach WDM hybrid PON supported by distributed Raman amplification, and the power budget margin is measured to be 15 dB for downstream transmission and 12 dB for upstream transmission, with dual Raman pump power of 300 mW.
Takehiko UNO Satoru NOGE Kei KASAHARA
We report Ultraviolet (UV)-induced visible light luminescence in artificial-lattice thin films of ion-doped silica glass (silica superstructure thin films). The film was composed of periodic nanometer layers of germanium-doped silica (Ge:SiO2), titanium-doped silica (Ti:SiO2), and tin-doped silica (Sn:SiO2). The thickness of each layer was between 10 and 30 nm. Despite the small thickness of the film (few microns), a relatively bright luminescence of white light was observed, along with cathode-ray luminescence in the superstructure film. In addition, irradiation of the superstructure film with UV light led to light amplification by stimulated emission at 405 nm. The experimental results suggest the potential application of silica superstructure thin films as optical amplifiers.
The hidden terminal problem leads to frequent collisions and decreases the throughput of ad hoc networks dramatically. Low network spatial reuse also results in fewer parallel transmissions, which further leads to reduced network throughput. Eliminating the hidden terminals and improving the spatial reuse are two important approaches to improving network throughput. In this paper, spatial distribution of the hidden terminals is analyzed in consideration of accumulated interference and environmental noise. As the distribution of hidden terminals is affected by many factors such as transmitter-receiver distance, SINR requirement and nodes density, it is inefficient to use fixed busy tone transmission power. To eliminate the hidden terminals and improve network spatial reuse, an enhancement to DBTMA named EDBTMA is proposed. This is achieved by using an adaptive busy tone power control scheme. Receivers adjust the transmission power of busy tone according to received signal power and accumulated interference adaptively so that all hidden terminals (and only hidden terminals) are covered by the busy tone. Simulation results show that EDBTMA protocol can solve the hidden terminal problem and improve network spatial reuse better than DBTMA and achieves 65% additional network throughput compared to DBTMA.
Yasuyuki KAWAMURA Akira MATSUBAYASHI
We study the online file allocation problem on ring networks. In this paper, we present a 7-competitive randomized algorithm against an adaptive online adversary on uniform cactus graphs. The algorithm is deterministic if the file size is 1. Moreover, we obtain lower bounds of 4.25 and 3.833 for a deterministic algorithm and a randomized algorithm against an adaptive online adversary, respectively, on ring networks.
Spectrum sensing is a key technology within Cognitive Radio (CR) systems. Cooperative spectrum sensing using a distributed model provides improved detection for the primary user, which opens the CR system to a new security threat. This threat is the decrease of the cooperative sensing performance due to the spectrum sensing data falsification which is generated from malicious users. Our proposed scheme, based on robust statistics, utilizes only available past sensing nodes' received power data for estimating the distribution parameters of the primary signal presence and absence hypotheses. These estimated parameters are used to perform the Dempster-Shafer theory of evidence data fusion which causes the elimination of malicious users. Furthermore, in order to enhance performance, a node's reliability weight is supplemented along with the data fusion scheme. Simulation results indicate that our proposed scheme can provide a powerful capability in eliminating malicious users as well as a high gain of data fusion under various cases of channel condition.
Fucai YU Soochang PARK Euisin LEE Younghwan CHOI Sang-Ha KIM
Geographic routing for wireless sensor networks requires a source that can encapsulate the location of a sink in each data packet. How a source can obtain the location of a sink with low overhead is a difficult issue. This letter proposes a Quorum Based Sink Location Service (QSLS) which can be exploited by most geographic routing protocols in arbitrary irregular wireless sensor networks.
Chee-Hyun PARK Kwang-Seok HONG
This letter proposes a new adaptive filtering method that uses the last L desired signal samples as an extra input vector, besides the existing input data, to reduce mean square error. We have improved the convergence rate by adopting the squared norm of the past error samples, in addition to the modified cost function. The modified variable error-data normalized step-size least mean square algorithm provides fast convergence, ensuring a small final misadjustment. Simulation results indicate its superior mean square error performance, while its convergence rate equals that of existing methods. In addition, the proposed algorithm shows superior tracking capability when the system is subjected to an abrupt disturbance.
Gi-Ho PARK Jung-Wook PARK Gunok JUNG Shin-Dug KIM
This paper presents a wordline gating logic for reducing unnecessary BTB accesses. Partial bit of the branch predictor was simultaneously recorded in the middle of BTB to prevent further SRAM operation. Experimental results with embedded applications showed that the proposed mechanism reduces around 38% of BTB power consumption.
Byung-Seo KIM Sung Won KIM Kook-Yeol YOO
Previous researches on ad-hoc networks did not consider the dynamic rate adaptation for wireless multicast. Instead, they statically use the lowest data rate for multicast transmission. The MAC protocol proposed in this paper utilizes the OFDMA mechanism, so that all members can report their rate preference at one time. As a result, the best rate for each member is dynamically selected.
Ya-Shih HUANG Yu-Ju HONG Juinn-Dar HUANG
In deep-submicron technology, several state-of-the-art architectural synthesis flows have already adopted the distributed register architecture to cope with the increasing wire delay by allowing multicycle communication. In this article, we regard communication synthesis targeting a refined regular distributed register architecture, named RDR-GRS, as a problem of simultaneous data transfer routing and scheduling for global interconnect resource minimization. We also present an innovative algorithm with regard of both spatial and temporal perspectives. It features both a concentration-oriented path router gathering wire-sharable data transfers and a channel-based time scheduler resolving contentions for wires in a channel, which are in spatial and temporal domain, respectively. The experimental results show that the proposed algorithm can significantly outperform existing related works.
Gia Khanh TRAN Kei SAKAGUCHI Fumie ONO Kiyomichi ARAKI
Infrastructure wireless mesh network has been attracting much attention due to the wide range of its application such as public wireless access, sensor network, etc. In recent years, researchers have shown that significant network throughput gain can be achieved by employing network coding in a wireless environment. For further improvement of network throughput in one dimensional (1D) topology, Ono et al. proposed to use multiple antenna technique combined with network coding. In this paper, being inspired by MIMO network coding in 1D topology, the authors establish a novel MIMO network coding algorithm for a 2D topology consisting of two crossing routes. In this algorithm, multiple network coded flows are spatially multiplexed. Owing to the efficient usage of radio resource of network coding and co-channel interference cancellation ability of MIMO, the proposed algorithm shows an 8-fold gain in network capacity compared to conventional methods in the best-case scenario.
Tatsuya ISHIMOTO Shinsuke HARA
For a group of wirelessly networked robots, called "a robot swarm," to accomplish a unified task as a group, it is necessary to generate a set of common coordinates among all member robots and to notify each member robot of its heading direction in the generated common coordinates. However, when the member robots are not equipped with sensors to identify their locations or bearings, they can use only a ranging capability based in the wireless communication protocol being used to network them as a tool to generate a set of common coordinates among them. This paper presents the detailed principles of a method for generating a set of common coordinates/heading direction for a robot swarm with only ranging capability which we have proposed so far. After showing the theoretical Cramer-Rao lower-bound on the location estimation error variance, we demonstrate several computer simulation results for the proposed method with Received Signal Strength Indication (RSSI)-based ranging.
Koichi ISHIHARA Takayuki KOBAYASHI Riichi KUDO Yasushi TAKATORI Akihide SANO Yutaka MIYAMOTO
In this paper, we use frequency-domain equalization (FDE) to create coherent optical single-carrier (CO-SC) transmission systems that are very tolerant of chromatic dispersion (CD) and polarization mode dispersion (PMD). The efficient transmission of a 25-Gb/s NRZ-QPSK signal by using the proposed FDE is demonstrated under severe CD and PMD conditions. We also discuss the principle of FDE and some techniques suitable for implementing CO-SC-FDE. The results show that a CO-SC-FDE system is very tolerant of CD and PMD and can achieve high transmission rates over single mode fiber without optical dispersion compensation.