Qiong WANG Mohamed EL-HADEDY Kevin SKADRON Ke WANG
Motif searching, i.e., identifying meaningful patterns from biological data, has been studied extensively due to its importance in the biomedical sciences. In this work, we seek to improve the performance of Weeder, a widely-used tool for automatic de novo motif searching. Weeder consists of several functions, among which we find that the function oligo_scan, which handles the pattern matching, is the bottleneck, especially when dealing with large datasets. Motivated by this observation, we adopt the Micron Automata Processor (AP) to accelerate the pattern-matching stage of Weeder. The AP is a massively-parallel, non-von-Neumann semiconductor architecture that is purpose-built for symbolic pattern matching. Relying on the fact that AP is capable of performing matching for thousands of patterns in parallel, we develop an AP-accelerated Weeder implementation in this work. In particular, we describe how to map Weeder's pattern matching to the AP chip and use the high-end FPGA on the AP board to postprocess the output from AP. Our experiment shows that the AP-accelerated Weeder achieves 751x speedup on pattern matching, compared to a single-threaded CPU implementation.
Takashi NAKADA Tomoki HATANAKA Hiroshi UEKI Masanori HAYASHIKOSHI Toru SHIMIZU Hiroshi NAKAMURA
Improving energy efficiency is critical for embedded systems in our rapidly evolving information society. Near real-time data processing tasks, such as multimedia streaming applications, exhibit a common fact that their deadline periods are longer than their input intervals due to buffering. In general, executing tasks at lower performance is more energy efficient. On the other hand, higher performance is necessary for huge tasks to meet their deadlines. To minimize the energy consumption while meeting deadlines strictly, adaptive task scheduling including dynamic performance mode selection is very important. In this work, we propose an energy efficient slack-based task scheduling algorithm for such tasks by adapting to task size variations and applying DVFS with the help of statistical analysis. We confirmed that our proposal can further reduce the energy consumption when compared to oracle frame-based scheduling.
Yuki YAMAGISHI Kazuo AOYAMA Kazumi SAITO Tetsuo IKEDA
This paper presents an efficient similarity search method utilizing as an index a complete binary tree (CBT) based on optimized pivots for a large-scale and high-dimensional data set. A similarity search method, in general, requires high-speed performance on both index construction off-line and similarity search itself online. To fulfill the requirement, we introduce novel techniques into an index construction and a similarity search algorithm in the proposed method for a range query. The index construction algorithm recursively employs the following two main functions, resulting in a CBT index. One is a pivot generation function that obtains one effective pivot at each node by efficiently maximizing a defined objective function. The other is a node bisection function that partitions a set of objects at a node into two almost equal-sized subsets based on the optimized pivot. The similarity search algorithm employs a three-stage process that narrows down candidate objects within a given range by pruning unnecessary branches and filtering objects in each stage. Experimental results on one million real image data set with high dimensionality demonstrate that the proposed method finds an exact solution for a range query at around one-quarter to half of the computational cost of one of the state-of-the-art methods, by using a CBT index constructed off-line at a reasonable computational cost.
Corentin JOUAULT Kazuhisa SETA Yuki HAYASHI
The purpose of this research is to support learners in self-directed learning on the Internet using automatically generated support using the current state of the semantic web. The main issue of creating meaningful content-dependent questions automatically is that it requires the machine to understand the concepts in the learning domain. The originality of this work is that it uses Linked Open Data (LOD) to enable meaningful content-dependent support in open learning space. Learners are supported by a learning environment, the Semantic Open Learning Space (SOLS). Learners use the system to build a concept map representing their knowledge. SOLS supports learners following the principle of inquiry-based learning. Learners that request help are provided with automatically generated questions that give them learning objectives. To verify whether the current system can support learners with fully automatically generated support, we evaluated the system with three objectives: judge whether the LOD based support was feasible and useful, whether the question support improved the development of historical considerations in the learners' mind and whether the engagement of learners was improved by the question support. The results showed that LOD based support was feasible. Learners felt that the support provided was useful and helped them learn. The question support succeeded in improving the development of learners' deep historical considerations. In addition, the engagement and interest in history of learners was improved by the questions. The results are meaningful because they show that LOD based question support can be a viable tool to support self-directed learning in open learning space.
Zhixian MA Jie ZHU Weitian LI Haiguang XU
Detection of cavities in X-ray astronomical images has become a field of interest, since the flourishing studies on black holes and the Active Galactic Nuclei (AGN). In this paper, an approach is proposed to detect cavities in X-ray astronomical images using our newly designed Granular Convolutional Neural Network (GCNN) based classifiers. The raw data are firstly preprocessed to obtain images of the observed objects, i.e., galaxies or galaxy clusters. In each image, pixels are classified into three categories, (1) the faint backgrounds (BKG), (2) the cavity regions (CAV), and (3) the bright central gas regions (CNT). And the sample sets are then generated by dividing large images into subimages with a window size according to the cavities' scale. Since the number of BKG samples are far more than the other types, to achieve balanced training sets, samples from the major class are split into subsets, i.e., granule. Then a group of three-convolutional-layer granular CNN networks without subsampling layers are designed as the classifiers, and trained with the labeled granular sample sets. Finally, the trained GCNN classifiers are applied to new observations, so as to estimate the cavity regions with a voting strategy and locate them with elliptical profiles on the raw observation images. Experiments and applications of our approach are demonstrated on 40 X-ray astronomical observations retrieved from chandra Data Archive (CDA). Comparisons among our approach, the β-model fitting and the Unsharp Masking (UM) methods were also performed, which prove our approach was more accurate and robust.
Jou-Ming CHANG Hung-Yi CHANG Hung-Lung WANG Kung-Jui PAI Jinn-Shyong YANG
Given a graph G, a set of spanning trees of G are completely independent spanning trees (CISTs for short) if for any vertices x and y, the paths connecting them on these trees have neither vertex nor edge in common, except x and y. Hasunuma (2001, 2002) first introduced the concept of CISTs and conjectured that there are k CISTs in any 2k-connected graph. Later on, this conjecture was unfortunately disproved by Péterfalvi (2012). In this note, we show that Hasunuma's conjecture holds for graphs restricted in the class of 4-regular chordal rings CR(n,d), where both n and d are even integers.
Haruki MIYAGAWA Junya SEKIKAWA
Arc runners are fixed on silver electrical contacts. Break arcs are generated between the contacts in a 450VDC circuit. Break arcs are magnetically blown-out and air is blown to the break arcs. The air flow was not used to our previous reports with runners. Circuit current when contacts are closed is 10A. Flow rate of air Q is changed from 1 to 10L/min. Supply voltage E is changed from 200V to 450V. The following results are shown. Arc duration D tends to decrease with increasing flow rate Q. The number of reignitions N increases with increasing supply voltage E for each flow rate Q. The number of reignitions is the least when the flow rate Q is 2L/min.
Break arcs are rotated with a radial magnetic field formed by a permanent magnet embedded in a fixed contact. The break arcs are generated in a 48VDC resistive circuit. The circuit current is 10A when the contacts are closed. The polarity of the fixed contact in which the magnet is embedded is changed. The rotational radius and the difference of position between the cathode and anode spots are investigated. The following results are obtained. The cathode spot is moved more easily than the anode spot by the radial magnetic field. The rotational radius of the break arcs is affected by the Lorentz force that is caused by the circumferential component of the arc current and the axial component of the magnetic field. The circumferential component of the arc current is caused by the difference of the positions of the rotating cathode and anode spots.
This paper presents a low-latency, low-cost architecture for computing square and cube roots in the fixed-point format. The proposed architecture is designed based on a non-iterative root calculation scheme to achieve fast computations. While previous non-iterative root calculators are restricted to a square-root operation due to the limitation of their mathematical property, the root computation is generalized in this paper to apply an approximation method to the non-iterative scheme. On top of that, a recurrent method is proposed to select parameters, which enables us to reduce the table size while keeping the maximum relative error value low. Consequently, the proposed root calculator can support both square and cube roots at the expense of small delay and low area overheads. This extension can be generalized to compute the nth roots, where n is a positive integer.
Toshinori TSUBOI Tomohiro TANIGUCHI Tetsuya YOKOTANI
This paper describes optical access networks focusing on passive optical network (PON) technologies from a technical point of view. Optical access networks have been applied to fiber-to-the-home as a driving force of broadband services and their use will continue growing in the near future. They will be applied as an aggregate component of broadband wireless networks. This paper also addresses solutions for their application.
Eiji OKI Naoya WADA Satoru OKAMOTO Naoaki YAMANAKA Ken-ichi SATO
This paper presents past and recent trends of optical networks and addresses the future directions. First, we describe path networks with the historical backgrounds and trends. path networks have advanced by using various multiplexing technologies. They include time-division multiplexing (TDM), asynchronous transfer mode (ATM), and wavelength-division multiplexing (WDM). ATM was later succeeded to multi-protocol label switching (MPLS). Second, we present generalized MPLS technologies (GMPLS). In GMPLS, the label concept of MPLS is extended to other labels used in TDM, WDM, and fiber networks. GMPLS enables network operators to serve networks deployed by different technologies with a common protocol suite of GMPLS. Third, we describe multi-layer traffic engineering and a path computation element (PCE). Multi-layer traffic engineering designs and controls networks considering resource usages of more than one layer. This leads to use network resources more efficiently than the single-layer traffic engineering adopted independently for each layer. PCE is defined as a network element that computes paths, which are used for traffic engineering. Then, we address software-defined networks, which put the designed network functions into the programmable data plane by way of the management plane. We describe the evaluation from GMPLS to software defined networking (SDN) and transport SDN. Fifth, we describe the advanced devices and switches for optical networks. Finally, we address advances in networking technologies and future directions on optical networking.
Chen CHEN Chunyan HOU Jiakun XIAO Yanlong WEN Xiaojie YUAN
In the era of e-commerce, purchase behavior prediction is one of the most important issues to promote both online companies' sales and the consumers' experience. The previous researches usually use traditional features based on the statistics and temporal dynamics of items. Those features lead to the loss of detailed items' information. In this study, we propose a novel kind of features based on temporally popular items to improve the prediction. Experiments on the real-world dataset have demonstrated the effectiveness and the efficiency of our proposed method. Features based on temporally popular items are compared with traditional features which are associated with statistics, temporal dynamics and collaborative filter of items. We find that temporally popular items are an effective and irreplaceable supplement of traditional features. Our study shed light on the effectiveness of the combination of popularity and temporal dynamics of items which can widely used for a variety of recommendations in e-commerce sites.
This paper reviews long optical reach and large capacity transmission which has become possible because of the application of wide-band and low-noise optical fiber amplifiers and digital coherent signal processing. The device structure and mechanism together with their significance are discussed.
Shigeru SAWADA Song-Zhu KURE-CHU Rie NAKAGAWA Toru OGASAWARA Hitoshi YASHIRO Yasushi SAITOH
This study is aimed at clarifying the mechanism of wear process for Ag plating. The samples of different hardness Ag plating on copper alloys were prepared as coupon and embossment specimens, which simulated terminal contacts. During the sliding test, the contact resistance and the friction coefficient versus sliding distance are measured. The surface observation and surface roughness of the Ag films after wear tests were investigated. As results, the hard Ag plating film (120 Hv) exhibited higher contact resistance comparing to the soft Ag plating film (80 Hv). The soft Ag film delivered wider wear trace on coupon specimens compared to the hard one. Moreover, the observation of tribofilms formed on the Ag films after wear tests suggested that a mixed-type of adhesive and abrasive wears occurred for both of soft and hard Ag films. Furthermore, the fretting corrosion resistance of Ag plating samples with different hardness was also investigated. As results, the wear resistance of hard Ag film was stronger than that of soft Ag film.
In underlay cognitive radio (CR) multicast networks, the cognitive base station (CBS) can transmit at the lowest rate of all the secondary users (SUs) within the multicast group. Existing works showed that the sum rate of such networks saturates when the number of SUs increases. In this letter, for CR multicast networks with multiple channels, we group the SUs into different subgroups, each with an exclusive channel. Then, the problem of joint user grouping and power allocation to maximize the sum rate of all subgroups under the interference power constraint and the transmit power constraint is investigated. Compared to exponential complexity in the number of SUs required by the optimal algorithm, we proposed an efficient algorithm with only linear complexity. Simulation results confirm that the proposed algorithm achieves the sum rate very closed to that achieved by the optimal algorithm and greatly outperforms the maximum signal-to-noise-ratio based user grouping algorithm and the conventional algorithm without user grouping.
Systematic research on electromagnetic compatibility (EMC) in Japan started in 1977 by the establishment of a technical committee on “environmental electromagnetic engineering” named EMCJ, which was founded both in the Institute of Electronics and Communication Engineers or the present IEICE (Institute of Electronics, Information and Communication Engineers) and in the Institute of Electrical Engineers of Japan or the IEEJ. The research activities have been continued as the basic field of interdisciplinary study to harmonize even in the electromagnetic (EM) environment where radio waves provide intolerable EM disturbances to electronic equipment and to that environment itself. The subjects and their outcomes which the EMCJ has dealt with during about 40 years from the EMCJ establishment include the evaluation of EM environment, EMC of electric and electronic equipment, and EMC of biological effects involving bioelectromagnetics and so on. In this paper, the establishment history and structure of the EMCJ are reviewed along with the change in activities, and topics of the technical reports presented at EMCJ meetings from 2006 to 2016 are surveyed. In addition, internationalization and its related campaign are presented in conjunction with the EMCJ research activities, and the status quo of the EMCJ under the IEICE is also discussed along with the prospects.
Xubo ZHAO Xiaoping LI Tongjiang YAN
In this letter, we present an improved method for the independence test procedure in the convolutional multicast algorithm proposed by Erez and Feder. We employ the linear independence test vectors to check the independence of the partial encoding vectors in the main program of Erez's convolutional multicast algorithm. It turns out that compared with the previous approach of computing the determinants of the correlative matrices, carrying out the independence test vectors can reduce the computational complexity.
Kaoru YAMAMOTO Masaki ONUKI Yuichi TANAKA
We propose a non-blind deconvolution algorithm of point cloud attributes inspired by multi-Wiener SURE-LET deconvolution for images. The image reconstructed by the SURE-LET approach is expressed as a linear combination of multiple filtered images where the filters are defined on the frequency domain. The coefficients of the linear combination are calculated so that the estimate of mean squared error between the original and restored images is minimized. Although the approach is very effective, it is only applicable to images. Recently we have to handle signals on irregular grids, e.g., texture data on 3D models, which are often blurred due to diffusion or motions of objects. However, we cannot utilize image processing-based approaches straightforwardly since these high-dimensional signals cannot be transformed into their frequency domain. To overcome the problem, we use graph signal processing (GSP) for deblurring the complex-structured data. That is, the SURE-LET approach is redefined on GSP, where the Wiener-like filtering is followed by the subband decomposition with an analysis graph filter bank, and then thresholding for each subband is performed. In the experiments, the proposed method is applied to blurred textures on 3D models and synthetic sparse data. The experimental results show clearly deblurred signals with SNR improvements.