Entity

Time filter

Source Type


Liu P.Q.,Shandong University of Science and Technology | Liu P.Q.,Shandong Institute of Business and Technology | Liu P.Q.,Key Laboratory of Intelligent Information Processing in Universities of Shandong
Advanced Materials Research | Year: 2013

Biclustering has been extensively studied in many fields such as data mining, e-commerce, computational biology, information security, etc. Problems of finding bicliques in bipartite, which are variants of biclustering, have received much attention in recent years due to its importance for biclustering. The k-biclique vertex partition problem proposed by Bein et al. is one of finding bicliques problems in bipartite. Its aim is to find k' bicliques (k'≤k) such that each vertex of the bipartite occurs in exactly one member of these bicliques. First, we give a sufficient condition of the k-biclique vertex partition problem. Moreover, we present an exact algorithm for finding k-biclique vertex partitions of a bipartite. Finally, we propose a method to generate simulated datasets used to test the algorithm. Experimental results on simulated datasets show that the algorithm can find k-biclique vertex partitions of a bipartite with relatively fast speed. © (2013) Trans Tech Publications, Switzerland. Source


Jiang P.,Key Laboratory of Intelligent Information Processing in Universities of Shandong | Jiang P.,Shandong Institute of Business and Technology | Dou Q.-S.,Key Laboratory of Intelligent Information Processing in Universities of Shandong | Dou Q.-S.,Shandong Institute of Business and Technology
Tongxin Xuebao/Journal on Communications | Year: 2015

A new vessel segmentation method called specificity and self-adaptive vessel detection (SSVD) was proposed based on pixel specificity and self-adaptive classification strategy, in the beginning pixel specificity was defined, by setting a higher pixel specificity threshold, the main vessel skeleton was extracted; then self-adaptive classification process was implemented, and each of the remaining undetermined pixels acted as an Agent, within a multi-scale threshold range, Agent revised its own status according to the status of its neighbor, so as to complete the classification of the pixels; finally the noise was removed by multi-window noise filtering method. By testing SSVD on DRIVE database, the experiment shows that it is more accurate and efficient than state-of-the-art methods. ©, 2015, Tongxin Xuebao/Journal on Communications. All right reserved. Source


Guan S.,Key Laboratory of Intelligent Information Processing in Universities of Shandong | Guan S.,Nanjing University | Zhang Y.,Nanjing University | Ji Y.,Nanjing Normal University
Computational and Mathematical Methods in Medicine | Year: 2013

With the development of network technology, more and more data are transmitted over the network and privacy issues have become a research focus. In this paper, we study the privacy in health data collection of preschool children and present a new identity-based encryption protocol for privacy protection. The background of the protocol is as follows. A physical examination for preschool children is needed every year out of consideration for the children's health. After the examination, data are transmitted through the Internet to the education authorities for analysis. In the process of data collection, it is unnecessary for the education authorities to know the identities of the children. Based on this, we designed a privacy-preserving protocol, which delinks the children's identities from the examination data. Thus, the privacy of the children is preserved during data collection. We present the protocol in detail and prove the correctness of the protocol. © 2013 Shaopeng Guan et al. Source


Liu P.,Shandong Institute of Business and Technology | Liu P.,Key Laboratory of Intelligent Information Processing in Universities of Shandong | Liu P.,Shandong University of Science and Technology | Zhu D.,Shandong University of Science and Technology | And 5 more authors.
Mathematical Problems in Engineering | Year: 2014

A biclustering problem consists of objects and an attribute vector for each object. Biclustering aims at finding a bicluster - a subset of objects that exhibit similar behavior across a subset of attributes, or vice versa. Biclustering in matrices with binary entries ("0"/"1") can be simplified into the problem of finding submatrices with entries of "1." In this paper, we consider a variant of the biclustering problem: the k -submatrix partition of binary matrices problem. The input of the problem contains an n × m matrix with entries ("0"/"1") and a constant positive integer k. The k -submatrix partition of binary matrices problem is to find exactly k submatrices with entries of "1" such that these k submatrices are pairwise row and column exclusive and each row (column) in the matrix occurs in exactly one of the k submatrices. We discuss the complexity of the k -submatrix partition of binary matrices problem and show that the problem is NP-hard for any k ≥ 3 by reduction from a biclustering problem in bipartite graphs. © 2014 Peiqiang Liu et al. Source


Dou Q.-S.,Shandong Institute of Business and Technology | Dou Q.-S.,Key Laboratory of Intelligent Information Processing in Universities of Shandong | Dou Q.-S.,CAS Institute of Computing Technology | Cong L.,Shandong Institute of Business and Technology | And 4 more authors.
Zidonghua Xuebao/Acta Automatica Sinica | Year: 2015

Consensus problem in multi-agent system has a wide application background in many fields, such as sensor networks, social networks, cooperative control and so on. In this paper, we address the problem of the discrete linear consensus algorithm with noise, and point out that the noise of discrete linear consistency algorithm is not controllable. Aiming at this problem, we propose a strategy using noise suppression operator ε (t) to control noise, and point out that when ε (t) is the higher-order infinitesimal of t-0.5, the noise of consistency algorithm after noise suppression is controllable. We analyze the effect of suppression operator on the convergence of consistency algorithm and prove that under the condition of no noise and if the suppression operator ε (t) is a lower-order infinitesimal of t-1, the consistency algorithm after noise suppression can still converge to the original convergence state x*. Based on this, we further point out that if the order of ε (t) is between the orders of t-0.5 and t-1 when t→∞, the states of all the agents will be a normal distribution with its center at the original convergence state x* in the end. And, by using DHA as an example, we verify and discuss the corresponding theoretical results. This paper provides a theoretical foundation for noise control of linear consensus algorithm, and has a strong directional effect on the determination of noise suppression operator. ©, 2015, Acta Automatica Sinica. All right reserved. Source

Discover hidden collaborations