Norihide KITAOKA Eichi SETO Ryota NISHIMURA
We have developed an adaptation method which allows the customization of example-based dialog systems for individual users by applying “plus” and “minus” operations to the distributed representations obtained using the word2vec method. After retrieving user-related profile information from the Web, named entity extraction is applied to the retrieval results. Words with a high term frequency-inverse document frequency (TF-IDF) score are then adopted as user related words. Next, we calculate the similarity between the distrubuted representations of selected user-related words and nouns in the existing example phrases, using word2vec embedding. We then generate phrases adapted to the user by substituting user-related words for highly similar words in the original example phrases. Word2vec also has a special property which allows the arithmetic operations “plus” and “minus” to be applied to distributed word representations. By applying these operations to words used in the original phrases, we are able to determine which user-related words can be used to replace the original words. The user-related words are then substituted to create customized example phrases. We evaluated the naturalness of the generated phrases and found that the system could generate natural phrases.
The test of homogeneity for normal mixtures has been used in various fields, but its theoretical understanding is limited because the parameter set for the null hypothesis corresponds to singular points in the parameter space. In this paper, we shed a light on this issue from a new perspective, variational Bayes, and offer a theory for testing homogeneity based on it. Conventional theory has not reveal the stochastic behavior of the variational free energy, which is necessary for constructing a hypothesis test, has remained unknown. We clarify it for the first time and construct a new test base on it. Numerical experiments show the validity of our results.
Kazuaki KONDO Takuto FUJIWARA Yuichi NAKAMURA
When using a gesture-based interface for pointing to targets on a wide screen, displaying a large pointer instead of a typical spot pattern reduces disturbance caused by measurement errors of user's pointing posture. However, it remains unclear why a large pointer helps facilitate easy pointing. To examine this issue, in this study we propose a mathematical model that formulates human pointing motions affected by a large pointer. Our idea is to describe the effect of the large pointer as human visual perception, because the user will perceive the pointer-target distance as being shorter than it actually is. We embedded this scheme, referred to as non-linear distance filter (NDF), into a typical feedback loop model designed to formulate human pointing motions. We also proposed a method to estimate NDF mapping from pointing trajectories, and used it to investigate the applicability of the model under three typical disturbance patterns: small vibration, smooth shift, and step signal. Experimental results demonstrated that the proposed NDF-based model could accurately reproduced actual pointing trajectories, achieving high similarity values of 0.89, 0.97, and 0.91 for the three respective disturbance patterns. The results indicate the applicability of the proposed method. In addition, we confirmed that the obtained NDF mappings suggested rationales for why a large pointer helps facilitate easy pointing.
Hanan T. Al-AWADHI Tomoki AONO Senling WANG Yoshinobu HIGAMI Hiroshi TAKAHASHI Hiroyuki IWATA Yoichi MAEDA Jun MATSUSHIMA
Multi-cycle Test looks promising a way to reduce the test application time of POST (Power-on Self-Test) for achieving a targeted high fault coverage specified by ISO26262 for testing automotive devices. In this paper, we first analyze the mechanism of Stuck-at Fault Detection Degradation problem in multi-cycle test. Based on the result of our analysis we propose a novel solution named FF-Control Point Insertion technique (FF-CPI) to achieve the reduction of scan-in patterns by multi-cycle test. The FF-CPI technique modifies the captured values of scan Flip-Flops (FFs) during capture operation by directly reversing the value of partial FFs or loading random vectors. The FF-CPI technique enhances the number of detectable stuck-at faults under the capture patterns. The experimental results of ISCAS89 and ITC99 benchmarks validated the effectiveness of FF-CPI technique in scan-in pattern reduction for POST.
Hiroyuki NISHIMUTA Daiki NOBAYASHI Takeshi IKENAGA
The communications quality of content delivery networks (CDNs), which are geographically distributed networks that have been optimized for content delivery, deteriorates when interflow congestion conditions are severe. Herein, we propose an adaptive server and path switching scheme that is based on the estimated acquisition throughput of each path. We also provide simulation results that show our proposed method can provide higher throughput performance levels than existing methods.
For low-density parity-check (LDPC) codes, the penalized decoding method based on the alternating direction method of multipliers (ADMM) can improve the decoding performance at low signal-to-noise ratios and also has low decoding complexity. There are three effective methods that could increase the ADMM penalized decoding speed, which are reducing the number of Euclidean projections in ADMM penalized decoding, designing an effective penalty function and selecting an appropriate layered scheduling strategy for message transmission. In order to further increase the ADMM penalized decoding speed, through reducing the number of Euclidean projections and using the vertical layered scheduling strategy, this paper designs a fast converging ADMM penalized decoding method based on the improved penalty function. Simulation results show that the proposed method not only improves the decoding performance but also reduces the average number of iterations and the average decoding time.
Liping ZHANG Zongqing LU Qingmin LIAO
This paper proposes a new and effective convolutional neural network model termed OFR-Net for optical flow refinement. The OFR-Net exploits the spatial correlation between images and optical flow fields. It adopts a pyramidal codec structure with residual connections, dense connections and skip connections within and between the encoder and decoder, to comprehensively fuse features of different scales, locally and globally. We also introduce a warp loss to restrict large displacement refinement errors. A series of experiments on the FlyingChairs and MPI Sintel datasets show that the OFR-Net can effectively refine the optical flow predicted by various methods.
Sugang XU Goshi SATO Masaki SHIRAIWA Katsuhiro TEMMA Yasunori OWADA Noboru YOSHIKANE Takehiro TSURITANI Toshiaki KURI Yoshinari AWAJI Naruto YONEMOTO Naoya WADA
Large-scale disasters can lead to a severe damage or destruction of optical transport networks including the data-plane (D-plane) and control and management-plane (C/M-plane). In addition to D-plane recovery, quick recovery of the C/M-plane network in modern software-defined networking (SDN)-based fiber optical networks is essential not only for emergency control of surviving optical network resources, but also for quick collection of information related to network damage/survivability to enable the optimal recovery plan to be decided as early as possible. With the advent of the Internet of Things (IoT) technologies, low energy consumption, and low-cost IoT devices have been more common. Corresponding long-distance networking technologies such as low-power wide-area (LPWA) and LPWA-based mesh (LPWA-mesh) networks promise wide coverage sensing and environment data collection capabilities. We are motivated to take an infrastructure-less IoT approach to provide long-distance, low-power and inexpensive wireless connectivity and create an emergency C/M-plane network for early disaster recovery. In this paper, we investigate the feasibility of fiber networks C/M-plane recovery using an IoT-based extremely narrow-band, and lossy links system (FRENLL). For the first time, we demonstrate a field-trial experiment of a long-latency/loss tolerable SDN C/M-plane that can take advantage of widely available IoT resources and easy-to-create wireless mesh networks to enable the timely recovery of the C/M-plane after disaster.
Daichi FURUBAYASHI Yuta KASHIWAGI Takanori SATO Tadashi KAWAI Akira ENOKIHARA Naokatsu YAMAMOTO Tetsuya KAWANISHI
A new structure of the electro-optic modulator to compensate the third-order intermodulation distortion (IMD3) is introduced. The modulator includes two Mach-Zehnder modulators (MZMs) operating with frequency chirp and the two modulated outputs are combined with an adequate phase difference. We revealed by theoretical analysis and numerical calculations that the IMD3 components in the receiver output could be selectively suppressed when the two MZMs operate with chirp parameters of opposite signs to each other. Spectral power of the IMD3 components in the proposed modulator was more than 15dB lower than that in a normal Mach-Zehnder modulator at modulation index between 0.15π and 0.25π rad. The IMD3 compensation properties of the proposed modulator was experimentally confirmed by using a dual parallel Mach-Zehnder modulator (DPMZM) structure. We designed and fabricated the modulator with the single-chip structure and the single-input operation by integrating with 180° hybrid coupler on the modulator substrate. Modulation signals were applied to each modulation electrode by the 180° hybrid coupler to set the chirp parameters of two MZMs of the DPMZM. The properties of the fabricated modulator were measured by using 10GHz two-tone signals. The performance of the IMD3 compensation agreed with that in the calculation. It was confirmed that the IMD3 compensation could be realized even by the fabricated modulator structure.
Takushi KAZAMA Takeshi UMEKI Yasuhiro OKAMURA Koji ENBUTSU Osamu TADANAGA Atsushi TAKADA Ryoichi KASAHARA
We evaluated the noise properties of a periodically poled lithium niobite phase-sensitive amplifier (PSA) using a phase-locked local oscillator as a pump generated by an optical phase-locked loop (OPLL-LO). To examine whether or not the LO pump generated by an OPLL degrades the noise figure (NF) of the PSA, we compared the noise levels of a PSA using an OPLL-LO with that of one using a master local oscillator (M-LO) that utilizes the master light itself as a pump in the electrical domain. With the OPLL, the phase-locked local light had almost the same frequency noise components as the master light. We observed almost the same output noise spectra for the OPLL-LO PSA and M-LO PSA and confirmed the absence of excess noise components in the OPLL-LO PSA in the 0.1 to 20-GHz range. The OPLL-LO PSA exhibited low-noise amplification with an average NF of 1.7-dB at a 23.2-dB gain within an input power range of -31 to -21dBm, which is a feasible input power for repeater amplifiers used in the optical signal transmission systems. We also investigated the influence of the noisy master light, which emulates the accumulation of optical noise from the amplifiers in the transmission system. The OPLL-LO PSA was highly tolerant to the optical noise because the difference in the NF was negligibly small within a master light OSNR range of 5 to 55dB. These results indicate that the OPLL-LO PSA will be useful as a low-noise repeater amplifier for the spectrally efficient large-capacity photonic networks of the future.
Ryo SHIBATA Gou HOSOYA Hiroyuki YASHIMA
For insertion and deletion channels, there are many coding schemes based on low-density parity-check (LDPC) codes, such as spatially coupled (SC) LDPC codes and concatenated codes of irregular LDPC codes and markers. However, most of the previous works have problems, such as poor finite-length performance and unrealistic settings for codeword lengths and decoding iterations. Moreover, when using markers, the decoder receives log-likelihood (LLR) messages with different statistics depending on code bit position. In this paper, we propose a novel concatenation scheme using protograph-based LDPC code and markers that offers excellent asymptotic/finite-length performance and a structure that controls the irregularity of LLR messages. We also present a density evolution analysis and a simple optimization procedure for the proposed concatenated coding scheme. For two decoding scenarios involving decoding complexity, both asymptotic decoding thresholds and finite-length performance demonstrate that the newly designed concatenated coding scheme outperforms the existing counterparts: the irregular LDPC code with markers, the SC-LDPC code, and the protograph LDPC code, which is optimized for an additive white Gaussian noise channel, with markers.
Teruaki SHIKUMA Yasuaki YUDA Kenichi HIGUCHI
We propose a novel non-orthogonal multiple access (NOMA)-based optimal multiplexing method for multiple downlink service channels to maximize the integrated system throughput. In the fifth generation (5G) mobile communication system, the support of various wireless communication services such as massive machine-type communications (mMTC), ultra-reliable low latency communications (URLLC), and enhanced mobile broadband (eMBB) is expected. These services will serve different numbers of terminals and have different requirements regarding the spectrum efficiency and fairness among terminals. Furthermore, different operators may have different policies regarding the overall spectrum efficiency and fairness among services. Therefore, efficient radio resource allocation is essential during the multiplexing of multiple downlink service channels considering these requirements. The proposed method achieves better system performance than the conventional orthogonal multiple access (OMA)-based multiplexing method thanks to the wider transmission bandwidth per terminal and inter-terminal interference cancellation using a successive interference canceller (SIC). Computer simulation results reveal that the effectiveness of the proposed method is especially significant when the system prioritizes the fairness among terminals (including fairness among services).
Masato TOMIYASU Keita MORIMOTO Akito IGUCHI Yasuhide TSUJI
In this paper, we reformulate a sensitivity analysis method for function-expansion-based topology optimization method without using gray area. In the conventional approach based on function expansion method, permittivity distribution contains gray materials, which are intermediate materials between core and cladding ones, so as to let the permittivity differentiable with respect to design variables. Since this approach using gray area dose not express material boundary exactly, it is not desirable to apply this approach to design problems of strongly guiding waveguide devices, especially for plasmonic waveguides. In this study, we present function-expansion-method-based topology optimization without gray area. In this approach, use of gray area can be avoided by replacing the area integral of the derivative of the matrix with the line integral taking into acount the rate of boundary deviation with respect to design variables. We verify the validity of our approach through applying it to design problems of a T-branching power splitter and a mode order converter.
Jun SHIBAYAMA Sumire TAKAHASHI Junji YAMAUCHI Hisamatsu NAKANO
A grating consisting of a periodic array of InSb-coated dielectric cylinders on a substrate is analyzed at THz frequencies using the frequency-dependent finite-difference time-domain method based on the trapezoidal recursive convolution technique. The transmission characteristics of an infinite periodic array are investigated not only at normal incidence but also at oblique incidence. The incident field is shown to be coupled to the substrate due to the guided-mode resonance (GMR), indicating the practical application of a grating coupler. For the sensor application, the frequency shift of the transmission dip is investigated with attention to the variation of the background refractive index. It is found that the shift of the dip involving the surface plasmon resonance is almost ten times as large as that of the dip only from the GMR. We finally analyze a finite periodic array of the cylinders. The field radiation from the array is discussed, when the field propagates through the substrate. It is shown that the radiation direction can be controlled with the frequency of the propagating field.
Masamune NOMURA Yuki NAKAMURA Hiroo TARAO Amane TAKEI
This paper describes the effectiveness of the geometric multi-grid method in a current density analysis using a numerical human body model. The scalar potential finite difference (SPFD) method is used as a numerical method for analyzing the current density inside a human body due to contact with charged objects in a low-frequency band, and research related to methods to solve faster large-scale simultaneous equations based on the SPFD method has been conducted. In previous research, the block incomplete Cholesky conjugate gradients (ICCG) method is proposed as an effective method to solve the simultaneous equations faster. However, even though the block ICCG method is used, many iterations are still needed. Therefore, in this study, we focus on the geometric multi-grid method as a method to solve the problem. We develop the geometric-multi-grid method and evaluate performances by comparing it with the block ICCG method in terms of computation time and the number of iterations. The results show that the number of iterations needed for the geometric multi-grid method is much less than that for the block ICCG method. In addition, the computation time is much shorter, depending on the number of threads and the number of coarse grids. Also, by using multi-color ordering, the parallel performance of the geometric multi-grid method can be greatly improved.
Ryosuke OZAKI Tomohiro KAGAWA Tsuneki YAMASAKI
In this paper, we analyzed the pulse responses of dispersion medium with periodically conducting strips by using a fast inversion Laplace transform (FILT) method combined with point matching method (PMM) for both the TM and TE cases. Specifically, we investigated the influence of the width and number of the conducting strips on the pulse response and distribution of the electric field.
Yosuke HINAKURA Hiroyuki ARAI Toshihiko BABA
A compact silicon photonic crystal waveguide (PCW) slow-light modulator is presented. The proposed modulator is capable of achieving a 64 Gbps bit-rate in a wide operating spectrum. The slow-light enhances the modulation efficiency in proportion to its group index ng. Two types of 200-µm-long PCW modulators are presented. These are low- and high-dispersion devices, which are implemented using a complementary metal-oxide-insulator process. The lattice-shifted PCW achieved low-dispersion slow-light and exhibited ng ≈ 20 with an operating spectrum Δλ ≈ 20 nm, in which the fluctuation of the extinction ratio is ±0.5 dB. The PCW device without the lattice shift exhibited high-dispersion, for which a large or small value of ng can be set on demand by changing the wavelength. It was found that for a large ng, the frequency response was degraded due to the electro-optic phase mismatch between the RF signals and slow-light even for such small-size modulators. Meander-line electrodes, which bypass and delay the RF signals to compensate for the phase mismatch, are proposed. A high cutoff frequency of 55 GHz was theoretically predicted, whereas the experimentally measured value was 38 GHz. A high-quality open eye pattern for a drive voltage of 1 V at 32 Gbps was observed. The clear eye pattern was maintained for 50-64 Gbps, although the drive voltage increased to 3.5-5.3 V. A preliminary operation of a 2-bits pulse amplitude modulation up to 100 Gbps was also attempted.
Ai YANAGIHARA Keita YAMAGUCHI Takashi GOH Kenya SUZUKI
We demonstrated a compact 16×16 multicast switch (MCS) made from a silica-based planar lightwave circuit (PLC). The switch utilizes a new electrical connection method based on surface mount technology (SMT). Five electrical connectors are soldered directly to the PLC by using the standard reflow process used for electrical devices. We reduced the chip size to half of one made with conventional wire bonding technology. We obtained satisfactory solder contacts and excellent switching properties. These results indicate that the proposed method is suitable for large-scale optical switches including MCSs, variable optical attenuators, dispersion compensators, and so on.
In recent years, deep neural network (DNN) has achieved considerable results on many artificial intelligence tasks, e.g. natural language processing. However, the computation complexity of DNN is extremely high. Furthermore, the performance of traditional von Neumann computing architecture has been slowing down due to the memory wall problem. Processing in memory (PIM), which places computation within memory and reduces the data movement, breaks the memory wall. ReRAM PIM is thought to be a available architecture for DNN accelerators. In this work, a novel design of ReRAM neuromorphic system is proposed to process DNN fully in array efficiently. The binary ReRAM array is composed of 2T2R storage cells and current mirror sense amplifiers. A dummy BL reference scheme is proposed for reference voltage generation. A binary DNN (BDNN) model is then constructed and optimized on MNIST dataset. The model reaches a validation accuracy of 96.33% and is deployed to the ReRAM PIM system. Co-design model optimization method between hardware device and software algorithm is proposed with the idea of utilizing hardware variance information as uncertainness in optimization procedure. This method is analyzed to achieve feasible hardware design and generalizable model. Deployed with such co-design model, ReRAM array processes DNN with high robustness against fabrication fluctuation.
Yasunori ISHIHARA Takashi HAYATA Toru FUJIWARA
This paper discusses a static analysis problem, called absolute consistency problem, for relational schema mappings. A given schema mapping is said to be absolutely consistent if every source instance has a corresponding target instance. Absolute consistency is an important property because it guarantees that data exchange never fails for any source instance. Originally, for XML schema mappings, the absolute consistency problem was defined and its complexity was investigated by Amano et al. However, as far as the authors know, there are no known results for relational schema mappings. In this paper, we focus on relational schema mappings such that both the source and the target schemas have functional dependencies, under the assumption that mapping rules are defined by constant-free tuple-generating dependencies. In this setting, we show that the absolute consistency problem is in coNP. We also show that it is solvable in polynomial time if the tuple-generating dependencies are full and the size of the left-hand side of each functional dependency is bounded by some constant. Finally, we show that the absolute consistency problem is coNP-hard even if the source schema has no functional dependency and the target schema has only one; or each of the source and the target schemas has only one functional dependency such that the size of the left-hand side of the functional dependency is at most two.