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

Optimization of Key Predistribution Protocol Based on Supernetworks Theory in Heterogeneous WSN

Tsinghua Science and Technology 2016年第3期21卷 333-343页

作者： Qi Yuan Chunguang Ma Xiaorui Zhong Gang Du Jiansheng Yao College of Computer Science and Technology Harbin Engineering UniversityHarbin 150001China College of Communication and Electronic Engineering Qiqihar UniversityQiqihar 161006China Key Lab of Network Security and Cryptography of Fujian Province China Academy of Electronics and Information Technology Beijing 100041China

This work develops an equilibrium model for finding the optimal distribution strategy to maximize performance of key predistribution protocols in terms of cost, resilience, connectivity, and lifetime. As an essential attribute of wireless sensor networks, heterogeneity and its impacts on random key predistribution protocols are first discussed. Using supernetworks theory, the optimal node deployment model is proposed and illustrated. In order to find the equilibrium performance of our model, all optimal performance functions are changed into variational inequalities so that this optimization problem can be solved. A small-scale example is presented to illustrate the applicability of our model.

关键词： optimization key predistribution protocol supernetworks variational inequality wireless sensornetworks

来源：评论

学校读者我要写书评

暂无评论

Multiple influence maximization in social networks 10

Multiple influence maximization in social networks

引用

10th International Conference on Ubiquitous information Management and Communication, IMCOM 2016

作者： Sun, Honglin Gao, Xiaofeng Chen, Guihai Gu, Jian Wang, Yongjian Shanghai Key Lab. of Scalable Computing and Systems Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of Information Network Security of Ministry of Public Security Third Research Institute of Ministry of Public Security Shanghai China

ISBN: (纸本)9781450341424

Influence Maximization, a technique of social analysis to help marketers select a small group of users to promote their products with the goal of maximizing their influence spread, has been studied for a long time. However, previous researches did not consider the scenario that a company may intend to promote serval kinds of products in the same social network, where each user has different preferences for different categories. Considering this scenario in this paper, we propose the Multiple Influence Maximization (MIM) problem based on the assumption that one seed user can accept serval kinds of goods for free, and at the same time non-seed users have enough purchasing power to accept different promotions from their social friends. To address this issue, we design the corresponding greedy algorithm framework with an approximate radio of 1-1/e if the influence function is submodular. Besides, to simplify the computation of influence spread and considering the properties of real social influence propagation, we propose a novel influence quantitative computation model in which influence function fortunately is submodular. Applying this model into our MIM problem, the experiment results show that the greedy algorithm out-performs serval traditional heuristics in influence spread without loss of performance. © 2015 ACM.

关键词： Method of moments

来源：评论

学校读者我要写书评

暂无评论

A community-powered search of machine learning strategy space to find NMR property prediction models

arXiv

引用

arXiv 2020年

作者： Bratholm, Lars A. Gerrard, Will Anderson, Brandon Bai, Shaojie Choi, Sunghwan Dang, Lam Hanchar, Pavel Howard, Addison Huard, Guillaume Kim, Sanghoon Kolter, Zico Kondor, Risi Kornbluth, Mordechai Lee, Youhan Lee, Youngsoo Mailoa, Jonathan P. Nguyen, Thanh Tu Popovic, Milos Rakocevic, Goran Reade, Walter Song, Wonho Stojanovic, Luka Thiede, Erik H. Tijanic, Nebojsa Torrubia, Andres Willmott, Devin Butts, Craig P. Glowacki, David R. Participants, Kaggle School of Chemistry University of Bristol Cantock’s Close BristolBS8 1TS United Kingdom School of Mathematics University of Bristol Fry Building Woodland Road BristolBS1 1UG United Kingdom Dept. of Computer Science University of Bristol Merchant Venturer’s Building BristolBS8 1UB United Kingdom Intangible Realities Laboratory University of Bristol Cantock’s Close BristolBS8 1TS United Kingdom Bosch Center for Artificial Intelligence PittsburghPA15222 United States Carnegie Mellon University PittsburghPA15213 United States National Institute of Supercomputing and Network Korea Institute of Science and Technology Information 245 Daehak-ro Yuseong-gu Daejeon34141 Korea Republic of BNP Paribas Cardif Fyusion Inc. Kaggle Google Inc. Mountain View United States Ebay Korea 34F Gangnam Finance Center 152 Teheran Ro Gangnam Gu Seoul Korea Republic of Department of Computer Science University of Chicago 5730 S Ellis Ave ChicagoIL60637 United States Department of Statistics University of Chicago 5747 S Ellis Ave ChicagoIL60637 United States Center for Computational Mathematics Flatiron Institute 162 5th Ave. New YorkNY10010 United States Bosch Research and Technology Center CambridgeMA02139 United States Department of Chemical and Biomolecular Engineering Korea Advanced Institute of Science and Technology 291 Daehak-ro Yuseong-gu Daejeon34141 Korea Republic of 111 Daedeok-daero 989beon-gil Yuseong-gu Daejeon Korea Republic of MINDS AND COMPANY 2621 Nambusunhwan-ro Gangnam-gu Seoul06267 Korea Republic of Totient Inc Sindjeliceva 9 Belgrade11000 Serbia KAIST Web Security & Privacy Lab 291 Daehak-ro Yuseong-guDaejeon34141 Korea Republic of *** Alicante Spain

The rise of machine learning (ML) has created an explosion in the potential strategies for using data to make scientific predictions. For physical scientists wishing to apply ML strategies to a particular domain, it can be difficult to assess in advance what strategy to adopt within a vast space of possibilities. Here we outline the results of an online community-powered effort to swarm search the space of ML strategies and develop algorithms for predicting atomic-pairwise nuclear magnetic resonance (NMR) properties in molecules. Using an open-source dataset, we worked with Kaggle to design and host a 3-month competition which received 47,800 ML model predictions from 2,700 teams in 84 countries. Within 3 weeks, the Kaggle community produced models with comparable accuracy to our best previously published ‘in-house’ efforts. A meta-ensemble model constructed as a linear combination of the top predictions has a prediction accuracy which exceeds that of any individual model, 7-19x better than our previous state-of-the-art. The results highlight the potential of transformer architectures for predicting quantum mechanical (QM) molecular properties. Copyright © 2020, The Authors. All rights reserved.

关键词： Nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

A4Cloud workshop: Accountability in the cloud 10th

A4Cloud workshop: Accountability in the cloud

引用

10th IFIP WG 9.2, 9.5, 9.6/11.7, 11.4, 11.6/SIG 9.2.2 International Summer School on Privacy and Identity Management, 2015

作者： Fernandez-Gago, Carmen Pearson, Siani D’Errico, Michela Alnemr, Rehab Pulls, Tobias de Oliveira, Anderson Santana Network Information and Computer Security Lab University of Malaga Malaga29071 Spain Hewlett Packard Labs Bristol United Kingdom Karlstad University Karlstad Sweden SAP Labs France Mougins France

ISBN: (纸本)9783319417622

As cloud computing becomes a widely used technology, it is essential to provide mechanisms and tools that enable trust about how personal data is dealt with by cloud providers. The Cloud Accountability (A4Cloud) project tries to solve the problem of ensuring trust in the cloud by providing tools that support the process of achieving accountability. In this paper we will concentrate on some specific tools that were demonstrated and discussed during the A4Cloud workshop held in association with the IFIP Privacy Summer School in Edinburgh in 2015. In particular, we will describe tools that facilitate the appropriate choice of a cloud provider such as the Cloud Offerings Advisory Tool (COAT) and the Data Protection Impact Assessment Tool (DPIAT), tools that are in charge of controlling the data of the users such as the Data Track (DT) tool, and tools that help specify and enforce accountability related policies by using the Accountability-Primelife Policy Language (A-PPL) and an associated enforcement engine. © IFIP International Federation for information Processing 2016.

关键词： Trusted computing

来源：评论

学校读者我要写书评

暂无评论

INTELLIGENT information network security AND MANAGEMENT

引用

China Communications 2016年第7期13卷 3-6页

作者： Yixian Yang Zhongshan Zhang Wenjing Li Information Security Center(ISC) Beijing University of Posts and Telecommunications(BUPT) National Engineering Laboratory for Disaster Backup and Recovery the School of Computer and Communication Engineering in the University of Science and Technology Beijing(USTB) State Key Lab of Networking and Switching Technologies Network Management Research Center at BUPT National Innovation Research Group of China

Intelligent information network security and Management(IINSM)is an emerging direction in future Internet architecture research,which has gained significant tractions among academia and *** the rapid development of modern society,intelligent information network with the computer as the core technology is widely used in every aspect of social ***

关键词： DCT INTELLIGENT information network security AND MANAGEMENT Simulation DWT DCNN

来源：评论

学校读者我要写书评

暂无评论

Full Secure Attribute-Based Broadcast Encryption Achieved through Selective Techniques

Full Secure Attribute-Based Broadcast Encryption Achieved th...

引用

2016 International Conference on Sustainable Energy, Environment and information Engineering (SEEIE 2016)

作者： Jin SUN Yu-pu HU Department of Application Mathematics in Xi'an University of Technology Key Lab of Computer Network and Information Security Xidian University

According to the broadcast encryption scheme couldn't consider its security and efficiency in one model simultaneously, a full secure attribute-based broadcast encryption achieved through selective techniques was proposed. The scheme can achieve constant-size ciphertext in the standard model. By utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full security, it is proved by combining the dual system encryption argument and the static assumptions. The analysis results show that the scheme of this paper is full secure.

关键词： Attribute-based encryption Broadcast encryption Dual system CP-ABBE

来源：评论

学校读者我要写书评

暂无评论

Robust Multi-Exposure Image Fusion: A Structural Patch Decomposition Approach

Robust Multi-Exposure Image Fusion: A Structural Patch Decom...

引用

作者： Ma, Kede Li, Hui Yong, Hongwei Wang, Zhou Meng, Deyu Zhang, Lei Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong Department of Computing. Hong Kong Polytechnic University Hong Kong Hong Kong Institute for Information and System Sciences and Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China Inst. for Info. and Syst. Sci. and Min. of Educ. Key Lab. of Intelligent Networks and Netwk. Secty. Xi'an Jiaotong University Xi'an710049 China

We propose a simple yet effective structural patch decomposition approach for multi-exposure image fusion (MEF) that is robust to ghosting effect. We decompose an image patch into three conceptually independent components: signal strength, signal structure, and mean intensity. Upon fusing these three components separately, we reconstruct a desired patch and place it back into the fused image. This novel patch decomposition approach benefits MEF in many aspects. First, as opposed to most pixel-wise MEF methods, the proposed algorithm does not require post-processing steps to improve visual quality or to reduce spatial artifacts. Second, it handles RGB color channels jointly, and thus produces fused images with more vivid color appearance. Third and most importantly, the direction of the signal structure component in the patch vector space provides ideal information for ghost removal. It allows us to reliably and efficiently reject inconsistent object motions with respect to a chosen reference image without performing computationally expensive motion estimation. We compare the proposed algorithm with 12 MEF methods on 21 static scenes and 12 deghosting schemes on 19 dynamic scenes (with camera and object motion). Extensive experimental results demonstrate that the proposed algorithm not only outperforms previous MEF algorithms on static scenes but also consistently produces high quality fused images with little ghosting artifacts for dynamic scenes. Moreover, it maintains a lower computational cost compared with the state-of-The-Art deghosting schemes.11The MATlab code of the proposed algorithm will be made available online. Preliminary results of Section III-A [1] were presented at the IEEE International Conference on Image Processing, Canada, 2015. © 1992-2012 IEEE.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

Distributed energy balanced routing for wireless sensor network using energy prediction metric

Distributed energy balanced routing for wireless sensor netw...

引用

International Conference on information Science and Control Engineering

作者： Quan Guo Xiaoying Song Liaoning Key Lab of Network Security and Computing Technology Dalian Neusoft Information Institute College of Computer Science and Engineering Northeastern University

ISBN: (纸本)9781509025367

A considerable amount of energy efficient routing algorithms have been proposed to save energy and prolong network lifetime. Those algorithms mainly focus on forwarding packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. In this paper, we propose a distributed energy balanced routing algorithm using energy prediction metric (EBEP). The routing scheme considers not only efficient energy but also energy balance. Firstly, with the help of Markov chain model and state conversion model, the future residual energy of front neighbor nodes can be predicted so that it is the most important local information when a node makes routing decision. Furthermore, the function of cost is adopted by our EBEP routing algorithm in order to synthetically evaluate and then select the best candidate of next step. Finally, the experimental results demonstrate the performance advantages of our EBEP routing algorithm.

关键词： Wireless sensor networks Balancing energy consumption Energy-efficient routing Markov chain model Residual energy

来源：评论

学校读者我要写书评

暂无评论

Chosen-ciphertext secure bidirectional proxy broadcast re-encryption schemes

引用

International Journal of information and Communication Technology 2016年第4期8卷 405-419页

作者： Sun, Jin Hu, Yupu Department of Application Mathematics Xi'an University of Technology Xi'an710048 China Key Lab. of Computer Network and Information Security Xidian University Xi'an710071 China

A proxy re-encryption (PRE) scheme supports the delegation of decryption rights via a proxy, who makes the ciphertexts decryptable by the delegatee. However, how to structure a chosen-ciphertext secure proxy re-encryption scheme without pair is still an open question. In this paper, by adjusting the Schnorr signature scheme and giving the accessional ciphertext components, a bidirectional (which the proxy is able to transform ciphertexts in both directions) proxy broadcast re-encryption schemes (PBRE) was proposed without pair, and the reduction of scheme's security is the computational Diffie-Hellman (CDH) assumption. The proof of security shows that the proposed scheme is chosen-ciphertext attack secure in the random oracle model. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Metrics for accountability in the cloud 1st

Metrics for accountability in the cloud

引用

1st Summer School, Cloud Accountability Project, A4Cloud, 2014

作者： Fernández-Gago, Carmen Nuñez, David Network Information and Computer Security Lab University of Malaga Malaga29071 Spain

ISBN: (纸本)9783319171982

Accountability in the Cloud is a key concept that is determined by the accountability attributes. For assessing how accountable an organisation is we should be able to assess or provide techniques for measuring the attributes that influence on accountability. How much or to what extent they should be measured is a key issue. One of the goals of the A4Cloud project is, therefore, to develop a collection of metrics for performing meaningful measures on the attributes that influence accountability. This paper sets up the foundations towards the elicitation of metrics for accountability attributes. We describe here a metamodel for metrics for accountability attributes, which constitutes the basis for the process of elicitation of metrics for accountability. This metamodel is intended to serve as a language for describing accountability attributes and sub-attributes and for identifying the elements involved in their evaluation. One of the key components of the metamodel is the type of evidence the attribute use. © Springer International Publishing Switzerland 2015.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：