Entity

Time filter

Source Type


Zhou C.,Science and Technology on Parallel and Distributed Processing Laboratory | Zhang X.,Science and Technology on Parallel and Distributed Processing Laboratory | Guan N.,Science and Technology on Parallel and Distributed Processing Laboratory | Guan N.,Institute of Software | And 3 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

Non-negative matrix factorization (NMF) is a popular matrix decomposition technique that has attracted extensive attentions from data mining community. However, NMF suffers from the following deficiencies: (1) it is non-trivial to guarantee the representation of the data points to be sparse, and (2) NMF often achieves unsatisfactory clustering results because it completely neglects the labels of the dataset. Thus, this paper proposes a semi-supervised non-negative local coordinate factorization (SNLCF) to overcome the above deficiencies. Particularly, SNLCF induces the sparse coefficients by imposing the local coordinate constraint and propagates the labels of the labeled data to the unlabeled ones by indicating the coefficients of the labeled examples to be the class indicator. Benefit from the labeled data, SNLCF can boost NMF in clustering the unlabeled data. Experimental results on UCI datasets and two popular face image datasets suggest that SNLCF outperforms the representative methods in terms of both average accuracy and average normalized mutual information. © Springer International Publishing Switzerland 2015. Source


Liao X.,National University of Defense Technology | Liao X.,Science and Technology on Parallel and Distributed Processing Laboratory | Li S.,National University of Defense Technology | Cheng L.,National University of Defense Technology | Gu M.,University of California at Berkeley
Computers and Mathematics with Applications | Year: 2016

In this paper we propose a novel divide-and-conquer (DC) algorithm to compute the SVD of banded matrices, and further accelerate it by using rank-structured matrix techniques, especially the hierarchically semiseparable (HSS) matrix. The DC algorithm for the symmetric banded eigenvalue problem can also be accelerated similarly. For matrices with few deflations, the banded DC algorithms require more flops than the classical DC algorithm, and thus they are suitable for narrowly banded matrices. While, if there exist many deflations, the banded DC algorithms can be faster than the classical ones for matrices with relatively large bandwidths. Numerous experiments have been done to test the proposed algorithms. Some of the tested matrices are from construction and some are from real applications. Comparing with the DC algorithm in Intel MKL, our proposed algorithms can be hundreds times faster for matrices with narrow bandwidths or many deflations. © 2016 Elsevier Ltd. Source


Song R.Q.,National University of Defense Technology | Chen S.M.,National University of Defense Technology | Chen S.M.,Science and Technology on Parallel and Distributed Processing Laboratory | He Y.B.,National University of Defense Technology | Du Y.K.,National University of Defense Technology
Science China Information Sciences | Year: 2015

The internal single-event transient (SET) induced upset in flip-flops is becoming significant with the increase of the operating frequency. However, the conventional soft error rate (SER) evaluation approach could only produce an approximate upset prediction result caused by the internal SET. In this paper, we propose an improved SER evaluation approach based on Monte Carlo simulation. A novel SET-based upset model is implemented in the proposed evaluation approach to accurately predict upsets caused by the internal SET. A test chip was fabricated in a commercial 65 nm bulk process to validate the accuracy of the improved SER evaluation approach. The predicted single-event upset cross-sections are consistent with the experimental data. © 2015, Science China Press and Springer-Verlag Berlin Heidelberg. Source


Yu H.,National University of Defense Technology | Yu H.,Science and Technology on Parallel and Distributed Processing Laboratory | Chen Z.,National University of Defense Technology | Chen Z.,Science and Technology on Parallel and Distributed Processing Laboratory | And 2 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

Compensating CSP (cCSP) is an extension to CSP for modeling long running transactions (LRTs). In our work, we extended the original cCSP with the ability of modeling non-determinism, deadlock and livelock. Until now, there is only a failure-divergence semantics for the extended cCSP, and there is no model checking or animating tool for it. In this paper, we present an operational semantics for model checking the extended cCSP. We prove that the general problem of model checking the extended cCSP with respect to regular properties is undecidable. Using the operational semantics, we have implemented an animator and a prototype model checker for the extended cCSP based on the platform Process Analysis Toolkit (PAT). In addition, a case study is given to demonstrate the tool. © 2014 Science and Engineering Faculty. Source


Shen H.,Science and Technology on Parallel and Distributed Processing Laboratory | Shen H.,National University of Defense Technology | Lv S.,Science and Technology on Parallel and Distributed Processing Laboratory | Lv S.,National University of Defense Technology | And 4 more authors.
KSII Transactions on Internet and Information Systems | Year: 2015

It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%. © 2015 KSII. Source

Discover hidden collaborations