Jianjuan LIANG Bilan ZHU Taro KUMAGAI Masaki NAKAGAWA
The paper presents a recognition method of character-position-free on-line handwritten Japanese text patterns to allow a user to overlay characters freely without confirming previously written characters. To develop this method, we first collected text patterns written without wrist or elbow support and without visual feedback and then prepared large sets of character-position-free handwritten Japanese text patterns artificially from normally handwritten text patterns. The proposed method sets each off-stroke between real strokes as undecided and evaluates the segmentation probability by SVM model. Then, the optimal segmentation-recognition path can be effectively found by Viterbi search in the candidate lattice, combining the scores of character recognition, geometric features, linguistic context, as well as the segmentation scores by SVM classification. We test this method on variously overlaid sample patterns, as well as on the above-mentioned collected handwritten patterns, and verify that its recognition rates match those of the latest recognizer for normally handwritten horizontal Japanese text with no serious speed restriction in practical applications.
Kwangok KIM Hwanseok CHUNG Younseon JANG
We propose the cost-effective bit-level coarse wavelength division multiplexing (CWDM)-based power budget extender (PBEx) that can provide a high link budget of 54dB in a symmetric-rate 10-Gbit/s Ethernet passive optical network (10/10G-EPON). The proposed CWDM-based PBEx comprises a 2R-based 10/10G-EPON central office terminal (COT) and 3R-based 10/10G-EPON remote terminal (RT). It can apply several conventional CWDM technologies at the feeder fiber to reduce the amount of optical fiber required and increase the link capacity. Thus, it mainly conducts a wavelength conversion and signal retiming, as well as an upstream burst-mode for a continuous-mode conversion. We experimentally demonstrate the feasibility of a CWDM-based PBEx through packet-level testing using a pre-commercialized 10/10G-EPON system. We can confirm that the proposed solution can support a 128-way split at a distance of over 40km per CWDM channel with an enlarged loss budget of 54dB. We can also satisfy loss-free service during a packet transmission of 1010 both downstream and upstream.
Patchaikani SINDHUJA Yoshihiko KUWAHARA Kiyotaka KUMAKI Yoshiyuki HIRAMATSU
In this paper, a vehicular antenna design scheme that considers vehicular body effects is proposed. A wire antenna for the global positioning system (GPS) and long-term evolution (LTE) systems is implemented on a plastic plate and then mounted on a windshield of the vehicle. Common outputs are used to allow feed sharing. It is necessary to increase the GPS right-hand circularly polarization (RHCP) gain near the zenith and to reduce the axis ratio (AR). For LTE, we need to increase the horizontal polarization (HP) gain. In addition, for LTE, multiband characteristics are required. In order to achieve the specified performance, the antenna shape is optimized via a Pareto genetic algorithm (PGA). When an antenna is mounted on the body, antenna performance changes significantly. To evaluate the performance of an antenna with complex shape mounted on a windshield, a commercial electromagnetic simulator (Ansoft HFSS) is used. To apply electromagnetic results output by HFSS to the PGA algorithm operating in the MATLAB environment, a MATLAB-to-HFSS linking program via Visual BASIC (VB) script was used. It is difficult to carry out the electromagnetic analysis on the entire body because of the limitations of the calculating load and memory size. To overcome these limitations, we consider only that part of the vehicle's body that influences antenna performance. We show that a series of optimization steps can minimize the degradation caused by the vehicle`s body. The simulation results clearly show that it is well optimized at 1.575GHz for GPS, and 0.74 ∼ 0.79GHz and 2.11 ∼ 2.16GHz for LTE, respectively.
Iku OHAMA Hiromi IIDA Takuya KIDA Hiroki ARIMURA
Latent variable models for relational data enable us to extract the co-cluster structures underlying observed relational data. The Infinite Relational Model (IRM) is a well-known relational model for discovering co-cluster structures with an unknown number of clusters. The IRM assumes that the link probability between two objects (e.g., a customer and an item) depends only on their cluster assignment. However, relational models based on this assumption often lead us to extract many non-informative and unexpected clusters. This is because the underlying co-cluster structures in real-world relationships are often destroyed by structured noise that blurs the cluster structure stochastically depending on the pair of related objects. To overcome this problem, in this paper, we propose an extended IRM that simultaneously estimates denoised clear co-cluster structure and a structured noise component. In other words, our proposed model jointly estimates cluster assignment and noise level for each object. We also present posterior probabilities for running collapsed Gibbs sampling to infer the model. Experiments on real-world datasets show that our model extracts a clear co-cluster structure. Moreover, we confirm that the estimated noise levels enable us to extract representative objects for each cluster.
Xiuping PENG Jiadong REN Chengqian XU Kai LIU
In this letter, several new families of binary sequence pairs with period N=np, where p is a prime and gcd(n,p)=1, and optimal correlation values 1 and -3 are constructed. These classes of binary sequence pairs are based on Chinese remainder theorem. The constructed sequence pairs have optimum balance among 0's and 1's.
Chihiro TSUTAKE Yutaka NAKANO Toshiyuki YOSHIDA
This paper proposes a fast mode decision technique for intra prediction of High Efficiency Video Coding (HEVC) based on a reliability metric for motion vectors (RMMV). Since such a decision problem can be regarded as a kind of pattern classification, an efficient classifier is required for the reduction of computation complexity. This paper employs the RMMV as a classifier because the RMMV can efficiently categorize image blocks into flat(uniform), active, and edge blocks, and can estimate the direction of an edge block as well. A local search for angular modes is introduced to further speed up the decision process. An experiment shows the advantage of our technique over other techniques.
Yu WU Yuehong XIE Weiqin YING Xing XU Zixing LIU
A partitioning parallelization of the multi-objective evolutionary algorithm based on decomposition, pMOEA/D, is proposed in this letter to achieve significant time reductions for expensive bi-objective optimization problems (BOPs) on message-passing clusters. Each sub-population of pMOEA/D resides on a separate processor in a cluster and consists of a non-overlapping partition and some extra overlapping individuals for updating neighbors. Additionally, sub-populations cooperate across separate processors by the hybrid migration of elitist individuals and utopian points. Experimental results on two benchmark BOPs and the wireless sensor network layout problem indicate that pMOEA/D achieves satisfactory performance in terms of speedup and quality of solutions on message-passing clusters.
Nan JIANG Wenge RONG Baolin PENG Yifan NIE Zhang XIONG
One of the main research tasks in community question answering (cQA) is finding the most relevant questions for a given new query, thereby providing useful knowledge for users. The straightforward approach is to capitalize on textual features, or a bag-of-words (BoW) representation, to conduct the matching process between queries and questions. However, these approaches have a lexical gap issue which means that, if lexicon matching fails, they cannot model the semantic meaning. In addition, latent semantic models, like latent semantic analysis (LSA), attempt to map queries to its corresponding semantically similar questions through a lower dimension representation. But alas, LSA is a shallow and linear model that cannot model highly non-linear correlations in cQA. Moreover, both BoW and semantic oriented solutions utilize a single dictionary to represent the query, question, and answer in the same feature space. However, the correlations between them, as we observe from data, imply that they lie in entirely different feature spaces. In light of these observations, this paper proposes a tri-modal deep belief network (tri-DBN) to extract a unified representation for the query, question, and answer, with the hypothesis that they locate in three different feature spaces. Besides, we compare the unified representation extracted by our model with other representations using the Yahoo! Answers queries on the dataset. Finally, Experimental results reveal that the proposed model captures semantic meaning both within and between queries, questions, and answers. In addition, the results also suggest that the joint representation extracted via the proposed method can improve the performance of cQA archives searching.
Chooi-Ling GOH Shigetoshi NAKATAKE
Blood pressure measurement by auscultatory method is a compulsory skill that is required by all healthcare practitioners. During the measurement, they must concentrate on recognizing the Korotkoff sounds, looking at the sphygmomanometer scale, and constantly deflating the cuff pressure simultaneously. This complex operation is difficult for the new learners and they need a lot of practice with the supervisor in order to guide them on their measurements. However, the supervisor is not always available and consequently, they always face the problem of lack of enough training. In order to help them mastering the skill of measuring blood pressure by auscultatory method more efficiently and effectively, we propose using a sensor device to capture the signals of Korotkoff sounds and cuff pressure during the measurement, and display the signal changes on a visualization tool through wireless connection. At the end of the measurement, the learners can verify their skill on deflation speed and recognition of Korotkoff sounds using the graphical view, and compare their measurements with the machine instantly. By using this device, the new learners do not need to wait for their supervisor for training but can practice with their colleagues more frequently. As a result, they will be able to acquire the skill in a shorter time and be more confident with their measurements.
A cryptographic hash is an important tool in the area of a modern cryptography. It comprises a compression function, where the compression function can be built by a scratch or blockcipher. There are some familiar schemes of blockcipher compression function such as Weimar, Hirose, Tandem, Abreast, Nandi, ISA-09. Interestingly, the security proof of all the mentioned schemes are based on the ideal cipher model (ICM), which depends on ideal environment. Therefore, it is desired to use such a proof technique model, which is close to the real world such as weak cipher model (WCM). Hence, we proposed an (n, 2n) blockcipher compression function, which is secure under the ideal cipher model, weak cipher model and extended weak cipher model (ext.WCM). Additionally, the majority of the existing schemes need multiple key schedules, where the proposed scheme and the Hirose-DM follow single key scheduling property. The efficiency-rate of our scheme is r=1/2. Moreover, the number of blockcipher call of this scheme is 2 and it runs in parallel.
Jaehyun HWANG Cheol-Ho HONG Hyo-Joong SUH
This paper proposes a rate adjustment scheme for inbound data traffic on a virtualized host. Most prior studies on network virtualization have only focused on outbound traffic, yet many cloud applications rely on inbound traffic performance. The proposed scheme adjusts the inbound rates of virtual network interfaces dynamically in proportion to the bandwidth demands of the virtual machines.
Recently, Park and Lee suggested a new framework for realizing Identity-Based Encryption (IBE) trapdoor called ‘two-equation-revocation’, and proposed a new IBE system that makes use of a Map-To-Point hash function. In this paper, we present a variant of the PL system by giving a simple way to remove the Map-To-Point hash function from the PL system. Our variant is proven to be secure under non-standard security assumptions, which results in the degradation of security. Instead, our variant can have several efficiency advantages over the PL system: (1) it provides receiver's anonymity, (2) it has no correctness error, (3) it has shorter ciphertext, and (4) it has faster encryption. As a result, (when not considering security assumptions and security losses) our variant is as efficient as the Boneh-Boyen and Sakai-Kasahara IBE systems that are considered as being the most practical ones.
Yunlong ZHAN Yuzhang GU Xiaolin ZHANG Lei QU Jiatian PI Xiaoxia HUANG Yingguan WANG Jufeng LUO Yunzhou QIU
Cost aggregation is one of the most important steps in local stereo matching, while it is difficult to fulfill both accuracy and speed. In this letter, a novel cost aggregation, consisting of guidance image, fast aggregation function and simplified scan-line optimization, is developed. Experiments demonstrate that the proposed algorithm has competitive performance compared with the state-of-art aggregation methods on 32 Middlebury stereo datasets in both accuracy and speed.
Soongi HONG Yoonsik CHOE Yong-Goo KIM
In transcoding, it is well known that refinement of the motion vectors is critical to enhance the quality of transcoded video while significantly reducing transcoding complexity. This paper proposes a novel cost model to estimate the rate-distortion cost of motion vector composition in order to develop a reliable motion vector re-estimation method that has reasonable computation cost. Based on a statistical analysis of motion compensated prediction errors, we design a basic form of the proposed cost model as a function of distance from the optimal motion vector. Simulations with a transcoder employing the proposed cost model demonstrate a significant quality gain over representative video transcoding schemes with no complexity increase.
Morito OOMINE Hiroshi NAGAMOCHI
In the obnoxious facility game with a set of agents in a space, we wish to design a mechanism, a decision-making procedure that determines a location of an undesirable facility based on locations reported by the agents, where we do not know whether the location reported by an agent is where exactly the agent exists in the space. For a location of the facility, the benefit of each agent is defined to be the distance from the location of the facility to where the agent exists. Given a mechanism, all agents are informed of how the mechanism utilizes locations reported by the agents to determine a location of the facility before they report their locations. Some agent may try to manipulate the decision of the facility location by strategically misreporting her location. As a fair decision-making, mechanisms should be designed so that no particular group of agents can get a larger benefit by misreporting their locations. A mechanism is called group strategy-proof if no subset of agents can form a group such that every member of the group can increase her benefit by misreporting her location jointly with the rest of the group. For a given mechanism, a point in the space is called a candidate if it can be output as the location of the facility by the mechanism for some set of locations reported by agents. In this paper, we consider the case where a given space is a tree metric, and characterize the group strategy-proof mechanisms in terms of distribution of all candidates in the tree metric. We prove that there exists a group strategy-proof mechanism in the tree metric if and only if the tree has a point to which every candidate has the same distance.
Kazuhiro KOMORI Takeyoshi SUGAYA Takeru AMANO Keishiro GOSHIMA
In this study, our recent research activities on nanophotonic devices with semiconductor quantum nanostructures are reviewed. We have developed a technique for nanofabricating of high-quality and high-density semiconductor quantum dots (QDs). On the basis of this core technology, we have studied next-generation nanophotonic devices fabricated using high-quality QDs, including (1) a high-performance QD laser for long-wavelength optical communications, (2) high-efficiency compound-type solar cell structures, and (3) single-QD devices for future applications related to quantum information. These devices are expected to be used in high-speed optical communication systems, high-performance renewable energy systems, and future high-security quantum computation and communication systems.
David KOCIK Yuki HIRAI Keiichi KANEKO
This paper proposes an algorithm that solves the node-to-set disjoint paths problem in an n-Möbius cube in polynomial-order time of n. It also gives a proof of correctness of the algorithm as well as estimating the time complexity, O(n4), and the maximum path length, 2n-1. A computer experiment is conducted for n=1,2,...,31 to measure the average performance of the algorithm. The results show that the average time complexity is gradually approaching to O(n3) and that the maximum path lengths cannot be attained easily over the range of n in the experiment.