检索结果-内蒙古大学图书馆

Runtime model based approach to IoT application development

Frontiers of Computer Science 2015年第4期9卷 540-553页

作者： Xing CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou 350116 China Key Laboratory of High Confidence Software Technologies (Ministry of Education) Beijing 100871 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

The internet of things （loT） attracts great interest in many application domains concerned with monitoring and ：ontrol of physical phenomena. However, application devel- opment is still one of the main hurdles to a wide adoption of IoT technology. Application development is done at a low level, very close to the operating system and requires pro- grammers to focus on low-level system issues. The under- lying APIs can be very complicated and the amount of data collected can be huge. This can be very hard to deal with as a developer. In this paper, we present a runtime model based approach to IoT application development. First, the manage- ability of sensor devices is abstracted as runtime models that are automatically connected with the corresponding systems. Second, a customized model is constructed according to a personalized application scenario and the synchronization be- tween the customized model and sensor device runtime mod- els is ensured through model transformation. Thus, all the application logic can be carried out by executing programs on the customized model. An experiment on a real-world ap- plication scenario demonstrates the feasibility, effectiveness, and benefits of the new approach to IoT application develop- ment.

关键词： IoT application development software architec-ture models at runtime

来源：评论

学校读者我要写书评

暂无评论

Some applications of nonlinear science methods and support vector machine methods to protein problems

引用

Mini-Reviews in Organic Chemistry 2015年第6期12卷 493-505页

作者： Hana, Guo Sheng Yu, Zu-Guo Zhao, Zhi-Qin Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University XiangtanHunan411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 BrisbaneQ4001 Australia

Protein folding, prediction of protein structure and functions are most important problems in bioinformatics. The protein fold process mainly reflects in the kinetic order of folding. Predicting the structural classes of low-homology protein is a difficult problem in the prediction of protein structure. In order to understanding the mechanism of programmed cell death, it is very necessary to obtain the information about subcellular locations and functions of apoptosis proteins. Predicting protein subnuclear localizations is a challenging problem which is harder than predicting protein subcellular locations. Predicting membrane protein types is related to the structure and function of proteins. In this review, we introduce some applications of nonlinear science methods and support vector machine methods to the above protein problems. The nonlinear science methods including the horizontal visibility network, kernel method, recurrence quantification analysis, global descriptor, Lempel-Ziv complexity, and Hilbert-Huang transform are used to extract features in these approaches. © 2015 Bentham Science Publishers.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Diffusion tensor based curvature-driven difiusion model for digital inpainting

引用

Journal of Computational Information Systems 2015年第1期11卷 185-194页

作者： Qu, Lei Huang, Linsheng Wei, Sui Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

In this paper, we formulate the digital inpainting as a curvature-driven anisotropic concentration difiusing process. The difiusion strength along the gradient directions is defined as a function of curvature, so that the "Connectivity Principle" can be satisfied. Difierent to the classic Curvature-Driven Difiusion (CDD) model, the difiusion along the edge directions can be easily integrated into the difiusion equation in our model by using difiusion tensor. As result, more exibility in designing the local difiusion behavior is allowed, and the CDD model can be generalized as a special case. We show that our model can boost inpainting speed 3fi6 times and at the same time has similar inpainting quality compared to the widely used CDD model. Experimental results on synthetic and real images have verified the stability and eficiency of our model. ©, 2014, Journal of Computational Information Systems. All right reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Deterministic realization of collective measurements via photonic quantum walks

arXiv

引用

arXiv 2017年

作者： Hou, Zhibo Tang, Jun-Feng Shang, Jiangwei Zhu, Huangjun Li, Jian Yuan, Yuan Wu, Kang-Da Xiang, Guo-Yong Li, Chuan-Feng Guo, Guang-Can Key Laboratory of Quantum Information University of Science and Technology of China CAS Hefei230026 China Synergetic Innovation Center of Quantum Information and Quantum Physics University of Science and Technology of China Hefei230026 China Naturwissenschaftlich-Technische Fakultät Universität Siegen Siegen57068 Germany Beijing Key Laboratory of Nanophotonics Ultrafine Optoelectronic Systems School of Physics Beijing Institute of Technology Beijing100081 China Institute for Theoretical Physics University of Cologne Cologne50937 Germany Department of Physics Center for Field Theory and Particle Physics Fudan University Shanghai200433 China Institute for Nanoelectronic Devices and Quantum Computing Fudan University Shanghai200433 China State Key Laboratory of Surface Physics Fudan University Shanghai200433 China Collaborative Innovation Center of Advanced Microstructures Nanjing210093 China Institute of Signal Processing Transmission Nanjing University of Posts and Telecommunications Nanjing210003 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing210003 China

Collective measurements on identically prepared quantum systems can extract more information than local measurements, thereby enhancing information-processing efficiency. Although this nonclassical phenomenon has been known for two decades, it has remained a challenging task to demonstrate the advantage of collective measurements in experiments. Here we introduce a general recipe for performing deterministic collective measurements on two identically prepared qubits based on quantum walks. Using photonic quantum walks, we realize experimentally an optimized collective measurement with fidelity 0.9946 without post selection. As an application, we achieve the highest tomographic efficiency in qubit state tomography to date. Our work offers an effective recipe for beating the precision limit of local measurements in quantum state tomography and metrology. In addition, our study opens an avenue for harvesting the power of collective measurements in quantum information processing and for exploring the intriguing physics behind this power. Copyright © 2017, The Authors. All rights reserved.

关键词： Quantum optics

来源：评论

学校读者我要写书评

暂无评论

Image authentication and self-recovery scheme based on the rehashing model

引用

Journal of Information Hiding and Multimedia signal processing 2016年第3期7卷 460-474页

作者： Lyu, Wan-Li Chang, Chin-Chen Wang, Feng Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230039 China Department of Information Engineering and Computer Science Feng Chia University 100 Wenhwa Rd. Seatwen Taichung40724 Taiwan Department of Computer Science and Information Engineering Asia University Taichung41354 Taiwan Department of Mathematics and Physics Fujian University of Technology FuzhouFujian350108 China

An effective image tamper localization and self-recovery scheme that uses the rehashing model is proposed in this paper. The aim of the proposed scheme was to reduce the failure rate in detecting image tamper areas and achieve high rates of successful detection. To achieve this aim, the proposed scheme uses a set of hash functions which are called the rehashing model, gained an optimal decreasing collision method to detect tamper areas With an improved and accurate tamper detection rate, the tampered image can be recovered more accurately. The quality of the proposed scheme was tested with gray and color images. The experimental results indicated that the proposed scheme has good performance in locating tamper locations and allows image recovery with an acceptable visual quality up to 50% of the image content tampered. © 2016.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

An integratable verifiable secret sharing mechanism

引用

International Journal of Network Security 2016年第4期18卷 617-624页

作者： Liu, Yanjun Chang, Chin-Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No. 111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No. 500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No. 100 Wenhwa Rd Seatwen Taichung413 Taiwan

Threshold secret sharing (SS), also denoted as (t, n) SS, has been used extensively in the area of information se- curity, such as for group authentication, cloud storage schemes, secure parallel communication and wireless mul- tipath routing protocols. However, a (t, n) SS cannot de- tect any deceptions among the dealer and shareholders. Veriable secret sharing (VSS) overcomes the weakness of (t, n) SS in such a way that it is able to detect cheaters by verifying the validity of shares or the correctness of the recovered secret under the condition that both shares and the secret are not compromised. Recently, two non- interactive VSSs based on Asmuth-Bloom's SS were pro- posed by Harn et al. and Liu et al., respectively. Both VSSs require shareholders to examine the range of values of some integers related to the secret before recovering the secret, which is a time-consuming operation. In this paper, we propose a novel integratable VSS mechanism that integrates the concepts of the generalized Chinese remainder theorem (GCRT), Shamir's SS and Asmuth- Bloom's SS. Our proposed VSS can verify that the secret reconstructed by any t or more shareholders is the same as the one that the dealer has generated. Analysis shows that our proposed VSS can provide perfect secrecy and better efficiency.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Distributed CoMP transmission for cell range expansion with almost blank subframe in downlink heterogeneous networks

Distributed CoMP transmission for cell range expansion with ...

引用

International Conference on intelligent computing and Internet of Things (ICIT)

作者： Yi Wang Yanjun Hu Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei Anhui Province China

ISBN: (纸本)9781479975358

The almost blank subframe (ABS) has been studied in 3GPP as a way to mitigate downlink interference experienced by cell range expansion (CRE) user equipments (UEs). However, the throughput of CRE UEs highly depends on the ratios of ABS which are statically configured in many situations. The coordinated multi-point (CoMP) is one of the key solutions standardized in LTE-A which can be implemented in CRE with ABS to exploit the abundant spatial resources. And distributed cell selection could help guarantee the UEs' performance under different range expansion biases. In this paper, a distributed CoMP method for CRE with ABS is proposed in heterogeneous networks. Simulation results show that our proposed algorithm provides considerable performance gains in the spectrum efficiency with different bias and users settings.

关键词： Algorithm design and analysis Macrocell networks Antennas

来源：评论

学校读者我要写书评

暂无评论

A co-evolutionary particle swarm optimization with dynamic topology for solving multi-objective optimization problems

Advances in Modelling and Analysis A

引用

Advances in Modelling and Analysis A 2016年第1期53卷 145-159页

作者： Wu, Daqing Tang, Lixiang Li, Haiyan Ouyang, LiJun Computer Science and Technology Institute University of South China HangyangHunan China Antai College of Economics and Management Shanghai Jiao Tong University Shanghai200240 China Zigong643000 China Key Laboratory of Guangxi High Schools for Complex System and Computational Intelligence Guangxi University for Nationalities Nanning530006 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University HefeiAnhui Province230039 China Department of Business Administration Hunan University of Finance and Economics Hunan410205 China

This paper proposes a multi-objective with dynamic topology particle swarm optimization (PSO) algorithm for solving multi-objective problems, named DTPSO. One of the main drawbacks of classical multi-objective particle swarm optimization algorithm is low diversity. To overcome this disadvantage, DTPSO uses two dynamic local best particles to lead the search particles with multiple populations to deal with multiple objectives, and maintains diversity of new found non-dominated solutions via partitioned the searching space into fixed number of cells. The proposed DTPSO is validated through comparisons with other two multi-objective algorithms using established benchmarks and metrics. Simulation results demonstrated that DTPSO shows competitive, if not better, performance as compared to the other algorithms. © 2016, AMSE Press. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

An improved performance metric for multiobjective evolutionary algorithms with user preferences

An improved performance metric for multiobjective evolutiona...

引用

IEEE Congress on Evolutionary Computation, CEC 2015

作者： Yu, Guo Zheng, Jinhua Li, Xiaodong School of Information Engineering Xiangtan University Hunan China Key Laboratory of Intelligent Computing Information Processing of Ministry of Education China School of Computer Science and IT RMIT University Melbourne Australia

ISBN: (纸本)9781479974924

This paper proposes an improved performance metric for multiobjective evolutionary algorithms with user preferences. This metric uses the idea of decomposition to transform the preference information into m+1 points on a constructed preference-based hyperplane, then calculates the Euclidean distances and the angles between the obtained solutions by algorithms and those obtained m+1 points, respectively. By means of these distances and angles, the proposed metric can evaluate effectively both the convergence and diversity of the obtained solution set, with consideration of the preference information. This makes easier and allows meaningful comparisons between different multiobjective evolutionary algorithms using preference information. © 2015 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Spray and Wait Routing Algorithm Based on Transfer Utility of Node in DTN

Spray and Wait Routing Algorithm Based on Transfer Utility o...

引用

2015 IEEE International Conference on Progress in Informatics and computing(PIC 2015)

作者： Guizhu Wang Mei Shao Run Li Yao Ma Bingting Wang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Department of Electronic and Electrical Engineering Chuzhou University

Delay Tolerant Networks(DTNs) is a mobile wireless network, in which it is difficult to establish end-to-end paths. Meanwhile, the nodes transmit message copies randomly,resulting in a high overhead of message propagation. In this paper, a Transfer Utility of Node Spray and Wait(TUoN-SNW)routing is proposed to forward the message copies dynamically,which avoid randomness of Spray and Wait routing protocol when message copies are forwarded. And in order to reduce the overhead, a Based on Transfer Utility of Node’s Buffer Scheduling Strategy(BTUoN-BSP) is also applied. Simulation results show that compared with the Spray and Wait(SNW)routing, the algorithms could not only improve the delivery rate but also reduce the overhead of network obviously.

关键词： delay tolerant networks transfer utility spray and wait buffer scheduling strategy

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：