作者机构：
[Peng, Ying-Ying] School of Management and Information Engineering, Hunan University of Chinese Medicine, Changsha, Hunan, 410208, China
通讯机构：
[Peng, Y.-Y.] S;School of Management and Information Engineering, Hunan University of Chinese Medicine, Changsha, Hunan, China
关键词：
Broadcast Storm;Internet of Things;Low Energy-Consumption;Routing Protocol
摘要：
How to make large-scale dynamic IoT devices transmit data to other devices via the Internet is an important topic in IoT research. Especially at the same time to avoid radio storms, to adapt to the dynamic environ ment, and with low energy consumption and other features, but there is no practical application of the routing protocol in the real world. This article describes the GFG-L (Greedy Face Greedy for location) routing protocol is a mobile IoT protocol that can meet the above properties, is expected to solve the current dilemma and accelerate the Internet of Things to achieve the pace.
关键词：
big data;steganography;carrier-free text steganography;multi-keywords;POS tagging
摘要：
Steganography has attracted more and more attentions in protecting information security. Previous studies achieved by modifying the carriers can't effectively resist the steganalysis methods and attacks. To address this problem, by combining big data with steganography, a novel multi-keywords carrier-free text steganography method based on part of speech tagging is proposed in this paper. In our method, the hidden tags are selected from all the Chinese character components of words. And the POS (Part of Speech) is used to hiding the number of keywords to enhance the hiding capacity. Meanwhile, the redundancy of hidden tags in extraction process is eliminated by ensuring the uniqueness of hidden tags in every stego-text. Also, the way of joint retrieval is used for hiding multi-keywords. The experimental results show that with appropriate hidden tags and large scale of big text data, the proposed method has good performance in the hiding capacity, the success rate of hiding, the extraction accuracy and the time efficiency.
关键词：
Image encryption;LSB substitution;ROI-based;Reversible data hiding;The medical image
摘要：
A novel ROI-based reversible data hiding scheme in encrypted medical images is proposed. Firstly, a content owner partitions an original medical image into the region of interest (ROI) and the region of noninterest (RONI), and then encrypts the image using an encryption key. A data-hider concatenates the least significant bits (LSB) of the encrypted ROI and Electronic Patient Record (EPR), and then embeds the concatenated data into the encrypted image by LSB substitution algorithm. With the encrypted medical image containing the embedded data, the receiver can extract the embedded data with the data-hiding key; if the receiver has the encryption key, a medical image similar to the original image can be obtained by directly decrypting the encrypted medical image; if the receiver has both the data-hiding key and the encryption key, the embedded data can be extracted without any error and ROI can be losslessly recovered after extracting the embedded data. (C) 2016 Elsevier Inc. All rights reserved.
作者机构：
[李鹏; 王建新] School of Information Science and Engineering, Central South University, Changsha, 410083, China;[李鹏; 丁长松] School of Management and Information Engineering, Hunan University of Chinese Medicine, Changsha, 410208, China
通讯机构：
School of Information Science and Engineering, Central South University, Changsha, China
作者机构：
[刘文龙; 石继连; 贺福元; 周晋; 杨岩涛] College of Pharmacy, Hunan University of Chinese Medicine, Changsha 410208, China;[刘文龙; 石继连; 贺福元; 周晋; 杨岩涛] Key Laboratory for Traditional Chinese Medicine Properties and Pharmacodynamics under State Administration of Traditional Chinese Medicine, Changsha 410208, China;[刘文龙; 石继连; 贺福元; 周晋; 杨岩涛] Laboratory for Modern Traditional Chinese Medicine Preparation Technology and Evaluation, Hunan University of Tradition Chinese Medicine, Changsha 410208, China;[刘文龙; 石继连; 贺福元; 周晋; 杨岩涛] Laboratory for Supramolecular Mechanism and Mathematic-Physics Characterization for Chinese Materia Medica, Hunan University of Chinese Medicine, Changsha 410208, China;[吴春英] College of Management and Information Engineering, Hunan University of Chinese Medicine, Changsha 410208, China
摘要：
<正>卡尔·费里德里希·高斯（Carl Friedrich Gauss）于1777年4月30日出生在德国不伦瑞克城,父亲是花匠、瓦工,还当过护堤工.高斯7岁那年（1784年）入小学,头两年学习成绩一般.但到第三年,校长兼数学教师布特纳（J.G.Büttner）有一次在课堂上出了一道算术题,要学生们计算出前一百个自然数的和.10岁的高斯用自己的办法很快求出了答案:5050.布特纳非常赏识高斯的聪明,买来课外
期刊：
Revista Tecnica de la Facultad de Ingenieria Universidad del Zulia,2016年39(11):1-9 ISSN：0254-0770
通讯作者：
Liu, Wei(weiliu_china@126.com)
作者机构：
[Liu, Wei; Huang, Xindi] School of Management and Information Engineering, Hunan University of Chinese Medicine, Changsha Hunan, 410208, China;[Hu, Zhigang; Xian, Weicheng] School of Software, Central South University, Changsha Hunan, 410075, China
通讯机构：
School of Management and Information Engineering, Hunan University of Chinese Medicine, Changsha Hunan, China
关键词：
Conditional complexity;Cyclomatic complexity;Identification of refactoring opportunities;Software metrics;Statistical analysis
摘要：
In order to identify the high conditional complexity in source code, a novel approach based on statistical analysis is proposed. According to the statistical analysis of two software metrics which are Method McCabe's Cyclomatic Complexity (MMCC) and Method Average McCabe's Cyclomatic Complexity Per Code Line (MAMCC) in a large number of projects, the probability density functions and cumulative distribution functions for describing distributions of these two metrics are obtained. Moreover, a model for identifying high conditional complexity is built by choosing reasonable threshold of these metrics, and this model can be used for preliminary screening the methods which have high MMCC and high MAMCC. The experimental results show that the proposed approach can identify some candidate methods which need to be refactored accurately.
作者机构：
[丁长松; 王志英] College of Computer, National University of Defense Technology, Changsha, 410073, China;[丁长松; 梁杨] School of Management and Information Engineering, Hunan University of Chinese Medicine, Changsha, 410208, China
关键词：
网格计算;协同预留;QoS满意度;预留策略
摘要：
针对动态网格资源服务的不确定性问题,提出一种可量化分析资源服务QoS (quality of service)的多资源协同预留策略.该策略基于对运行在资源上的网格任务QoS指标分析,得出QoS满意度量化、归一化方法,建立资源服务QoS与预留容量之间的函数关系,并以市场经济环境为背景,分析任务费用约束下资源价格与预留容量之间的关系,求解得出可均衡负载的多资源节点协同预留方案.理论分析给出了策略的有效性证明和算法,仿真实验采用真实网格系统中的任务负载信息作为实验负载,在较大规模的模拟网格系统中检验了所提出的预留策略的性能表现.实验结果显示,该策略在接纳任务数、资源利用率和任务违约率方面的性能表现显著优于传统的预留策略.
