摘要：
We focus on the topology control algorithm in Software-Defined Sensor Networks (SDSNs) and propose a robot-assisted sink nodes relocation algorithm based on the Markov chain. Firstly, by using the software-defined architecture, sensor nodes and network topology can be deployed and updated by the controller which provides global network information and centralized management in real time. Then robot-assisted sink nodes are deployed into SDSN to extend the network lifetime. Unlike motionless nodes or random mobile nodes which may bring about unforeseeable network topological variation, robot-assisted sink node can be migrated to specified location by the controller in SDSN. Furthermore, we propose a Markov chain based Robot-assisted Weighted Relocation (MRWR) algorithm to redeploy the sink nodes on the basis of node status and weight. Simulation results and analysis indicate that the proposed algorithm extends network lifetime with lower average power consumption and decreases the average delay from sensor nodes to sink node as compared with that of static network.
摘要：
Wireless network, to achieve load diversification and to improve end quality of service, while there are many problems on the dropout rate of the traditional load balancing algorithm in processing thr
摘要：
The feature description of image and the index mechanism of the feature are the keys to realize the content-based image retrieval, aiming at the problem of massive image data and "dimension curse", this paper proposes the BOF-based image retrieval improved algorithm, and combines with VLAD and soft assignment it generates the soft assignment local aggregation descriptor（SA-VLAD） which has a better ability to resist the dimension reduction and a higher recognition rate. When the index mechanism IVFADC is at query time, to ensure the recall ratio and precision rate of the result, the candidates inverted index chain are increased, which leads to the problems of distance calculation and the query time’s increasing. For this point, in the index phase, the scattered distribution is carried out aiming at the database vector, which reduces the burden of distance calculation, and improves the quality of the query results at the same time. The experimental results show that the algorithm in this paper obtains a good effect in the content-based massive image database retrieval.
摘要：
In order to solve gateway deployment of geometry K center in the wireless network and improve the service quality of network. This paper puts forward the gateway deployment solving model and algorithm
摘要：
The traditional recommendation algorithms of image tagging ignore the diversity between the visual content information and the tags recommended, which causes the recommended results have the problem o
摘要：
To deal with the issues like existing common data sparseness in weibo social network and the phenomena of cold start, this paper puts forward a two-stage clustering based on the recommendation algorithm GCCR. The algorithm firstly selects users’ focused nodes which have higher number, so as to extract a dense subset of sparse data, and by using the method of graph paper, similar concerned interested core clustering is formed to this dense subset. Then, it is extracted that weibo content features of seed clustering and the whole data set other users. Then the entire user group is clustered based on content similarity. Finally the clustering results are used in subject recommendation. Through clustering the two phases of dense data subset and the whole data set, the clustering effect of extreme sparse data sets are improved. At the same time, because of fuzziness of graph clustering, this thesis retains a certain diversity in the process of user interest clustering, so as to avoid convergence too fast when cold start. This method is verified through the real social network data, and the experimental results show that this algorithm can effectively solve the problems such as data sparseness and cold start phenomenon.
摘要：
Aiming at the problems in service oriented real-time multimedia transmission, such as a long delay, frequent jitter and low reliability, this paper proposes LD/R Path algorithm LD/R Path estimates the
作者机构：
[Shubo Chen; Xia Cai; Ting Zeng; Lihui Yang] College of Science, Hunan City University
会议时间：
2017-10
摘要：
The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices of the graph G, where the resistance distance between two vertices of a connected graph G is defined as the e
作者：
Cuie Xiao;Xiuwen Li;Hunan City University;Yiyang;China;...
期刊：
ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND PHYSIK,2017年05(2):303-310 ISSN：0044-2275
作者机构：
[Cuie Xiao; Xiuwen Li] Department of Mathematics and Computation Sciences, Hunan City University;[Cuie Xiao; Xiuwen Li] Department of Mathematics and Computer Information Engineering, Baise University
会议名称：
2017 International Symposium on Computational and Applied Mathematics （ISCAM 2017）
会议时间：
2017-02-26
会议地点：
中国陕西西安
会议论文集名称：
Proceedings of 2017 International Symposium on Computational and Applied Mathematics (ISCAM 2017)
关键词：
Solvability;Sequential Fractional Equations;Mittag-Leffler Function;Gramian matrix;Fixed Point Theorems
摘要：
In this paper, we are concerned with the solvability for a class of nonlinear sequential fractional dynamical systems with damping infinite dimensional spaces, which involves fractional Riemann-Liouville derivatives. The solutions of the dynamical systems are obtained by utilizing the method of Laplace transform technique and are based on the formula of the Laplace transform of the Mittag-Leffler function in two parameters. Next, we present the existence and uniqueness of solutions for nonlinear sequential fractional dynamical systems with damping by using fixed point theorems under some appropriate conditions.
作者机构：
[Yan, Feng; Shen, Lianfeng; Ding, Zhaoming] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China.;[Xing, Song] Calif State Univ Los Angeles, Dept Informat Syst, Los Angeles, CA 90032 USA.;[Deng, Shuguang] Hunan City Univ, Coll Commun & Elect Engn, Yiyang 413000, Peoples R China.
会议名称：
9th International Conference on Wireless Communication and Signal Processing (WCSP)
会议时间：
OCT 11-13, 2017
会议地点：
Nanjing, PEOPLES R CHINA
会议主办单位：
[Ding, Zhaoming;Yan, Feng;Shen, Lianfeng] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China.^[Xing, Song] Calif State Univ Los Angeles, Dept Informat Syst, Los Angeles, CA 90032 USA.^[Deng, Shuguang] Hunan City Univ, Coll Commun & Elect Engn, Yiyang 413000, Peoples R China.
会议论文集名称：
International Conference on Wireless Communications and Signal Processing
关键词：
Carrier sensing threshold;link success probability;Poisson point process;dense wireless networks
摘要：
Considering a small-scale fading environment in a dense random wireless network, we investigate the impact of the carrier-sensing threshold on the link performance under the premise of a fixed carrier-sensing range. At first, we assume a close transmitter-receiver distance and model the network nodes as a homogeneous Poisson point process (PPP). Then we present a simple analysis model of the conditional link success probability to establish a correlation between the interference capture and the link success. Subsequently, based on the assumption that the interference among proximity nodes mainly comes from the nearby nodes, we obtain the bounds of the carrier-sensing threshold through stochastic analysis and a simple adaptive algorithm to adjust the carrier-sensing threshold within its bounds is further presented. Numerical results show that the proposed method enables the pending transmitter to adjust the bounds of the carrier-sensing threshold adaptively when the channel path-loss exponent changes and the validity of the proposed adaptive algorithm is verified in the simulations.
摘要：
As an important intangible cultural heritage of our country, Xiangxi Miao embroidery has unique aesthetic, cultural, economic and social value, and from the perspective of digital protection and inher
关键词：
Advanced Encryption Standard New Instruction;counter mode;encryption speed;encryption speedup;encryption time;OpenMP;parallel encryption;performance
摘要：
In the open environment of cloud computing, a large amount of user data needs to be encrypted/decrypted fast to maintain confidentiality and provide high quality of service. Advanced Encryption Standard (AES), the standard encryption algorithm, has better security and efficiency compared to its competitive algorithms, so it is widely used in cloud computing and other fields. However, the implementation of AES based on software still has the problem of low efficiency; whereas the implementation of AES based on hardware needs to purchase special purpose devices. Adopting the method of special instruction sets can resolve the above two drawbacks. Therefore, we propose a fast parallel cryptographic algorithm, NIPAES, which is based on the AES-NI (New Instructions) instruction set and CPU multiple cores. NIPAES makes use of the block property of AES and the parallel property of Counter (CTR) model, adopts OpenMP to evenly distribute workloads to each thread, which performs AES-NI instructions to complete encryption/decryption. Compared to CPU serial AES based on lookup tables, CPU parallel AES, and serial AES based on AES-NI, NIPAES has significant improvement on performance. The experimental results show that NIPAES achieves the average speedups of 3197.78x, 196.12x, and 7.71x, compared to the other aforementioned algorithms, respectively.
