Kazuhiro KUDO Shigekazu KUNIYOSHI Hiroshi YAMAUCHI Masaaki IIZUKA Masatoshi SAKAI
We have fabricated printed active antenna for flexible information tag which have a loop antenna combined with step-edge vertical channel organic field-effect transistor (SVC-OFET). Fabrication using printing process, characterization of SVC-OFETs, and performances of active antenna elements are discussed in detail.
Hiroshi KIKUCHI Satoru YOSHIDA Takeshi MORIMOTO Tomoo USHIO Zenichiro KAWASAKI
We examine the relationship between 116 VHF sensor events recorded by the VHF sensor on the Maido-1 satellite and lightning strokes detected by the World Wide Lightning Location Network (WWLLN) to show that most of the VHF sensor events were caused by lightning discharges. For each VHF sensor event, the WWLLN events within 1400 km from the subsatellite point and within 1 sec, 30 sec, and 300 sec of the VHF sensor trigger time are analyzed. We find that the coincidence rates in the North and South American continents, and in Southeast/East Asia and the Australian continent are greater than 0.90. Those in the African and European continents, and in the Pacific and Atlantic Oceans are less than 0.61. These high enough coincidence rates indicate that the VHF sensor events were emitted from lightning, although the coincidence rates in the other regions are quite low because of the low detection efficiency of the WWLLN in the regions. We also focus on 6 coincident events measured by both the VHF sensor and the WWLLN. The incidence angles of the EM waves for the VHF sensor are estimated from the group delay characteristics of the recorded EM waveforms. Compared with the WWLLN lightning locations, the two incidence angles are temporally and spatially coincident. These results indicate that a large fraction of the VHF sensor events are emitted by lightning discharges.
Hung K. NGUYEN Peng CAO Xue-Xiang WANG Jun YANG Longxing SHI Min ZHU Leibo LIU Shaojun WEI
REMUS-II (REconfigurable MUltimedia System 2) is a coarse-grained dynamically reconfigurable computing system for multimedia and communication baseband processing. This paper proposes a real-time H.264 baseline profile encoder on REMUS-II. First, we propose an overall mapping flow for mapping algorithms onto the platform of REMUS-II system and then illustrate it by implementing the H.264 encoder. Second, parallel and pipelining techniques are considered for fully exploiting the abundant computing resources of REMUS-II, thus increasing total computing throughput and solving high computational complexity of H.264 encoder. Besides, some data-reuse schemes are also used to increase data-reuse ratio and therefore reduce the required data bandwidth. Third, we propose a scheduling scheme to manage run-time reconfiguration of the system. The scheduling is also responsible for synchronizing the data communication between tasks and handling conflict between hardware resources. Experimental results prove that the REMUS-MB (REMUS-II version for mobile applications) system can perform a real-time H.264/AVC baseline profile encoder. The encoder can encode CIF@30 fps video sequences with two reference frames and maximum search range of [-16,15]. The implementation, thereby, can be applied to handheld devices targeted at mobile multimedia applications. The platform of REMUS-MB system is designed and synthesized by using TSMC 65 nm low power technology. The die size of REMUS-MB is 13.97 mm2. REMUS-MB consumes, on average, about 100 mW while working at 166 MHz. To my knowledge, in the literature this is the first implementation of H.264 encoding algorithm on a coarse-grained dynamically reconfigurable computing system.
Xiangxu MENG Xiaodong WANG Xinye LIN
The GPS trajectory databases serve as bases for many intelligent applications that need to extract some trajectories for future processing or mining. When doing such tasks, spatio-temporal range queries based methods, which find all sub-trajectories within the given spatial extent and time interval, are commonly used. However, the history trajectory indexes of such methods suffer from two problems. First, temporal and spatial factors are not considered simutaneously, resulting in low performance when processing spatio-temporal queries. Second, the efficiency of indexes is sensitive to query size. The query performance changes dramatically as the query size changed. This paper proposes workload-aware Adaptive OcTree based Trajectory clustering Index (ATTI) aiming at optimizing trajectory storage and index performance. The contributions are three-folds. First, the distribution and time delay of the trajectory storage are introduced into the cost model of spatio-temporal range query; Second, the distribution of spatial division is dynamically adjusted based on GPS update workload; Third, the query workload adaptive mechanism is proposed based on virtual OcTree forest. A wide range of experiments are carried out over Microsoft GeoLife project dataset, and the results show that query delay of ATTI could be about 50% shorter than that of the nested index.
Kazuo SENDA Tsuyoshi MATSUDA Kuniaki TANAKA Hiroaki USUI
Fluoropolymer thin films were prepared by the ion-assisted vapor deposition polymerization (IAD) of 2-(perfluorohexyl)ethylacrylate (Rf-6). The adhesion strength of the film to substrates was estimated by sonicating the films in water and by immersing the films into dichloro-pentafluoro propane (HCFC225). The Rf-6 polymer films by IAD showed stronger adhesion to glass compared to a spin-coated Teflon AF film. The adhesion strength was improved with increasing ion energy Eion of IAD. The IAD films showed superior adhesion to PET surface compared to the glass substrate. The Rf-6 polymer film was effective as a single-layer antireflective coating. The refractive index of the film was 1.368 (λ = 546 nm), which increased slightly with increasing Eion. IAD can be a promising method to prepare fluoropolymer thin films due to the solvent-less process and the flexibility in controlling the film characteristics by the ion energy.
An automotive operating system is a typical safety-critical software and therefore requires extensive analysis w.r.t its effect on system safety. Our earlier work [1] reported a systematic model checking approach for checking the safety properties of the OSEK/VDX-based operating system Trampoline. This article reports further performance improvement using embeddedC constructs for efficient verification of the Trampoline model developed in the earlier work. Experiments show that the use of embeddedC constructs greatly reduces verification costs.
Hiroshi TAKENOUCHI Masataka TOKUMARU Noriaki MURANAKA
We present an Interactive Tabu Search (ITS) algorithm to reduce the evaluation load of Interactive Evolutionary Computation (IEC) users. Most previous IEC studies used an evaluation interface that required users to provide evaluation values for all candidate solutions. However, user's burden with such an evaluation interface is large. Therefore, we propose ITS where users choose the favorite candidate solution from the presented candidate solutions. Tabu Search (TS) is recognized as an optimization technique. ITS evaluation is simpler than Interactive Genetic Algorithm (IGA) evaluation, in which users provide evaluation values for all candidate solutions. Therefore, ITS is effective for reducing user evaluation load. We evaluated the performance of our proposed ITS and a Normal IGA (NIGA), which is a conventional 10-stage evaluation, using a numerical simulation with an evaluation agent that imitates human preferences (Kansei). In addition, we implemented an ITS evaluation for a running-shoes-design system and examined its effectiveness through an experiment with real users. The simulation results showed that the evolution performance of ITS is better than that of NIGA. In addition, we conducted an evaluation experiment with 21 subjects in their 20 s to assess the effectiveness of these methods. The results showed that the satisfaction levels for the candidates generated by ITS and NIGA were approximately equal. Moreover, it was easier for test subjects to evaluate candidate solutions with ITS than with NIGA.
Chunxiao JIANG Hongyang CHEN Peisen ZHAO Nengqiang HE Canfeng CHEN Yong REN
Among the cognitive radio technologies, cooperative spectrum sensing has been corroborated to be an effective approach to counter channel fading. Recent research about it is mainly with the assumption that secondary users (SUs) are synchronous with primary users (PUs). In this letter, we discuss the asynchronous situation for the first time, which means SUs have no idea about the communication time table of PUs' network. Based on the ON/OFF channel model, we derive the detection and false alarm probabilities, and the optimal sensing parameters under such asynchronous scenario. Simulation results are shown in the end.
Xu LI Kai LU Xiaoping WANG Bin DAI Xu ZHOU
Existing large-scale systems suffer from various hardware/software failures, motivating the research of fault-tolerance techniques. Checkpoint-restart techniques are widely applied fault-tolerance approaches, especially in scientific computing systems. However, the overhead of checkpoint largely influences the overall system performance. Recently, the emerging byte-addressable, persistent memory technologies, such as phase change memory (PCM), make it possible to implement checkpointing in arbitrary data granularity. However, the impact of data granularity on the checkpointing cost has not been fully addressed. In this paper, we investigate how data granularity influences the performance of a checkpoint system. Further, we design and implement a high-performance checkpoint system named AG-ckpt. AG-ckpt is a hybrid-granularity incremental checkpointing scheme through: (1) low-cost modified-memory detection and (2) fine-grained memory duplication. Moreover, we also formulize the performance-granularity relationship of checkpointing systems through a mathematical model, and further obtain the optimum solutions. We conduct the experiments through several typical benchmarks to verify the performance gain of our design. Compared to conventional incremental checkpoint, our results show that AG-ckpt can reduce checkpoint data amount up to 50% and provide a speedup of 1.2x-1.3x on checkpoint efficiency.
Kazunori HAYASHI Masaaki NAGAHARA Toshiyuki TANAKA
This survey provides a brief introduction to compressed sensing as well as several major algorithms to solve it and its various applications to communications systems. We firstly review linear simultaneous equations as ill-posed inverse problems, since the idea of compressed sensing could be best understood in the context of the linear equations. Then, we consider the problem of compressed sensing as an underdetermined linear system with a prior information that the true solution is sparse, and explain the sparse signal recovery based on
Joon-Young CHOI Hongju KIM Soonman KWON
We address the global asymptotic stability of FAST TCP, especially considering cross traffics, time-varying network feedback delay, and queuing delay dynamics at link. Exploiting the inherent dynamic property of FAST TCP, we construct two sequences that represent the lower and upper bound variations of the congestion window in time. By showing that the sequences converge to the equilibrium point of the congestion window, we establish that FAST TCP in itself is globally asymptotically stable without any specific conditions on the tuning parameter α or the update gain γ.
Yong-Ho LEE Hyukchan KWON Jin-Mok KIM Kiwoong KIM Kwon-Kyu YU In-Seon KIM Chan-Seok KANG Seong-Joo LEE Seong-Min HWANG Yong-Ki PARK
As sensitive magnetic sensors, magnetometers based on superconducting quantum interference devices can be used for the detection of weak magnetic fields. These signals can be generated by diverse origins, for example, brain electric activity, myocardium electric activity, and nuclear precession of hydrogen protons. In addition, weak current induced in the low-temperature detectors, for example, transition-edge sensors can be detected using SQUIDs. And, change of magnetic flux quantum generated in a superconducting ring can be detected by SQUID, which can be used for realization of mechanical force. Thus, SQUIDs are key elements in precision metrology. In Korea, development of low-temperature SQUIDs based on Nb-Josephson junctions was started in late 1980s, and Nb-based SQUIDs have been used mainly for biomagnetic measurements; magnetocardiography and magnetoencephalography. High-Tc SQUIDs, being developed in mid 1990s, were used for magnetocardiography and nondestructive evaluation. Recently, SQUID-based low-field nuclear magnetic resonance technology is under development. In this paper, we review the past progress and recent activity of SQUID applications in Korea, with focus on biomagnetic measurements.
Masayuki HIRATA Toshiki YOSHIMINE
Magnetoencephalography (MEG) measures very weak neuromagnetic signals using SQUID sensors. Standard MEG analyses include averaged waveforms, isofield maps and equivalent current dipoles. Beamforming MEG analyses provide us with frequency-dependent spatiotemporal information about the cerebral oscillatory changes related to not only somatosensory processing but also language processing. Language dominance is able to be evaluated using laterality of power attenuation in the low γ band in the frontal area. Neuromagnetic signals of the unilateral upper movements are able to be decoded using a support vector machine.
Toshiki YAMADA Takahiro KAJI Akira OTOMO
After brief introduction of our new microscope unit with an immersion objective and ionic liquid used as a refractive index matching medium, in this paper, we describe the studies on dipole orientation imaging of single molecules under high vacuum conditions as one of the important applications of our microscope.
Hirotoshi HONMA Kodai ABE Yoko NAKAJIMA Shigeru MASUYAMA
Let Gs=(Vs, Es) be a simple connected graph. A vertex v ∈ Vs is an articulation vertex if deletion of v and its incident edges from Gs disconnects the graph into at least two connected components. Finding all articulation vertices of a given graph is called the articulation vertex problem. A vertex u ∈ Vs is called a hinge vertex if there exist any two vertices x and y in Gs whose distance increase when u is removed. Finding all hinge vertices of a given graph is called the hinge vertex problem. These problems can be applied to improve the stability and robustness of communication network systems. In this paper, we propose linear time algorithms for the articulation vertex problem and the hinge vertex problem of circular permutation graphs.
Masashi KIYOMI Toshiki SAITOH Ryuhei UEHARA
PREIMAGE CONSTRUCTION problem by Kratsch and Hemaspaandra naturally arose from the famous graph reconstruction conjecture. It deals with the algorithmic aspects of the conjecture. We present an O(n8) time algorithm for PREIMAGE CONSTRUCTION on permutation graphs and an O(n4(n+m)) time algorithm for PREIMAGE CONSTRUCTION on distance-hereditary graphs, where n is the number of graphs in the input, and m is the number of edges in a preimage. Since each graph of the input has n-1 vertices and O(n2) edges, the input size is O(n3) (, or O(nm)). There are polynomial time isomorphism algorithms for permutation graphs and distance-hereditary graphs. However the number of permutation (distance-hereditary) graphs obtained by adding a vertex to a permutation (distance-hereditary) graph is generally exponentially large. Thus exhaustive checking of these graphs does not achieve any polynomial time algorithm. Therefore reducing the number of preimage candidates is the key point.
Yuichi ASAHIRO Hiroshi ETO Eiji MIYANO
Given a connected graph G = (V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED CONNECTED SUBGRAPH (r-MaxRICS) problem asks for a maximum sized subset of vertices S ⊆ V such that the induced subgraph G[S] on S is connected and r-regular. It is known that 2-MaxRICS and 3-MaxRICS are NP-hard. Moreover, 2-MaxRICS cannot be approximated within a factor of n1-ε in polynomial time for any ε > 0 unless P= NP. In this paper, we show that r-MaxRICS are NP-hard for any fixed integer r ≥ 4. Furthermore, we show that for any fixed integer r ≥ 3, r-MaxRICS cannot be approximated within a factor of n1/6-ε in polynomial time for any ε > 0 unless P= NP.
Dong-Ju KIM Sang-Heon LEE Myoung-Kyu SHON
This paper proposes a novel face recognition approach using a centralized gradient pattern image and image covariance-based facial feature extraction algorithms, i.e. a two-dimensional principal component analysis and an alternative two-dimensional principal component analysis. The centralized gradient pattern image is obtained by AND operation of a modified center-symmetric local binary pattern image and a modified local directional pattern image, and it is then utilized as input image for the facial feature extraction based on image covariance. To verify the proposed face recognition method, the performance evaluation was carried out using various recognition algorithms on the Yale B, the extended Yale B and the CMU-PIE illumination databases. From the experimental results, the proposed method showed the best recognition accuracy compared to different approaches, and we confirmed that the proposed approach is robust to illumination variation.
Mariko HIROKAWA Yoshimitsu KUROKI
PCA-L1 (principal component analysis based on L1-norm maximization) is an approximate solution of L1-PCA (PCA based on the L1-norm), and has robustness against outliers compared with traditional PCA. However, the more dimensions the feature space has, the more calculation time PCA-L1 consumes. This paper focuses on an initialization procedure of PCA-L1 algorithm, and proposes a fast method of PCA-L1 using Gram-Schmidt orthogonalization. Experimental results on face recognition show that the proposed method works faster than conventional PCA-L1 without decrease of recognition accuracy.