This paper proposes a new algorithm for substring searching. Our algorithm is an improvement on the famous BM algorithm. When a mismatch happens while searching a substring (pattern), the BM algorithm will use two strategies to calculate shifting distances of the substring respectively and selects the larger one. In comparison, our algorithm uses each of the two strategies for their most suitable cases separately without a selection operation. Experimental results demonstrated that our algorithm is more efficient than the BM algorithm and the Quick Search algorithm, especially for binary strings and DNA strings.

Caching is considered widely as an efficient way to reduce access latency and network bandwidth consumption. En-route caching, where caches are associated with routing nodes in the network, is proposed in the context of Web cache to exploit fully the potential of caching. To make sensible replacement and placement decision for en-route caching, traditional caching schemes either engage computation-intensive algorithm like dynamic programming or suffer from inferior performance in terms of average access latency. In this article, we propose a new caching scheme with cost-based replacement and random placement, which is named CRRP. The cost-based replacement of CRRP introduces probing request to timely perceive cost change and the random placement is independent of current caching state, of O(1) computational complexity of placement decision. Through extensive simulations, we show that CRRP outperforms a wide range of caching schemes and is very close to the traditional dynamic-programming-based algorithm, in terms of average access delay.

In this paper, we propose a simple and efficient face representation feature that adopts the eigenfaces of Local Binary Pattern (LBP) space, referred to as the LBP eigenfaces, for robust face recognition. In the proposed method, LBP eigenfaces are generated by first mapping the original image space to the LBP space and then projecting the LBP space to the LBP eigenface subspace by Principal Component Analysis (PCA). Therefore, LBP eigenfaces capture both the local and global structures of face images. In the experiments, the proposed LBP eigenfaces are integrated into two types of classification methods, Nearest Neighbor (NN) and Collaborative Representation-based Classification (CRC). Experimental results indicate that the classification with the LBP eigenfaces outperforms that with the original eigenfaces and LBP histogram.

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.

This paper presents a comparative study of the number of pieces of optical transport equipment, network cost and power consumption depending on the transmission reach of the 400-Gb/s-based signal between flexible-bitrate networks using 100-Gb/s and 400-Gb/s signals and 100-Gb/s-based single-line-rate networks. In this study, we use three types of network topologies: a North American network topology, a European network topology and a Japan photonic network topology. As for the transmission reach of the 400-Gb/s-based signal, considering performance margins, different transmission reaches of the 400-Gb/s signal are assumed varying from 300km to 600km with 100-km increments. We show that the 100-Gb/s and 400-Gb/s-based flexible-bitrate networks are effective for cutting the total number of pieces of equipment and could be effective for reducing network cost and power consumption depending on the transmission reach of the 400-Gb/s signal in the case of a relatively small-scale network.

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.

Integrated InP polarization converters based on half-ridge structure are studied numerically. We demonstrate that the fabrication tolerance of the half-ridge structure can be extended significantly by introducing a slope at the ridge side and optimizing the thickness of the residual InGaAsP layer. High polarization conversion over 90% is achieved with the broad range of the waveguide width from 705 to 915~nm, corresponding to a factor-of-two or larger improvement in the fabrication tolerance compared with that of the conventional polarization converters. Finally we present a simple fabrication procedure of this newly proposed structure, where the thickness of the residual InGaAsP layer is controlled precisely by using a thin etch-stop layer.

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.

The paper presents ultra-high-capacity transmission technologies based on multi-core space-division-multiplexing. In order to realize high-capacity multi-core fiber (MCF) transmission, investigation of low crosstalk fiber and connection technology is important, and high-density signal generation using multilevel modulation and crosstalk management are also key technologies. 1Pb/s multi-core fiber transmission experiment using space-division-multiplexing is also described.

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.

Recently, there are many Japanese citizens living abroad in Asia, including developing countries. However, not many studies have been conducted regarding their mental health. The purpose of this study was to see what kinds of stress people experience when living abroad. Japanese workers living abroad, including some who are married to foreign nationals, and their families were asked seven questions in a survey, and they provided answers to questions in agreement with the intent and purpose of this study. Morphological analysis of the results and category classification by word class was carried out. This category was arranged by word classes. Additionally, the tendencies of responses were categorized according to the KJ method. In response to the question, “Do you have any trouble because of cultural differences?” these responses were classified according to common features. A fuzzy cluster analysis was carried out based on this information. Meaningful clusters were obtained by fuzzy cluster analysis. Differences in the values of stress and family culture can best be described by fuzzy cluster analysis.

In this paper, an accurate player tracking method in far-view soccer videos based on a composite energy function is presented. In far-view soccer videos, player tracking methods that perform processing based only on visual features cannot accurately track players since each player region becomes small, and video coding causes color bleeding between player regions and the soccer field. In order to solve this problem, the proposed method performs player tracking on the basis of the following three elements. First, we utilize visual features based on uniform colors and player shapes. Second, since soccer players play in such a way as to maintain a formation, which is a positional pattern of players, we use this characteristic for player tracking. Third, since the movement direction of each player tends to change smoothly in successive frames of soccer videos, we also focus on this characteristic. Then we adopt three energies: a potential energy based on visual features, an elastic energy based on formations and a movement direction-based energy. Finally, we define a composite energy function that consists of the above three energies and track players by minimizing this energy function. Consequently, the proposed method achieves accurate player tracking in far-view soccer videos.

In this paper we summarize the work conducted in our group in the area of E- and W-band optical high-capacity fiber-wireless links. We present performance evaluations of E- and W-band mm-wave signal generation using photonic frequency upconversion employing both VCSELs and ECLs, along with transmission over different type of optical fibers and for a number of values for the wireless link distance. Hybrid wireless-optical links can be composed of mature and resilient technology available off-the-shelf, and provide functionalities that can add value to optical access networks, specifically in mobile backhaul/fronthaul applications, dense distributed antenna systems and fiber-over-radio scenarios.

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.

In this paper, we propose a new encoding method applicable to any linear codes over arbitrary finite field whose computational complexity is O(δ*n) where δ* and n denote the maximum column weight of a parity check matrix of a code and the code length, respectively. This means that if a code has a parity check matrix with the constant maximum column weight, such as LDPC codes, it can be encoded with O(n) computation. We also clarify the relation between the proposed method and conventional methods, and compare the computational complexity of those methods. Then we show that the proposed encoding method is much more efficient than the conventional ones.

Software products are increasingly complex, so it is becoming more difficult to find and correct bugs in large programs. Software developers rely on bug reports to fix bugs; thus, bug-tracking tools have been introduced to allow developers to upload, manage, and comment on bug reports to guide corrective software maintenance. However, the very high frequency of duplicate bug reports means that the triagers who help software developers in eliminating bugs must allocate large amounts of time and effort to the identification and analysis of these bug reports. In addition, classifying bug reports can help triagers arrange bugs in categories for the fixers who have more experience for resolving historical bugs in the same category. Unfortunately, due to a large number of submitted bug reports every day, the manual classification for these bug reports increases the triagers' workload. To resolve these problems, in this study, we develop a novel technique for automatic duplicate detection and classification of bug reports, which reduces the time and effort consumed by triagers for bug fixing. Our novel technique uses a support vector machine to check whether a new bug report is a duplicate. The concept profile is also used to classify the bug reports into related categories in a taxonomic tree. Finally, we conduct experiments that demonstrate the feasibility of our proposed approach using bug reports extracted from the large-scale open source project Mozilla.

A new wavelength-selective optical modulator was proposed and discussed. The modulator consists of three kinds of distributed Bragg reflectors (DBRs) integrated in a single straight waveguide. The waveguide can guide TE$_0$ and TE$_1$ modes, and an in-line Michelson interferometer is constructed by the three DBRs. An operation-wavelength wave among incident wavelength-division-multiplexed TE$_1$ guided waves is split into TE$_0$ and TE$_1$ guided waves by one of DBRs, and combined by the same DBR to be TE$_0$ output wave with interference after one of waves is phase-modulated. A modulator using an electro-optic (EO) polymer is designed, and the static performance was predicted theoretically. An operation principle was confirmed experimentally by a prototype device utilizing a thermo-optic effect instead of the EO effect.

The past decade has witnessed a growing interest in vehicular networking. Initially motivated by traffic safety, vehicles equipped with computing, communication and sensing capabilities will be organized into ubiquitous and pervasive networks with a significant Internet presence while on the move. Large amount of data can be generated, collected, and processed on the vehicular networks. Big data on vehicular networks include useful and sensitive information which could be exploited by malicious intruders. But intrusion detection in vehicular networks is challenging because of its unique features of vehicular networks: short range wireless communication, large amount of nodes, and high mobility of nodes. Traditional methods are hard to detect intrusion in such sophisticated environment, especially when the attack pattern is unknown, therefore, it can result unacceptable false negative error rates. As a novel attempt, the main goal of this research is to apply data mining methodology to recognize known attacks and uncover unknown attacks in vehicular networks. We are the first to attempt to adapt data mining method for intrusion detection in vehicular networks. The main contributions include: 1) specially design a decentralized vehicle networks that provide scalable communication and data availability about network status; 2) applying two data mining models to show feasibility of automated intrusion detection system in vehicular networks; 3) find the detection patterns of unknown intrusions.

In this paper, the linear complexity and minimal polynomials of Legendre sequences over Fq have been calculated, where q = pm and p is a prime number. Our results show that Legendre sequences have high linear complexity over Fq for a large part of prime power number q so that they can resist the linear attack method.