Masanobu ISHIKAWA Katsuhisa YAMANAKA Yota OTACHI Shin-ichi NAKANO
This paper presents an efficient algorithm to generate all (unordered) rooted trees with exactly n vertices including exactly k leaves. There are known results on efficient enumerations of some classes of graphs embedded on a plane, for instance, biconnected and triconnected triangulations [3],[6], and floorplans [4]. On the other hand, it is difficult to enumerate a class of graphs without a fixed embedding. The paper is on enumeration of rooted trees without a fixed embedding. We already proposed an algorithm to generate all “ordered” trees with n vertices including k leaves [11], while the algorithm cannot seem to efficiently generate all (unordered) rooted trees with n vertices including k leaves. We design a simple tree structure among such trees, then by traversing the tree structure we generate all such trees in constant time per tree in the worst case. By repeatedly applying the algorithm for each k=1,2, ...,n-1, we can also generate all rooted trees with exactly n vertices.
Biao WANG Wenming YANG Weifeng LI Qingmin LIAO
In the task of face recognition, a challenging issue is the one sample problem, namely, there is only one training sample per person. Principal component analysis (PCA) seeks a low-dimensional representation that maximizes the global scatter of the training samples, and thus is suitable for one sample problem. However, standard PCA is sensitive to the outliers and emphasizes more on the relatively distant sample pairs, which implies that the close samples belonging to different classes tend to be merged together. In this paper, we propose two-stage block-based whitened PCA (TS-BWPCA) to address this problem. For a specific probe image, in the first stage, we seek the K-Nearest Neighbors (K-NNs) in the whitened PCA space and thus exclude most of samples which are distant to the probe. In the second stage, we maximize the “local” scatter by performing whitened PCA on the K nearest samples, which could explore the most discriminative information for similar classes. Moreover, block-based scheme is incorporated to address the small sample problem. This two-stage process is actually a coarse-to-fine scheme that can maximize both global and local scatter, and thus overcomes the aforementioned shortcomings of PCA. Experimental results on FERET face database show that our proposed algorithm is better than several representative approaches.
Shelly SACHDEVA Daigo YAGINUMA Wanming CHU Subhash BHALLA
Large-scale adoption of electronic healthcare applications requires semantic interoperability. The new proposals propose an advanced (multi-level) DBMS architecture for repository services for health records of patients. These also require query interfaces at multiple levels and at the level of semi-skilled users. In this regard, a high-level user interface for querying the new form of standardized Electronic Health Records system has been examined in this study. It proposes a step-by-step graphical query interface to allow semi-skilled users to write queries. Its aim is to decrease user effort and communication ambiguities, and increase user friendliness.
Jin-Ping HE Guang-Da SU Jian-Sheng CHEN
To reconstruct low-resolution facial photographs which are in focus and without motion blur, a novel algorithm based on local similarity preserving is proposed. It is based on the theories of local manifold learning. The innovations of the new method include mixing point-based entropy and Euclidian distance to search for the nearest points, adding point-to-patch degradation model to restrict the linear weights and compensating the fusing patch to keep energy coherence. The compensation reduces the algorithm dependence on training sets and keeps the luminance of reconstruction constant. Experiments show that our method can effectively reconstruct 1612 images with the magnification of 88 and the 3224 facial photographs in focus and without motion blur.
Hiromi UEDA Keita HAMASAKI Takashi KURIYAMA Toshinori TSUBOI Hiroyuki KASAI
To realize economical optical burst signal receivers for the Optical Network Unit (ONU) of the Ethernet Optical Switched Access Network (E-OSAN), we previously implemented optical burst receivers with AC-coupling and DC-coupling using off-the-shelf components, and showed that the former offers better performance. This paper proposes a new optical burst signal receiver that uses the transfer function, Gn(s) = 1-Hn(s), where Hn(s) denotes a Bessel filter transfer function of order n. We also present a method for designing the proposed receiver and clarify that it has better performance than the conventional AC-coupling one. We then present an LCR circuit synthesis of Gn(s), which is necessary to actually implement a burst receiver based on the proposal.
ShuKai HU Chao CHEN Rong SUN XinMei WANG
Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j = 2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.
Given a collection of k sets consisting of a total of n points in the plane, the distance from any point in the plane to each of the sets is defined to be the minimum among distances to each point in the set. The farthest-color Voronoi diagram is defined as a generalized Voronoi diagram of the k sets with respect to the distance functions for each of the k sets. The combinatorial complexity of the diagram is known to be Θ(kn) in the worst case. This paper initiates a study on farthest-color Voronoi diagrams having O(n) complexity. We introduce a realistic model, which defines a certain class of the diagrams with desirable geometric properties observed. We finally show that the farthest-color Voronoi diagrams under the model have linear complexity.
Xinhai XU Xuejun YANG Yufei LIN
As supercomputers increase in size, the mean time between failures (MTBF) of a system becomes shorter, and the reliability problem of supercomputers becomes more and more serious. MPI is currently the de facto standard used to build high-performance applications, and researches on the fault tolerance methods of MPI are always hot topics. However, due to the characteristics of MPI programs, most current checkpointing methods for MPI programs need to modify the MPI library (even operating system), or implement a complicated protocol by logging lots of messages. In this paper, we carry forward the idea of Application-Level Checkpointing (ALC). Based on the general fact that programmers are familiar with the communication characteristics of applications, we have developed BC-ALC, a new portable blocking coordinated ALC for MPI programs. BC-ALC neither modifies the MPI library (even operating system) nor logs any message. It implements coordination only by the Barrier operations instead of any complicated protocol. Furthermore, in order to reduce the cost of fault-tolerance, we reduce the synchronization range of the barrier, and design WBC-ALC, a weak blocking coordinated ALC utilizing group synchronization instead of global synchronization based on the communication relationship between processes. We also propose a fault-tolerance framework developed on top of WBC-ALC and discuss an implementation of it. Experimental results on NPB3.3-MPI benchmarks validate BC-ALC and WBC-ALC, and show that compared with BC-ALC, the average coordination time and the average backup time of a single checkpoint in WBC-ALC are reduced by 44.5% and 5.7% respectively.
We use network coding based on coded cooperation for the Two-Way Relay channel, where two nodes communicate with each other assisted by a third, relay node. We consider the time-division two-way relay channel without power control, which means the two users and the relay use the same transmission power. Using the proposed network coding approach, channel codes are used at both users and network coding is used at the relay. It is shown via simulation that the proposed scheme provides substantial coding gain in fading channels.
We have developed a portable NIRS-based optical BCI system that features a non-invasive, facile probe attachment and does not require muscle movement to control the target devices. The system consists of a 2-channel probe, a signal-processing unit, and an infrared-emission device, which measures the blood volume change in the participant's prefrontal cortex in a real time. We use the threshold logic as a switching technology, which transmits a control signal to a target device when the electrical waveforms exceed the pre-defined threshold. Eight healthy volunteers participated in the experiments and they could change the television channel or control the movement of a toy robot with average switching times of 11.5 ± 5.3 s and the hit rate was 83.3%. These trials suggest that this system provides a novel communication aid for people with motor disabilities.
Keiichi HIROSE Tadatoshi BABASAKI
To develop the advanced and rich life, and the also economy and social activity continuously, various types of energy are necessary. At the same time, to protect the global environment and to prevent the depletion of natural resources, the effective and moreover efficient use of energy is becoming important. Electric power is one of the most important forms of energy for our life and society. This paper describes topics and survey results of technical trends regarding the electric power supply systems which are playing a core role as the important infrastructure to support the emergence of information-oriented society. Specifically, the power supply systems that enhance high power quality and reliability (PQR) are important for the steady growth of information and communication services. The direct current (DC) power, which has been used for telecommunications power systems and information and communications technologies (ICT), enables existing utilities' grid and distributed energy resources to keep a balance between supply and demand of small-scaled power systems or microgirds. These techniques are expected to be part of smartgrid technologies and facilitate the installation of distributed generators in mission critical facilities.
Xiaofeng LING Xinbao GONG Xiaogang ZANG Ronghong JIN
In this letter, an area-efficient architecture for the hardware implementation of the real-time prime factor Fourier transform (PFFT) is presented. In the proposed architecture, a prime length DFT module with the one-point-per-cycle (OPPC) property is implemented by the parallel distributed arithmetic (DA), and a cyclic convolution feature is exploited to simplify the structure of the DA cells. Based on the proposed architecture, a real-time 65-point PFFT processor is designed, and the synthesis results show that it saves over 8% gates compared to the existing real-time 64-point DFT designs.
Jian XIAO Jinguo ZHANG Min ZHU Jun YANG Longxing SHI
An AdaBoost-based face detection system is proposed, on a Coarse Grain Reconfigurable Architecture (CGRA) named “REMUS-II”. Our work is quite distinguished from previous ones in three aspects. First, a new hardware-software partition method is proposed and the whole face detection system is divided into several parallel tasks implemented on two Reconfigurable Processing Units (RPU) and one micro Processors Unit (µPU) according to their relationships. These tasks communicate with each other by a mailbox mechanism. Second, a strong classifier is treated as a smallest phase of the detection system, and every phase needs to be executed by these tasks in order. A phase of Haar classifier is dynamically mapped onto a Reconfigurable Cell Array (RCA) only when needed, and it's quite different from traditional Field Programmable Gate Array (FPGA) methods in which all the classifiers are fabricated statically. Third, optimized data and configuration word pre-fetch mechanisms are employed to improve the whole system performance. Implementation results show that our approach under 200 MHz clock rate can process up-to 17 frames per second on VGA size images, and the detection rate is over 95%. Our system consumes 194 mW, and the die size of fabricated chip is 23 mm2 using TSMC 65 nm standard cell based technology. To the best of our knowledge, this work is the first implementation of the cascade Haar classifier algorithm on a dynamically CGRA platform presented in the literature.
Seiichi ITABASHI Hidetaka NISHI Tai TSUCHIZAWA Toshifumi WATANABE Hiroyuki SHINOJIMA Rai KOU Koji YAMADA
Monolithic integration of various kinds of optical components on a silicon wafer is the key to making silicon (Si) photonics practical technology. Applying silicon photonics to telecommunications further requires low insertion loss and polarization independence. We propose an integration concept for telecommunications based on Si and related materials and demonstrate monolithic integration of passive and dynamic functional components. This article shows the great potential of Si photonics technology for telecommunications.
Naoki IKEDA Yoshimasa SUGIMOTO Masayuki OCHIAI Daijyu TSUYA Yasuo KOIDE Daisuke INOUE Atsushi MIURA Tsuyoshi NOMURA Hisayoshi FUJIKAWA Kazuo SATO
We investigated optical transmission characteristics of aluminum thin films with periodic hole arrays in sub-wavelength. We divided white light into several color spectra using a color filter based on the surface plasmon resonance (SPR) utilizing aluminum showing high plasma frequency. By optimizing a hole-array period, hole shape, polarization and index difference of two surface, transmittance of 30% and full-width at half-maximum of around 100 nm were achieved.
Qingyi GU Takeshi TAKAKI Idaku ISHII
We describe a cell-based connected component labeling algorithm to calculate the 0th and 1st moment features as the attributes for labeled regions. These can be used to indicate their sizes and positions for multi-object extraction. Based on the additivity in moment features, the cell-based labeling algorithm can label divided cells of a certain size in an image by scanning the image only once to obtain the moment features of the labeled regions with remarkably reduced computational complexity and memory consumption for labeling. Our algorithm is a simple-one-time-scan cell-based labeling algorithm, which is suitable for hardware and parallel implementation. We also compared it with conventional labeling algorithms. The experimental results showed that our algorithm is faster than conventional raster-scan labeling algorithms.
Yosuke TODO Yuki OZAWA Toshihiro OHIGASHI Masakatu MORII
In this paper, we propose two new falsification attacks against Wi-Fi Protected Access Temporal Key Integrity Protocol (WPA-TKIP). A previous realistic attack succeeds only for a network that supports IEEE 802.11e QoS features by both an access point (AP) and a client, and it has an execution time of 12–15 min, in which it recovers a message integrity code (MIC) key from an ARP packet. Our first attack reduces the execution time for recovering a MIC key. It can recover the MIC key within 7–8 min. Our second attack expands its targets that can be attacked. This attack focuses on a new vulnerability of QoS packet processing, and this vulnerability can remove the condition that the AP supports IEEE 802.11e. In addition, we discovered another vulnerability by which our attack succeeds under the condition that the chipset of the client supports IEEE 802.11e even if the client disables this standard through the OS. We demonstrate that chipsets developed by several kinds of vendors have the same vulnerability.
Kazumine OGURA Yohei NEMOTO Zhou SU Jiro KATTO
This paper focuses on RTT-fairness of multiple TCP flows over the Internet, and proposes a new TCP congestion control named “HRF (Hybrid RTT-Fair)-TCP”. Today, it is a serious problem that the flows having smaller RTT utilize more bandwidth than others when multiple flows having different RTT values compete in the same network. This means that a user with longer RTT may not be able to obtain sufficient bandwidth by the current methods. This RTT fairness issue has been discussed in many TCP papers. An example is CR (Constant Rate) algorithm, which achieves RTT-fairness by multiplying the square of RTT value in its window increment phase against TCP-Reno. However, the method halves its windows size same as TCP-Reno when a packet loss is detected. This makes worse its efficiency in certain network cases. On the other hand, recent proposed TCP versions essentially require throughput efficiency and TCP-friendliness with TCP-Reno. Therefore, we try to keep these advantages in our TCP design in addition to RTT-fairness. In this paper, we make intuitive analytical models in which we separate resource utilization processes into two cases: utilization of bottleneck link capacity and that of buffer space at the bottleneck link router. These models take into account three characteristic algorithms (Reno, Constant Rate, Constant Increase) in window increment phase where a sender receives an acknowledgement successfully. Their validity is proved by both simulations and implementations. From these analyses, we propose HRF-TCP which switches two modes according to observed RTT values and achieves RTT fairness. Experiments are carried out to validate the proposed method. Finally, HRF-TCP outperforms conventional methods in RTT-fairness, efficiency and friendliness with TCP-Reno.
Kiyoshi ASAKAWA Yoshimasa SUGIMOTO Naoki IKEDA Daiju TSUYA Yasuo KOIDE Yoshinori WATANABE Nobuhiko OZAKI Shunsuke OHKOUCHI Tsuyoshi NOMURA Daisuke INOUE Takayuki MATSUI Atsushi MIURA Hisayoshi FUJIKAWA Kazuo SATO
This paper reviews our recent activities on nanophotonics based on a photonic crystal (PC)/quantum dot (QD)-combined structure for an all-optical device and a metal/semiconductor composite structure using surface plasmon (SP) and negative refractive index material (NIM). The former structure contributes to an ultrafast signal processing component by virtue of new PC design and QD selective-area-growth technologies, while the latter provides a new RGB color filter with a high precision and optical beam-steering device with a wide steering angle.
Yuki KAWAKAMI Toshikazu HORI Mitoshi FUJIMOTO Ryo YAMAGUCHI Keizo CHO
This paper describes a metasurface designed utilizing either a Frequency Selective Surface (FSS) that has band-pass characteristics or one with band-rejection filtering characteristics in order to clarify the relationship between the filtering characteristics of the FSS and the Perfect Magnetic Conductor (PMC) characteristics of the metasurface. The effects of the filtering characteristics of the FSS on the PMC characteristics of the metasurface are described. Calculation results confirm that a low profile metasurface can be achieved using these FSSs. In addition, the effects of the size of the metasurface on the PMC characteristics of the surface are shown.