Recent progress in research on the finite element method (FEM) for optical waveguide design and analysis is reviewed, focusing on the author's works. After briefly reviewing fundamentals of FEM such as a theoretical framework, a conventional nodal element, a newly developed edge element to eliminate nonphysical, spurious solutions, and a perfectly matched layer to avoid undesirable reflections from computational window edges, various FEM techniques for a guided-mode analysis, a beam propagation analysis, and a waveguide discontinuity analysis are described. Some design examples are introduced, including current research activities on multi-core fibers.
Chengqian XU Xiuping PENG Kai LIU
A novel class of signal of perfect Gaussian integer sequence pairs are put forward in this paper. The constructions of obtaining perfect Gaussian integer sequence pairs of odd length by using Chinese remainder theorem as well as perfect Gaussian integer sequence pairs of even length by using complex transformation and interleaving techniques are presented. The constructed perfect Gaussian integer sequence pairs can not only expand the existence range of available perfect Gaussian integer sequences and perfect sequence pairs signals but also overcome the energy loss defects.
Ryo HARADA Yukio MITSUYAMA Masanori HASHIMOTO Takao ONOYE
This paper presents a measurement circuit structure for capturing SET pulse-width suppressing pulse-width modulation and within-die process variation effects. For mitigating pulse-width modulation while maintaining area efficiency, the proposed circuit uses massively parallelized short inverter chains as a target circuit. Moreover, for each inverter chain on each die, pulse-width calibration is performed. In measurements, narrow SET pulses ranging 5ps to 215ps were obtained. We confirm that an overestimation of pulse-width may happen when ignoring die-to-die and within-die variation of the measurement circuit. Our evaluation results thus point out that calibration for within-die variation in addition to die-to-die variation of the measurement circuit is indispensable.
Masashi TAKADA Akira FUKUSHIMA Yosuke TANIGAWA Hideki TODE
In conventional networks, service control function and network control function work independently. Therefore, stereotypical services are provided via fixed routes or selected routes in advance. Recently, advanced network services have been provided by assortment of distributed components at low cost. Furthermore, service platform, which unifies componentized network control and service control in order to provide advanced services with flexibility and stability, has attracted attention. In near future, network management system (NMS) is promising, which replies an answer quickly for such advanced service platforms when route setting is requested with some parameters: quality of service (QoS), source and destination addresses, cost (money) and so on. In addition, the NMS is required to provide routes exploiting functions such as path computation element (PCE) actually. This paper proposes scalable network architecture that can quickly reply an answer by pre-computing candidate routes when route setting is requested to a control unit like an Autonomous System (AS). Proposed architecture can manage network resources scalably, and answer the availability of the requested QoS-aware path settings instantaneously for the forthcoming service platform that finds an adequate combination of a server and a route. In the proposed method, hierarchical databases are established to manage the information related to optical network solution and their data are updated at fewer times by discretized states and their boundaries with some margin. Moreover, with multiple and overlapped overlay, it pre-computes multiple candidate routes with different characteristics like available bandwidth and the number of hops, latency, BER (bit error rate), before route set-up request comes. We present simulation results to verify the benefits of our proposed system. Then, we implement its prototype using OpenFlow, and evaluate its effectiveness in the experimental environment.
Han-Peng JIANG Ming-Lung WENG Wei-Mei CHEN
Now that the subject of green computing is receiving a lot of attention, the energy consumption of datacenters has emerged as a significant issue. Consolidation of Virtual Machines (VMs) reduces the energy consumption since VM live migration not only optimizes VM placement, but also switches idle nodes to sleep mode. However, VM migration may negatively impact the performance of the system and lead to violations in SLA (Service Level Agreement) requirements between end users and cloud providers. In this study, we propose a VM consolidation mechanism that reduces the energy consumption of datacenters, eliminates unnecessary migrations, and minimizes the SLA violations. Compared to previous studies, the proposed policy shows a reduction of 2% to 3% in energy consumption, 13% to 41% in VM migration frequency, and 15% to 50% in SLA violations.
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.
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.
Raissa RELATOR Yoshihiro HIROHASHI Eisuke ITO Tsuyoshi KATO
Classification tasks in computer vision and brain-computer interface research have presented several applications such as biometrics and cognitive training. However, like in any other discipline, determining suitable representation of data has been challenging, and recent approaches have deviated from the familiar form of one vector for each data sample. This paper considers a kernel between vector sets, the mean polynomial kernel, motivated by recent studies where data are approximated by linear subspaces, in particular, methods that were formulated on Grassmann manifolds. This kernel takes a more general approach given that it can also support input data that can be modeled as a vector sequence, and not necessarily requiring it to be a linear subspace. We discuss how the kernel can be associated with the Projection kernel, a Grassmann kernel. Experimental results using face image sequences and physiological signal data show that the mean polynomial kernel surpasses existing subspace-based methods on Grassmann manifolds in terms of predictive performance and efficiency.
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.
Xiangyu ZHANG Yangdong DENG Shuai MU
General purpose computing on GPU (GPGPU) has become a popular computing model for high-performance, data-intensive applications. Accordingly, there is a strong need to develop highly efficient data structures to ease the development of GPGPU applications. In this work, we proposed an efficient concurrent queue data structure for GPU computing. The GPU based provably correct, lock-free FIFO queue allows a massive number of concurrent producers and consumers. Warp-centric en-queue and de-queue procedures are introduced to better match the underlying Single-Instruction, Multiple-Thread execution model of modern GPUs. It outperforms the best previous GPU queues by up to 40 fold. The correctness of the proposed queue operations is formally validated by linearizability criteria.
Yukihiro TSUCHIDA Koichi MAEDA Ryuichi SUGIZAKI
We propose multi-core erbium-doped fiber amplifiers for next-generation optical amplifiers utilized by space-division multiplexing technologies. Multi-core erbium-doped fiber amplifiers were studied widely as a means for overcoming exponential growth of internet traffic in the backbone network. We consider two approaches to excitation of erbium irons; One is core-pumping scheme, the other is cladding-pumping scheme. For a core-pumping configuration, we evaluate its applicability to future ultra long-haul network. In addition, we demonstrate that cladding-pumping configuration will enable reduction of power consumption, size, and cost because one multimode pumping laser diode can excite several cores simultaneously embedded in a common cladding and amplify several signals passed through the multi-core erbium-doped fiber cores.
This letter proposes an efficient Two-stage Resource scheduling algorithm for cloud based Live Media Streaming system (TRLMS). It transforms the cloud-based resource scheduling problem to a min-cost flow problem in a graph, and solves it by an improved Successive Short Path (SSP) algorithm. Simulation results show that TRLMS can enhance user demand satisfaction by 17.1% than mean-based method, and its time complexity is much lower than original SSP algorithm.
Mohammad NASIR UDDIN Takaaki KIZU Yasuhiro HINOKUMA Kazuhiro TANABE Akio TAJIMA Kazutoshi KATO Kiichi HAMAMOTO
Laser diode capable of high speed direct modulation is one of the key solution for short distance applications due to their low power consumption, low cost and small size features. Realization of high modulation bandwidth for direct modulated laser maintaining the above mentioned feature is needed to enhance the short distance, low cost data transmission. One promising approach to enhance the modulation speed is to increase the photon density to achieve high modulation bandwidth. So to achieve this target, 1.55 $mu$m InGaAsP/InGaAsP multiple quantum well (MQW) asymmetric active multimode interferometer laser diode (active MMI-LD) has been demonstrated [1]. The split pumping concept has been applied for the active MMI-LD and significant enhancement of electrical to optical 3 dB down frequency bandwidth (f$_{mathrm{3dB}})$ up to 8 GHz has been successfully confirmed. The reported high bandwidth for split pump active MMI-LD is around 3.5 times higher than the previously reported maximum 3 dB bandwidth (2.3 GHz) of active MMI-LD without split pumping section. That shows, the splitted multimode pumping section behind the electrically isolated modulation section can potentially improve the modulation bandwidth of active MMI-LD. Clear and open eye diagram had also been confirmed for 2.5 Gbps, (2$^{mathrm{7}}$-1) pseudo random bit sequence (PRBS) modulation.
Erik D. DEMAINE Yoshio OKAMOTO Ryuhei UEHARA Yushi UNO
Shakashaka is a pencil-and-paper puzzle proposed by Guten and popularized by the Japanese publisher Nikoli (like Sudoku). We determine the computational complexity by proving that Shakashaka is NP-complete, and furthermore that counting the number of solutions is #P-complete. Next we formulate Shakashaka as an integer-programming (IP) problem, and show that an IP solver can solve every instance from Nikoli's website within a second.
Ryuichi HARASAWA Yutaka SUEYOSHI Aichi KUDO
In the paper [4], the authors generalized the Cipolla-Lehmer method [2][5] for computing square roots in finite fields to the case of r-th roots with r prime, and compared it with the Adleman-Manders-Miller method [1] from the experimental point of view. In this paper, we compare these two methods from the theoretical point of view.
Atsushi FUJIOKA Taiichi SAITO Keita XAGAWA
This paper proposes a generic construction of hierarchical identity-based identification (HIBI) protocols secure against impersonation under active and concurrent attacks in the standard model. The proposed construction converts a digital signature scheme existentially unforgeable against chosen message attacks, where the scheme has a protocol for showing possession of a signing key, not a signature. Our construction is based on the so-called certificate-based construction of hierarchical identity-based cryptosystems, and utilizes a variant of the well-known OR-proof technique to ensure the security against impersonation under active and concurrent attacks. We also present several concrete examples of our construction employing the Waters signature (EUROCRYPT 2005), and other signatures. As results, its concurrent security of each instantiation is proved under the computational Diffie-Hellman (CDH) assumption, the RSA assumption, or their variants in the standard model. Chin, Heng, and Goi proposed an HIBI protocol passively and concurrently secure under the CDH and one-more CDH assumption, respectively (FGIT-SecTech 2009). However, its security is proved in the random oracle model.
Jaeyoung LEE Hyundong SHIN Jun HEO
In this paper, we consider decouple-and-forward (DCF) relaying, where the relay encodes and amplifies decoupled data using orthogonal space-time block codes (OSTBCs), to achieve the maximum diversity gain of multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying. Since the channel status of all antennas is generally unknown and time-varying for cooperation in multi-antenna multiple-relay systems, we investigate an opportunistic relaying scheme for DCF relaying to harness distributed antennas and minimize the cooperation overheads by not using the global channel state information (CSI). In addition, for realistic wireless channels which have spatial fading correlation due to closely-spaced antenna configurations and poor scattering environments, we analyze the exact and lower bound on the symbol error probability (SEP) of the opportunistic DCF relaying over spatially correlated MIMO Rayleigh fading channels. Numerical results show that, even in the presence of spatial fading correlation, the proposed opportunistic relaying scheme is efficient and achieves additional performance gain with low overhead.
Atsushi FUJIOKA Eiichiro FUJISAKI Keita XAGAWA
We study non-malleability of multiple public-key encryption (ME) schemes. The main difference of ME from the threshold public-key encryption schemes is that there is no dealer to share a secret among users; each user can independently choose their own public-keys; and a sender can encrypt a message under ad-hoc multiple public keys of his choice. In this paper we tackle non-malleability of ME. We note that the prior works only consider confidentiality of messages and treat the case that all public keys are chosen by honest users. In the multiple public-key setting, however, some application naturally requires non-malleability of ciphertexts under multiple public keys including malicious users'. Therefore, we study the case and have obtained the following results:·We present three definitions of non-malleability of ME, simulation-based, comparison-based, and indistinguishability-based ones. These definitions can be seen as an analogue of those of non-malleable public-key encryption (PKE) schemes. Interestingly, our definitions are all equivalent even for the “invalid-allowing” relations. We note that the counterparts of PKE are not equivalent for the relations.·The previous strongest security notion for ME, “indistinguishability against strong chosen-ciphertext attacks (sMCCA)” [1], does not imply our notion of non-malleability against chosen-plaintext attacks.·Non-malleability of ME guarantees that the single message indistinguishability-based notion is equivalent to the multiple-message simulation-based notion, which provides designers a fundamental benefit.·We define new, stronger decryption robustness for ME. A non-malleable ME scheme is meaningful in practice if it also has the decryption robustness.·We present a constant ciphertext-size ME scheme (meaning that the length of a ciphertext is independent of the number of public-keys) that is secure in our strongest security notion of non-malleability. Indeed, the ciphertext overhead (i.e., the length of a ciphertext minus that of a plaintext) is the combined length of two group elements plus one hash value, regardless of the number of public keys. Then, the length of the partial decryption of one user consists of only two group elements, regardless of the length of the plaintext.
Tatsuya FUJIMOTO Tsunehiro YOSHINAGA Makoto SAKAMOTO
A cooperating system of finite automata (CS-FA) has more than one finite automata (FA's) and an input tape. These FA's operate independently on the input tape and can communicate with each other on the same cell of the input tape. For each k ≥ 1, let L[CS-1DFA(k)] (L[CS-1UFA(k)]) be the class of sets accepted by CS-FA's with k one-way deterministic finite automata (alternating finite automata with only universal states). We show that L[CS-1DFA(k+1)] - L[CS-1UFA(k)] ≠ ∅ and L[CS-1UFA(2)] - ∪1≤k<∞L[CS-1DFA(k)] ≠ ∅.
Rongchun LI Yong DOU Jie ZHOU Chen CHEN
The parallel interference cancellation (PIC) multiple input multiple output (MIMO) detection algorithm has bit error ratio (BER) performance comparable to the maximum likelihood (ML) algorithm but with complexity close to the simple linear detection algorithm such as zero forcing (ZF), minimum mean squared error (MMSE), and successive interference cancellation (SIC), etc. However, the throughput of PIC MIMO detector on central processing unit (CPU) cannot meet the requirement of wireless protocols. In order to reach the throughput required by the standards, the graphics processing unit (GPU) is exploited in this paper as the modem processor to accelerate the processing procedure of PIC MIMO detector. The parallelism of PIC algorithm is analyzed and the two-stage PIC detection is carefully developed to efficiently match the multi-core architecture. Several optimization methods are employed to enhance the throughput, such as the memory optimization and asynchronous data transfer. The experiment shows that our MIMO detector has excellent BER performance and the peak throughput is 337.84 Mega bits per second (Mbps), about 7x to 16x faster than that of CPU implementation with SSE2 optimization methods. The implemented MIMO detector has better computing throughput than recent GPU-based implementations.