Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
 
Articles by Zheng Qin
Total Records ( 15 ) for Zheng Qin
  Xian-Hui Wang , Zheng Qin , Xing-Chen Heng and Yu Liu
  In this study, we put forward a new method to learn structure of Product Unit Neutral Network (PUNN). The technique used in our research is based on Particle Swarm Optimization (PSO) algorithm. The technique can optimized collocate network structure and weight of the PUNN at the same time using PSO algorithm through standard data set. Moreover, the number of Hidden Layer units of PUNN is decided by training set, not prefixed by the designer`s prior knowledge. Particles encoding scheme is simple and effective. The design of fitness function considers not only the mean square error between networks output and desired output, but also the number of hidden layer units. Therefore, the resulting network can alleviate the problem of over-fitting. The results of the experiment indicate that PSPUNN algorithm can achieve rational architecture for PUNN relying on standard data set and the resulting networks hence obtain strong generalization abilities.
  Zheng Qin , Ji Jia , Tian-Tian Li and Jiang Lu
  In this study, we propose a novel method to extract 2D projection contour from 3D models. 2D projection contour is a significant feature and data of a 3D shape. It can be used in the fields of 3D model retrieval, analysis of shape, free distortion and joint of curved surface. Triangular mesh is generally adopted as the data representation form of 3D models. Therefore, as a case study, we consider 2D projection contour extraction from triangular mesh of 3D models. In our approach, we perform a discriminant of the visualization to every 3D model curved surface and get the boundary vertexes of them, extract contour vertexes after projection, construct rings and perform a ring-relationship-based judge mechanism to get the 2D projection contour. Our method is unique in that we can extract contours from both single-valued and arbitrary complex space curved surface by ring-relationship-based strategy. Theoretical analysis and experimental results show that we can significantly improve the accuracy and efficiency in contour extraction by using ring-relationship-based method.
  Hong-Jiang Gao , Zheng Qin , Lei Lu , Li-Ping Shao and Xing-Chen Heng
  With increasingly complexity in Multi-Agent Systems (MAS), the problem of their verification and validation is acquiring increasing importance and rigorous design practices are needed in case of critical applications. Event B, which provides an accessible and rigorous development method, is ideal for the formal modelling of reactive systems. In this study, a practical approach for developing flexible and reliable formal specifications of MAS using Event B is described, exemplified on Contract Net Protocol (CNP) in the interaction of MAS and B models generated with evt2b supported by Atelier B are then proven in consistency and correctness. All the concepts of this approach are illustrated by a case study concerning the use of Event B for the modelling and verifying a multi-modal platform associating an intellectualized design system of shape and style in automobile. Moreover, the results of proof and evaluation of present method are presented.
  Ji Jia , Zheng Qin and Junying Chen
  In this study, we propose a method for voxelizing triangular mesh model based on space partitioning and octree encoding. It describes the 3D model by octree structure and then processes it with both surface voxelization and internal voxelization to generate volume model. Our experimental results show that the method can voxelize 3D polygon meshes correctly and effectively.
  Li-Ping Shao , Zheng Qin , Hong-Jiang Gao and Xing-Chen Heng
  The conventional 2D matrix transform represented by 2D Arnold transform and 2D Fibonacci-Q transform is applied widely in the security of image information, because of its easily selected scrambling variables and its abilities in enduring erasing, cropping and compression attacks. However, this scrambling method can only be used to scramble square image. For any rectangle image with its width not equal to its height, it needs to be expanded into square image or divided into several square images before using 2D matrix transform to scramble it, which adds the extra space or increases the computation cost. To address this problem, this study proposes two kinds of 2D matrix transforms called 2D triangular mappings and also gives their corresponding inverse transforms. The proposed mappings can be used to scramble or recover rectangle image directly and their iterative cost is low. The cost to scramble or recover image for one time is only the numbers of pixels and our proposed mappings need not to compute the iterative period in advance. Experiments show the proposed mappings validity in scrambling rectangle image, low cost in scrambling and recovering rectangle image and robustness in enduring erasing, cropping and compressing attacks.
  Rongyu He , Zheng Qin and Xi Qin
  In this contribution, we firstly design and realize a PKI-SIM card that is a regular SIM card with additional PKI-functionality and present a security mobile access scheme based on the PKI-SIM card, which offers solutions for the development of secure mobile business applications using SMS. Then, we proposed a novel authentication and session key distribution protocol which provides end-to-end confidentiality and integrity of the SMS message. Finally, a formal verification of the protocol using BAN logic is presented and the security and performance analysis of our scheme revealed that it is suitable for practical needs both in speed and security
  Hong-Jiang Gao , Hong Sun , Bang-Hai Xu , Ying He and Zheng Qin
  The aim of this study is to demonstrate the approach of stepwise development of a distributed transaction mechanism for information retrieval systems. In this study, we formally develop an abstract model of transactions in Event-B for an IR system, in which fault tolerance is provided in the distributed transaction execution. We starts from an abstract system specification and gradually introduce implementation details in a series of correctness-preserving transformations, where complex system properties (such as fault tolerant) could be specified in a structured and rigorous way. During each transformation, the refinement between the abstract specification of the system and its detailed design is verified. Using Event-B, we achieve a high degree of automatic proof via this incremental approach.
  Youzhi Zheng , Zheng Qin , Liping Shao and Xiaodong Hou
  In this study, a novel objective image quality metric is proposed. The proposed metric can be used for image fusion evaluation without a reference image. The proposed metric is an extension of Mutual Information (MI) metric based on Renyi entropy which is a single parameter generalization of Shannon entropy. Renyi MI measures the total amount of information that fused image contains about source images. Also, the overlapping information problem is considered by using Generalized Normalized MI to avoid its influence. Experimental results show that the presented metric well correlated with human subjective evaluations and it is much better than conventional MI metrics based on Shannon entropy and Tsallis entropy.
  Bo Liu , Zheng Qin , Rui Wang , You-Bing Gao and Li-Ping Shao
  The aim of this study is to solve the target assignment of coordinated distributed multi-agent systems. Earlier methods (e.g., neural network, genetic algorithm, ant colony algorithm, particle swarm optimization and auction algorithm) used to address this problem have proved to be either too slow or not stable as far as converging to the global optimum is concerned. To address this problem, a new algorithm is proposed which combines heuristic ant colony system and decentralized cooperative auction. Based on ant colony system, the decentralized cooperative auction is used to construct ants` original solutions which can reduce the numbers of blind search and then the original solutions are improved by heuristic approach to increase the system stability. The performance of the new algorithm is studied on air combat scenarios. Simulation experiment results show present method can converge to the global optimum more stably and faster by comparing the original methods.
  Zu-Ning Chen , Zheng Qin and Lei Lu
  In this study, a novel quantum secure direct communication protocol is proposed with authentication using the quantum superdense coding scheme and a braid-based key agreement protocol. The security of the proposed protocol is based on the no-cloning theorem, the correlations of quantum entanglement and the fact that the p-th root finding problem on braid groups is intractable even on quantum computers, as well as classical computers. In the proposed protocol, the sender Alice and the receiver Bob firstly apply a braid-based key agreement protocol to share a secret random number, whose size and magnitude are undecided in advance, for authentication. Then, Alice and Bob share a set of EPR pairs. Both sides authenticate each other through the Bell state measurement on their check qubits. Alice encodes a secret message on their message qubits in terms of superdense coding and then sends her message qubits to Bob. After receiving Alice‚Äôs message qubits, Bob decodes them so as to get the secret message. We prove rigorously that the proposed QSDC protocol can resist the known attacks so far, particularly the man in the middle attacks. At the same time the proposed protocol is similar in the communication way to the common communication.
  Bo Yang and Zheng Qin
  The aim of this study is to solve the problem of composing semantic Web services with AI planner. Automatic semantic Web service composition is a key technique in the research of Web service. The idea of composing semantic Web services using AI planner has been presented in several studies. In our opinion, since the different application domains and the constraint of precondition that AI planners have, none of the existing planners can deal with the problem of semantic Web services composition perfectly. In this study, we present an algorithm for translating semantic Web service composition problem to AI planning problem described in PDDL. Based on this algorithm, according to the situation of the problem, we can use the most suitable AI planner to compose Web services. One of our goals is to support the claim that AI planner can be used in the domain of semantic Web service composition. The other goal of ours is that the description of semantic Web services can be translated into a description written in PDDL. There are also several key procedures of the translating algorithm in this study.
  Rongyu He , Zheng Qin and Shaojie Wu
  The authenticity and integrity of software running on mobile equipment is relevant and important in m-commerce. Mobile trusted computing can solve the problem by using Reference Integrity Metric (RIM) certificate. But the RIM certificate stored in Mobile Trusted Module (MTM) is suffered to frequently renew while the software is updated or patched. In the study, a user-specific RIM, uRIM, is presented. Based on the uRIM, a novel software integrity verification protocol is proposed. It allows an easy management of RIM to support the secure boot as well as a low-cost on verifying of software authenticity.
  Wenhua Xu , Zheng Qin and Yang Chang
  During the last decade, classification from data streams is based on deterministic learning algorithms which learn from precise and complete data. However, a multitude of practical applications only supply approximate measurements. Usually, the estimated errors of the measurements are also available and they are valuable supplemental information for the classification process. Therefore, the development of highly efficient algorithms dealing with uncertain examples has emerged as an exciting new direction in stream data mining literature. In this study, an ensemble classification model ECluds is built from data streams having uncertain attribute values. ECluds applies supervised k-means clustering algorithm on uncertain data stream chunks, then extracts sufficient statistics into micro-clusters. An ensemble of micro-clusters performs classification on test examples using nearest neighbor algorithm and majority voting strategy. Our experiments on synthetic and real-world datasets show that ECluds is highly scalable for data streams and more effective than a purely deterministic method.
  Xing-Chen Heng , Zheng Qin , Xian-Hui Wang and Li-Ping Shao
  A new approach to learning Bayesian networks (Bns) was proposed in this study. This approach was based on Particle Swarm Optimization (PSO). We start by giving a fitness function to evaluate possible structure of BN. Next, the definition and encoding of the basic mathematical elements of PSO were given and the basic operations of PSO was designed which provides guarantee of convergence. Next, full samples for the training set and test set are generated from a known original Bayesian network with probabilistic logic sampling. After that, the structure of BN was learned from complete training set using improved PSO algorithm steps. Finally, the simulation experimental results also demonstrated sthis new approach’s efficiency.
  JunYing Chen , Zheng Qin and Ji Jia
  In this study, we propose a weighted mean subtractive clustering algorithm in which new cluster centers are derived by using weighted mean method on the data points around the center prototypes found by subtractive clustering. Comparisons between weighted mean subtractive clustering and other clustering alogrithms are performed on three datasets by using three indexes and visual methods. The experimental results show that weighted mean subtractive clustering finds more reasonable cluster centers and groups data better than other clustering alogrithms do.
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility