检索结果-南通市图书馆

维普期刊数据库

The quantum Ising model for perfect matching and solving it with variational quantum eigensolver

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第9期67卷 306-320页

作者： Qilin ZHENG Pingyu ZHU Chao WU Miaomiao YU Weihong LUO Ping XU Institute for Quantum Information and State key laboratory of High Performance computing College of Computer Science and Technology National University of Defense Technology Hefei National laboratory

Obtaining all perfect matchings of a graph is a tough problem in graph theory, and its complexity belongs to the #P-Complete class. The problem is closely related to combinatorics, marriage matching problems, dense subgraphs, the Gaussian boson sampling, chemical molecular structures, and dimer *** this paper, we propose a quadratic unconstrained binary optimization formula of the perfect matching problem and translate it into the quantum Ising model. We can obtain all perfect matchings by mapping them to the ground state of the quantum Ising Hamiltonian and solving it with the variational quantum eigensolver. Adjusting the model's parameters can also achieve the maximum or minimum weighted perfect matching. The experimental results on a superconducting quantum computer of the Origin Quantum computing Technology Company show that our model can encode 2~n dimensional optimization space with only O（n） qubits consumption and achieve a high success probability of the ground state corresponding to all perfect matchings. In addition, the further simulation results show that the model can support a scale of more than 14 qubits, effectively resist the adverse effects of noise, and obtain a high success probability at a shallow variational depth. This method can be extended to other combinatorial optimization problems.

关键词： perfect matching Ising model quantum Hamiltonian variational quantum eigensolver quadratic unconstrained binary optimization

Chaotic CS Encryption:An Efficient Image Encryption Algorithm Based on Chebyshev Chaotic System and Compressive Sensing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第5期79卷 2625-2646页

作者： Mingliang Sun Jie Yuan Xiaoyong Li Dongxiao Liu key laboratory of Trustworthy Distributed computing and Service(BUPT) Ministry of EducationBeijing University of Posts and TelecommunicationsBeijing100876China

Images are the most important carrier of human information. Moreover, how to safely transmit digital imagesthrough public channels has become an urgent problem. In this paper, we propose a novel image encryptionalgorithm, called chaotic compressive sensing (CS) encryption (CCSE), which can not only improve the efficiencyof image transmission but also introduce the high security of the chaotic system. Specifically, the proposed CCSEcan fully leverage the advantages of the Chebyshev chaotic system and CS, enabling it to withstand various attacks,such as differential attacks, and exhibit robustness. First, we use a sparse trans-form to sparse the plaintext imageand then use theArnold transformto perturb the image pixels. After that,we elaborate aChebyshev Toeplitz chaoticsensing matrix for CCSE. By using this Toeplitz matrix, the perturbed image is compressed and sampled to reducethe transmission bandwidth and the amount of data. Finally, a bilateral diffusion operator and a chaotic encryptionoperator are used to perturb and expand the image pixels to change the pixel position and value of the compressedimage, and ultimately obtain an encrypted image. Experimental results show that our method can be resistant tovarious attacks, such as the statistical attack and noise attack, and can outperform its current competitors.

关键词： Image encryption chaotic system compressive sensing arnold transform

On Isodual Double Toeplitz Codes

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLé Patrick key laboratory of Intelligent computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University State key laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences CNRS University of Aix Marseille Centrale Marseille

Double Toeplitz（shortly DT） codes are introduced here as a generalization of double circulant codes. The authors show that such a code is isodual, hence formally self-dual（FSD）. FSD codes form a far-reaching generalization of self-dual codes, the most important class of codes of rate one-half. Self-dual DT codes are characterized as double circulant or double negacirculant. Likewise, even binary DT codes are characterized as double circulant. Numerical examples obtained by exhaustive search show that the codes constructed have best-known minimum distance, up to one unit, amongst formally self-dual codes, and sometimes improve on the known values. For q = 2, the authors find four improvements on the best-known values of the minimum distance of FSD codes. Over F4an explicit construction of DT codes, based on quadratic residues in a prime field, performs equally well. The authors show that DT codes are asymptotically good over Fq. Specifically, the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes formally self-dual codes isodual codes

Contact engineering for temperature stability improvement of Bi-contacted MoS2 field effect transistors

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第06期67卷 172-179页

作者： Zizheng LIU Qing ZHANG Xiaohe HUANG Chunsen LIU Peng ZHOU State key laboratory of Integrated Chip and Systems School of MicroelectronicsZhangjiang Fudan International Innovation CenterFudan University Frontier Institute of Chip and System Shanghai Key Lab for Future Computing Hardware and SystemFudan University Shaoxin laboratory

Semimetallic bismuth（Bi） is one of the most effective strategies for reducing the contact resistance of two-dimensional transition metal dichalcogenide field effect transistors（FETs）. However, the low melting point of Bi contact（271.5℃） limits its reliable applications. In this study, we demonstrated that the temperature stability of Bi-contacted electrodes could be improved by inserting a high-melting point semimetallic antimony（Sb） between the Bi contacting layer and the gold（Au） capping layer. The proposed Bi/Sb/Au contact electrodes tended to form a metal mixture with a continuous surface during the heating process（Voids appeared on the surface of the Bi/Au contact electrodes after heating at 120℃）. Because of the improved contacting layer formed by the semimetal Bi/Sb alloy, the fabricated Bi/Sb/Au-contacted molybdenum sulfide（MoS2） FETs with different gate lengths demonstrated higher on-state current stability after heating treatment than the Bi/Au contact. Because of the Bi/Sb/Au contact and poly（methyl methacrylate） package, the MoS2FETs demonstrated time stability of at least two months from the almost unchanged transfer characteristics. The electrical stability indicates that the insertion of semimetallic Sb is a promising technology for reliable Bi-based contact.

关键词： temperature stability semimetallic bismuth contact semimetallic antimony contact MoS$_{2}$ FETs time stability

Partially-hiding functional encryption for degree-2 polynomials with fine-grained access control

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第3期18卷 231-233页

作者： Haifeng QIAN Cheng LIN Qiaohan CHU Jie CHEN Shanghai key laboratory of Trustworthy computing Software Engineering InstituteEast China Normal UniversityShanghai 200062China

1 Introduction Boneh et al.[1]first systematically introduce the concept of Functional Encryption(FE)which overcomes all-or-nothing limitation of traditional public key ***,FE hides a potential problem:even if the secret key is obtained legitimately,once it is released,it can be used *** leads to that the secret key may leak information *** deal with this problem and make FE more practical,Abdalla et al.[2]recently constructed inner-product FE(IPFE)with fine-grained access control achieving strong security guarantees under standard assumptions.

关键词： grain Encryption encryption

Method and Practice of Trusted Embedded computing and Data Transmission Protection Architecture Based on Android

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第3期33卷 623-634页

作者： Yichuan WANG Wen GAO Xinhong HEI Yanning DU School of Computer Science and Engineering Xi'an University of Technology Shaanxi key laboratory for Network computing and Security Technology

In recent years,the rapid development of Internet technology has constantly enriched people's daily life and gradually changed from the traditional computer terminal to the mobile *** with it comes the security problems brought by the mobile *** for Android system,due to its open source nature,malicious applications continue to emerge,which greatly threatens the data security of ***,this paper proposes a method of trusted embedded static measurement and data transmission protection architecture based on Android to reduce the risk of data leakage in the process of terminal storage and *** conducted detailed data and feasibility analysis of the proposed method from the aspects of time consumption,storage overhead and *** experimental results show that this method can detect Android system layer attacks such as self-booting of the malicious module and improve the security of data encryption and transmission process *** with the native system,the additional performance overhead is small.

关键词： Embedded computing Protocols Data security Computer architecture Encryption Internet Data communication

Large-Scale Multi-Objective Optimization Algorithm Based on Weighted Overlapping Grouping of Decision Variables

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2024年第7期140卷 363-383页

作者： Liang Chen Jingbo Zhang Linjie Wu Xingjuan Cai Yubin Xu Shanxi key laboratory of Big Data Analysis and Parallel computing Taiyuan University of Science and TechnologyTaiyuan030024China School of State key laboratory of Novel Software Technology Nanjing UniversityNanjing210008China

The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision ***,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this ***,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision *** the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping ***,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision *** decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into ***,the decision variable with the strongest interaction is added to each *** minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different *** was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our *** with the other algorithms,our method is still at an advantage.

关键词： Decision variable grouping large-scale multi-objective optimization algorithms weighted overlapping grouping direction-guided evolution

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Bionic Engineering 2024年第3期21卷 1541-1566页

作者： keyu Zhong Fen Xiao Xieping Gao key laboratory of computing and Stochastic Mathematics of Ministry of Education Hunan Normal UniversityChangsha410081China School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China School of Computer Science Xiangtan UniversityXiangtan411105China Hunan Provincial key laboratory of Intelligent computing and Language Information Processing Hunan Normal UniversityChangsha410081China

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific *** many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching *** address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED *** proposed algorithm first stores non-dominated optimal solutions found so far into an ***,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index *** mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant ***,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto *** this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching *** proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance ***,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED ***,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs

关键词： Dynamic economic emission dispatch Multi-objective optimization Golden jackal Euclidean distance index

APFA:Ameliorated Pathfinder Algorithm for Engineering Applications

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Bionic Engineering 2024年第3期21卷 1592-1616页

Pathfinder algorithm(PFA)is a swarm intelligent optimization algorithm inspired by the collective activity behavior of swarm animals,imitating the leader in the population to guide followers in finding the best food *** algorithm has the characteristics of a simple structure and high ***,PFA faces challenges such as insufficient population diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation *** paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization ***,a guidance mechanism based on multiple elite individuals is presented to enhance the global search capability of the ***,to improve the exploration efficiency of the algorithm,the Logistic chaos mapping is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst ***,a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the convergence *** three strategies achieve an effective balance between exploration and exploitation overall,thus improving the optimization performance of the *** performance evaluation,APFA is validated by the CEC2022 benchmark test set and five engineering optimization problems,and compared with the state-of-the-art metaheuristic *** numerical experimental results demonstrated the superiority of APFA.

关键词： Pathfinder algorithm Swarm intelligent Metaheuristic Engineering problems