Latest issue

International Review on
Computers and Software
(IRECOS)
December 2012 (Vol. 7 N. 7)

Part A - Part B - Part C

Performance Comparison of Various Chaotic Maps in CDMA-DCSK Multiuser SISO Systems

by M. Sangeetha, Vidhyacharan Bhaskar

Vol. 7 n. 7, pp. 3402-3408

Abstract - A CDMA based multiple access schemes for M-ary Differential Chaos Shift Keying (M-DCSK) in Single-Input-Single-Output (SISO) system is proposed in this paper. Using Walsh Hadamard codes, multiuser access can be provided for both synchronous and asynchronous multiuser M-DCSK system. Various chaotic maps are used to generate the chaotic sequences required for the M-DCSK scheme. Theoretical Bit Error Rate (BER) of the proposed system is analyzed and an expression for BER is obtained. The performance of the system is evaluated for various chaotic maps, its spreading lengths, number of active multiple users and average SNRs.

Keywords: CDMA, Logistic Map, M-Ary Differential Chaos Shift Keying (M-DCSK), Single-Input-Single-Output (SISO) System, Walsh Hadamard Codes.

An Enhanced ID-Based Multi-Decrypters Encryption Scheme

by Wei Yuan, Liang Hu, Hongtu Li and Jianfeng Chu

Vol. 7 n. 7, pp. 3409-3413

Abstract - Multi-decrypters encryption is a typical application of public key cryptology. Recently, Chai et al. proposed an ID-based multi-decrypters encryption and declared their scheme was secure against chosen ciphertext attack. In this paper, we find that scheme cannot withstand the internal attack. That is, each decrypter participating into the encryption can forge a decryption share and deceive other participators for its special status, but any other participators cannot detect it. Then we analyze the reasons for that problem and propose an enhanced identity-based multi-decrypters encryption scheme in which the forged decryption share can be verified if a decrypter deceives others. Our enhancement makes Chai et al.’s scheme closer to practical environment.

Keywords: ID-based cryptography, Secret sharing, Bilinear map, Multi-Decrypters Encryption, Cryptanalysis.

An Approach to Testing Systems Based on Stream X-machines with Probability Intervals

by Qian Zhongsheng

Vol. 7 n. 7, pp. 3414-3419

Abstract - This work proposes an empirical usage model based on Stream X-machines (SXMs for short) with the transitions enhanced with probability intervals information. A probabilistic SXM is a computational model capable of describing both the data and the control aspects of a given system. According to the probabilistic SXM usage model of the system, it details the process of generating test cases. The testing process is based on the idea that different parts of the system have different execution frequency. Therefore, the test cases produced ensure that the failures occurring most frequently in operational uses will be found early in the test process.

Keywords: Probabilistic Stream X-Machine, Probability Interval, Test Case.

Research on 3D Human Micro-Particle Motion Characteristic Based on Semantic Multi-Modal Method

by Jian Xiang, Jiang Lin, Dingfei Ge

Vol. 7 n. 7, pp. 3420-3424

Abstract - This paper has proposed 3D Human Micro-Particle Motion Characteristic analysis and retrieval method based on semantic multi-modal. It uses semantic-related multimedia objects to label on each multimedia object and a new multi-modal indexing method with calculating the total similarity of each object and the query is presented to achieve a unified multi-modal data retrieval system. Experiment results show that the approaches are effective to discover the movement 1aw of micro-particle in the human airway and improve the short-term and long-term accuracy of analysis.

Keywords: Motion Control, Retrieval, Semantic, Multi-Modal.

A Task partitioning and Scheduling Method in P2P Network Environment

by Lin Jinjiao, Pu Haitao,Song Yanwei

Vol. 7 n. 7, pp. 3425-3429

Abstract - Improving the workflow execution efficiency is now an important problem with great academic concerns. This paper introduces the P2P network nod context into the workflow management to build a task partitioning method based on the finite automata of workflows. By defining the processing capability evaluation indexes of the nodes, an ant colony task scheduling method is given through some improvement on the colony optimization.

Keywords: P2P Network, Node context, Task Partitioning, Task Scheduling.

An Improved Results Merging Mechanism of Meta-Search Engine

by Qingshan LI, Bin XI, Xin LI, Mengxia ZHU

Vol. 7 n. 7, pp. 3430-3434

Abstract - The quality of results merging methods of meta-search engine will directly affect the performance of meta-search engine and the user’s experience, in order to improve the retrieval precision of meta-search engine, this paper presents an improved results merging mechanism of meta-search engine, through building a results merging model of meta-search engine based on Agent, importing the Agent's autonomy and self-adaptive, and bring user interest factors into the results merging algorithms to achieve personalized results, and calculate the weight of the member search engine, finally combine the user interest, the weight of the member search engine and the location information together to sorting the results so that can improve the user experience. The tests show that the proposed mechanism has better search relativity than these existing merging mechanisms.

Keywords: Meta-Search Engine, Results Merging, Agent, User Interest.

A Modeling Approach of Medical Knowledge Based on Ontology for Opening Management

by Qingshan LI, Can CUI, Zhifu YANG, Hua CHU

Vol. 7 n. 7, pp. 3435-3439

Abstract - This paper gives a modeling approach of medical knowledge, analysis the static characteristics of current knowledge modeling approaches, proposes a model of ontology medical knowledge, defines a knowledge descriptive language, supports dynamic integrated and expanded of knowledge, combination with open clinical intelligent decision support system and expert knowledge design tools, does a test on dynamic integrated and expanded of knowledge based on open knowledge management of ontology medical modeling method, and discusses the characteristics of ontology knowledge modeling approach based on opening management.

Keywords: Decision Support System, Knowledge Modeling, Ontology, Knowledge Management.

Power Prediction Based Feedrate Optimization Model for the Roughing Processes of CNC Machine Tools

by Gu Zhenyu, He Yan, Hu Shaohua, Zheng Jiajia

Vol. 7 n. 7, pp. 3440-3445

Abstract - Feedrate optimization is significantly essential to improve the processing efficiency. To achieve it, this paper proposes a power prediction based feedrate optimization model for the roughing processes of CNC (Computer Numerical Control) machine tools. The power equation of the feeding system and roughing processes are analyzed, which describes that there is a quadratic function of input power and the feed force. Based on the power equation of the feeding system and the empirical equation of the feed force, the feedrate optimization model is derived. Neural network has been exploited to predict the power based on the measured power in real time. The model can predict the cutting situation by calculating the cutting depth. And then, the desirable feedrate can be deduced from the expected value of power and the value of cutting depth. The proposed model is solved in Simulink simulation environment. The results show the model can effectively forecast on the cutting conditions and the controller can auto tune the speed of feeding system according to the desirable feedrate.

Keywords: CNC Machine Tools, Roughing Processes, Feedrate Optimization, Power Prediction.

A Server-Aided Verification Signature Scheme without Random Oracles

by Bin Wang

Vol. 7 n. 7, pp. 3446-3451

Abstract - Wu et al. defined three security notions for server aided verification (SAV) protocols to prevent a server from convincing a verifier that an invalid signature is valid. Security against strong collusion attacks provides the strongest security guarantee among these notions. They constructed SAV protocols to meet these notions respectively. But they did not provide concrete running time to show that the running time of a verifier in their SAV protocol is strictly less than that of a verifier in the original verification protocol. In addition, a problem left open by their work is to design a SAV protocol which is unforgeable without random oracles as well as sound against strong collusion attacks. To address the above issues, we first design a SAV-Hofheinz protocol for a short signature proposed by Hofheinz, which is unforgeable in the standard model. Then we implement SAV-Hofheinz by the PBC library and show that the running time of a verifier in SAV-Hofheinz is strictly less than that of a verifier in the original verification protocol.

Keywords: Pairing, PBC Library, Server-Aided Verification, Short Signature.

An Improved Segmentation Method Based on Semi-fuzzy Cluster

by Zengqiang Ma, Yongqiang Wang,Yacongzheng, Xingxing Zou

Vol. 7 n. 7, pp. 3452-3457

Abstract - The original image segmentation method based on ESFCM(Edge-based Semi-Fuzzy C-means Clustering Method), which is named as original ESFCM in the paper, is introduced firstly. Then, three defects of the original ESFCM, which involves the great error in the initial subclass partition, the high calculation amount and the poor performance of anti-noise, have been analyzed and summarized. In order to solve the three problems, an improved ESFCM is put forward based on the supplement of the edge connection algorithm and redefinition of the spatial distance. Later, the comparisons of segmentation accuracy, calculation amount and anti-noise performance between the original ESFCM and the improved one have been carried out. The experiment results shows that the image segmentation precision and the anti-noise ability have been greatly increased and the calculation amount significantly decreased after the original ESFCM was substituted by the improved one.

Keywords: Image Segmentation, Edge-Based Semi-Fuzzy c-Means Cluster, Edge Connection, Fuzzy Distance.

Panorama Quality Assessment

by Mohammad Javad Fadaeieslam, Mahmood Fathy, Mohsen Soryani

Vol. 7 n. 7, pp. 3458-3462

Abstract - Many algorithms have been developed to create panoramic views from still images. In most of cases, the results are evaluated qualitatively. In this paper, a robust and novel method is proposed for quantitative assessment of mosaicing methods. It uses covariance descriptor to evaluate the structural similarity between panoramic view and original input images. The main advantage of this approach is its coordination with synthetic nature of the mosaicing process. Some simulations were arranged to demonstrate the effectiveness and robustness of this assessment method.

Keywords: Panorama, Quality assessment, Covariance Descriptor.

Identification of Tobacco Disease Using Content-Based Image Retrieval with Interactive Image Segmentation

by Yi Wang,, Cheng Cai

Vol. 7 n. 7, pp. 3463-3469

Abstract - Traditional tobacco disease recognition depends on tobacco experts or some complicated biological or chemical experiments, which is inconvenient and time consuming. Here is an image retrieval method introduced to identify tobacco disease type by means of a self-designed software system. Graph-based image segmentation and interactive segmentation methods are applied to extract the useful information of tobacco leaves infected with disease, and then specific descriptors are used to compute similarity or dissimilarity between these objects as the preparation for image retrieval. The whole software is written by C# language, and is intended for tablet PC. In the experiment, the software has a good performance for image retrieval of tobacco diseases and we have also confirmed that image retrieval can be applied to tobacco disease recognition as well.

Keywords: Tobacco Disease Diagnosis, Interactive Image Segmentation, Content-Based Image Retrieval, MPEG-7 Color Descriptor, Image Retrieval of Assistant Diagnostic System, Tobacco Disease.

Enhancing Underwater Image by Dehazing and Colorization

by Huimin Lu, Yujie Li, Lifeng Zhang, ,Seiichi Serikawa

Vol. 7 n. 7, pp. 3470-3474

Abstract - This paper describes a novel method to enhance underwater images by dehazing and colorization. Scattering and color change are two major problems of distortion for underwater imaging. Scattering is caused by large suspended particles, like fog or turbid water. Color change corresponds to the varying degrees of attenuation encountered by light traveling in the water with different wavelengths, rendering ambient underwater environments dominated by a bluish tone. Our key contribution is to propose a single image dehazing algorithm, to compensate the attenuation discrepancy along the propagation path, and to take the influence of the possible presence of an artificial lighting source into consideration. Next, the water depth in the image scene is estimated. A simple colorization method is utilized for restore color balance. The enhanced images are characterized by reduced noised level, better exposedness of the dark regions, improved global contrast while the finest details and edges are enhanced significantly. In addition, our enhancement method is comparable to higher quality than the state of the art methods.

Keywords: Underwater Imaging, Dehazing, Colorization.

Automatically Extracting Event Knowledge from Text Based on the Event Model

by Wei Xu, Ke Zhao, Yatao Li

Vol. 7 n. 7, pp. 3475-3480

Abstract - Event knowledge is playing an increasingly important role in a number of areas. The purpose of this paper is to automatically extract event knowledge from text. Based on the event model, this paper presents the definition of event, and builds the framework of dynamic event to represent the instantiation knowledge of events and the framework of static event to describe the general knowledge of events. It discusses the relationship between the attribute values of dynamic events and that of corresponding static event, and establishes the concept hierarchy trees to express their relations. Based on these analyses, an algorithm for automatically extracting event knowledge from text is presented. The result of the final experiment demonstrates that the proposed algorithm is feasible and effective.

Keywords: Natural Language Processing, Information Extraction, Event, Event Extraction, Event Knowledge.

A Detour-Path Based Fault-Tolerant Routing Algorithm for Network On Chip

by Zhou Lei, , Wu Ning, Hu XueLong, Ge Fen

Vol. 7 n. 7, pp. 3481-3487

Abstract - A fault-tolerant and deadlock-free routing algorithm which applied in 2D-mesh is proposed to solve the problem of the permanent and unpredictable failure occurrence in Network on Chip. Firstly a new definition of fault block is proposed, which reduces the number of affected healthy nodes in faulty block compare to regular definition, and then a detour-path construction algorithm is designed to implement the construction of fault block and the generation of detour-path list by recursive of message deliver. The detour-path routing algorithm combines the detour-path list and routing rules to avoid the faulty block, which decreases delay by simplifying the routing calculation. The experimental results show that the proposed algorithm achieves a reduction of average delay under uniform random distribution and hotspot distribution.

Keywords: Network on Chip, Mesh, Fault-Tolerant, Deadlock-Free, Routing Algorithm.

The Decoherence Suppression in Cavity QED via Rabi Oscillation Stabilization

by Ming Li, Wei Chen

Vol. 7 n. 7, pp. 3488-3493

Abstract - For eliminating the unexpected decoherence effect to the Rabi oscillation, the transfer function of Rabi oscillation is deduced using optical Bloch equations, in which one of the important cause of decoherence in Cavity QED - the atom’s spontaneous emission is considered especially. A root locus based compensation system is proposed to realize coherence preserving via Rabi oscillation stabilization. Finally, a quantum tomography technology combined physical realization is put forward in succession and the simulation results have proved its effectiveness and superiority.

Keywords: Cavity QED, Rabi Oscillation Stabilization, Decoherence Suppression.

Emotion Recognition System of Finger Braille

by Yasuhiro Matsuda, Tsuneshi Isomura

Vol. 7 n. 7, pp. 3494-3501

Abstract - Finger Braille is one of the tactual communication methods utilized by deafblind individuals. Deafblind people who are skilled in Finger Braille can catch up with speech conversation and express various emotions by changing dotting strength and speed. In this paper, we developed an emotion recognition system, which recognizes four emotions (joy, sadness, anger and neutral) expressed by the deafblind person. The emotion recognition system calculated the probabilities of four emotions (joy, sadness, anger and neutral) about each dotting, and the dotting is classified into the emotion that is the highest in the probability. Then, the means probabilities of four emotions about a sentence are calculated, and the sentence is recognized as the emotion that is the highest in the mean probability. An experiment to verify the execution of the emotion recognition system was conducted. A sender dotted six characters of “u” with joy, sadness and anger on the hands of a receiver. As a result, regardless of the accuracy of emotion recognition of dotting was 78.1%, the accuracy of emotion recognition of sentence was 96.7%. The results showed that the algorithm of emotion recognition was effective in the developed system, and could recognize these emotions of sentences.

Keywords: Emotional Communication, Finger Braille, Deafblind, Recognition, Classification.

Mean-Shift Tracking Algorithm Based on Fused Texture Feature of Contourlet Transform

by Xuelong Hu, Wei Fang, Wanpei Chen, Tongyu Jiang, Canjun Qian

Vol. 7 n. 7, pp. 3502-3506

Abstract - Object tracking is a very important research subject, and its achievements have been applied in a wide field. In traditional Mean-shift algorithm only the color features of object was used. When the object has a greater rotation, the object could not be tracked effectively. An improved Mean Shift united with texture was proposed. The sub-image of tracking window was decomposed by the Contourlet transform, and the statistical properties of multi-level Contourlet coefficients were used to constitute a texture feature vector. Then it was weighted and fused with the color histogram feature vector as the final matching feature vector. The experimental results show that this method obtains better accuracy and robustness compared with the traditional Mean-shift based on color probabilistic histogram model on the condition of object rotation.

Keywords: Contourlet Transform, Mean-Shift Algorithm, Object Tracking, Texture Feature.

Computational Soundness of Diffie-Hellman Key Exchange Against Active Attackers

by Fan Zhang, Zhoujun Li, Liang Gan

Vol. 7 n. 7, pp. 3507-3512

Abstract - Significant progress was made in proving that symbolic models offering basic cryptographic operations such as encryption and digital signatures can be sound with respect to actual cryptographic realizations and security definitions. In this paper, we first introduce an extension of the Dolev-Yao algebra that allows protocol designers to express the Diffie-Hellman scheme as part of their protocols. We prove that even in the presence of arbitrary active adversaries, any Dolev-Yao attack that violates the formal version of the Diffie-Hellman assumption maps to a computational algorithm that violates the computational Diffie-Hellman assumption also. This yields the first computational soundness result for Diffie-Hellman key exchange against active adversaries.

Keywords: Computational Soundness; Symbolic Cryptography; Diffie-Hellman Key Exchange.

A Hybrid Routing Algorithm for Load Balancing in Wireless Mesh Networks

by Liu Chunxiao, Chang Guiran, Jia Jie, Sun Lina, Li Fengyun

Vol. 7 n. 7, pp. 3513-3519

Abstract - As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. So as to solve the load balancing problem in wireless mesh networks, this paper proposed a routing algorithm based on the leftover load rate first. And the routing algorithm was applied to the routing protocol based on the combination of genetic algorithm and ant colony algorithm. Taking advantage of genetic algorithm was used to produce the original results, they were transformed into the initial pheromones value needed by ant colony algorithm, then ant colont algorithm tunity of the two algorithms. Simulation results show that the algorithm proposed in this paper can effectively achieve the load balancing in the wireless mesh networks, improve the network throughput and the network performance.

Keywords: Wireless Mesh Network (WMN), Load Balancing, Leftover Load Rate, Genetic Algorithm, Ant Colony Algorithm.

Modeling of Processes, Systems and Knowledge: a Multi-Dimensional Comparison of 13 Chosen Methods

by Eldar Sultanow, Xingxing Zhou, Norbert Gronau, Sean Cox

Vol. 7 n. 7, pp. 3520-3531

Abstract - Modeling methods are apposite for describing complex situations and their relations in the global world of business - a field which is heavily driven by information management systems. Many approaches attempting to discern differences among these methods already exist in literature; however, as we shall argue, to compare all the methods in one-dimension is not appropriate. By carrying on a broad literature study, this examination aims to identify various dimensions in order to create a multidimensional framework for compassion. Thirteen methods, which are based on different backgrounds, will be used as the objects for this evaluation.

Keywords: Modeling, Process Visualization, Knowledge Intensive Processes, Awareness.

Part A - Part B - Part C

Modeling of Complex Rolling Multi-Agent System

by Yeqing Zhao, Guihong Bi

Vol. 7 n. 7, pp. 3532-3537

Abstract - The aim of this paper is to present a new modeling method for complex steel rolling logistics system. Because of interior relation complexity and flexibility demanded in production of rolling logistics system, the rolling system was defined as a multi-agent systems, agent behavior was decomposed into action and status and that is devoted to utilizing Petri nets for modeling and describing of dynamic process. Then, the model of complex rolling multi- agent system is developed and modeling process is discussed on detail, especially, four type agent, namely, transport agent , heating furnace agent, rolling agent and buffer agent was generalized. Moreover, communication process of agents was designed and behavior reasoning was analyzed in rolling system. At last, a case study of rolling logistics system is provided to show the applicability of our approach and the simulation results show that the modeling method is correct and effective.

Keywords: Complex System, Petri Nets, Steel Rolling System, Multi-agent Systems.

A Task Decomposition Method of RoboCup Rescue Robot System based on k-Mean Clustering

by Jianping Chen, Sijie Ouyang, Qijun Xiao, Yimin Yang

Vol. 7 n. 7, pp. 3538-3546

Abstract - As one of the hotspots in the field of multi-robot system in recent years, Task planning of multi-robot system belongs to the research category of multi-robot cooperation problem, and it mainly includes two aspects, namely, task decomposition and task allocation. For the complicated goal task of multi-robot system, reasonable task decomposition can reduce the complexity of task allocation and improve the efficiency of task execution. According to the task decomposition problem of rescue robot system under dynamic searching environment, and on the basis of a brief analysis of total task generation mechanism of the system, k-mean algorithm is introduced into the task decomposition problem of multi-robot cooperative environment exploring. The approach kMC-RCRSTD is proposed in this paper based on k-mean clustering which is used in task decomposition of RoboCup rescue system. The simulation results show that kMC-RCRSTD is superior to all other approaches for its good performance in task decomposition and advantages of low rate of off-group points, small subtask difference degree, low time complexity, etc.

Keywords: RoboCup Rescue Robot System, Task Decomposition, Task Allocation, k-Mean Clustering, Map.

A Novel Algorithm of Uncover Directed and Fuzzy Communities Using Nonnegative Singular Value Decomposition

by Lulu Chang, Huijia Li

Vol. 7 n. 7, pp. 3547-3553

Abstract - Most existing clustering approaches require the complete graph information and can’t find directed fuzzy modules in large-scale real networks. We proposed a novel algorithm which does not embrace the universal approach but instead tries to focus on the directed networks in a fuzzy view. We introduce a new method which decomposes a directed network into modules by optimally decomposing the asymmetric feature matrix of the directed network into two matrices separately representing the closeness degree from node to community and the closeness degree from community to node. Their combined result uncovers the community structures in a fuzzy sense in the directed networks. The illustrations on an artificial network and a word association network give reasonable results.

Keywords: Directed Network, Fuzzy Community Structure, Singular Value Decomposition, Word Association Network.

A Computer-Based Algorithm for Machine Fault Diagnosis

by Li Li, Dexue Zeng, Hongmei Wang, Baojia Chen

Vol. 7 n. 7, pp. 3554-3558

Abstract - Since mechanical vibration signal contains a lot of noise, it is an important problem in machinery diagnosis to extract the useful information from measured signals. The paper presents a method based on parametric model -- hidden Markov model (HMM) to diagnose mechanical faults. First, wavelet packet method is used to decompose a measured signal into a set of sub-band signals. The energy values of the sub-band signals based on wavelet packet energy spectrum (WPES) are extracted as the feature values, which are normalized and quantification coded to be used as the input of HMM model. Then, HMM is trained to make the output of N dimensional model (represented by N types of faults) achieve maximum likelihood probability (MLP). The fault classifier based on HMM is obtained. Finally, when a detected signal input to the classifier, the type corresponded to the MLP is the fault type to be diagnosed. Applied the method to rolling bearing diagnosis, different faults in the rolling ball are identified. The results show that this method is simple and reliable, and with good diagnosis effects.

Keywords: Hidden Markov Model (HMM), Wavelet Packet Energy Spectrum (WPES), Maximal Likelihood probability (MLP), Machine Fault Diagnosis.

A Novel Numerical Tool Based On Game Analysis for the Evaluation of the Impact of Knowledge Spillovers on Regional Cooperative Knowledge Innovation Decision

by Caimei Hu, Fulei Wei

Vol. 7 n. 7, pp. 3559-3564

Abstract - Based on game analysis it analyzing the impact of knowledge spillovers and their benefits on the condition includes leader region and follower region in cooperation decisions. It finds that the influence of knowledge spillovers is bi-directional; prior knowledge investment of the leader region has positive relation with the follower region’s outgoing spillovers and has negative relation with outgoing spillovers of themselves; prior knowledge investment of the follower region has positive relation with the leader region’s outgoing spillovers and negative relation with outgoing spillovers of themselves; the costs of the leader region and the follower region for current knowledge innovation effort investment has positive relation with outgoing spillovers. It uses numerical simulation methods to analyze the impact of incoming and outgoing knowledge spillover on regional cooperative knowledge innovation.

Keywords: Knowledge Spillovers, Cooperative Knowledge Innovation, Game Analysis.

Customer Requirement Mapping Algorithm Oriented to Information Network Business

by Yingzhao Wang, Mei Meng

Vol. 7 n. 7, pp. 3565-3570

Abstract - Mapping customer requirements to design requirements is one of key procedures in product design. With the method of analytic network process, traditional house of quality model is optimized which combined the characteristics of customer requirements oriented to information network business, and the improved model of house of quality employed to achieve the conversion from the requirements of information customer to product design requirements. Targeting on the optimized satisfaction improvements of product design from customers. an optimized mathematic model is established and the corresponding algorithm is given by fuzzy set theory. Finally, the mapping of customer requirements of the ship order oriented to information network business is exemplified to validate the method.

Keywords: Customer Requirement, Information Network Business, Mapping Method.

Intelligent Network Sensor Terminal GPRS-Based for Multiparameter Water Quality Monitor System

by Dehua Wei, Hongyan Yan, Yanning Kang, Gangzhu Pan

Vol. 7 n. 7, pp. 3571-3575

Abstract - Intelligent network sensor is an important development direction of the current sensor technology, which has a broad application prospect in water quality monitoring. This paper has proposed a sensor terminal system for multiparameter water quality, which is integrated with sensor instrument to collect water quality data and acquire YSI multiparameter, the instrument’s outputs are transmitted to monitor center through the RS232 interface with GPRS data terminal. The experiment results demonstrate all water parameters form the sensor terminal are very close to the actual parameters, and the sensor system has the strong capability of anti-interference and its signal transmission distance is also long.

Keywords: Sensor Terminal, Water Quality, Multiparameter.

PER Estimation of AIS in Inland Rivers based on Ray Tracking

by Feng Ma, Xiumin Chu, Chenguang Liu

Vol. 7 n. 7, pp. 3576-3582

Abstract - The Automatic Identification System (AIS) is an important maritime safety device, which is populous in inland rivers. Compared with that in open sea, the Package Error Rate (PER) of AIS in inland river has increased sharply due to its complex environment. With the help of hardware-in-loop simulation, it is possible to make statistical calculation on the PER under a given field strength and describe the data by quadratic rational fraction. Meanwhile, the ray tracking method will calculate the field strength accurately in certain position, which means it is possible to estimate the PER of the AIS in a given position. And the method proves accurate and effective by field testing.

Keywords: Automatic Identification System, Package Error Rate, Ray Tracking, Field Strength.

PROMETHEE: A Fuzzy Algorithm for Decision Making in Stock Market Value Investing

by Hua Li, Shuanghong Qu, Hua Zhu

Vol. 7 n. 7, pp. 3583-3588

Abstract - This thesis introduces the fuzzy PROMETHEE method to the investment decision-making process of value investing. Five performance criteria are used for measuring the growth potential of firms and are represented by fuzzy numbers based on the real financial data. The fuzzy PROMETHEE method is applied to rank 20 randomly selected stocks in Shanghai Stock Exchange. The portfolio with top 5 stocks is proven to have higher return and less risk than the portfolio with the top 10 stocks throughout the whole 17-month investment period. The empirical study shows the effectiveness of the fuzzy PROMETHEE method in the decision making process of value investing in stock markets.

Keywords: Fuzzy Sets, Decision Making, Finance, Value Investing, PROMETHEE.

A Novel Workflow Engine Method and Metadata Directory Method to Meet the Mapping Requirements between Data and Services

by Jianwei Zhang, Yuntian Teng, Pan Deng, Ming Cai, Shilong Ma

Vol. 7 n. 7, pp. 3589-3593

Abstract - National Earthquake Data Sharing and Exchanging Platform (i.e. National Earthquake Data Grid) is used to solve the demands of data sharing, interoperability and coordinately access in earthquake industry. However, the heterogeneous, distributed and variety data resources make it difficult to share and coordinately access. This paper first propose a novel workflow engine method, which uses Globus service to package heterogeneous resources to achieve the unified access, workflow technology to achieve the coordinately access in distributed environment, and metadata directory method to meet the mapping requirements between data and services. Then we implement this workflow engine in Earthquake Data Grid. Experiment results show that our system can be expanded and applied to other appropriate industries.

Keywords: Data Grid, Globus, Workflow Engine, Earthquake.

A New Application of Agent of Multiple Expert Systems for Oil-Gas Reservoir Protection

by Li Yang, Xinyu Geng, Jian Zhang

Vol. 7 n. 7, pp. 3594-3599

Abstract - To solve collaboration problem between multi-expert system, agent-based task decomposition model is introduced to multi-expert system. Firstly, a minimum-cost-based formal description of task decomposition is presented. With the minimum-cost-function, task decomposition method based on AND/OR tree is proposed. Secondly, heuristic algorithm for task decomposition is analyzed to solve communication among agents. Cooperation model based on contract net between multiple expert agents is proposed, inviting bid, bid, winning bid model are analyzed and can solve the collaboration problem among expert-agents very well. For illustration, expert system for oil-gas reservoir protection is utilized to verify the effectiveness of the method. Finally, our proposed model can effectively solve the collaboration of experts in the multiple-expert system and improve the accuracy of inference.

Keywords: Heuristic Algorithm, Intelligent Agent, Multi-expert, Task Decomposition, Contract Net.

A Signal Threshold Denoising Method Based on Improved EEMD

by Jianzhao Huang, Jian Xie, Qinhe Gao, Liang Li

Vol. 7 n. 7, pp. 3600-3604

Abstract - To confirm the IMF number decomposed in ensemble empirical mode decomposition (EEMD) and select proper IMFs for denoising, a method for signal denoising based on improved EEMD is put forward. In this method, the IMF number decomposed in EEMD is conservative estimated by using the original EMD firstly, and the whole stop criterion of EMD employed in EEMD is modified as the IMF number. According to the EMD decomposition characteristics of the white noise, the IMFs for signal denoising are selected based on the changing discipline of the product of energy density and average period of the IMF. By using the signal to noise ratio, root mean square error and correlation coefficient as the evaluation index, simulation experiment results illustrate that compared with other methods, the current method is feasible and effective.

Keywords: EEMD, IMF Selection, IMF Number, Signal Denoising.

A Novel Algorithm for Analysis of Buyer Satisfaction for the Third Party Logistics in C2C E-Commerce Market

by Qinghua Zhang

Vol. 7 n. 7, pp. 3605-3610

Abstract - The development level of logistics has been far more behind the demand for E-commerce development and logistics is becoming the bottle neck restricting the E-commerce development of China. In this paper, we focus on buyer satisfaction for the third party logistics in C2C E-commerce market, based on the ORC model, put forward correlative hypotheses and verified the model and hypotheses by means of questionnaire survey and data analysis. The research results are that under C2C net shopping background, operation quality shows no significant positive effect, relationship quality shows less significant positive effect and cost quality shows significant positive effect to buyer satisfaction for the third party logistics, and relationship quality shows significant positive effect to operation quality and cost quality. In C2C E-commerce market, the third party logistics enterprises can take the research results as reference if they intend to improve customer satisfaction degree and obtain further development.

Keywords: E-commerce, C2C, Third Party Logistics, Buyer Satisfaction .

A New Software Tool for Design and Simulation of RF Amplifiers Based on the Smith Chart

by Yong Fu, Qiang Guo, Changying Chen, Xiangzhi Liu, Yinglong Wang

Vol. 7 n. 7, pp. 3611-3616

Abstract - An impedance transformation trace generation algorithm and a design tool based on the Smith chart are presented in this paper. The S parameter extraction and stability analysis of RF amplifiers are considered at first, then we design a Smith chart tool with circuit schematic realization, we also study a 2-port impedance transformation trace generation algorithm based on the binary tree in detail, then the expression generation and calculation method for impedance transformation are designed and discussed. At last the algorithm is employed to simulate an impedance transformation circuit and realize a practical RF amplifier. It’s shown that the algorithm and tool is precise and efficient. This algorithm and tool suggests applications to simulation and design of impedance matching networks for RF amplifiers.

Keywords: Smith Chart, Binary Tree, Wireless Communication, RF Amplifiers.

Modeling and Prediction with Wavelet Neural Network in the On-Linear Time Series

by Aiyun Li, Jianhua Wu

Vol. 7 n. 7, pp. 3617-3621

Abstract - The traditional time series prediction model is not able to achieve a satisfying prediction effect in the problem of a non-linear system and nonstationary time series, especially the system in which people participate in or a social economic system. To solve these problems, this paper presents essential research on modeling and prediction with wavelet neural network in the non-linear time series. On this basis, combining the wavelet analysis and RBF neural network to establish combination forecasting model, a runoff prediction model with RBF neural network is established in Matlab environment. Application Mallat algorithm analysis the monthly runoff series of Fenhe Dam station. This model is verified by the practical example that it converges fast and has a high precision. Comparing RBF net with BP net, RBF net shows better superiority.

Keywords: Wavelet Analysis, RBF Neural Network, Runoff Forecasting, Fenhe Reservoir.

Large-Scale Graph Processing: Two Effective Solutions using MapReduce Programming Model

by Jianjun Yang, Dawei Cai

Vol. 7 n. 7, pp. 3622-3626

Abstract - Many graphs with the scale of millions of vertices and billions of edges are difficult to analyze. To improve efficiency and accelerate the algorithms researchers have increasing turned to distributed solutions. These include MPI, PVM, Pregel etc. The most popular technology is the MapReduce programming model. In this paper, we elaborate the general steps to implement some graph algorithms using MapReduce. And we also present another effective solution---- Bsp(Bulk-Synchronous Parallel)[12] to accelerate the algorithms. We innovatively use these two solutions to compute the connected components of an undirected graph which has never been proposed. In Bsp programming model, programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent from the previous iteration, modify its own state, then sent messages to other vertices. Through the compare of the experimental results and rational analysis, we got a conclusion: when the graph is not too large to load it into memory, Bsp is a better choice because it runs much faster than MapReduce; otherwise, we should use MapReduce to get the correct result.

Keywords: MapReduce, Bsp, Distributed Computing, Hadoop, Hama.

Optimizing Smith-Waterman Algorithm Based on CPU and GPU Through CUDA Platform

by Mengjia Yin, Xianbin Xu, Zenggang Xiong, Fang Zheng, Tao Zhang

Vol. 7 n. 7, pp. 3627-3632

Abstract - The very rapid growth of biological sequence databases demands even more powerful high-performance solutions in the near future. Smith-Waterman (SW) algorithm is a classic dynamic programming algorithm to solve the problem of biological sequence alignment. In this paper, we proposed new parallelization algorithms based on Smith-Waterman algorithm, which solved the problem of biological sequence alignment and implemented the algorithm on a heterogeneous system based on CPU and GPU through CUDA platform. Some optimization strategies are used in our implementation, the optimization strategies including: instruction optimization based on the loop unrolling, optimized the global memory. We experimented the algorithm on GeForce 9600 GT, connect to Windows XP 64-bit system. The experiment results showed that our new parallel algorithms are more efficient than previous ones; the optimization strategies also can improve performance, and increase speedup.

Keywords: Sequence Alignment, Smith-Waterman Algorithm, Computer Unified Device Architecture (CUDA), Graphics Processing Unit (GPU).

A New Secure Three-Party Authenticated Key Exchange Protocol

by Peng He, WenJing Yang

Vol. 7 n. 7, pp. 3633-3638

Abstract - Authenticated Key exchange (AKE) protocols are essential for secure communications over a public network. AKE protocols not only allow parties to compute a session key but also ensure that parties actually possess the secret session key. Gorantla et al. firstly modeled the security of group key exchange (GKE) protocols addressing KCI attacks, but not considering UKS attacks. We refine the security model in the three-party settings and present the security definition by taking UKS attacks and KCI attacks into account. A one-way authenticated scheme is first proposed. Based on the scheme, we propose a secure three-party authenticated key exchange protocol with key confirmation under the CDH assumption.

Keywords: Three-Party AKC Protocol, Security Model, CDH Assumption, Authentication.

A Computer-based Algorithm for Mechanical Response of Chest Wall to Blunt Ballistic Impact

by Jianyi Kang, Jing Chen, Ping Dong, Hai Liu, Qikuan Zhang

Vol. 7 n. 7, pp. 3639-3645

Abstract - The rapid inward displacement of the chest wall following a blunt ballistic impact is the primary cause of behind-armor blunt trauma (BABT). In this study, based on a CT image dataset of normal adult Chinese males, we construct a three-dimensional human torso finite-element model (HTFEM) using Mimics and HyperMesh software. In the LS-Dyna software environment, a finite element simulation analysis is performed for the blunt ballistic impact caused by a 9-mm handgun bullet with a speed of 280 m/s toward a human torso wearing a soft body armor vest. The distribution and propagation characteristics of the thoracic bone pressure and the equivalent stress are analyzed, with a focus on the movement and displacement of the chest wall. The human injury results predicted by the finite element analysis are found to agree with the injury effects observed in animal experiments and reported in the literature. The HTFEM constructed in this study can realistically reflect the characteristic mechanical response of a chest wall to a blunt ballistic impact. The computational results from this model can provide a basis for the BABT prediction, in-depth studies of the mechanical mechanism and further improvement of protective equipment.

Keywords: Blunt Ballistic Impact, Chest Wall, Mechanical Response, Finite Element Analysis.

Simplified Cubature Kalman Filter to Improve Initial Alignment Accuracy of a Strapdown Inertial Navigation System (SINS) with Large Azimuth Misalignment Angle

by Zhikun He, Guangbin Liu, Xijing Zhao, Xuemei Wang, Bo Zhang

Vol. 7 n. 7, pp. 3646-3653

Abstract - A simplified cubature Kalman filter is proposed to improve the initial alignment accuracy of a strapdown inertial navigation system (SINS) with large azimuth misalignment angle. For large initial azimuth misalignment, the error models of SINS are nonlinear. To solve the problem that application of the Kalman filter to the linearized error models does not yield good estimation, the cubature Kalman filter (CKF) is considered. Under the fact that the measurement model of SINS initial alignment is linear, the standard CKF algorithm is simplified. The computational cost of the resulting algorithm is reduced about 15%. For improved numerical stability, the derivation of a square root version of the simplified CKF is also included in this paper. Simulation results of initial alignment of SINS with stationary base show that the simplified algorithms can obtain high accuracy for misalignment angles estimation and be faster than the standard algorithms.

Keywords: Strapdown Inertial Navigation System, Initial Alignment, Simplified Kalman Filter, Cubature Rule, Large Azimuth Misalignment Angle, Square Root.

Software Architecture Recovery Based on Weighted Hierarchical Clustering

by Han Li, Feng Chen, Hongji Yang, Xin Feng, He Guo

Vol. 7 n. 7, pp. 3654-3659

Abstract - Software architecture reflects the inner structure of software systems, therefore the recovery of software architecture has great significant for software analysis, understanding, reverse engineering and reengineering, especially for legacy systems. Since hierarchical clustering is considered as a vital activity for software clustering, a clustering algorithm called Agglomerative Information Bottleneck Based Weighted Hierarchical Clustering Algorithm (ABWHC) is given to achieve software architecture recovery. The algorithm introduces more meaningful and targeted features for both procedure-oriented and object-oriented entities. Information loss is applied to calculate the similarity between entities, and label sets are generated for entities and clusters during clustering. To evaluate the effectiveness and performance of the proposed algorithm, some experiments are conducted. The results indicate the algorithm improves the accuracy and it is more flexible and targeted for software architecture recovery.

Keywords: Software Architecture Recovery, Hierarchical Clustering, Entity Feature, Weight, Legacy System.

A P2P Streaming Media System with Node Selection Strategy Combined Topology Aggregation and Bandwidth First Algorithm

by Jianchun Li, Daoying Huang, Jianyong Li, Anlin Zhang, Hui Chen, Anqin Zhang

Vol. 7 n. 7, pp. 3660-3664

Abstract - The node selection mechanism is one of the key technologies of P2P Streaming Media System which bases on hybrid P2P network. From current situation, firstly, the paper analyzes basic characteristics of three kinds node selection mechanism, and then propose an improved node selection strategy, which combined topology aggregation and priority of bandwidth algorithm, called Two-Stage algorithm(TS). Simulation program indicates that the performance such as overlay network pressure, media stream quality of service of TS algorithm, which is compared to other three kinds of node selection algorithm, is significantly improved.

Keywords: P2P Streaming Media System, Media Stream Quality of Service, Overlay Network Pressure, Node Selection Strategy.

Performance Analysis of Q-ary Low-Density Parity-Check Coded Continuous Phase Modulations

by Zhijun Zhang, Weifeng Wang, Xintao Duan

Vol. 7 n. 7, pp. 3665-3670

Abstract - In this paper, a serially concatenated nonbinary low-density parity-check (LDPC) coded continuous phase modulation (CPM) system is investigated. The nonbinary LDPC codes are constructed using algebraic methods based on finite fields GF(q) (q>2), which have quasi-cyclic structure and hence easily implemented encoders. Based on the soft-input-soft-output detectors for M-ary CPM, we introduce a q-ary LDPC coded CPM system in which the decoder operates on the symbol likelihoods. Thus, the performance loss incurred in bit-interleaved coded-modulation (BICM) schemes by the conversion between symbol and bit likelihoods is avoided. Simulation results show that the coded modulation system based on q-ary LDPC codes, can achieve better performance than binary LDPC coded systems with the same spectral efficiency.

Keywords: Continuous Phase Modulations, Finite fields GF(q), q-ary LDPC Codes.

Edge Extraction and Z-order Discriminant of Lunar Craters Based on Light Source Vector Reference

by Lei Cao, Fang Miao, Wenhui Yang, Huifen Luo

Vol. 7 n. 7, pp. 3671-3677

Abstract - Crater is the most important characteristics of the lunar surface. Scholars at home and abroad have studied the recognition and distribution of lunar craters, and they have already identified the location of lunar craters and its distributed density. This passage we put forward a method that can extract the edge of craters on the basis of light source vector reference and establish both a discriminating method system of z-order, a coding method of geometric and overlapping features of the lunar craters. Through the logical identification of the coding by the computer, it can achieve the automatic determination of the overlapping sequence of lunar craters. Currently it fills the vacancy of the research in the detailed description and automatic identification of craters, which provides a basis of comprehensive study on the morphology and structure of lunar surface and also gives a technical support for the study of formation and mapping studies of lunar.

Keywords: Remote-Sensing image, Light Source Vector, Edge Detection, Lunar Craters, Circle Fitting.

Practical Beaconless Geographic Routing in Wireless Sensor Networks

by Kun Yu, Xiaobing Chen, Chengfu Sun

Vol. 7 n. 7, pp. 3678-3684

Abstract - Geographic routing is a localized routing scheme that is appropriate to static wireless sensor networks, but may not be efficient in highly dynamic scenarios where network topology changes rapidly due to mobility and node activity. Recently proposed beaconless geographic routing is more appropriate to dynamic scenarios but introduces longer End-to-End delay. Meanwhile, most of the proposed schemes prefer shortest path to energy optimization that is vital to wireless sensor networks. In this paper we propose a new geographic routing scheme that combines two factors, consumed energy and residual energy into the forwarding metric together. The scheme also utilizes the overheard information to estimate the energy distribution among the neighbors of a node and balance the load from the node to its neighbors. The collision is utilized to guarantee the quality of next-hop relay. Certain level of collision is achieved by changing search region and maximum delay. Furthermore, a simplified RTS/CTS handshaking mechanism is used to gain shorter responding delay. The simulations shows that all of these can improve the network performances, including delay, communication overhead and lifetime, and remain the beaconless routings’ property of the adaptability for network dynamic such as duty cycle.

Keywords: Wireless Sensor Network, Beaconless Geographic Routing, Residual Energy-aware, Load Balancing, Energy-efficient.

Part A - Part B - Part C

Fuzzy Image Restoration Algorithm Based on Im-lucy

by Yafeng Xu

Vol. 7 n. 7, pp. 3685-3688

Abstract - In the process of image acquisition, a lot of objective or non-objective factors make the image become fuzzy, so this needs for the restoration of blurred image. In view of the question above, this paper puts forward the fuzzy image restoration technique based on improved Lucy algorithm, the technique made a certain improvement in noise reduction aiming at the defects of noise dealing of traditional Lucy algorithm, using multi-scale and geometric analysis method to suppress noise, and finally reaching the purpose of image noise reduction. The experimental results show that the proposed scheme has a better visual effect in fuzzy image restoration, which is practical and effective.

Keywords: Lucy Algorithms, Fuzzy Image Restoration, Multi-scale Geometric Analysis.

A Weighted Local-World Network with Tunable and Increment Behavior

by Xiaojun Yu

Vol. 7 n. 7, pp. 3689-3697

Abstract - Increment behavior and tunable cluster mechanism are important dynamic evolving mechanisms and exist universally in real systems. In this paper, a new weighted local-world model, which incorporates Increment mechanism and tunable cluster mechanism, is proposed and the topology properties is deduced. Numerical simulations are good agreement with the theoretical results and show good right skewed scale-free properties. Furthermore, we analysis the correlations of vertices by calculate some important coefficients suit to weighted networks and prove the assortative property of this model. Last, epidemic spreading process using weighted transmission rate on this weighted local-world network shows that the tunable cluster behavior has a great impact on the epidemic dynamic.

Keywords: Weighted Network, Local-world Structure, Increment Behavior, Tunable Cluster, Assortative Property, Epidemic Spreading.

Inhomogeneity of Weak Edge Image Level Set Segmentation Algorithm

by Yunxia Pei

Vol. 7 n. 7, pp. 3698-3703

Abstract - For angiographic images in grayscale uneven and weak edge case has been the level set model cannot correctly split vascular problems, proposed a coupling vascular imaging geometry information, edge information and regional level set segmentation method using Hessian matrix anisotropic angiographic target recognition, multi-scale filter to the original image data; then the Laplacian fast edge of the zero-cross point integral method the edge information embedding energy functions, constructing a modified level set segmentation method based on structure, edge and regional information. Compared to rely on the single image edge information or regional information model and the improved model, the method on the uneven split severe grayscale images angiography can accurately extract blood vessels, and the precise positioning of the vessel edges.

Keywords: Inhomogeneity, Blood Vessels, Weak Edge, Level Set Segmentation, Angiographic Images.

Channel Allocation Strategy Based on Cognitive Radio Network

by Jia Chen, Chenxia Zhang

Vol. 7 n. 7, pp. 3704-3709

Abstract - With the rapid development of wireless communication, unauthorized band used is saturated with each passing day. Cognitive radio technology effectively eases the contradiction. Cognitive radio network is able to intelligent hold cognitive radio spectrum, automatic search idle spectrum and use learning and decision making algorithm adaptively to change the working parameter of the system, to improve the utilization ratio of spectrum opened up a brand new way. In this paper, based on a three independent transceiver node physical platform with low cost, put forward a kind of dynamic control channel for cognitive radio ( Dynamic Control MAC protocol DCC-CR Channel based Cognitive Radio MAC protocol ). The protocol avoids the use of fixed control channel bottle neck problem, and on this basis to increase the power control mechanism, improve the network spectrum reuse. In this paper, based on the NS2 platform design of cognitive radio nodes, simulation model, simulation results validate the DCC-CR protocol can effectively improve the aggregate network throughput.

Keywords: Cognitive Network, Channel Allocation, Fixed Control Channel.

Optimal Evaluation Strategy of Practical Teaching Based on Fuzzy-SVM

by Hongxin Wan, Yun Peng

Vol. 7 n. 7, pp. 3710-3714

Abstract - In the evaluation of empirical teaching, it is very difficult to carry out effective assess through some normal methods because of many uncertain value in evaluation system. An evaluation algorithm of empirical teaching is proposed, and the algorithm has been described in detail by example in this paper. Aforementioned technique can improve the algorithm perplexity of time and space, and increase the efficiency and accuracy, simultaneously increase the robustness of evaluation. In order to discriminate the key attributes and sub-key attributes, a SVM classification method is proposed. The valuation values of domain experts include many uncertain data, so the traditional methods of evaluation cannot deal with the data well. Evaluation algorithm based on fuzzy set can improve the reliability and accuracy of by its special ability on incomplete data. The realization process of evaluation strategy is described by example in detail.

Keywords: Multicast Support Vector Machine, Fuzzy Set, Practical Teaching, Fuzzy Evaluation.

Image Inpainting Based on Compressed Sensing

by Zongwen Bai

Vol. 7 n. 7, pp. 3715-3718

Abstract - Image inpainting is a fundamental problem in image processing and has many applications. Motivated by classical image restore model that based methods on image restoration in either the image or the transform domain. Based on the assumption that the nature image are likely to have a sparse representation in wavelet tight frame domain, An image inpainting algorithm is proposed to restore the image containing some missing patches with noise . Based on the sparsity of images, the method translates the problem of image inpainting into image reconstruction in compressed sensing. The inpainting model is solved using the split iteration Simulated image inpainting results demonstrate the efficiency of the proposed method.

Keywords: Image Inpainting,Compressed Sensing, Split Iteration, Variational Model.

An Encryption Scheme for Color Image

by Changjiu Pu

Vol. 7 n. 7, pp. 3719-3723

Abstract - In order to protect information or color image effectively, a new color image encryption scheme based on logistic chaotic mapping and chen chaotic mapping is presented. First, the scheme generate random strong key array using logistic mapping. Then, the global pixels shuffling in rows and columns is implemented using logistic chaotic mapping and simultaneously separate encryption and diffusion encryption of component of every new pixel is also implemented using chaotic mapping and the key array. Finally, Theoretical analysis and experimental results show that the scheme has a large space of keys, the correlation between adjacent pixels is small and it is a good encryption and decryption effects and efficiency.

Keywords: Image Encryption, Logistic Chaotic Mapping, Chen Chaotic Mapping, Color Image.

A Review on Provable Security of Protocols in Wireless Sensor Networks

by Weihong Chen, Xiongwei Fei, Jun Yang

Vol. 7 n. 7, pp. 3724-3728

Abstract - Wireless sensor networks are composed of sensor nodes which are limited in computational capabilities, power and memory resources, and they are susceptible to a variety of security threats. Provable security plays an important role in designing and analyzing the security of protocols in wireless sensor networks. Firstly, the current situations of sensor network security, the security challenges and the security problems were presented. Secondly, the method of provable security is introduced and we review the formal analysis methods using in the WSN. As for the provable security of the wireless sensor network’s protocols, the model-based method and the theoretical analysis method are mainly used. The comparisons were made to help researchers select and design the security protocols for wireless sensor networks. Finally, the further direction of sensor network security techniques is summarized and discussed.

Keywords: Wireless Sensor Networks, Provable Security, Attacks.

Optimizing Site Selection of Rural Distribution Center under Two-way Forward e-Logistics

by Lijuan Huang

Vol. 7 n. 7, pp. 3729-3734

Abstract - With the rapid development of Chinese New Rural Construction and e-logistics technology, it is important to select rural logistics distribution center scientifically and reasonably to integrate two-way forward e-logistics and reduce the logistics costs. In this paper, a new optimized model with minimum cost is established based on the characteristics of two-way forward e-logistics and traditional mixed integer programming model. Through setting an example of site selection with enough data tables, and considering economic losses of agricultural products mainly due to decay during transportation, the best location is ultimately determined with the help of Lingo software. More optimizations are mainly focused on selecting industrial distribution center than selecting rural one, and traditional optimizations are usually based on one-way logistics other than two-way one in the E-commerce environment. So, the research fruits are innovation, and it is proved by this example that the new model can effectively overcome some deficiencies of the traditional site selection methods, and have an important reference value for decision-makers.

Keywords: Two-way, e-Logistics, Rural Distribution Center, Lingo.

A 3D Model Watermarking Algorithm Based on Optimization Statistics

by Xiuhu Tan

Vol. 7 n. 7, pp. 3735-3740

Abstract - The recent increasing demand for 3D digital contents has motivated us to develop techniques for watermarking 3D models so that we can hide copyright information behind them. In this paper, we present a new approach to watermarking 3D models based on optimization statistics. Through choosing the vertexes, we are able to obtain to the embedded watermark that has the least modified to topology transform of the 3D geometry model, and then project the watermark to the space that has the least mean square error value. So, we obtain that the robustness of the approach lies in hiding a watermark in the space that is least susceptible to the 3D model potential modification. Through analysis and constraint the conditions, we can obtain a high detection probability, a low false alarm probability. The robustness of our method is demonstrated by various attacks through computer simulation.

Keywords: 3D Model Watermarking, Optimization Statistics, Robustness.

Information Fusion Algorithm Based on Revised Kalman Filtering

by Xiuhu Tan

Vol. 7 n. 7, pp. 3740-3745

Abstract - The information fusion Kalman filter for multi-channel data acquisition under the distributed system architecture, the mathematical model and the noise statistics are essential; this limitation was settled by adaptive algorithm. The adaptive revised Kalman filter was proposed to solve the filtering problem of the system with unknown mathematical model or noise statistics in information fusion. Based on the probability method and the scalar weighting optimal information fusion criterion in the minimum variance sense, the revised algorithm can not only optimize the multi-channel data, but also obtain the minimum mean square error (MMSE) by introducing fusion equation, namely the algorithm is optimal under the sense of MMSE, and the error is the least than the original Kalman information fusion algorithm. The test result shows that the algorithm can precede information fusion effectively under the distributed acquisition system.

Keywords: Information Fusion, Revised Kalman Method, Minimum Mean Square Error.

Chemical Reactive Optimization-based Heuristic for VM Consolidation in Cloud Computing Environment

by Chaokun Yan, Zhigang Hu, Huimin Luo, Xiang Yuan

Vol. 7 n. 7, pp. 3746-3754

Abstract - Cloud computing promises to deliver reliable services through next-generation data centers built on virtualization technology. However, the growing demand of Cloud infrastructure has drastically increased the energy consumption of data centers, which has become a critical issue. Because of highly bursty nature of workload resulted in overprovision of physical resources, VM consolidation has become an important method for conserving energy. Some traditional VM consolidation strategies usually adopt greedy algorithm or focus on single resource, which cannot applied to real data centers in Clouds. To address this issue, a multi-dimensional bin-packing model is constructed for VM consolidation problem. Then, we use a novel meta-heuristic method, called Chemical Reactive Optimization algorithm (CRO), to create an approximate reconfiguration plan. Results from our extensive simulations demonstrate our method outperforms greedy algorithm FFD and ACO-based algorithm, which can reduce energy through utilizing less physical severs.

Keywords: Cloud Computing, Bin Packing Problem, Chemical Reactive Optimization, VM, Energy Consumption.

A Multi-Path Mobile Ad Hoc Routing Algorithm Based on Ant Colony Optimization Algorithm

by Hui Chen, Yongfeng Ju

Vol. 7 n. 7, pp. 3755-3763

Abstract - Routing algorithm has been well studied as a hotspot in wireless Ad Hoc networks. However, due to the strictly limited resources, few routing algorithm take into account extending the network lifetime and achieves an improving performance using multi-path and ant colony algorithm as the main goal. The paper is to aim at the problem of network transmission efficiency and allocation of network traffic in Ad Hoc. A multi-path route protocol is based on ant colony algorithm. The algorithm selects the path according to transmission latency, path of the energy rate, congestion rate and dynamic rate. The algorithm updates the routing table in term of dynamic collection of path information after the establishment of the path. The simulation result shows that algorithm, increases the network throughput, reduces the average end-to-end packet transmission latency, extends the network lifetime and achieves an improving performance.

Keywords: Ant-Colony Optimization, Mobile Ad Hoc Networks; Routing, Multi-Path, Congestion Control.

Consensus Algorithm for Formation Technology of Multiple Unmanned Aerial Vehicles

by Yansong Deng, Kaiyu Qin, Guangming Xie, Qinzhen Huang

Vol. 7 n. 7, pp. 3764-3769

Abstract - A controller design method is studied for UAVs formation flight. A consensus-based algorithm is proposed to maintain a specified time-varying geometric configuration for formation flight of multiple UAVs. In this approach, the proposed control strategy requires only the local neighbor-to-neighbor information between vehicles. The information flow topologies between the vehicles can be defined by graph Laplacian matrix. Speed and heading synchronization is realized and the two dimensional space formations can be achieved by the proposed consensus algorithm. The effectiveness of the algorithms is demonstrated through detailed simulation studies.

Keywords: Multi-agent, UAV, Consensus, Formation Flight.

A Distributed Data Access Model based on Multi-task Cooperative Agent

by Xinyu Geng, Li Yang, Xiaoyan Huang

Vol. 7 n. 7, pp. 3770-3775

Abstract - In virtual data access center integration platform, a new virtual data access model is presented in this paper. By introducing distributed multi-task cooperative agent (MTCA-DDA), formalization description and cooperative control mechanism of MTCA-DDA is proposed, which can efficiently solve distributed data access collaboration problem. In virtual data Access framework based on MTCA, failure server scheme guarantees distributed data continuous access. Periodic exchange and data cache mechanism greatly improve data distributed store and access speed. For illustration, virtual data access center integration platform shows MTCA-DDA model can improve data access efficiency and enhance the reliability of data access. MTCA-DDA model with periodic exchange and data cache can effectively solve storage and reliability of massive distributed data access and provides a new way for similar distributed application.

Keywords: Mobile Agent, Failure Server, Periodic Exchange, Multi-agent, Multi-task.

Repeated Cumulative Capture Arithmetic Research of Repeated Cycle Based on Direct Sequence Spread Spectrum System

by Guoqiang Wu, Yuguang Bai, Hui Wang, Zhaowei Sun, Xin Chen

Vol. 7 n. 7, pp. 3776-3781

Abstract - Considering the complexity and performance of algorithms, a rapid capture method of Doppler shift is proposed for a low orbit earth satellite spread spectrum communications system in this paper. The method adopts repeated cycle cumulative theory to improve SNR verdict load of capture loop on the basis of serial slippage correlation capture. The multiplex repeated cumulative loop is used to overcome the symbol sliding, and to realize rapid capture of Doppler shift. Average capture time expression of Doppler shift is derived. The simulation is finally provided and the results show that the proposed capture method, which is compared with the traditional serial capture method, has better performance.

Keywords: Doppler Shift, Slippage Correlations Capture, Repeated Cycle Cumulative Method, DSSS.

Uncover Multi-Paths Communities by Automatic Determined Optimal Structure

by Hongwei Su

Vol. 7 n. 7, pp. 3782-3788

Abstract - Community detection algorithm is one of the most interesting issues in the study of social networks. There are many nice algorithms on binary or weighted networks. Inspired by those famous ideas, a multi-paths relationship matrix is defined and Newman’s modularity is modified to “strength modularity”. An algorithm based on strength modularity was designed. Experiments for several real-world social networks were valid which confirmed the feasibility and effectiveness of the algorithm based on strength modularity.

Keywords: Social Network, Community Structure, Multi-paths, Strength Modularity.

An Improved Method to Estimate the Motion Blurred Direction of Motion Blurred Images

by Yexiao Wu,Jiangming Kan, Shuo Feng

Vol. 7 n. 7, pp. 3789-3795

Abstract - In the process of the image’s recording and transmission, because of many factors, it could easily generate relative motion between the camera and objects and form a motion blurred image. So, how to recover motion blurred images becomes an important issue in the digital image processing. One of the typical approaches to estimate the motion blurred direction of the motion blurred images is based on the high-pass filtering. This paper is concerned with the drawback of this method that the speed of the estimation is too slow. The improved method increases the speed of estimating the motion blurred direction by automatically adjusting the parameter of step size and dividing the image into several parts. Three experiments are conducted to study the proposed method, and we analyze the results from three aspects: accuracy, speed and physical memory used by the MATLAB program for estimation. The experimental results indicate that our approach can effectively increase the speed of the estimation of the motion blurred direction with high precision, and reduces the physical memory used by the MATLAB program for estimation. Also, the proposed method has a good anti-noise performance.

Keywords: Motion Blurred Direction, Motion Blurred Image, Automatic Step Size .

Transcoding Method of H.264 Coded Bitstream for Interest Region

by Ya Lin Wu, Yun Hao Li, Sun-Woo Ko

Vol. 7 n. 7, pp. 3796-3804

Abstract - We propose a transcoding method of H.264 coded bitsteam to control the picture quality dependently on the interest region. In the proposed method, first we find the model of quantization step-size and bitrate. And then a classification method according to the subjectively interest region within a video sequence is suggested. Also we propose a method that assigns a specific quantization step-size differentially according to the interest region within a video. In general, the subjective picture quality can be increased by applying the quantization step-size as a small value relatively for the interest region compared with the other regions. We can find the result that the proposed method gives the improved picture quality by assigning the quantization step-size differentially, and the best improvement can be brought when the difference between the maximum and the minimum values of the quantization step-size in a picture is 4 or 6 using the measurement of the objective PSNR and the subjective image quality of result.

Keywords: Quantization Step-Size, Subjective Quality, Interest Region, DSCQS, Transcoding.

An Image Watermarking Algorithm Based on Linear Congruence and HVS

by Yizhuo Liu, Kexin Yin

Vol. 7 n. 7, pp. 3805-3810

Abstract - A digital image watermark algorithm based on Human Visual System (HVS) and linear congruence is presented. The positions and grey values of the watermark image pixels are shuffled by a linear congruence algorithm in the spatial domain first. Then the shuffled image is encrypted by Chen’s chaotic system continuously before embedding in the host image. HVS model in Discrete Cosine Transform (DCT) domain consists of Just Noticeable Difference (JND) thresholds for corresponding DCT basis functions. The experiment results show that the algorithm proposed in this paper is effective and robust to common signal processing operations such as JPEG compression, resizing, median filtering, adding noise etc.

Keywords: Watermark, Linear Congruence, HVS, Discrete Cosine Transform.

PCNN-based Label Fusion for Multi-atlas Segmentation

by Yaqian Zhao, Yue Fu, Jiachen Zhang

Vol. 7 n. 7, pp. 3811-3815

Abstract - Local image similarity based weighting has been shown to be the most accurate label fusion strategy in multi-atlas segmentation. But the large computation cost limits its application. To simplify this problem, we propose a modified PCNN model, and give a PCNN-based label fusion model. Compared with previous local similarity based fusion methods, our method has two major advantages. First, its main computational cost of label fusion is able to be employed as a pre-processing step to reduce the cost. Second, the local weight value at a location x is calculated based on pixel or voxel, not on the neighbor around x, which reduces the computational complexity of weighting model. Experiments on segmenting brain magnetic resonance images show our proposed PCNN-based label fusion method is simple and effective.

Keywords: Multi-atlas Segmentation, PCNN, Multi-atlas Label Fusion.

A Dynamic Adaptive Cluster Head Competition Mechanism of WMSN

by Chuanglu Zhu

Vol. 7 n. 7, pp. 3816-3820

Abstract - One of the key factors of the realizing the wireless multimedia sensor network (WMSN) communication is that whether MAC( Medium Access Control) layer can use the wireless channel effectively or not. MAC layer can achieve high efficiency and reasonable channel assignment which is closely bound up with the clustering structure. According to the requirements of the wireless multimedia sensor network, this paper has presented an algorithm called adaptive cycle distributed cluster head competition algorithm which is based on the dump energy and transmission distance. This algorithm uses a clustering way which is based on location and chooses a cluster head by taking node’s dump energy and communication cost into consideration. At the same time, the algorithm regulates the working cycle of the cluster head dynamically to balance the energy consumption of every node and to lengthen the lifetime cycle of network and prevent the interference among clusters.

Keywords: WMSN, Clustering, Energy Consumption, Cluster Head.

A Collaborative Task Allocation Mechanism for Wireless Sensor Networks

by Yinghui Qiu, Chunlei Liu

Vol. 7 n. 7, pp. 3821-3825

Abstract - Since the resources of wireless sensor networks (WSNs) are highly limited and the usage of resources is usually related to the execution of tasks, energy efficient task allocation is a promising way to prolong the lifetime of WSNs. In this paper, a novel collaborative task allocation mechanism for heterogeneous wireless sensor networks is presented. First, a dynamic alliance network model is introduced into the WSNs. Then a fitness function based on execution time and energy consumption is established, and an improved particle swarm optimization which is the corresponding algorithm of the dynamic alliance model is proposed at the same time. Simulating the mechanism with MATLAB, the results show that the allocation Mechanism can effectively reduce the network energy consumption, shorten the execution time of task processing and has a good balance performance, all of which extend the life of WSNs.

Keywords: Wireless Sensor Networks, Dynamic Alliance, Particle Swarm Optimization.

A Red Congestion Control Algorithm Based on IXP2400 Network Processor

by Chenxia Zhang, Jia Chen

Vol. 7 n. 7, pp. 3826-3830

Abstract - Realize a system for the Web server of the end user classification and intrusion prevention based on IXP2400 network processor. System on HTTP protocol in Cookie reserved field related content matching, and then the matching user data packets are delivered to the user basic information at the same time the normal degree calculation module and the old user queuing service module, by a user to normal degree calculation module calculates the user's normal level and passed to the old user queuing service module, the old user the Queuing service module according to user data packets to the basic information and the normal level, the data packets will add different queue implementation of congestion control, queue scheduling algorithm and the rate limiting, ensure the normal level of different users have access to the bandwidth service.

Keywords: Network Processor, DDOS, RED, Queue Service.

Concurrently Controlled Multithreads Based Dynamical Graphical Software Watermarking Scheme

by Kexin Yin, Yizhuo Liu, Huiran Sun, Jingbo Sun

Vol. 7 n. 7, pp. 3831-3835

Abstract - Software watermarking is a technique for protecting software by embedding secret information into the software to identify its copyright owner. This paper presents a novel dynamic graph software watermark scheme and utilizes concurrently controlled multithread to implement redundant embedding and reliable extraction of the watermark. The scheme first utilizes the Shamir threshold scheme to split the watermark number into pieces that helps increase resilience. Then the pieces are run through self isomorphic mapping operation in order to become associated that further improves the scheme robustness. The experiment shows that our watermark encoding technique has higher encoding rate compared with the traditional PPCT scheme, moreover the presented watermark scheme has great robustness and can effectively resist semantics-preserving code transformation attacks and immune from most obfuscation attacks.

Keywords: DGW, Thread Watermark, Self Isomorphic Mapping, Robust Watermark.