检索结果-南通市图书馆

A CPK-Based Identity Authentication Scheme for IoT

在线全文

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2022年第3期40卷 1217-1231页

作者： Mingming zhang Jiaming Mao Yuanyuan Ma Liangjie Xu Chuanjun Wang ran Zhao Zhihao Li lu Chen Wenbing Zhao State Grid Jiangsu Electric Power Co. Ltd.Information&Telecommunication BranchNanjing210008China State Grid Key Laboratory of Information&Network Security Institute of Information and CommunicationGlobal Energy Interconnection Research InstituteNanjing210003China Anhui Jiyuan Software Co.Ltd SGITGHefei230088China Engineering Research Center of Post Big Data Technology and Application of Jiangsu Province Research and Development Center of Post Industry Technology of the State Posts Bureau(Internet of Things Technology)Engineering Research Center of Broadband Wireless Communication Technology of the Ministry of EducationNanjing University of Posts and TelecommunicationsNanjing210003China Department of Electrical Engineering and Computer Science Cleveland State UniversityCleveland44115USA

As the power Internet of Things(IoT)enters the security construction stage,the massive use of perception layer devices urgently requires an identity authentication scheme that considers both security and *** existing public key infrastructure(PKI)-based security authentication scheme is currently difficult to apply in many terminals in *** key distribution and management costs are high,which hinders the development of power IoT security *** Public Key(CPK)technology uses a small number of seeds to generate unlimited public *** is very suitable for identity authentication in the power Internet of *** this paper,we propose a novel identity authentication scheme for power *** scheme combines the physical unclonable function(PUF)with improved CPK technology to achieve mutual identity authentication between power IoT terminals and *** proposed scheme does not require third-party authentication and improves the security of identity authentication for power ***,the scheme reduces the resource consumption of power IoT *** improved CPK algorithm solves the key collision problem,and the third party only needs to save the private key and the public key *** results show that the amount of storage resources occupied in our scheme is *** proposed scheme is more suitable for the power IoT.

关键词： Power Internet of Things terminal equipment identity authentication CPK PUF

Lattice-based PKEs/KEMs

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

National Science Review 2021年第9期8卷 7-8页

作者： Xianhui lu Jiang zhang Institute of Information Engineering Chinese Academy of Sciences State Key Laboratory of Cryptology

The invention of public-key cryptography(PKC) by Diffie and Hellman in 1976 is one of two milestones marking the beginning of modern cryptography. The security of a PKC system requires that it should be infeasible to compute the private key from a given public key, which in turn is typically guaranteed by the difficulty in solving some cryptographicfriendly mathematical problems. Among those problems, the integer factorization and discrete logarithm problems play pivotal roles in the development of public-key cryptography.

关键词：

A Simple Nonfused Ring Electron Acceptor with a Power Conversion Efficiency over 16%

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Chemistry 2023年第6期41卷 665-671页

作者： Xiaodong Wang Rui Zeng Hao lu Guangliu ran Andong zhang Ya-Nan Chen Yahui Liu Feng Liu Wenkai zhang Zheng Tang Zhishan Bo College of Textiles&Clothing State Key Laboratory of Bio-fibers and Eco-textilesQingdao UniversityQingdaoShandong 266071China Frontiers Science CenterforTransformative Molecules In-situ Centerfor Physical Scienceand Center of Hydrogen Science Schoolof Chemistryand Chemical EngineeringShanghai JiaoTong UniversityShanghai 200240China Departmentof Physics and Applied Optics Beijing Area Major Laboratory Bejing Normal UniversityBeijing 100875China Center for Advanced Low-dimension Materials State Key Laboratory for Modification of Chemical Fibers and Polymer MaterialsCollege of Materials Science and EngineeringDonghua UniversityShanghai 201620China

By simplifying the r-bridge unit,a nonfused ring electron acceptor(NFREA)BM-2F was designed and synthesized with several high-yield *** specific molecular structure features of BM-2F are planar molecular backbone and out-of-plane side chain,which is favorable for charge transport and can suppress the ***-2F based neat and blend films display obvious face-on molecular ***,D18:BM-2F based blend film can form good bicontinuous interpenetrating *** excitingly,a power conversion efficiency of 16.15%was achieved with D18:BM-2F based photovoltaic devices,which is the highest one based on *** researches manifest that NFREA is a promising direction for low-cost and high-performance organic solar cells.

关键词： Organic solar cells Nonfused ring electron acceptors Nonfullerene acceptors Low-cost acceptors High-performance acceptors

Study on electronic density topology of various cluster models of Mg/Al hydrotalcite by density functional theory

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Natural Gas Chemistry 2010年第2期19卷 179-184页

作者： Renqing lu Nina zhang College of Chemistry and Chemical Engineering China University of Petroleum （East China） Qingdao 266555 Shandong China

The geometry and electronic topology properties of Mg/Al hydrotalcite cluster models were comparatively investigated by means of density functional theory at GGA/DND *** results suggested that cluster model containing seven octahedral cations was the smallest size to be employed to simulate other *** fact that the n＋ charge of cluster models containing n aluminum atoms can reflect electronic properties of anionic clay layer *** bond lengths of clusters can be modified by terminating with or without OH-/H2O groups in terms of principle of bond order conservation.

关键词： hydrotalcite density functional theory cluster model Mg/Al

New Mehrotra's second order predictor-corrector algorithm for P_*(κ) linear complementarity problems

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2010年第4期21卷 705-712页

作者： Mingwang zhang Yanli lu College of Science China Three Gorges University Yichang 443002 R R. China

It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P_＊（κ） linear complementarity *** paper presents an extension of the recent variant of Mehrotra＇s second order algorithm for linear *** is shown that the iteration-complexity bound of the algorithm is O（4κ ＋ 3）√14κ ＋ 5 nlog（x0）Ts0/ε,which is similar to that of the corresponding algorithm for linear optimization.

关键词： linear complementarity problem P_*(κ)-matrix Mehrotra-type predictor-corrector algorithm polynomial complexity.

Scheduling Problems with Rejection to Minimize the Maximum Flow Time

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2016年第5期29卷 1293-1301页

作者： zhang Liqi lu Lingfa College of Information and Management Science Henan Agricultural University School of Mathematics and Statistics Zhengzhou University

This paper considers the scheduling problem with rejection on m identical parallel machines to minimize the maximum flow time. The authors show that this problem is NP-hard even when there is a single machine and all jobs have two distinct release dates. Furthermore, the authors present a dynamic programming algorithm and two approximation algorithms to solve them.

关键词： Approximation algorithm NP-hard rejection penalty scheduling.

ForkXplorer:an approach of fork summary generation

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2022年第2期16卷 1-15页

作者： zhang zhang Xinjun MAO Chao zhang Yao lu Key Laboratory of Software Engineering for Complex Systems College of ComputerNational University of Defense TechnologyChangsha 410073China

Pull-based development has become an important paradigm for distributed software *** this model,each developer independently works on a copied repository(i.e.,a fork)from the central *** is essential for developers to maintain awareness of the state of other forks to improve collaboration *** this paper,we propose a method to automatically generate a summary of a *** first use the random forest method to generate the label of a fork,i.e.,feature implementation or a bug *** on the information of the fork-related commits,we then use the Textrank algorithm to generate detailed activity information of the ***,we apply a set of rules to integrate all related information to construct a complete fork *** validate the effectiveness of our method,we conduct 30 groups of manual experiment and 77 groups of case studies on *** propose Fea_(avg)to evaluate the performance of Fea_(avg)the generated fork summary,considering the content accuracy,content integrity,sentence fluency,and label extraction *** results show that the average of of the fork summary generated by this method is *** than 63%of project maintainers and the contributors believe that the fork summary can improve development efficiency.

关键词： open source software pull-based development fork summary distributed cooperative development

EXPONENTIALLY ADAPTIVE SYNCHRONIZATION OF AN UNCERTAIN DELAYED DYNAMICAL NETWORK

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2011年第2期24卷 207-217页

作者： Qunjiao zhang Jun'an lu College of Science Wuhan Textile University Wuhan 430073 China School of Mathematics and Statistics Wuhan University Wuhan 430072 China

Over the past decades, complex networks have been prosperous greatly in various fields of sciences and engineering. Much attention has been given to investigate the synchronization of complex networks in recent years. However, few work has done for the networks with uncertain parameters and unknown topology. In this paper, to further reveal the dynamical mechanism in complex networks with time delays, an uncertain general complex dynamical network with delayed nodes is studied. By constructing a drive network and a suitable slave network, several novel criteria for the networks consisting of the identical nodes and different nodes have been obtained based on the adaptive feedback method. Particularly, the hypotheses and the proposed adaptive laws for network synchronization are simple and can be readily applied in practical applications. Finally, numerical simulations are provided to illustrate the effectiveness of the proposed synchronization criteria.

关键词： Adaptive feedback synchronization complex networks delayed nodes uncertain parameter unknown topology.

PEGylation of therapeutic oligonucletides： From linear to highly branched PEG architectures

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Nano Research 2018年第10期11卷 5519-5534页

作者： Xueguang lu Ke zhang Department of Chemistry and Chemical Biology Northeastern University Boston Massachusetts 02115 USA

PEGylation, the attachment of poly（ethylene glycol）（PEG）, has been adopted to improve the pharmacokinetic properties of oligonucleotide therapeutics for nearly 30 years. Prior efforts mainly focused on the investigation of linear or slightly branched PEG having different molecular weights, terminal functional groups, and possible oligonucleotide sites for functionalization. Recent studies on highly branched PEG （including brush, star, and micellar structures） indicate superior properties in several areas including cellular uptake, gene regulation efficac~ reduction of side effects, and biodistribution. This review focuses on comparing the effects of PEG architecture on the physiochemical and biological properties of the PEGylated oligonucleotide.

关键词： PEGylation oligonucleotide brush polymer antisense small interfering RNA aptamer phosphorothioate