作者机构：
[贺位位; 邹祎; 刘波涛; Li, Lang] Department of Computer Science, Hengyang Normal University, Hengyang, Hunan, 421008, China;[Li, Lang; 李浪] College of Information Science and Engineering, Hunan University, Changsha, Hunan, 410082, China
通讯机构：
Department of Computer Science, Hengyang Normal University, Hengyang, Hunan, China
作者机构：
[Wen, Guilin; Zhou, Huaan; Chen, Zhong] Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha 410082, Hunan, Peoples R China.;[Chen, Zhong] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421002, Peoples R China.;[Wen, Guilin; Zhou, Huaan; Chen, Zhong] Hunan Univ, Key Lab Adv Design & Simulat Tech Special Equipme, Minist Educ, Changsha 410082, Hunan, Peoples R China.;[Chen, Junyao] Hengyang Normal Univ, Dept Phys & Elect Informat Sci, Hengyang 421002, Peoples R China.;[Chen, Junyao] Ajou Univ, Coll Informat Technol, Suwon 16499, South Korea.
通讯机构：
[Chen, Zhong] H;Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha 410082, Hunan, Peoples R China.
关键词：
Arctangent function series;Multi-scroll attractor;Rucklidge system
摘要：
A new method for generating M × N-grid double-scroll Rucklidge chaotic attractors is presented. By designing arctangent function series to construct a nonlinear function, which replace the state variables x, y of the Rucklidge system, a new M × N-grid double-scroll chaotic system is created. The formation mechanism of this M × N-grid double-scroll chaotic model is further investigated. Moreover, some basic properties are theoretically analyzed and numerically simulated, including equilibria and their stability, Lyapunov exponents and bifurcation diagram. This system can be widely utilized in secure communication and data encryption.
作者机构：
[Wang, Dong] South China Agr Univ, Coll Math & Informat, Guangzhou, Guangdong, Peoples R China.;[Zou, Changqing] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang, Peoples R China.;[Tan, Ping; Zou, Changqing] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada.;[Li, Guiqing] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China.;[Su, Zhuo; Gao, Chengying] Sun Yat Sen Univ, Natl Engn Res Ctr Digital Life, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China.
会议名称：
25th Pacific Conference on Computer Graphics and Applications (Pacific Graphics)
会议时间：
OCT 16-19, 2017
会议地点：
Taipei, TAIWAN
会议主办单位：
[Wang, Dong] South China Agr Univ, Coll Math & Informat, Guangzhou, Guangdong, Peoples R China.^[Zou, Changqing] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang, Peoples R China.^[Zou, Changqing;Tan, Ping] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada.^[Li, Guiqing] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China.^[Gao, Chengying;Su, Zhuo] Sun Yat Sen Univ, Natl Engn Res Ctr Digital Life, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China.
摘要：
A chaotic model for generating multi-directional multi-scroll attractors via hyperbolic tangent function series is proposed in this paper. The dynamical mechanisms of this chaotic model are further investigated, including M-scroll, MxN-grid scroll, MxNxL-grid scroll chaotic attractors. Moreover, the dynamical behaviors of this system are theoretically analyzed and numerically simulated, such as equilibria and their stability,.Lyapunov exponents and bifurcation diagrams. This system can be widely used in data encryption and secure communication. (C) 2016 Elsevier GmbH. All rights reserved.
作者机构：
[Qu, Taiguo] College of Computer Science and Technology, Hengyang Normal University, Hengyang, China;[Cai, Zixing] School of Information Science and Engineering, Central South University, Changsha, China;[Qu, Taiguo] Hunan Provincial Key Laboratory of Intelligent Information Processing and Application, Hengyang, China
通讯机构：
College of Computer Science and Technology, Hengyang Normal University, Hengyang, China
摘要：
We propose a new ultra-lightweight block cipher, QTL. The 64 bits block cipher QTL supports 64 and 128 bits keys. To solve the slow diffusion of the traditional Feistel-type structures we have used a new variant of generalized Feistel network structure in design of the QTL. Traditional Feistel-type structures change only half of block messages in an iterative round, but our structure overcomes this disadvantage and changes all block messages. Thus, our structure has the fast diffusion of the Substitution Permutation Networks (SPNs) structures, which improves the security of lightweight block cipher in Feistel-type structures. Moreover, QTL algorithm has the same encryption and decryption processes, so it will occupy less area in resource-constrained applications. Furthermore, to reduce the cost of energy consumption in hardware implementation of the cipher while maintaining security, we decide not to use a key schedule. We show that QTL offers an adequate security level against classic analyses. Our hardware implementation for the 64 and the 128 bits keys modes only require 1025.52 and 1206.52 gate equivalents, respectively. QTL achieves high security and compact implementation in hardware. QTL is one of the most competitive ultra-lightweight block ciphers, which is suitable for extremely constrained devices. (C) 2016 Elsevier B.V. All rights reserved.
摘要：
We propose a mesh saliency detection approach using absorbing Markov chain. Unlike most of the existing methods based on some center-surround operator, our method employs feature variance to obtain insignificant regions and considers both background and foreground cues. Firstly, we partition an input mesh into a set of segments using Ncuts algorithm and then each segment is over segmented into patches based on Zernike coefficients. Afterwards, some background patches are selected by computing feature variance within the segments. Secondly, the absorbed time of each node is calculated via absorbing Markov chain with the background patches as absorbing nodes, which gives a preliminary saliency measure. Thirdly, a refined saliency result is generated in a similar way but with foreground nodes extracted from the preliminary saliency map as absorbing nodes, which inhibits the background and efficiently enhances salient foreground regions. Finally, a Laplacian-based smoothing procedure is utilized to spread the patch saliency to each vertex. Experimental results demonstrate that our scheme performs competitively against the state-of-the-art approaches.
摘要：
Purpose - The purpose of this paper is to develop a compressive sensing (CS) algorithm for noisy solder joint imagery compression and recovery. A fast gradient-based compressive sensing (FGbCS) approach is proposed based on the convex optimization. The proposed algorithm is able to improve performance in terms of peak signal noise ratio (PSNR) and computational cost. Design/methodology/approach - Unlike traditional CS methods, the authors first transformed a noise solder joint image to a sparse signal by a discrete cosine transform (DCT), so that the reconstruction of noisy solder joint imagery is changed to a convex optimization problem. Then, a so-called gradient-based method is utilized for solving the problem. To improve the method efficiency, the authors assume the problem to be convex with the Lipschitz gradient through the replacement of an iteration parameter by the Lipschitz constant. Moreover, a FGbCS algorithm is proposed to recover the noisy solder joint imagery under different parameters. Findings - Experiments reveal that the proposed algorithm can achieve better results on PNSR with fewer computational costs than classical algorithms like Orthogonal Matching Pursuit (OMP), Greedy Basis Pursuit (GBP), Subspace Pursuit (SP), Compressive Sampling Matching Pursuit (CoSaMP) and Iterative Re-weighted Least Squares (IRLS). Convergence of the proposed algorithm is with a faster rate O(kk) instead of O(1/k). Practical implications - This paper provides a novel methodology for the CS of noisy solder joint imagery, and the proposed algorithm can also be used in other imagery compression and recovery. Originality/value - According to the CS theory, a sparse or compressible signal can be represented by a fewer number of bases than those required by the Nyquist theorem. The new development might provide some fundamental guidelines for noisy imagery compression and recovering.
期刊：
Journal of Instrumentation,2016年11(2):T02002-T02002 ISSN：1748-0221
通讯作者：
Tan, Y.
作者机构：
[Tan, Y.] Hengyang Normal Univ, Coll Phys & Elect Engn, Hengyang 421008, Peoples R China.;[Tokonami, S.] Hirosaki Univ, Inst Radiat Emergency Med, Dept Radiat Phys, Hirosaki, Aomori 0368564, Japan.;[Liu, H.] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421008, Peoples R China.;[Kearfott, K. J.] Univ Michigan, Dept Nucl Engn & Radiol Sci, Ann Arbor, MI 48109 USA.
通讯机构：
[Tan, Y.] H;Hengyang Normal Univ, Coll Phys & Elect Engn, Hengyang 421008, Peoples R China.
关键词：
Data processing methods;Models and simulations;Spectrometers;Simulation methods and programs
摘要：
222Rn and 220Rn can be used as tracers of groundwater or submarine springs, and 222Rn in water also could indicate indoor radon problems in some regions. The half-life of 222Rn is long enough that its concentration may remain significant during transit over relatively long distances, while that of 220Rn is not. Prior research revealed that it took about 15 min for the radon to achieve gas equilibrium at a water flow rate of 17.5 L min−1, which is approximately equivalent to the time required for the 222Rn-218Po pair to approach radioactive equilibrium and is limiting in terms of measurements of sudden radon concentration change. In this work, an algorithm is applied to improve the continuous tracing of radon concentrations in the field environment. Results of a laboratory experiment analyzed applying the analysis method illustrated its ability to allow immediate identification of sharp concentration increases. In this paper we find that a precipitous drop in radon concentrations lead to improper corrected values as the result of measurement uncertainties prior to the drop, and a method using zero instead negative values for reducing the uncertainties under such condition also is proposed.
期刊：
International Journal of Distributed Sensor Networks,2015年2015(10):437678:1-437678:13 ISSN：1550-1477
通讯作者：
Liu, Fangju
作者机构：
[Liu, Fangju] Univ South China, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.;[Ma, Xingpo] Xinyang Normal Univ, Sch Comp & Informat Technol, Xinyang 464000, Henan, Peoples R China.;[Liang, Junbin] Guangxi Univ, Sch Comp & Elect Informat, Nanning 530004, Guangxi, Peoples R China.;[Lin, Mugang] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
通讯机构：
[Liu, Fangju] U;Univ South China, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.
摘要：
Verifiable top-k query processing in tiered sensor networks, which refers to verifying the authenticity and the completeness of top-k query results received by the network owner in tiered sensor networks, has received attention in very recent years. However, the existing solutions of this problem are only fit for static sensor network. In this paper, we try to solve the problem in a tiered mobile sensor network model, where not only static sensor nodes but also mobile sensor nodes existed. Based on the tiered mobile sensor network model, we propose a novel verifiable scheme named VTMSN for fine-grained top-k queries. The main idea of VTMSN is as follows: it maps each of the positions where sensor nodes are in a static state to a virtual node and then establishes relationships among data items of each virtual node with their score orders, which are encrypted along with the scores of the data items and the time epochs using the distinct symmetric keys kept by each sensor node and the network owner. Both theory analysis and simulation results show the efficiency and the security of VTMSN.
摘要：
This paper proposes a high-capacity reversible watermarking algorithm for medical image analysis based on the difference block histogram, which will benefit the medical image authentication and doctor–patient confidentiality. By dividing the original medical image into blocks, the method displaces the peak point of a block's histogram of difference and embeds multi-bit information at 1 pixel point. In so doing, secret communication and storage of large-capacity invisible medical diagnoses and patients personal confidential data can be achieved. Once the watermark is extracted, not only the image integrity is authenticated, but also the original image and personal data of the patient can be recovered in a nondestructive way. With low computational complexity, a high embedding capacity and little demand for auxiliary information, the proposed algorithm is highly secure and practical.
通讯机构：
[Xu, Yuming] H;Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
关键词：
Artificial Chemical Reaction Optimization;Job Scheduling;Makespan;NP-Hard Problem
摘要：
The non-deterministic polynomial-time-hard job scheduling problem can be regarded as the optimal assignment of a set of jobs to a set of computing nodes to minimize the completion time. Such problems can be efficiently addressed through a meta-heuristic optimization approach, such as the new artificial chemical reaction optimization method. This approach mimics a chemical reaction process in which reactants interact with one another to reach the minimum enthalpy (potential energy) state. Therefore, this study proposes a novel approach of artificial chemical reaction optimization for job scheduling (ACROAJS) in grid computing environments based on the recently proposed chemical reaction-inspired meta-heuristic. Software simulation results show that the proposed ACROAJS algorithm significantly improves job schedule quality (makespan) in grid computing environments compared with two existing solutions [genetic algorithm and heterogeneous earliest finish time algorithm] over a set of randomly generated graphs and over graphs for real-world problems with various characteristics. With this algorithm, makespan was reduced by approximately 5.06% on average.
期刊：
IET Communications,2015年9(7):940-946 ISSN：1751-8628
通讯作者：
Zhao, Huihuang
作者机构：
[Zhao, Huihuang; Peng, Xiaojiang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Hunan, Peoples R China.;[Zhao, Huihuang; Wang, Yaonan] Hunan Univ, Coll Elect & Informat Engn, Changsha 410082, Hunan, Peoples R China.;[Qiao, Zhijun] Univ Texas Pan Amer, Dept Math, Edinburg, TX 78539 USA.
通讯机构：
[Zhao, Huihuang] H;Hengyang Normal Univ, Dept Comp Sci, Hengyang, Hunan, Peoples R China.
关键词：
image reconstruction;video signal processing;compressed sensing;convex programming;minimisation;noise image reconstruction;noise video reconstruction;fast gradient-based compressive sensing;orthogonal transformation;convex optimisation problem;gradient-based method;signal reconstruction;convex minimisation problem;convex optimisation;noise signal reconstruction;Lipschitz gradient;iteration parameter;FGB-CS method
摘要：
In this study, a fast gradient-based compressive sensing (FGB-CS) for noise image and video is proposed. Given a noise image or video, the authors first make it sparse by orthogonal transformation, and then reconstruct it by solving a convex optimisation problem with a novel gradient-based method. The main contribution is twofold. Firstly, they deal with the noise signal reconstruction as a convex minimisation problem, and propose a new compressive sensing based on gradient-based method for noise image and video. Secondly, to improve the computational efficiency of gradient-based compressive sensing, they formulate the convex optimisation of noise signal reconstruction under Lipschitz gradient and replace the iteration parameter by the Lipschitz constant. With this strategy, the convergence of our FGB-CS is reduced from O(1/k) to O(1/k2). Experimental results indicate that their FGB-CS method is able to achieve better performance than several classical algorithms.
摘要：
In this paper, a compressing and reconstruction method for a noise video based on Compressed Sensing (CS) theory is proposed. At first, the CS theory is presented. Then the noise video is estimated from noisy measurement by solving the convex minimization problem. The video recovery algorithms based on gradient-based method is used to compressing and reconstructing the noise signal. And a compressive sensing algorithm with gradient-based method is proposed. At last, the performance of the proposed approach is shown and compared with some conventional algorithms. Our method can obtain best results in terms of peak signal noise ratio (PSNR) than those achieved by common methods with only a little runtime.
作者机构：
[李浪; 邹祎] Department of Computer Science, Hengyang Normal University, Hengyang;Hunan;421002, China;[李仁发] College of Information Science and Engineering, Hunan University, Changsha;410082, China
