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

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yingkang Cao Xiaodi Wu Department of Computer Science Joint Center for Quantum Information and Computer Science University of Maryland College Park USA

Distributed quantum sensing network has the potential of enhancing the precision in estimating a global function of local parameters by utilizing an entangled probe, compared with that achieved with separable probes. This advantage is often characterized as a quadratic improvement of the quantum Cramér-Rao bound (QCRB). This argument is incomplete in that QCRB assumes a team of all-powerful sensors that can perform arbitrary joint measurements allowed by quantum mechanics. An immediate question arises as to whether such an advantage persists for isolated sensors with physically motivated constraints in their measurement strategies. In this paper, we first consider local operations and classical communication (LOCC) strategies and prove that the QCRB is indeed asymptotically attainable for arbitrary pure probe states, by extending previous work on single-parameter estimation [1]. We further numerically analyze a more restricted scenario where the sensors can only make independent local measurements, and provide evidence that the QCRB is not informative enough for comparing different probe states.

关键词： Estimation Sensor phenomena and characterization Signal processing Acoustic measurements Noise measurement Resource management Probes

来源：评论

学校读者我要写书评

暂无评论

Soft-GNN:towards robust graph neural networks via self-adaptive data utilization

引用

Frontiers of computer science 2025年第4期19卷 1-12页

作者： Yao WU Hong HUANG Yu SONG Hai JIN National Engineering Research Center for Big Data Technology and System Service Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China College of Information and Communication National University of Defense TechnologyWuhan 430019China Department of Computer Science and Operations Research Universitéde MontréalMontreal H3C 3J7Canada

Graph neural networks(GNNs)have gained traction and have been applied to various graph-based data analysis tasks due to their high ***,a major concern is their robustness,particularly when faced with graph data that has been deliberately or accidentally polluted with *** presents a challenge in learning robust GNNs under noisy *** address this issue,we propose a novel framework called Soft-GNN,which mitigates the influence of label noise by adapting the data utilized in *** approach employs a dynamic data utilization strategy that estimates adaptive weights based on prediction deviation,local deviation,and global *** better utilizing significant training samples and reducing the impact of label noise through dynamic data selection,GNNs are trained to be more *** evaluate the performance,robustness,generality,and complexity of our model on five real-world datasets,and our experimental results demonstrate the superiority of our approach over existing methods.

关键词： graph neural networks node classification label noise robustness

来源：评论

学校读者我要写书评

暂无评论

quantum Algorithms and the Power of Forgetting 14

Quantum Algorithms and the Power of Forgetting

引用

14th Innovations in Theoretical computer science Conference, ITCS 2023

作者： Childs, Andrew M. Coudron, Matthew Gilani, Amin Shiraz Joint Center for Quantum Information and Computer Science College ParkMD United States Department of Computer Science University of Maryland College ParkMD United States Institute for Advanced Computer Studies University of Maryland MD United States National Institute of Standards and Technology GaithersburgMD United States

ISBN: (纸本)9783959772631

The so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm [3]. Given the name of a special entrance vertex, a quantum walk can find another distinguished exit vertex using polynomially many queries, though without finding any particular path from entrance to exit. It has been an open problem for twenty years whether there is an efficient quantum algorithm for finding such a path, or if the path-finding problem is hard even for quantum computers. We show that a natural class of efficient quantum algorithms provably cannot find a path from entrance to exit. Specifically, we consider algorithms that, within each branch of their superposition, always store a set of vertex labels that form a connected subgraph including the entrance, and that only provide these vertex labels as inputs to the oracle. While this does not rule out the possibility of a quantum algorithm that efficiently finds a path, it is unclear how an algorithm could benefit by deviating from this behavior. Our no-go result suggests that, for some problems, quantum algorithms must necessarily forget the path they take to reach a solution in order to outperform classical computation. © Andrew M. Childs, Matthew Coudron, and Amin Shiraz Gilani;licensed under Creative Commons License CC-BY 4.0.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

DetSpace:Distributed Congestion Free Routing for Global Deterministic Network in Mega-Constellations

引用

China Communications 2024年第12期21卷 203-216页

作者： Li Jihao Li Hewu Lai Zeqi Wang Xiaomo Beijing National Research Center for Information Science and Technology(BNRist) Beijing 100084China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China Institute of Network Science and Cyberspace Tsinghua UniversityBeijing 100084China Zhongguancun Laboratory Beijing 100095China China Academy of Electronics and Information Technology Beijing 100040China

Emerging long-range industrial IoT applications(e.g.,remote patient monitoring)have increasingly higher requirements for global deterministic *** many existing methods have built deterministic networks in small-scale networks through centralized computing and resource reservation,they cannot be applied on a global *** emerging mega-constellations enable new opportunities for realizing deterministic delay *** one constellation(e.g.,Starlink)might be managed by a single operator(e.g.,SpaceX),packets can be routed within deterministic number of ***,the path diversity brought by the highly symmetrical network structure in mega-constellations can help to construct a congestion free network by *** paper leverages these unique characteristics of mega-constellations to avoid the traditional network congestion caused by multiple inputs and single output,and to determine the routing hops,and thus realizing a global deterministic network(DETSPACE).The model based on the 2D Markov chain theoretically verifies the correctness of *** effectiveness of DETSPACE in different traffic load con-ditions is also verified by extensive simulations.

关键词： congestion free deterministic network mega-constellations path diversity

来源：评论

学校读者我要写书评

暂无评论

Single Qubit quantum Logistic-Sine XYZ-Rotation Maps:An Ultra-Wide Range Dynamics for Image Encryption

引用

computers, Materials & Continua 2025年第5期83卷 2161-2188页

作者： De Rosal Ignatius Moses Setiadi T.Sutojo Supriadi Rustad Muhamad Akrom Sudipta Kr Ghosal Minh T.Nguyen Arnold Adimabua Ojugo Research Center for Quantum Computing and Materials Informatics Faculty of Computer ScienceDian Nuswantoro UniversitySemarang50131Indonesia Department of Cyber Forensics and Information Security Behala Government Polytechnic756Upendra Nath Banerjee RoadParnasreeBehalaKolkata700060India Thai Nguyen University of Technology Thai Nguyen UniversityThai Nguyen240000Vietnam Department of Computer Science Federal University of Petroleum ResourcesEffurun330102Nigeria

Data security has become a growing priority due to the increasing frequency of cyber-attacks,necessitating the development of more advanced encryption *** paper introduces Single Qubit quantum Logistic-Sine XYZ-Rotation Maps(SQQLSR),a quantum-based chaos map designed to generate one-dimensional chaotic sequences with an ultra-wide parameter *** proposed model leverages quantum superposition using Hadamard gates and quantum rotations along the X,Y,and Z axes to enhance *** numerical experiments validate the effectiveness of *** proposed method achieves a maximum Lyapunov exponent(LE)of≈55.265,surpassing traditional chaotic maps in *** bifurcation analysis confirms a uniform chaotic distribution,eliminating periodic windows and ensuring higher *** system also generates an expanded key space exceeding 10^(40),enhancing security against brute-force ***,SQQLSR is applied to image encryption using a simple three-layer encryption scheme combining permutation and substitution *** approach is intentionally designed to highlight the impact of SQQLSR-generated chaotic sequences rather than relying on a complex encryption *** method achieves an average entropy of 7.9994,NPCR above 99.6%,and UACI within 32.8%–33.8%,confirming its strong randomness and sensitivity to minor *** robustness tests against noise,cropping,and JPEG compression demonstrate its resistance to statistical and differential ***,the decryption process ensures perfect image reconstruction with an infinite PSNR value,proving the algorithm’s *** results highlight SQQLSR’s potential as a lightweight yet highly secure encryption mechanism suitable for quantum cryptography and secure communications.

关键词： Single qubit quantumchaotic quantumchaotic map quantumimage encryption quantumlogistic map quantum sine map

来源：评论

学校读者我要写书评

暂无评论

Low-depth quantum symmetrization

arXiv

引用

arXiv 2024年

作者： Liu, Zhenning Childs, Andrew M. Gottesman, Daniel Department of Computer Science Institute for Advanced Computer Studies Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States

quantum symmetrization is the task of transforming a non-strictly increasing list of n integers into an equal superposition of all permutations of the list (or more generally, performing this operation coherently on a superposition of such lists). This task plays a key role in initial state preparation for first-quantized simulations. A weaker version of symmetrization in which the input list is strictly increasing has been extensively studied due to its application to fermionic systems, but the general symmetrization problem with repetitions in the input list has not been solved previously. We present the first quantum algorithm for the general symmetrization problem. Our algorithm, based on (quantum) sorting networks, uses O(log n) depth and O(nlog m) ancilla qubits where m is the greatest possible value of the list, enabling efficient simulation of bosonic quantum systems in first quantization. Furthermore, our algorithm can prepare (superpositions of) Dicke states of any Hamming weight in O(log n) depth using O(nlog n) ancilla qubits. We also propose an O(log2 n)depth quantum algorithm to transform second-quantized states to first-quantized states. Using this algorithm, QFT-based quantum telescope arrays can image brighter photon sources, extending quantum interferometric imaging systems to a new regime. Copyright © 2024, The Authors. All rights reserved.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Downscaling Taiwan precipitation with a residual deep learning approach

引用

Geoscience Letters 2024年第1期11卷 23页

作者： Hsu, Li-Huan Chiang, Chou-Chun Lin, Kuan-Ling Lin, Hsin-Hung Chu, Jung-Lien Yu, Yi-Chiang Fahn, Chin-Shyurng National Science and Technology Center for Disaster Reduction New Taipei City 231007 Taiwan Department of Computer Science and Information Engineering National Taiwan University of Science and Technology Taipei 106335 Taiwan

In response to the growing demand for high-resolution rainfall data to support disaster prevention in Taiwan, this study presents an innovative approach for downscaling precipitation data. We employed a hierarchical architecture of Multi-Scale Residual Networks (MSRN) to downscale rainfall from a coarse 0.25-degree resolution to a fine 0.0125-degree resolution, representing a substantial challenge due to a resolution increase of over 20 times. Our results demonstrate that the hierarchical MSRN outperforms both the one-step MSRN and linear interpolation methods when reconstructing high-resolution daily rainfall. It surpasses the linear interpolation method by 15.1 and 9.1% in terms of mean absolute error and root mean square error, respectively. Furthermore, the hierarchical MSRN excels in accurately reproducing high-resolution rainfall for various rainfall thresholds, displaying minimal biases. The threat score (TS) highlights the hierarchical MSRN's capability to replicate extreme rainfall events, achieving TS scores exceeding 0.54 and 0.46 at rainfall thresholds of 350 and 500 mm per day, outperforming alternative methods. This method is also applied to an operational global model, the ECMWF’s daily rainfall forecasts over Taiwan. The evaluation results indicate that our approach is effective at improving rainfall forecasts for thresholds greater than 100 mm per day, with more significant improvement for the 1- to 3-day lead forecast. This approach also offers a realistic visual representation of fine-grained rainfall distribution, showing promise for making significant contributions to disaster preparedness and weather forecasting in Taiwan. © The Author(s) 2024.

关键词： Deep learning Downscaling Precipitation forecasting Residual network Super-resolution

来源：评论

学校读者我要写书评

暂无评论

A Niching Regression Adaptive Memetic Algorithm for Multimodal Optimization of the Euclidean Traveling Salesman Problem

引用

IEEE Transactions on Evolutionary Computation 2023年第5期27卷 1413-1426页

作者： Jian, Shi-Jie Hsieh, Sun-Yuan National Cheng Kung University Department of Computer Science and Information Engineering Tainan City70101 Taiwan Institute of Manufacturing Information and Systems The Center for Innovative FinTech Business Models The International Center for the Scientific Development of Shrimp Aquaculture National Cheng Kung University Department of Computer Science and Information Engineering Institute of Medical Informatics Tainan City70101 Taiwan

The traveling salesman problem (TSP) has been studied for many years. In particular, the multimodal optimization of the TSP is important for practical applications, because decision-makers can select the best candidate based on current conditions and requirements. In the Euclidean TSP, there are n points in R^d space with Euclidean distance between any two points, that is, d(x, y) =||x-y||_2. The goal is to find a tour of minimum length visiting each point. In this article, we only focus on the case that d=2. Recently, in order to efficiently handle the multimodal optimization of the TSP, some methods have been developed to deal with it. Nevertheless, these methods usually perform poorly for large-scale cases. In this article, we propose a niching regression adaptive memetic algorithm (MA) to handle the multimodal optimization of the Euclidean TSP. We use the MA as the baseline algorithm and incorporate the neighborhood strategy to maintain the population diversity. In addition, we design a novel regression partition initialization and adaptive parameter control to enhance our algorithm, and propose the concept of the redundant individual to improve the search efficiency. To validate the performance of the proposed algorithm, we comprehensively conduct experiments on the multimodal optimization of TSP benchmark and the well-known TSPLIB library. The experimental results reveal that the proposed method outperforms other methods, especially for large-scale cases. © 1997-2012 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Tier Sentiment Analysis of Social Media Text Using Supervised Machine Learning

引用

computers, Materials & Continua 2023年第3期74卷 5527-5543页

作者： Hameedur Rahman Junaid Tariq M.Ali Masood Ahmad F.Subahi Osamah Ibrahim Khalaf Youseef Alotaibi Department of Creative Technologies Air UniversityE-9 Islamabad44230Pakistan Department of Computer Science National University of Modern LanguagesRawalpindiPakistan Department of Computer Science University College of Al JamoumUmm Al-Qura UniversityMakkah21421Saudi Arabia Al-Nahrain Nano-Renewable Energy Research Center Al-Nahrain UniversityBaghdad10072Iraq Department of Computer Science College of Computer and Information SystemsUmm Al-Qura UniversityMakkah21955Saudi Arabia

Sentiment Analysis(SA)is often referred to as opinion *** is defined as the extraction,identification,or characterization of the sentiment from ***,the sentiment of a textual document is classified into binary classes i.e.,positive and ***,fine-grained classification provides a better insight into the *** downside is that fine-grained classification is more challenging as compared to *** the contrary,performance deteriorates significantly in the case of multi-class *** this study,pre-processing techniques and machine learning models for the multi-class classification of sentiments were *** augment the performance,a multi-layer classification model has been *** to similitude with social media text,the movie reviews dataset has been used for the *** machine learning models namely Decision Tree,Support Vector Machine,and Naive Bayes models have been implemented for the task of sentiment *** have compared the models of single-layer architecture with multi-tier *** results of Multi-tier model have slight improvement over the single-layer ***,multi-tier models have better recall which allow our proposed model to learn more *** have discussed certain shortcomings of the model that will help researchers to design multi-tier models with more contextual information.

关键词： Sentiment analysis machine learning multi-class classification svm decision tree naive bayes

来源：评论

学校读者我要写书评

暂无评论

BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving Engineering Design Problems

引用

computer Modeling in Engineering & sciences 2024年第10期141卷 219-265页

作者： Farouq Zitouni Saad Harous Abdulaziz S.Almazyad Ali Wagdy Mohamed Guojiang Xiong Fatima Zohra Khechiba Khadidja Â Kherchouche Department of Computer Science and Information Technology Kasdi Merbah UniversityP.O.Box 30000OuarglaAlgeria Department of Computer Science College of Computing and InformaticsUniversity of SharjahP.O.Box 27272SharjahUnited Arab Emirates Department of Computer Engineering College of Computer and Information SciencesKing Saud UniversityP.O.Box 51178Riyadh11543Saudi Arabia Operations Research Department Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Applied Science Research Center Applied Science Private UniversityAmman11937Jordan Guizhou Key Laboratory of Intelligent Technology in Power System College of Electrical EngineeringGuizhou UniversityGuiyang550025China

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization *** approach aims to leverage the strengths of multiple algorithms,enhancing solution quality,convergence speed,and robustness,thereby offering a more versatile and efficient means of solving intricate real-world optimization *** this paper,we introduce a hybrid algorithm that amalgamates three distinct metaheuristics:the Beluga Whale Optimization(BWO),the Honey Badger Algorithm(HBA),and the Jellyfish Search(JS)*** proposed hybrid algorithm will be referred to as *** this fusion,the BHJO algorithm aims to leverage the strengths of each *** this hybridization,we thoroughly examined the exploration and exploitation capabilities of the BWO,HBA,and JS metaheuristics,as well as their ability to strike a balance between exploration and *** meticulous analysis allowed us to identify the pros and cons of each algorithm,enabling us to combine them in a novel hybrid approach that capitalizes on their respective strengths for enhanced optimization *** addition,the BHJO algorithm incorporates Opposition-Based Learning(OBL)to harness the advantages offered by this technique,leveraging its diverse exploration,accelerated convergence,and improved solution quality to enhance the overall performance and effectiveness of the hybrid ***,the performance of the BHJO algorithm was evaluated across a range of both unconstrained and constrained optimization problems,providing a comprehensive assessment of its efficacy and applicability in diverse problem ***,the BHJO algorithm was subjected to a comparative analysis with several renowned algorithms,where mean and standard deviation values were utilized as evaluation *** rigorous comparison aimed to assess the performance of the BHJOalgorithmabout its counterparts,shedd

关键词： Global optimization hybridization of metaheuristics beluga whale optimization honey badger algorithm jellyfish search optimizer chaotic maps opposition-based learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：