Takashi YAMAMOTO Shigemasa TAKAI
In this paper, we study conjunctive decentralized diagnosis of discrete event systems (DESs). In most existing works on decentralized diagnosis of DESs, it is implicitly assumed that diagnosis decisions of all local diagnosers are available to detect a failure. However, it may be possible that some local diagnosis decisions are not available, due to some reasons. Letting n be the number of local diagnosers, the notion of (n,k)-conjunctive codiagnosability guarantees that the occurrence of any failure is detected in the conjunctive architecture as long as at least k of the n local diagnosis decisions are available. We propose an algorithm for verifying (n,k)-conjunctive codiagnosability. To construct a reliable conjunctive decentralized diagnoser, we need to compute the delay bound within which the occurrence of any failure can be detected as long as at least k of the n local diagnosis decisions are available. We show how to compute the delay bound.
Takafumi TANAKA Masahiko JINNO
Many detailed studies ranging from networking to hardware as well as standardization activities over the last few years have advanced the performance of the elastic optical network. Thanks to these intensive works, the elastic optical network has been becoming feasible. This paper reviews the recent advances in the elastic optical network from the aspects of networking technology and hardware design. For the former, we focus on the efficient elastic network design technology related to routing and spectrum assignment (RSA) of elastic optical paths including network optimization or standardization activities, and for the latter, two key enabling technologies are discussed: elastic transponders/regenerators and gridless optical switches. Making closely-dependent networking and hardware technologies work synergistically is the key factor in implementing truly effective elastic optical networks.
This paper proposes a so called quasi-linear support vector machine (SVM), which is an SVM with a composite quasi-linear kernel. In the quasi-linear SVM model, the nonlinear separation hyperplane is approximated by multiple local linear models with interpolation. Instead of building multiple local SVM models separately, the quasi-linear SVM realizes the multi local linear model approach in the kernel level. That is, it is built exactly in the same way as a single SVM model, by composing a quasi-linear kernel. A guided partitioning method is proposed to obtain the local partitions for the composition of quasi-linear kernel function. Experiment results on artificial data and benchmark datasets show that the proposed method is effective and improves classification performances.
Woo Hyun AHN Joon-Woo CHOI Jaewon OH Seung-Ho LIM Kyungbaek KIM
Virtual memory systems page out a cluster of contiguous modified pages in virtual memory to a swap disk at one disk I/O but cannot find large clusters in applications mainly changing non-contiguous pages. Our proposal stores small clusters at one disk I/O. This decreases disk writes for paging out small clusters, thus improving page-out performance.
Masahiro NAKAGAWA Kyota HATTORI Naoki KIMISHIMA Masaru KATAYAMA Akira MISAWA
We are developing an optical layer-2 switch network that uses both wavelength-division multiplexing and time-division multiplexing technologies for efficient traffic aggregation in metro networks. For efficient traffic aggregation, path bandwidth control is key because it strongly affects bandwidth utilization efficiency. We propose a fast time-slot allocation method that uses hierarchical calculation, which divides the network-wide bandwidth-allocation problem into small-scale local bandwidth-allocation problems and solves them independently. This method has a much shorter computation complexity and enables dynamic path bandwidth control in large-scale networks. Our network will be able to efficiently accommodate dynamic traffic with limited resources by using the proposed method, leading to cost-effective metro networks.
Hiroaki KONOURA Takashi IMAGAWA Yukio MITSUYAMA Masanori HASHIMOTO Takao ONOYE
Fault tolerant methods using dynamically reconfigurable devices have been studied to overcome wear-out failures. However, quantitative comparisons have not been sufficiently assessed on device lifetime enhancement with these methods, whereas they have mainly been evaluated individually from various viewpoints such as additional hardware overheads, performance, and downtime for fault recovery. This paper presents quantitative lifetime evaluations performed by simulating the fault-avoidance procedures of five representative methods under the same conditions in wear-out scenarios, applications, and device architecture. The simulation results indicated that improvements of up to 70% mean-time-to-failure (MTTF) in comparison with ideal fault avoidance could be achieved by using methods of fault avoidance with ‘row direction shift’ and ‘dynamic partial reconfiguration’. ‘Column shift’, on the other hand, attained a high degree of stability with moderate improvements in MTTF. The experimental results also revealed that spare basic elements (BEs) should be prevented from aging so that improvements in MTTF would not be adversely affected. Moreover, we found that the selection of initial mappings guided by wire utilization could increase the lifetimes of partial reconfiguration based fault avoidance.
This paper covers new architectures, technologies, and performance benchmarking together with prospects for high productivity and high performance computing enabled by photonics. The exponential and sustained increases in computing and data center needs are driving the demands for exascale computing in the future. Power-efficient and parallel computing with balanced system design is essential for reaching that goal as should support ∼billion total concurrencies and ∼billion core interconnections with ∼exabyte/second bisection bandwidth. Photonic interconnects offer a disruptive technology solution that fundamentally changes the computing architectural design considerations. Optics provide ultra-high throughput, massive parallelism, minimal access latencies, and low power dissipation that remains independent of capacity and distance. In addition to the energy efficiency and many of the fundamental physical problems, optics will bring high productivity computing where programmers can ignore locality between billions of processors and memory where data resides. Repeaterless interconnection links across the entire computing system and all-to-all massively parallel interconnection switch will significantly transform not only the hardware aspects of computing but the way people program and harness the computing capability. This impacts programmability and productivity of computing. Benchmarking and optimization of the configuration of the computing system is very important. Practical and scalable deployment of photonic interconnected computing systems are likely to be aided by emergence of athermal silicon photonics and hybrid integration technologies.
Toshiyuki INOUE Toshiaki SUHARA
We fabricated high-quality domain-inverted MgO: LiNbO$_3$ structures with 3.0 and 2.0~$mu$m periods using applying votage to the corrugation electrode. We found that keeping the crystal temperature at 150$^{circ}$C for 12 hours before applying voltage was effective for obtaining good uniformity. We also demonstrated an application of the structures with 3.0~$mu$m period to electro-optic Bragg deflection modulator for the first time.
Kenta TAKASE Rie UEHARA Nobuo GOTO Shin-ichiro YANAGIYA
An optical flip-flop circuit with a single semiconductor optical amplifier (SOA) using two orthogonal polarization states is proposed. The optical set / reset input and output signals are at a single wavelength. The flip-flop circuit consists of an SOA, a polarization combiner, a polarization splitter, two directional couplers, and two phase shifters. No continuous light source is required to operate the circuit. In this paper, we theoretically analyze the operation performance. Polarization dependence in SOA is considered in the analysis at a single wavelength operation, and numerically simulated results are presented. We confirm that the flip-flop circuit with a feedback-loop length of 15~mm can be operated at switching time of around 3~ns by 1~ns set / reset pulses. The flip-flop performance is discussed from viewpoints of transient overshoot and contrast at the steady on-off states.
Tomotaka NAGASHIMA Takema SATOH Petre CATALIN Kazuyoshi ITOH Tsuyoshi KONISHI
We investigate resolution improvement in optical quantization with keeping high sampling rate performance in optical sampling. Since our optical quantization approach uses power-to-wavelength conversion based on soliton self-frequency shift, a spectral compression can improve resolution in exchange for sampling rate degradation. In this work, we propose a different approach for resolution improvement by parallel use of dispersion devices so as to avoid sampling rate degradation. Additional use of different dispersion devices can assist the wavelength separation ability of an original dispersion device. We demonstrate the principle of resolution improvement in 3 bit optical quantization. Simulation results based on experimental evaluation of 3 bit optical quantization system shows 4 bit optical quantization is achieved by parallel use of dispersion devices in 3 bit optical quantization system. The maximum differential non-linearity (DNL) and integral non-linearity (INL) are 0.49 least significant bit (LSB) and 0.50 LSB, respectively. The effective number of bits (ENOB) estimated to 3.62 bit.
Takaya MIYAZAWA Hideaki FURUKAWA Naoya WADA Hiroaki HARAI
We experimentally demonstrate an optical packet and circuit integrated (OPCI) ring network interoperated with a wavelength-switched optical network (WSON) in a network domain. OPCI network and WSON have distinct characteristics from each other: the methods to transfer path control messages and the protocols to set up or delete the optical connections in an optical circuit switch. To interoperate the two types of optical networks, we develop a common path control-plane which can establish or release an end-to-end path by only one autonomous distributed signaling process without stitching. In the common path control-plane, we modify the signaling protocol for OCS so that we can allocate a distinct wavelength to each link on an end-to-end path and also allocate a distinct path route to each of downstream and upstream directions in a bi-directional path. We experimentally show that the common path control-plane can dynamically establish end-to-end paths over the heterogeneous network including the two types of optical networks.
Song GAO Chunheng WANG Baihua XIAO Cunzhao SHI Wen ZHOU Zhong ZHANG
This paper tries to model spatial layout beyond the traditional spatial pyramid (SP) in the coding/pooling scheme for scene text character recognition. Specifically, we propose a novel method to build a dictionary called spatiality embedded dictionary (SED) in which each codeword represents a particular character stroke and is associated with a local response region. The promising results outperform other state-of-the-art algorithms.
In this invited paper, software defined network (SDN)-based approaches for future cost-effective optical mobile backhaul (MBH) networks are discussed, focusing on key principles, throughput optimization and dynamic service provisioning as its use cases. We propose a novel physical-layer aware throughput optimization algorithm that confirms > 100Mb/s end-to-end per-cell throughputs with ≥2.5Gb/s optical links deployed at legacy cell sites. We also demonstrate the first optical line terminal (OLT)-side optical Nyquist filtering of legacy 10G on-off-keying (OOK) signals, enabling dynamic >10Gb/s Orthogonal Frequency Domain Multiple Access (OFDMA) λ-overlays for MBH over passive optical network (PON) with 40-km transmission distances and 1:128 splitting ratios, without any ONU-side equipment upgrades. The software defined flexible optical access network architecture described in this paper is thus highly promising for future MBH networks.
Wei CHOON TAY Eng LEONG TAN Ding YU HEH
This paper presents a fundamental locally one-dimensional (FLOD) method for 3-D thermal simulation. We first propose a locally one-dimensional (LOD) method for heat transfer equation within general inhomogeneous media. The proposed LOD method is then cast into compact form and formulated into the FLOD method with operator-free right-hand-side (RHS), which leads to computationally efficient update equations. Memory storage requirements and boundary conditions for both FLOD and LOD methods are detailed and compared. Stability analysis by means of analyzing the eigenvalues of amplification matrix substantiates the stability of the FLOD method. Additionally, the potential instability of the Douglas Gunn (DG) alternating-direction-implicit (ADI) method for inhomogeneous media is demonstrated. Numerical experiments justify the gain achieved in the overall efficiency for FLOD over LOD, DG-ADI and explicit methods. Furthermore, the relative maximum error of the FLOD method illustrates good trade-off between accuracy and efficiency.
Ying YAN Xunwang ZHAO Yu ZHANG Changhong LIANG Zhewang MA
In this paper, a novel hybrid technique for analyzing complex antennas around the coated object is proposed, which is termed as “iterative vector fields with Physical Optics (PO)”. A closed box is used to enclose the antennas and the complex field vectors on the box' surfaces can then be obtained using Huygens principle. The equivalent electromagnetic currents on Huygens surfaces are computed by Higher-order Method of Moments (HOB-MoM) and the fields scattered from the coated object are calculated by PO method. In addition, the parallel technique based on Message Passing Interface (MPI) and Scalable Linear Algebra Package (ScaLAPACK) is employed so as to accelerate the computation. Numerical examples are presented to validate and to show the effectiveness of the proposed method on solving the practical engineering problem.
Ryota TAKASU Yoichi TOMIOKA Yutaro ISHIGAKI Ning LI Tsugimichi SHIBATA Mamoru NAKANISHI Hitoshi KITAZAWA
Electromagnetic field analysis is a time-consuming process, and a method involving the use of an FPGA accelerator is one of the attractive ways to accelerate the analysis; the other method involve the use of CPU and GPU. In this paper, we propose an FPGA accelerator dedicated for a two-dimensional finite-difference time-domain (FDTD) method. This accelerator is based on a two-dimensional single instruction multiple data (SIMD) array architecture. Each processing element (PE) is composed of a six-stage pipeline that is optimized for the FDTD method. Moreover, driving signal generation and impedance termination are also implemented in the hardware. We demonstrate that our accelerator is 11 times faster than existing FPGA accelerators and 9 times faster than parallel computing on the NVIDIA Tesla C2075. As an application of the high-speed FDTD accelerator, the design optimization of a waveguide is shown.
Shinichiro OHNUKI Kenichiro KOBAYASHI Seiya KISHIMOTO Tsuneki YAMASAKI
Electromagnetic scattering problems of canonical 2D structures can be analyzed with a high degree of accuracy by using the point matching method with mode expansion. In this paper, we will extend our previous method to 3D electromagnetic scattering problems and investigate the radar cross section of spherical shells and the computational accuracy.
Toru SEGAWA Wataru KOBAYASHI Tatsushi NAKAHARA Ryo TAKAHASHI
We describe wavelength-routed switching technology for 25-Gbit/s optical packets using a tunable transmitter that monolithically integrates a parallel-ring-resonator tunable laser and an InGaAlAs electro-absorption modulator (EAM). The transmitter provided accurate wavelength tunability with 100-GHz spacing and small output power variation. A 25-Gbit/s burst-mode optical-packet data was encoded onto the laser output by modulating the integrated EAM with a constant voltage swing of 2 V at 45$^{circ}$C. Clear eye openings were observed at the output of the 100 GHz-spaced arrayed-waveguide grating with error-free operation being achieved for all packets. The tunable transmitter is very promising for realizing a high-speed, large-port-count and energy-efficient wavelength-routing switch that enables the forwarding of 100-Gbit/s optical packets.
Gazi Mohammad SHARIF Quang NGUYEN-THE Motoharu MATSUURA Naoto KISHI
We demonstrate an all-optical non-return-to-zero differential phase shift keying (NRZ-DPSK) to return-to-zero differential phase shift keying (RZ-DPSK) format conversion with wavelength-shift-free and pulsewidth tunable operations by using a semiconductor optical amplifier (SOA)-based switch. An NRZ-DPSK signal is injected into the SOA-based switch with an RZ clock, and is converted to RZ-DPSK signal owing to the nonlinear effects inside the SOA. In this scheme, the wavelength of the converted RZ-DPSK signal is maintained as the original wavelength of the input NRZ-DPSK signal during the format conversion. Moreover, the pulsewidth of the converted signal is tunable in a wider operating range from 30 to 60 ps. The format conversion with pulsewidth tunability is based on cross-phase modulation (XPM) and cross-gain modulation (XGM) effects in the SOA. The clear eye diagrams, optical spectra and the bit-error-rate (BER) characteristics show high conversion performance with the wide pulsewidth tuning range. For all cases of the converted RZ-DPSK signal with different pulsewidths, the receiver sensitivities at a BER of 10$^{-9}$ for the converted RZ-DPSK signal were 0.7 to 1.5 dB higher than the receiver sensitivity of the input NRZ-DPSK signal.
Xin XIA Xiaozhen ZHOU David LO Xiaoqiong ZHAO Ye WANG
A build system converts source code, libraries and other data into executable programs by orchestrating the execution of compilers and other tools. The whole building process is managed by a software build system, such as Make, Ant, CMake, Maven, Scons, and QMake. Many studies have investigated bugs and fixes in several systems, but to our best knowledge, none focused on bugs in build systems. One significant feature of software build systems is that they should work on various platforms, i.e., various operating systems (e.g., Windows, Linux), various development environments (e.g., Eclipse, Visual Studio), and various programming languages (e.g., C, C++, Java, C#), so the study of software build systems deserves special consideration. In this paper, we perform an empirical study on bugs in software build systems. We analyze four software build systems, Ant, Maven, CMake and QMake, which are four typical and widely-used software build systems, and can be used to build Java, C, C++ systems. We investigate their bug database and code repositories, randomly sample a set of bug reports and their fixes (800 bugs reports totally, and 199, 250, 200, and 151 bug reports for Ant, Maven, CMake and QMake, respectively), and manually assign them into various categories. We find that 21.35% of the bugs belong to the external interface category, 18.23% of the bugs belong to the logic category, and 12.86% of the bugs belong to the configuration category. We also investigate the relationship between bug categories and bug severities, bug fixing time, and number of bug comments.