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

arXiv 2025年

作者： Liu, Minzhao Shaydulin, Ruslan Niroula, Pradeep DeCross, Matthew Hung, Shih-Han Kon, Wen Yu Cervero-Martín, Enrique Chakraborty, Kaushik Amer, Omar Aaronson, Scott Acharya, Atithi Alexeev, Yuri Berg, K. Jordan Chakrabarti, Shouvanik Curchod, Florian J. Dreiling, Joan M. Erickson, Neal Foltz, Cameron Foss-Feig, Michael Hayes, David Humble, Travis S. Kumar, Niraj Larson, Jeffrey Lykov, Danylo Mills, Michael Moses, Steven A. Neyenhuis, Brian Eloul, Shaltiel Siegfried, Peter Walker, James Lim, Charles Pistoia, Marco Global Technology Applied Research JPMorganChase New YorkNY10017 United States Quantinuum BroomfieldCO80021 United States Computational Science Division Argonne National Laboratory LemontIL60439 United States Department of Physics The University of Chicago ChicagoIL60637 United States Department of Computer Science The University of Texas at Austin AustinTX78712 United States Department of Electrical Engineering National Taiwan University Taipei City10617 Taiwan Quantinuum Terrington House 13–15 Hills Road CambridgeCB2 1NL United Kingdom Quantum Science Center Oak Ridge National Laboratory Oak RidgeTN37831 United States Mathematics and Computer Science Division Argonne National Laboratory LemontIL60439 United States

While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers [1, 2], realizing this potential remains a challenge. One such task is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy [3]. Certified randomness has many applications [4] but is fundamentally impossible to achieve solely by classical computation. In this work, we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations [5, 6]: a client generates quantum "challenge" circuits using a small randomness seed, sends them to an untrusted quantum server to execute, and verifies the server’s results. We analyze the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 1018 floating-point operations per second across multiple supercomputers, we certify 71, 313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of today’s quantum computers. Copyright © 2025, The Authors. All rights reserved.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

A Low-Cost Partially Reflective Surface for Gain Enhancement of Dual Polarized Microstrip Patch Antenna

A Low-Cost Partially Reflective Surface for Gain Enhancement...

引用

2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics, RI2C 2021

作者： Chudpooti, Sukanya Sangpet, Patchadaporn Chalermwisutkul, Suramate Torrungrueng, Danai Akkaraekthalin, Prayoot King Mongkut's University of Technology North Bangkok Facutly of Appied Science Department of Industrial Physics and Medical Instrumentation Bangkok Thailand King Mongkut's University of Technology North Bangkok Faculty of Engineering Department of Electrical and Computer Engineering Bangkok Thailand Bangkok Thailand King Mongkut's University of Technology North Bangkok Faculty of Technical Education Department of Teacher Training in Electrical Engineering Bangkok Thailand

ISBN: (纸本)9781665403009

This paper presents a designed partially reflective surface (PRS) with a low-cost substrate for gain enhancement in the dual-polarized antenna. The conventional microstrip patch antenna, with the operating frequency at 3.5 GHz, is selected to use for a source. Two SMA ports with a 90-degree difference phase are fed into the patch antenna to create a dual-polarization. The PRS is designed based on the unit cell of a square metallic patch. The dimension of the unit cell is 5 mm × 5 mm. To investigate the performance of the PRS design, the fully 3D-simulation software, CST-Studio, is used to monitor all parameters, e.g., reflection magnitude, reflection phase, and realized gain. Four conditions on the square patch are carefully chosen by varying the dimension of the square patch from 3 mm to 4.5 mm with a step of 0.5 mm. Based on simulated results, the maximum gain at the zero degrees is increased from 1.68 dBi to 5.82 dBi, when compared with and without an integrated partially reflective surface. © 2021 IEEE.

关键词： Microstrip antennas

来源：评论

学校读者我要写书评

暂无评论

Prevalence of symptomatic dry eye disease (DED) among a population of contact lens wearers in Jordan

引用

Contact Lens and Anterior Eye 2024年第4期47卷

作者： May Bakkar Wissam Ghach Mona Al-Aridi Mohammad Al Ebrahim Faculty of Applied Medical Sciences Jordan University of Science and Technology Irbid Jordan Faculty of Communication Arts and Sciences Canadian University Dubai Dubai United Arab Emirates School of Computer and Applied Sciences Modern University for Business and Science Damour Lebanon

来源：评论

学校读者我要写书评

暂无评论

A review of federated learning in renewable energy applications: Potential, challenges, and future directions

arXiv

引用

arXiv 2023年

作者： Grataloup, Albin Jonas, Stefan Meyer, Angela School of Engineering and Computer Science Bern University of Applied Sciences Quellgasse 12 Biel2501 Switzerland Faculty of Informatics Università della Svizzera Italiana Via la Santa 1 Lugano-Viganello 6962 Switzerland Department of Geoscience and Remote Sensing Delft University of Technology Stevinweg 1 Delft2628 Netherlands

Federated learning has recently emerged as a privacy-preserving distributed machine learning approach. Federated learning enables collaborative training of multiple clients and entire fleets without sharing the involved training datasets. By preserving data privacy, federated learning has the potential to overcome the lack of data sharing in the renewable energy sector which is inhibiting innovation, research and development. Our paper provides an overview of federated learning in renewable energy applications. We discuss federated learning algorithms and survey their applications and case studies in renewable energy generation and consumption. We also evaluate the potential and the challenges associated with federated learning applied in power and energy contexts. Finally, we outline promising future research directions in federated learning for applications in renewable energy. © 2023, CC BY-NC-ND.

关键词： Wind power

来源：评论

学校读者我要写书评

暂无评论

Dpb-Mopso: A Dynamic Pareto Bi-Level Multi-Objective Particle Swarm Optimization Algorithm

SSRN

引用

SSRN 2022年

作者： Aboud, Ahlem Rokbani, Nizar Fdhila, Raja Qahtani, Abdulrahman M. Almutiry, Omar Dhahri, Habib Hussain, Amir Alimi, Adel M. University of Sousse ISITCom Sousse4011 Tunisia BP 1173 Sfax3038 Tunisia High Institute of Applied Science and Technology of Sousse University of Sousse Tunisia Department of Computer Science College of Computers and Information Technology Taif University P.O.Box. 11099 Taif21944 Saudi Arabia College of Applied Computer Science King Saud University Riyadh Saudi Arabia Edinburgh Napier University School of Computing EdinburghEH10 5DT United Kingdom Department of Electrical and Electronic Engineering Science Faculty of Engineering and the Built Environment University of Johannesburg South Africa

Particle Swarm Optimization (PSO) system based on the distributed architecture over multiple sub-swarms is very efficient for static multi-objective optimization, but has not been considered for solving dynamic multi-objective problems (DMOPs). Tracking the most effective solutions over time and ensuring good exploitation and exploration are the main challenges of solving DMOP. This study proposes a Dynamic Pareto bi-level Multi-Objective Particle Swarm Optimization (DPb-MOPSO) algorithm including two parallel optimization levels. At the first level, all solutions are managed in a single search space. When a dynamic change is successfully detected in the objective values, the Pareto ranking operator is used to enable a multiple sub-swarm’ subdivisions and processing which drives the second level of enhanced exploitation. A dynamic handling strategy based on random detectors is used to track the changes of the objective function due to time-varying parameters. A response strategy consisting in re-evaluate all unimproved solutions and replacing them with newly generated ones is also implemented. The DPb-MOPSO system is tested on a set of DMOPs with different types of time-varying Pareto Optimal Set (POS) and Pareto Optimal Front (POF). Inverted generational distance (IGD), mean inverted generational distance (MIGD), and hypervolume difference (HVD) metrics are used to assess the DPb-MOPSO performances. Quantitative results are analyzed using Friedman's analysis of variance, while stability is analyzed using Lyapunov's theorem. The DPb-MOPSO is more robust than several dynamic multi-objective evolutionary algorithms in solving 21 complex problems over a range of changes in both the POS and POF. On IGD and HVD, DPb-MOPSO can solve 8/13 and 7/13 of the 13 UDF and ZJZ functions with moderate changes. DPb-MOPSO is able to resolve 4/8 FDA and DMOP benchmarks with severe changes to the MIGD, and 5/8 with moderate changes. DPb-MOPSO assumes 4/8 of the solving function on IGD

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Integration of photosystem i and photosystem II from tylakoid membrane of spirulina sp. for DSSC natural dye pigments 1

Integration of photosystem i and photosystem II from tylakoi...

引用

1st International Conference on Lesson Study of science technology Engineering and Mathematics 2019, ICOLSSTEM 2019

作者： Kusuma, D.Y. Hidayah, Q. Izziyah, A.N. Purnama, B. Department of Physics Faculty of Applied Science and Technology Universitas Ahmad Dahlan Jl. Ring Road Selatan Tamanan Yogyakarta55191 Indonesia Department of Physics Faculty of Science Universitas Sebelas Maret Jl. Ir. Sutami 36A Jebres Surakarta55171 Indonesia

Conversion of sunlight to electron within pigment-protein complex of Photosistem I (PS I) and Photosystem II (PS II) in kloroplast's tylakoid membrane is the hearth of photosynthesis process. This process is very efficient with nearly 100% quantum efficiency. In this paper, we demonstrate the integration of PS I and PS II pigment-protein complex extracted from spirulina sp, as the natural dye for DSSC structure. The PS I and PS II was obtained by ultrasonic cell rupture followed by staggered sequential centrifugation at various g-force level to separate the tylakoid protein complex from other cell components. Contrary to typical DSSC using inorganic dyes which requires elaborate surface treatment, expensive, and employing hazardous dyes, the devices described here are straightforward and inexpensive to fabricate. The device also perform well on photovoltaic activity yielding open circuit voltage of 0.20 V, short-circuit current density of 7.60 μA, and fill factor of 35% at 1 mW/cm2 incandescence lamp illumination. © Published under licence by IOP Publishing Ltd.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of deep learning and machine learning techniques for forecasting new malaria cases in Cameroon's Adamaoua region

引用

Intelligence-Based Medicine 2025年 11卷 100220-100220页

作者： Naroum, Esaie Maka, Ebenezer Maka Abboubakar, Hamadjam Dayang, Paul Bamana, Appolinaire Batoure Garga, Benjamin Daouda, Hassana Daouda Bakouri, Mohsen Khan, Ilyas University of Ngaoundéré Department of Mathematics and computer Science Faculty of Science P.O. Box 455 Ngaoundéré Cameroon University of Douala National Higher Polytechnic School Department of Computer Engineering and Telecommunications P.O. Box 2701 Douala Cameroon University of Ngaoundéré University Institute of Technology Department of Computer Engineering P.O. Box 455 Ngaoundéré Cameroon University of Ngaoundéré Laboratory of Analysis Simulation and Test (LASE) P.O. Box 455 Ngaoundéré Cameroon University of Ngaoundéré School of Geology and Mining Engineering Department Applied Mathematics and Computer Science P.O. Box 115 Meiganga Cameroon University of Ngaoundéré ENSAI Department of Electrical Electronic and Automatic Engineering P.O. Box 455 Ngaoundéré Cameroon Majmaah University College of Applied Medical Science Department of Medical Equipment Technology Al-Majmaah 11952 Saudi Arabia Department of Mathematics College of Science Al-Zulfi Majmaah University Al-Majmaah 11952 Saudi Arabia

The Plasmodium parasite, which causes malaria is transmitted by Anopheles mosquitoes, and remains a major development barrier in Africa. This is particularly true considering the conducive environment that promotes the spread of malaria. This study examines several machine learning approaches, such as long short term memory (LSTM), random forests (RF), support vector machines (SVM), and data regularization models including Ridge, Lasso, and ElasticNet, in order to forecast the occurrence of malaria in the Adamaoua region of Cameroon. The LSTM, a recurrent neural network variant, performed the best with 76% accuracy and a low error rate (RMSE = 0.08). Statistical evidence indicates that temperatures exceeding 34 degrees halt mosquito vector reproduction, thereby slowing the spread of malaria. However, humidity increases the morbidity of the condition. The survey also identified high-risk areas in Ngaoundéré Rural and Urban and Meiganga. Between 2018 and 2022, the Adamaoua region had 20.1%, 12.3%, and 10.0% of malaria cases, respectively, in these locations. According to the estimate, the number of malaria cases in the Adamaoua region will rise gradually between 2023 and 2026, peaking in 2029 before declining in 2031. © 2025 The Authors

关键词： Adamaoua-Cameroon Deep learning Machine learning Malaria Metric evaluation Time-series forecasting

来源：评论

学校读者我要写书评

暂无评论

Computational complexity of covering two-vertex multigraphs with semi-edges

arXiv

引用

arXiv 2021年

作者： Bok, Jan Fiala, Jiří Hliněný, Petr Jedličková, Nikola Kratochvíl, Jan Computer Science Institute Faculty of Mathematics and Physics Charles University Prague Czech Republic Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Prague Czech Republic Faculty of Informatics Masaryk University Brno Czech Republic

We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for graphs with semi-edges. The notion of graph covering is a discretization of coverings between surfaces or topological spaces, a notion well known and deeply studied in classical topology. Graph covers have found applications in discrete mathematics for constructing highly symmetric graphs, and in computer science in the theory of local computations. In 1991, Abello et al. asked for a classification of the computational complexity of deciding if an input graph covers a fixed target graph, in the ordinary setting (of graphs with only edges). Although many general results are known, the full classification is still open. In spite of that, we propose to study the more general case of covering graphs composed of normal edges (including multiedges and loops) and so-called semi-edges. Semi-edges are becoming increasingly popular in modern topological graph theory, as well as in mathematical physics. They also naturally occur in the local computation setting, since they are lifted to matchings in the covering graph. We show that the presence of semi-edges makes the covering problem considerably harder;e.g., it is no longer sufficient to specify the vertex mapping induced by the covering, but one necessarily has to deal with the edge mapping as well. We show some solvable cases, and completely characterize the complexity of the already very nontrivial problem of covering one- and two-vertex (multi)graphs with semi-edges. Our NP-hardness results are proven for simple input graphs, and in the case of regular two-vertex target graphs, even for bipartite ones. This provides a strengthening of previously known results for covering graphs without semi-edges, and may contribute to better understanding of this notion and its complexity. Copyright © 2021, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Swin Vision Transformer Model using Gradient Accumulation Optimization Technique

arXiv

引用

arXiv 2023年

作者： Aburass, Sanad Dorgham, Osama Department of Computer Science Maharishi International University FairfieldIA United States Prince Abdullah bin Ghazi Faculty of Information and Communication Technology Al-Balqa Applied University Al-Salt19117 Jordan School of Information Technology Skyline University College University City of Sharjah P.O. Box 1797 Sharjah United Arab Emirates

Vision Transformers (ViTs) have emerged as a promising approach for visual recognition tasks, revolutionizing the field by leveraging the power of transformer-based architectures. Among the various ViT models, Swin Transformers have gained considerable attention due to their hierarchical design and ability to capture both local and global visual features effectively. This paper evaluates the performance of Swin ViT model using gradient accumulation optimization (GAO) technique. We investigate the impact of gradient accumulation optimization technique on the model's accuracy and training time. Our experiments show that applying the GAO technique leads to a significant decrease in the accuracy of the Swin ViT model, compared to the standard Swin Transformer model. Moreover, we detect a significant increase in the training time of the Swin ViT model when GAO model is applied. These findings suggest that applying the GAO technique may not be suitable for the Swin ViT model, and concern should be undertaken when using GAO technique for other transformer-based models. © 2023, CC BY.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Hamiltonian analysis of metric-affine-R2 theory

arXiv

引用

arXiv 2023年

作者： Glavan, Dražen Zlosnik, Tom Lin, Chunshan CEICO FZU Institute of Physics The Czech Academy of Sciences Na Slovance 1999/2 Prague 8182 21 Czech Republic Institute of Theoretical Physics and Astrophysics University of Gdańsk ul. Wita Stwosza 57 Gdańsk80-308 Poland Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University ul. prof. Stanislawa Lojasiewicza 11 Kraków30-348 Poland

Determining the number of propagating degrees of freedom in metric-affine theories of gravity requires the use of Hamiltonian constraint analysis, except in some subclasses of theories. We develop the technicalities necessary for such analyses and apply them to the Weyl-invariant and projective-invariant case of metric-affine-R2 theory that is known to propagate just the graviton. This serves as a check of the formalism and a case study where we introduce appropriate ADM variables for the distortion 3-tensor tensor and its time derivatives, that will be useful when analyzing more general metric-affine theories where the physical spectrum is not known. © 2023, CC BY.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：