Cong Wang

Beijing University of Posts and Telecommunications, Peping, Beijing, China

Are you Cong Wang?

Claim your profile

Publications (77)34.91 Total impact

  • Gang Xu · X.-B. Chen · Jing Li · Cong Wang · Y.-X. Yang · Zongpeng Li
    [Show abstract] [Hide abstract]
    ABSTRACT: Cooperative communication is starting to attract substantial research attention in quantum information theory. However, given a specific network, it is still unknown whether quantum cooperative communication can be successfully performed. In this paper, we investigate network coding for quantum cooperative multicast (QCM) over the classic butterfly network. A very reasonable definition of QCM is first introduced. It not only perfectly focuses on the basic idea of quantum cooperative communication, but also wonderfully reflects the characteristic of classical multicast over a specific network structure. Next, we design QCM protocol for two-level systems and generalize the protocol into d-dimensional Hilbert space. It is shown that our protocols have significant advantages in terms of resource cost and compatibility with classical multicast. Besides, the success probability, which only depends on the coefficients of the initial quantum states, is carefully analyzed. In particular if the source nodes choose the quantum equatorial states, success probability can reach 1.
    No preview · Article · Sep 2015 · Quantum Information Processing
  • Hai Long Huang · Wei Cao · Cong Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: The numerical simulation of multipahse flow characteristics during the launch process from the tube of the submarine vehicle are investigated, obtains the variation rules of the movement characteristic of the gas inside the tube, the cavity shape of around the vehicle body, the surface pressure coefficient during the movement process. The resluts show that the launch depth and velocity have significiant impact on the shouder cavitation of the submarine vehicle, the smaller values of the depth and the velocity are, the more obvious shouber cavitation, and which led to the distribution difference of the surface pressure coefficient
    No preview · Article · May 2014
  • Kai Kang · Zhibo Pang · Li Da Xu · Liya Ma · Cong Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: The Internet of Things (IoT) application market (IAM) is supposed to be an effective approach for service distribution in the era of IoT. To protect the privacy and security of users, a systematic mechanism to determine the trustworthiness of the applications in the IAM is demanded. In this paper, an interactive trust model (ITM) is proposed based on interaction between application market and end users. In this model, application trustworthiness (AT) is quantitatively evaluated by the similarity between the application’s behavior and the behavior expected by the user. In particular, by using the evaluation vector and feedback vector feature of application in the marketplace and behavior of applications on end devices can be exchanged in mathematical form to establish the connection between market and users. Behavior-based detecting agent on a users’ device gives strong evidence about what applications have done to your privacy and security issues. Indicators derived by this model are presented in the market along with the application, and it helps users to more efficiently select the most appropriate application from the market.
    No preview · Article · May 2014 · IEEE Transactions on Industrial Informatics
  • Xiu-Bo Chen · Zhao Dou · Gang Xu · Cong Wang · Yi-Xian Yang
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a class of protocols for quantum private comparison is investigated. The main feature is that the symmetry of quantum states is utilized. First of all, we design a new protocol for quantum private comparison via the $$\chi $$¿-type state as a special example. Then, through the in-deep research and analysis on the quantum carrier, it is found that lots of quantum states with the symmetrical characteristic can be utilized to perform the protocol successfully. It is an attractive advantage in the practical application. What is more, two players are only required to be equipped with the unitary operation machines. It means that our protocols can easily be realized and have a broad scope of application. Finally, the analyses on the protocols' security, which are mainly ensured by the symmetry of quantum states and the property of the decoy state, are given in detail.
    No preview · Article · Jan 2014 · Quantum Information Processing
  • Gang Xu · Cong Wang · Yi-Xian Yang
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose a new protocol of hierarchical quantum information splitting (HQIS) via two four-qubit cluster state. In the protocol, a boss can asymmetrically distribute an arbitrary two-qubit state, which has not been investigated by the previous papers, to the distant agents in a network. The asymmetric distribution leads to that the agents' authorities for getting the secret state are hierarchical. In other word, they have different authorities for the boss's secret state. Moreover, the symmetry feature of cluster state reflects our protocol will have a better extendibility. Thus, we further propose a multiparty HQIS protocol. In our HQIS protocol, the agents only need the single-qubit measurement, which is an appealing advantage in practically implementation. Meanwhile, the present protocol can be modified to implement the threshold-controlled teleportation.
    No preview · Article · Jan 2014 · Quantum Information Processing
  • Weiguang Wang · Wanlin Gao · Cong Wang · Jinbin Li
    [Show abstract] [Hide abstract]
    ABSTRACT: Data prediction and classification is a critical method in medical nutrition data analysis area. As for the characteristics of being intuitive, efficient and easy to understand, the decision tree algorithm is widely used in this field. However, the classification rules extracted from the decision tree are not the most simple and efficient. The paper analyzes the classical decision tree algorithm CART, and proposes a new improved algorithm R2-CART. The core idea of the advanced algorithm is, in order to simplify the classification rules and tree, combining CART algorithm with rough set theory to conduct the attribute and rule reduction on the classification rules of decision tree. The experiment, which compares the Original CART algorithm with the improved algorithm, shows that the improved algorithm has much better classification efficiency with achieving a simple and efficient classification rule set at the same time. This improved algorithm has a potential practical value for large-scale medical nutrition data of classification and predictive analysis.
    No preview · Conference Paper · Dec 2013
  • Kai KANG · Zhi-bo PANG · Cong WANG
    [Show abstract] [Hide abstract]
    ABSTRACT: The rapid development of technologies towards Internet of Things (IoT), has led to new circumstances at all levels of the social environment. In healthcare in particular, the use of IoT concepts and technologies make diagnose and monitor more convenient for the physicians and patients. As mobile applications solutions are widely accepted because the easy to use, secure healthcare service is a new demand for mobile solutions. To protect the privacy and security for patients in the domain of healthcare towards IoT, a systematic mechanism is needed. This article proposes a novel security and privacy mechanism for Health Internet of Things (Health-IoT) to solve above problems. Health-IoT is promising for both traditional healthcare industry and the information and communication technologies (ICTs) industry. From the view of trustworthiness, interactive vector was proposed to communicate the end-devices and application brokers. The aim is to establish a trust IoT application market (IAM), feature of application in marketplace and behavior of applications on end-devices can be exchanged in mathematical value to establish the connection between market and users.
    No preview · Article · Dec 2013 · The Journal of China Universities of Posts and Telecommunications
  • Wei Cao · Chun Tao He · Cong Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: Computational simulation investigation which is based on the Navier-Stokes equation, finite-volume method, dynamic mesh method, and volume of fluid method, was carried out principally on the constant speed vertical water entry of the cone with 75 degree and a half angle. Based on this, the cavity generation and the process of cavity wall expansion of the cone with 75 degree and a half angle were analyzed. Through analyzing the expansion dynamic for the cavity wall in different depths, the velocity and acceleration with time in the process of cavity wall expansion were obtained, and the disturbances and splash feature laws of the free surface near the entrance of the cavity after cones water-entry were analyzed too.
    No preview · Article · Oct 2013
  • Cong Wang · Gang Xu · Yi-xian Yang
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we carry out an in-depth analysis of the quantum private comparison (QPC) protocol with the semi-honest third party (TP). The security of QPC protocol using the EPR pairs is re-examined. Unfortunately, we find that TP can use the fake EPR pairs to steal all the secret information. Furthermore, we give two simple and feasible solutions to improve the original QPC protocol. It is shown that the improved protocol is secure, which can resist various kinds of attacks from both the outside eavesdroppers and the inside participants, even the semi-honest TP.
    No preview · Article · Sep 2013 · International Journal of Quantum Information
  • Fei Sun · Lixiang Li · Haipeng Peng · Cong Wang · Yixian Yang
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we explore the issue that how many messages can be transmitted through one scalar chaotic time series. A scheme is proposed for modulating multiple messages into the system. Based on the adaptive parameter estimation method, provided that some special conditions are satisfied, such as the long-time persistent excitation condition or the long-time linearly independent condition, the carried information could be recovered at the receiver. This scheme has potential application in chaotic optical communication (COC). Its feasibility and effectiveness are demonstrated by numerical examples.
    No preview · Article · Feb 2013 · Physics of Condensed Matter
  • Source
    Fei Sun · Lixiang Li · Haipeng Peng · Cong Wang · Yixian Yang
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we explore the issue that how many messages can be transmitted through one scalar chaotic time series. A scheme is proposed for modulating multiple messages into the system. Based on the adaptive parameter estimation method, provided that some special conditions are satisfied, such as the long-time persistent excitation condition or the long-time linearly independent condition, the carried information could be recovered at the receiver. This scheme has potential application in chaotic optical communication (COC). Its feasibility and effectiveness are demonstrated by numerical examples.
    Full-text · Article · Feb 2013 · The European Physical Journal B
  • Zhao Chen · Wenbin Yao · Cong Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: To cope with the security challenges posed by providing disaster-recovery services on the cloud, a data disaster-recovery model is proposed based on a three-dimension data split scheme. This model presents higher security, data privacy and time efficiency than conventional security methods for cloud storage service. Besides, it will not bring too much extra costs on cloud storage resources. And taking storage price of Amazon S3 as an example, this model only costs less than 20 cents a month for extra storage price as the backup files are TB level.
    No preview · Article · Jan 2013 · Communications in Computer and Information Science
  • Wei Cao · Tie Zhi Sun · Cong Wang · Xin Hua Zhao
    [Show abstract] [Hide abstract]
    ABSTRACT: The process of the supercavitation projectile penetrating into metal targets was simulated by using the dynamic analysis software ANSYS/LS-DYNA, and the deformation, breakage and forces on the body in different initial velocities and the penetration depth were discussed. Analysis results show that there are two peaks of resistance and the velocities is variety almost in linear attenuation when the cone part of the projectile is moving through contacted with the target plate, which provides references for the structure and parameters design of the supercavitation projectile.
    No preview · Article · Nov 2012 · Applied Mechanics and Materials
  • [Show abstract] [Hide abstract]
    ABSTRACT: One stage light gas gun is an important device for experiments of low-speed supercavitation projectiles. After a reasonable simplification to the gas gun, movements of the projectile in the barrel have been analyzed and the relationships between the initial pressure of the gas gun and the exit velocity of the projectile were obtained. For meeting the velocity difference between at the gun exit and water-entry, a speed impairment factor was employed. The results of the adiabatic analysis of the simplified gun show that the best ratio between gun chamber volume and the barrel length is related to the gas thermodynamic process and the gas residual pressure has relation to the gas thermodynamic process. The low-speed supercavitation projectile experiments have been carried out. The movements of the projectile in the gas gun and the supercavitation shape and projectile speed after water-entry have been numerically simulated.
    No preview · Article · Nov 2012 · Applied Mechanics and Materials
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Users of a Web site usually perform their interest-oriented actions by clicking or visiting Web pages, which are traced in access log files. Clustering Web user access patterns may capture common user interests to a Web site, and in turn, build user profiles for advanced Web applications, such as Web caching and prefetching. The conventional Web usage mining techniques for clustering Web user sessions can discover usage patterns directly, but cannot identify the latent factors or hidden relationships among users' navigational behaviour. In this paper, we propose an approach based on a vector space model, called Random Indexing, to discover such intrinsic characteristics of Web users' activities. The underlying factors are then utilised for clustering individual user navigational patterns and creating common user profiles. The clustering results will be used to predict and prefetch Web requests for grouped users. We demonstrate the usability and superiority of the proposed Web user clustering approach through experiments on a real Web log file. The clustering and prefetching tasks are evaluated by comparison with previous studies demonstrating better clustering perfor-mance and higher prefetching accuracy.
    Full-text · Article · Oct 2012 · Knowledge and Information Systems
  • Source
    Miao Wan · Cong Wang · Lixiang Li · Yixian Yang
    [Show abstract] [Hide abstract]
    ABSTRACT: journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: http://www.elsevier.com/copyright
    Full-text · Article · Aug 2012 · Applied Soft Computing
  • Miao Wan · Cong Wang · Lixiang Li · Yixian Yang
    [Show abstract] [Hide abstract]
    ABSTRACT: Clustering divides data into meaningful or useful groups (clusters) without any prior knowledge. It is a key technique in data mining and has become an important issue in many fields. This article presents a new clustering algorithm based on the mechanism analysis of chaotic ant swarm (CAS). It is an optimization methodology for clustering problem which aims to obtain global optimal assignment by minimizing the objective function. The proposed algorithm combines three advantages into one: finding global optimal solution to the objective function, not sensitive to clusters with different size and density and suitable to multi-dimensional data sets. The quality of this approach is evaluated on several well-known benchmark data sets. Compared with the popular clustering method named k-means algorithm and the PSO-based clustering technique, experimental results show that our algorithm is an effective clustering technique and can be used to handle data sets with complex cluster sizes, densities and multiple dimensions.
    No preview · Article · Aug 2012 · Applied Soft Computing
  • Dawei Zhao · Haipeng Peng · Cong Wang · Yixian Yang
    [Show abstract] [Hide abstract]
    ABSTRACT: On the basis of the properties of the Jordan matrix, we proposed a secret sharing scheme which can realize both the (t,n)(t,n) threshold and the adversary structure and share a large secret while each participant has a short share. At the same time, the scheme can prevent the participants from cheating. The shares can be kept secret in the process of reconstruction and do not need to be renewed when the shared secret is changed. If nn participants want to share a large secret using a short share such that tt or more participants can reconstruct the shared secret and there are some subsets that each contain at least tt participants that cannot reconstruct the shared secret, our scheme will be effective.
    No preview · Article · Aug 2012 · Computers & Mathematics with Applications
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Clustering divides data into meaningful or useful groups (clusters) without any prior knowledge. It is a key technique in data mining and has become an important issue in many fields. This article presents a new clustering algorithm based on the mechanism analysis of Bacterial Foraging (BF). It is an optimization methodology for clustering problem in which a group of bacteria forage to converge to certain positions as final cluster centers by minimizing the fitness function. The quality of this approach is evaluated on several well-known benchmark data sets. Compared with the popular clustering method named k-means algorithm, ACO-based algorithm and the PSO-basedclustering technique, experimental results show that the proposed algorithm is an effective clustering technique and can be used to handle data sets with various cluster sizes, densities and multiple dimensions.
    Full-text · Article · Apr 2012 · Journal of Intelligent Information Systems
  • [Show abstract] [Hide abstract]
    ABSTRACT: Cavitation typically occurs when the fluid pressure is lower than the vapor pressure at a local thermodynamic state. The aim of this paper is a numerical investigation of the cryogenic cavitation flow characteristics, considering variable thermodynamic properties of liquid nitrogen and numerical simulation liquid nitrogen around hydrofoil cryogenic cavitation flow characteristics. Based on homogeneous flow model and Zwart cavitation model, calculates hydrofoil isothermal and cryogenic cavitation in liquid nitrogen steadily, updates the evaporation and condensation coefficients of Zwart cavitation model, gives the hydrofoil surface pressure profile, temperature depression and distribution of cavitation intensity, contrasts the isothermal and cryogenic cavitation flow characteristics. Numerical results show that thermodynamics effect in cryogenic liquid cavitation significantly. Meanwhile, the hydrofoil surface pressure and temperature numerical results with experimental data and more Hord compared to verify the validity of the numerical simulation.
    No preview · Article · Jan 2012 · Applied Mechanics and Materials

Publication Stats

245 Citations
34.91 Total Impact Points

Institutions

  • 2003-2015
    • Beijing University of Posts and Telecommunications
      • • School of Software Engineering
      • • State Key Laboratory of Switching and Networking
      • • School of Computer Science
      • • Department of Information Engineering
      Peping, Beijing, China
  • 2011-2014
    • Harbin Institute of Technology
      • School of Astronautics
      Charbin, Heilongjiang Sheng, China
  • 2005
    • Xi'an University of Posts and Telecommunications
      Ch’ang-an, Shaanxi, China
    • Beijing Institute Of Technology
      Peping, Beijing, China
    • University of Science and Technology, Beijing
      Peping, Beijing, China