Young-Sik KIM Hosung PARK Sang-Hyo KIM
To construct good DNA codes based on biologically motivated constraints, it is important that they have a large minimum Hamming distance and the number of GC-content is kept constant. Also, maximizing the number of codewords in a DNA code is required for given code length, minimum Hamming distance, and number of GC-content. In most previous works on the construction of DNA codes, quaternary constant weight codes were directly used because the alphabet of DNA strands is quaternary. In this paper, we propose new coding theoretic constructions of DNA codes based on the binary Hadamard matrix from a binary sequence with ideal autocorrelation. The proposed DNA codes have a greater number of codewords than or the equal number to existing DNA codes constructed from quaternary constant weight codes. In addition, it is numerically shown that for the case of codes with length 8 or 16, the number of codewords in the proposed DNA code sets is the largest with respect to the minimum reverse complementary Hamming distances, compared to all previously known results.
Zhen LI Zhisong PAN Guyu HU Guopeng LI Xingyu ZHOU
Community detection is an important task in the social network analysis field. Many detection methods have been developed; however, they provide little semantic interpretation for the discovered communities. We develop a framework based on joint matrix factorization to integrate network topology and node content information, such that the communities and their semantic labels are derived simultaneously. Moreover, to improve the detection accuracy, we attempt to make the community relationships derived from two types of information consistent. Experimental results on real-world networks show the superior performance of the proposed method and demonstrate its ability to semantically annotate communities.
Fei XU Pinxin LIU Jing XU Jianfeng YANG S.M. YIU
Bloom Filter is a bit array (a one-dimensional storage structure) that provides a compact representation for a set of data, which can be used to answer the membership query in an efficient manner with a small number of false positives. It has a lot of applications in many areas. In this paper, we extend the design of Bloom Filter by using a multi-dimensional matrix to replace the one-dimensional structure with three different implementations, namely OFFF, WOFF, FFF. We refer the extended Bloom Filter as Feng Filter. We show the false positive rates of our method. We compare the false positive rate of OFFF with that of the traditional one-dimensional Bloom Filter and show that under certain condition, OFFF has a lower false positive rate. Traditional Bloom Filter can be regarded as a special case of our Feng Filter.
Dong-Hun KIM Jiro HIROKAWA Makoto ANDO
A 42×42-way one-body 2-D beam-switching Butler matrix with waveguide short-slot 2-plane couplers is designed and fabricated in the 22GHz band. The one-body configuration using the commutativity and the overlapping of units allows reducing the size and loss in comparison with a cascade of matrices beam-switching for the horizontal and the vertical planes. It is achieved by replacing 2×2-way 1-plane couplers in the conventional block configuration for a Butler matrix with 22×22-way 2-plane couplers. The measured bandwidth is approximately 2% restricted by the frequency characteristics of the 2-plane couplers. In the radiation from the aperture array antenna of the 42 output ports, the 3.9dB-down coverage of 3-D solid angle by the sixteen beams is around 1.72 steradian which is same as 27.4% of hemisphere at the design frequency for the aperture spacing of 0.73×0.73 wavelength.
Kento OHTANI Kenta NIWA Kazuya TAKEDA
A single-dimensional interface which enables users to obtain diverse localizations of audio sources is proposed. In many conventional interfaces for arranging audio sources, there are multiple arrangement parameters, some of which allow users to control positions of audio sources. However, it is difficult for users who are unfamiliar with these systems to optimize the arrangement parameters since the number of possible settings is huge. We propose a simple, single-dimensional interface for adjusting arrangement parameters, allowing users to sample several diverse audio source arrangements and easily find their preferred auditory localizations. To select subsets of arrangement parameters from all of the possible choices, auditory-localization space vectors (ASVs) are defined to represent the auditory localization of each arrangement parameter. By selecting subsets of ASVs which are approximately orthogonal, we can choose arrangement parameters which will produce diverse auditory localizations. Experimental evaluations were conducted using music composed of three audio sources. Subjective evaluations confirmed that novice users can obtain diverse localizations using the proposed interface.
Lei ZHANG Qingfu FAN Wen LI Zhizhen LIANG Guoxing ZHANG Tongyang LUO
Existing moving object's trajectory prediction algorithms suffer from the data sparsity problem, which affects the accuracy of the trajectory prediction. Aiming to the problem, we present an Entropy-based Sparse Trajectories Prediction method enhanced by Matrix Factorization (ESTP-MF). Firstly, we do trajectory synthesis based on trajectory entropy and put synthesized trajectories into the trajectory space. It can resolve the sparse problem of trajectory data and make the new trajectory space more reliable. Secondly, under the new trajectory space, we introduce matrix factorization into Markov models to improve the sparse trajectory prediction. It uses matrix factorization to infer transition probabilities of the missing regions in terms of corresponding existing elements in the transition probability matrix. It aims to further solve the problem of data sparsity. Experiments with a real trajectory dataset show that ESTP-MF generally improves prediction accuracy by as much as 6% and 4% compared to the SubSyn algorithm and STP-EE algorithm respectively.
Rachelle RIVERO Richard LEMENCE Tsuyoshi KATO
With the huge influx of various data nowadays, extracting knowledge from them has become an interesting but tedious task among data scientists, particularly when the data come in heterogeneous form and have missing information. Many data completion techniques had been introduced, especially in the advent of kernel methods — a way in which one can represent heterogeneous data sets into a single form: as kernel matrices. However, among the many data completion techniques available in the literature, studies about mutually completing several incomplete kernel matrices have not been given much attention yet. In this paper, we present a new method, called Mutual Kernel Matrix Completion (MKMC) algorithm, that tackles this problem of mutually inferring the missing entries of multiple kernel matrices by combining the notions of data fusion and kernel matrix completion, applied on biological data sets to be used for classification task. We first introduced an objective function that will be minimized by exploiting the EM algorithm, which in turn results to an estimate of the missing entries of the kernel matrices involved. The completed kernel matrices are then combined to produce a model matrix that can be used to further improve the obtained estimates. An interesting result of our study is that the E-step and the M-step are given in closed form, which makes our algorithm efficient in terms of time and memory. After completion, the (completed) kernel matrices are then used to train an SVM classifier to test how well the relationships among the entries are preserved. Our empirical results show that the proposed algorithm bested the traditional completion techniques in preserving the relationships among the data points, and in accurately recovering the missing kernel matrix entries. By far, MKMC offers a promising solution to the problem of mutual estimation of a number of relevant incomplete kernel matrices.
Yonggang HU Xiongwei ZHANG Xia ZOU Meng SUN Yunfei ZHENG Gang MIN
Nonnegative matrix factorization (NMF) is one of the most popular machine learning tools for speech enhancement. The supervised NMF-based speech enhancement is accomplished by updating iteratively with the prior knowledge of the clean speech and noise spectra bases. However, in many real-world scenarios, it is not always possible for conducting any prior training. The traditional semi-supervised NMF (SNMF) version overcomes this shortcoming while the performance degrades. In this letter, without any prior knowledge of the speech and noise, we present an improved semi-supervised NMF-based speech enhancement algorithm combining techniques of NMF and robust principal component analysis (RPCA). In this approach, fixed speech bases are obtained from the training samples chosen from public dateset offline. The noise samples used for noise bases training, instead of characterizing a priori as usual, can be obtained via RPCA algorithm on the fly. This letter also conducts a study on the assumption whether the time length of the estimated noise samples may have an effect on the performance of the algorithm. Three metrics, including PESQ, SDR and SNR are applied to evaluate the performance of the algorithms by making experiments on TIMIT with 20 noise types at various signal-to-noise ratio levels. Extensive experimental results demonstrate the superiority of the proposed algorithm over the competing speech enhancement algorithm.
Peng QIAN Yan GUO Ning LI Baoming SUN
The compressive sensing (CS) theory has been recognized as a promising technique to achieve the target localization in wireless sensor networks. However, most of the existing works require the prior knowledge of transmitting powers of targets, which is not conformed to the case that the information of targets is completely unknown. To address such a problem, in this paper, we propose a novel CS-based approach for multiple target localization and power estimation. It is achieved by formulating the locations and transmitting powers of targets as a sparse vector in the discrete spatial domain and the received signal strengths (RSSs) of targets are taken to recover the sparse vector. The key point of CS-based localization is the sensing matrix, which is constructed by collecting RSSs from RF emitters in our approach, avoiding the disadvantage of using the radio propagation model. Moreover, since the collection of RSSs to construct the sensing matrix is tedious and time-consuming, we propose a CS-based method for reconstructing the sensing matrix from only a small number of RSS measurements. It is achieved by exploiting the CS theory and designing an difference matrix to reveal the sparsity of the sensing matrix. Finally, simulation results demonstrate the effectiveness and robustness of our localization and power estimation approach.
Yoshikazu FUJISHIRO Takahiko YAMAMOTO Kohji KOSHIJI
This paper expands Bartlett's bisection theorem. The theory of modal S-parameters and their circuit representation is constructed from a group-theoretic perspective. Criteria for the division of a circuit at a fixed node whose state is distinguished by the irreducible representation of its stabilizer subgroup are obtained, after being inductively introduced using simple circuits as examples. Because these criteria use only circuit symmetry and do not require human judgment, the distinction is reliable and implementable in a computer. With this knowledge, the entire circuit can be characterized by a finite combination of smaller circuits. Reducing the complexity of symmetric circuits contributes to improved insights into their characterization, and to savings of time and effort in calculations when applied to large-scale circuits. A three-phase filter and a branch-line coupler are analyzed as application examples of circuit and electromagnetic field analysis, respectively.
Hongmei LI Xingchun DIAO Jianjun CAO Yuling SHANG Yuntian FENG
Collaborative filtering with only implicit feedbacks has become a quite common scenario (e.g. purchase history, click-through log, and page visitation). This kind of feedback data only has a small portion of positive instances reflecting the user's interaction. Such characteristics pose great challenges to dealing with implicit recommendation problems. In this letter, we take full advantage of matrix factorization and relative preference to make the recommendation model more scalable and flexible. In addition, we propose to take into consideration the concept of covisitation which captures the underlying relationships between items or users. To this end, we propose the algorithm Integrated Collaborative Filtering for Implicit Feedback incorporating Covisitation (ICFIF-C) to integrate matrix factorization and collaborative ranking incorporating the covisitation of users and items simultaneously to model recommendation with implicit feedback. The experimental results show that the proposed model outperforms state-of-the-art algorithms on three standard datasets.
Jiangbo LIU Guan GUI Wei XIE Xunchao CONG Qun WAN Fumiyuki ADACHI
Based on the reconstruction of the augmented interference-plus-noise (IPN) covariance matrix (CM) and the estimation of the desired signal's extended steering vector (SV), we propose a novel robust widely linear (WL) beamforming algorithm. Firstly, an extension of the iterative adaptive approach (IAA) algorithm is employed to acquire the spatial spectrum. Secondly, the IAA spatial spectrum is adopted to reconstruct the augmented signal-plus-noise (SPN) CM and the augmented IPNCM. Thirdly, the extended SV of the desired signal is estimated by using the iterative robust Capon beamformer with adaptive uncertainty level (AU-IRCB). Compared with several representative robust WL beamforming algorithms, simulation results are provided to confirm that the proposed method can achieve a better performance and has a much lower complexity.
Liangliang ZHANG Longqi YANG Yong GONG Zhisong PAN Yanyan ZHANG Guyu HU
In multi-view social networks field, a flexible Nonnegative Matrix Factorization (NMF) based framework is proposed which integrates multi-view relation data and feature data for community discovery. Benefit with a relaxed pairwise regularization and a novel orthogonal regularization, it outperforms the-state-of-art algorithms on five real-world datasets in terms of accuracy and NMI.
Zhanhu HU Wang HU Zhiping WANG
To improve the quality of waveforms and achieve a high input power factor (IPF) for matrix rectifier, a novel quasi sliding mode control (SMC) with adaptive compensation is proposed in this letter. Applying quasi-SMC can effective obviate the disturbances of time delay and spatial lag, and SMC based on continuous function is better than discontinuous function to eliminate the chattering. Furthermore, compared with conventional compensation, an adaptive quasi-SMC compensation without any accurate detection for internal parameters is easier to be implementated, which has shown a superior advance. Theoretical analysis and experiments are carried out to validate the correctness of the novel control scheme.
An online nonnegative matrix factorization (NMF) algorithm based on recursive least squares (RLS) is described in a matrix form, and a simplified algorithm for a low-complexity calculation is developed for frame-by-frame online audio source separation system. First, the online NMF algorithm based on the RLS method is described as solving the NMF problem recursively. Next, a simplified algorithm is developed to approximate the RLS-based online NMF algorithm with low complexity. The proposed algorithm is evaluated in terms of audio source separation, and the results show that the performance of the proposed algorithms are superior to that of the conventional online NMF algorithm with significantly reduced complexity.
Kai FANG Shuoyan LIU Chunjie XU Hao XUE
In this paper, an adaptive updating probabilistic model is proposed to track an object in real-world environment that includes motion blur, illumination changes, pose variations, and occlusions. This model adaptively updates tracker with the searching and updating process. The searching process focuses on how to learn appropriate tracker and updating process aims to correct it as a robust and efficient tracker in unconstrained real-world environments. Specifically, according to various changes in an object's appearance and recent probability matrix (TPM), tracker probability is achieved in Expectation-Maximization (EM) manner. When the tracking in each frame is completed, the estimated object's state is obtained and then fed into update current TPM and tracker probability via running EM in a similar manner. The highest tracker probability denotes the object location in every frame. The experimental result demonstrates that our method tracks targets accurately and robustly in the real-world tracking environments.
Taishin NAKAMURA Hisashi YAMAMOTO Takashi SHINZATO Xiao XIAO Tomoaki AKIBA
Using a matrix approach based on a Markov process, we investigate the reliability of a circular connected-(1,2)-or-(2,1)-out-of-(m,n):F lattice system for the i.i.d. case. We develop a modified linear lattice system that is equivalent to this circular system, and propose a methodology that allows the systematic calculation of the reliability. It is based on ideas presented by Fu and Hu [6]. A partial transition probability matrix is used to reduce the computational complexity of the calculations, and closed formulas are derived for special cases.
Zhangkai LUO Huali WANG Wanghan LV Hui TIAN
In this letter, a novel mainlobe anti-jamming method via eigen-projection processing and covariance matrix reconstruction is proposed. The present work mainly focuses on two aspects: the first aspect is to obtain the eigenvector of the mainlobe interference accurately in order to form the eigen-projection matrix to suppress the mainlobe interference. The second aspect is to reconstruct the covariance matrix which is uesd to calculate the adaptive weight vector for forming an ideal beam pattern. Additionally, the self-null effect caused by the signal of interest and the sidelobe interferences elimination are also considered in the proposed method. Theoretical analysis and simulation results demonstrate that the proposed method can suppress the mainlobe interference effectively and achieve a superior performance.
Ke XU Rujun LIU Yuan SUN Keju ZOU Yan HUANG Xinfang ZHANG
In tutoring systems, students are more likely to utilize hints to assist their decisions about difficult or confusing problems. In the meanwhile, students with weaker knowledge mastery tend to choose more hints than others with stronger knowledge mastery. Hints are important assistances to help students deal with questions. Students can learn from hints and enhance their knowledge about questions. In this paper we firstly use hints alone to build a model named Hints-Model to predict student performance. In addition, matrix factorization (MF) has been prevalent in educational fields to predict student performance, which is derived from their success in collaborative filtering (CF) for recommender systems (RS). While there is another factorization method named non-negative matrix factorization (NMF) which has been developed over one decade, and has additional non-negative constrains on the factorization matrices. Considering the sparseness of the original matrix and the efficiency, we can utilize an element-based matrix factorization called regularized single-element-based NMF (RSNMF). We compared the results of different factorization methods to their combination with Hints-Model. From the experiment results on two datasets, we can find the combination of RSNMF with Hints-Model has achieved significant improvement and obtains the best result. We have also compared the Hints-Model with the pioneer approach performance factor analysis (PFA), and the outcomes show that the former method exceeds the later one.
In this paper, we study the problem of noise with regard to the perfect reconstruction of non-bandlimited signals, the class of signals having a finite number of degrees of freedom per unit time. The finite rate of innovation (FRI) method provides a means of recovering a non-bandlimited signal through using of appropriate kernels. In the presence of noise, however, the reconstruction function of this scheme may become ill-conditioned. Further, the reduced sampling rates afforded by this scheme can be accompanied by increased error sensitivity. In this paper, to obtain improved noise robustness, we propose the matrix pencil (MP) method for sample signal reconstruction, which is based on principal component analysis (PCA). Through the selection of an adaptive eigenvalue, a non-bandlimited signal can be perfectly reconstructed via a stable solution of the Yule-Walker equation. The proposed method can obtain a high signal-to-noise-ratio (SNR) for the reconstruction results. Herein, the method is applied to certain non-bandlimited signals, such as a stream of Diracs and nonuniform splines. The simulation results demonstrate that the MP and PCA are more effective than the FRI method in suppressing noise. The FRI method can be used in many applications, including those related to bioimaging, radar, and ultrasound imaging.