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

Quantum memory assisted entangled state verification with local measurements

Physical Review Research 2025年第1期7卷 013003-013003页

作者： Siyuan Chen Wei Xie Ping Xu Kun Wang Hefei National Research Center for Physical Sciences at the Microscale and School of Physical Sciences University of Science and Technology of China Hefei 230026 China College of Physics Jilin University Changchun 130012 China School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha 410073 China

We consider the quantum memory assisted quantum state verification task, where an adversary prepares independent multipartite entangled states and sends them to the local verifiers, who then store several copies in the quantum memory and measure them collectively to make a decision. We establish an exact analytic formula for optimizing two-copy state verification, where the verifiers store two copies, and give a globally optimal two-copy strategy for multiqubit graph states involving only Bell measurements. When the verifiers can store arbitrarily many copies, we present a dimension expansion technique that designs efficient verification strategies for this case, showcasing its application to efficiently verifying Greenberger-Horne-Zeilinger (GHZ)-like states. These strategies become increasingly advantageous with growing memory resources, ultimately approaching the theoretical limit of efficiency. Our findings demonstrate that quantum memories enhance state verification efficiency, shedding light on error-resistant strategies and practical applications of large-scale quantum memory assisted verification.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Cutting-Edge Predictive Methods for Enhancing Short-Term Load Prediction

Cutting-Edge Predictive Methods for Enhancing Short-Term Loa...

引用

2024 International Conference on Electrical and computer Engineering Researches, ICECER 2024

作者： Ghazal, Taher M. Janjua, Jamshaid Iqbal Abushiba, Walid Ahmad, Munir Abbas, Tahir Ateeq, Karamath College of Arts & Science Applied Science University P.O.Box 5055 Manama Bahrain Universiti Kebangsaan Malaysia Center for Cyber Security Faculty of Information Science and Technology Bangi Selangor Malaysia Lahore Pakistan College of Engineering Applied Science University Bahrain College of Informatics Korea University Seoul02841 Korea Republic of TIMES Institute Department of Computer Science Multan Pakistan School of Computing Skyline University College University City Sharjah Sharjah United Arab Emirates

ISBN: (纸本)9798331539733

Efficient management and cost-related factors in the power sector call for accurate short-term load forecasting as it enables better planning with the electric grid and achieving stability within it. This paper looks into the state-of-the-art forecasting strategies that enhance load forecasts made in shorter time frames. Such techniques include but are not limited to machine learning applications, effective data models, and multi-dimensional modeling leveraging historical, meteorological, and economic data. Their review is carried out in detail with their advantages and disadvantages and their application in practice. Furthermore, this study strives to understand the barriers that need to be overcome in the quest to increase the accuracy of the forecasting models especially concerning renewable energy sources. We illustrate how new trends relate to future developments of predictive models about supporting the decision-making in operating power systems and improving the reliability and sustainability of energy systems. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Identifying Influential nodes in Brain Networks via Self-Supervised Graph-Transformer

arXiv

引用

arXiv 2024年

作者： Kang, Yanqing Zhu, Di Zhang, Haiyang Shi, Enze Yu, Sigang Wu, Jinru Wang, Xuhui Liu, Xuan Chen, Geng Jiang, Xi Zhang, Tuo Zhang, Shu Center for Brain and Brain-Inspired Computing Research School of Computer Science Northwestern Polytechnical University Xi'An China School of Computer Science Northwestern Polytechnical University Xi'An China School of Life Science and Technology University of Electronic Science and Technology of China Chengdu China School of Automation Northwestern Polytechnical University Xi'An China

Studying influential nodes (I-nodes) in brain networks is of great significance in the field of brain imaging. Most existing studies consider brain connectivity hubs as I-nodes such as the regions of high centrality or rich-club organization. However, this approach relies heavily on prior knowledge from graph theory, which may overlook the intrinsic characteristics of the brain network, especially when its architecture is not fully understood. In contrast, self-supervised deep learning dispenses with manual features, allowing it to learn meaningful representations directly from the data. This approach enables the exploration of I-nodes for brain networks, which is also lacking in current studies. This paper proposes a Self-Supervised Graph Reconstruction framework based on Graph-Transformer (SSGR-GT) to identify I-nodes, which has three main characteristics. First, as a self-supervised model, SSGR-GT extracts the importance of brain nodes to the reconstruction. Second, SSGR-GT uses Graph-Transformer, which is well-suited for extracting features from brain graphs, combining both local and global characteristics. Third, multimodal analysis of I-nodes uses graph-based fusion technology, combining functional and structural brain information. The I-nodes we obtained are distributed in critical areas such as the superior frontal lobe, lateral parietal lobe, and lateral occipital lobe, with a total of 56 identified across different experiments. These I-nodes are involved in more brain networks than other regions, have longer fiber connections, and occupy more central positions in structural connectivity. They also exhibit strong connectivity and high node efficiency in both functional and structural networks. Furthermore, there is a significant overlap between the I-nodes and both the structural and functional rich-club. Experimental results verify the effectiveness of the proposed method, and I-nodes are obtained and discussed. These findings enhance our understanding of

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

VANER: Leveraging Large Language Model for Versatile and Adaptive Biomedical Named Entity Recognition 27

VANER: Leveraging Large Language Model for Versatile and Ada...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Bian, Junyi Zhai, Weiqi Huang, Xiaodi Zheng, Jiaxuan Zhu, Shanfeng School of Computer Science Fudan University Shanghai200433 China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University China Ministry of Education Shanghai200433 China MOE Frontiers Center for Brain Science Fudan University Shanghai200433 China Zhangjiang Fudan International Innovation Center Shanghai200433 China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai200433 China School of Computing and Mathematics Charles Sturt University AlburyNSW2640 Australia

ISBN: (纸本)9781643685489

The prevalent solution for BioNER involves using representation learning techniques combined with sequence ***, such methods are inherently task-specific, demonstrate poor generalizability, and often require a dedicated model for each *** leverage the versatile capabilities of recent large language models (LLMs), several approaches have explored generative techniques for entity ***, these approaches often fall short compared to previous sequence labeling *** this paper, we utilize the open-sourced LLM LLaMA2 as the backbone model, and design specific instructions to distinguish between different types of entities and *** combining the LLM's understanding of instructions with sequence labeling techniques, we train a model using a mix of datasets capable of extracting various types of *** that the backbone LLMs lacks specialized medical knowledge, we also integrate external entity knowledge bases and employ instruction tuning to enable the model to densely recognize curated *** parameter-efficient training model, VANER, significantly outperforms previous LLMs-based *** the first time, as an LLM-based model, VANER surpasses the majority of conventional state-of-the-art BioNER systems, achieving the highest F1 scores across three datasets. © 2024 The Authors.

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

COUNTING RANDOM k-SAT NEAR THE SATISFIABILITY THRESHOLD

arXiv

引用

arXiv 2024年

作者： Chen, Zongchen Lonkar, Aditya Wang, Chunyang Yang, Kuan Yin, Yitong School of Computer Science Georgia Institute of Technology AtlantaGA United States State Key Laboratory for Novel Software Technology New Cornerstone Science Laboratory Nanjing University 163 Xianlin Avenue Jiangsu Province Nanjing210023 China John Hopcroft Center for Computer Science Shanghai Jiao Tong University Shanghai China

We present efficient counting and sampling algorithms for random k-SAT when the clause density satisfies α ≤ 2k poly(k) . In particular, the exponential term 2k matches the satisfiability threshold Θ(2k) for the existence of a solution and the (conjectured) algorithmic threshold 2k (ln k)/k for efficiently finding a solution. Previously, the best-known counting and sampling algorithms required far more restricted densities α 2k/3 [HWY23]. Notably, our result goes beyond the lower bound d 2k/2 for worst-case k-SAT with bounded-degree d [BGG+19], showing that for counting and sampling, the average-case random k-SAT model is computationally much easier than the worst-case model. At the heart of our approach is a new refined analysis of the recent novel coupling procedure by [WY24], utilizing the structural properties of random constraint satisfaction problems (CSPs). Crucially, our analysis avoids reliance on the 2-tree structure used in prior works, which cannot extend beyond the worst-case threshold 2k/2. Instead, we employ a witness tree similar to that used in the analysis of the Moser-Tardos algorithm [MT10] for the Lovász Local lemma, which may be of independent interest. Our new analysis provides a universal framework for efficient counting and sampling for random atomic CSPs, including, for example, random hypergraph colorings. At the same time, it immediately implies as corollaries several structural and probabilistic properties of random CSPs that have been widely studied but rarely justified, including replica symmetry and non-reconstruction. Copyright © 2024, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Layered Structure Aware Dependent Microservice Placement Toward Cost Efficient Edge Clouds

Layered Structure Aware Dependent Microservice Placement Tow...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Deze Zeng Hongmin Geng Lin Gu Zhexiong Li School of Computer Science China University of Geosciences Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Although the containers are featured by light-weightness, it is still resource-consuming to pull and startup a large container image, especially in relatively resource-constrained edge cloud. Fortunately, Docker, as the most widely used container, provides a unique layered architecture that allows the same layer to be shared between microservices so as to lower the deployment cost. Meanwhile, it is highly desirable to deploy dependent microservices of an application together to lower the operation cost. Therefore, the balancing of microservice deployment cost and the operation cost should be considered comprehensively to achieve minimal overall cost of an on-demand application. In this paper, we first formulate this problem into a Quadratic Integer Programming form (QIP) and prove it as a NP-hard problem. We further propose a Randomized Rounding-based Microservice Deployment and Layer Pulling (RR-MDLP) algorithm with low computation complexity and guaranteed approximation ratio. Through extensive experiments, we verify the high efficiency of our algorithm by the fact that it significantly outperforms existing state-of-the-art microservice deployment strategies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LSTM Based Neural Network Model for Anomaly Event Detection in Care-Independent Smart Homes

引用

computer Modeling in Engineering & sciences 2024年第9期140卷 2689-2706页

作者： Brij B.Gupta Akshat Gaurav Razaz Waheeb Attar Varsha Arya Ahmed Alhomoud Kwok Tai Chui Department of Computer Science and Information Engineering Asia UniversityTaichung413TaiwanChina Symbiosis Centre for Information Technology(SCIT) Symbiosis International UniversityPune411057India Center for Interdisciplinary Research University of Petroleum and Energy Studies(UPES)Dehradun248007India Computer Engineering Ronin InstituteMontclairNJ 07043USA Management Department College of Business AdministrationPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Business Administration Asia UniversityTaichung413TaiwanChina Department of Electrical and Computer Engineering Lebanese American UniversityBeirut1102Lebanon Department of Computer Sciences Faculty of Computing and Information TechnologyNorthern Border UniversityRafha91911Saudi Arabia School of Science and Technology Hong Kong Metropolitan University(HKMU)Hong KongChina

This study introduces a long-short-term memory(LSTM)-based neural network model developed for detecting anomaly events in care-independent smart homes,focusing on the critical application of elderly fall *** balances the dataset using the Synthetic Minority Over-sampling Technique(SMOTE),effectively neutralizing bias to address the challenge of unbalanced datasets prevalent in time-series classification *** proposed LSTM model is trained on the enriched dataset,capturing the temporal dependencies essential for anomaly *** model demonstrated a significant improvement in anomaly detection,with an accuracy of 84%.The results,detailed in the comprehensive classification and confusion matrices,showed the model’s proficiency in distinguishing between normal activities and *** study contributes to the advancement of smart home safety,presenting a robust framework for real-time anomaly monitoring.

关键词： LSTM neural networks anomaly detection smart home health-care elderly fall prevention

来源：评论

学校读者我要写书评

暂无评论

GraphInstruct: Empowering Large Language Models with Graph Understanding and Reasoning Capability

arXiv

引用

arXiv 2024年

作者： Luo, Zihan Song, Xiran Huang, Hong Lian, Jianxun Zhang, Chenhao Jiang, Jinqi Xie, Xing Huazhong University of Science and Technology Wuhan China Microsoft Research Asia Beijing China The National Engineering Research Center for Big Data Technology and System Service Computing Technology and Systems Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

Evaluating and enhancing the general capabilities of large language models (LLMs) has been an important research topic. Graph is a common data structure in the real world, and understanding graph data is a crucial part for advancing general intelligence. To evaluate and enhance the graph understanding abilities of LLMs, in this paper, we propose a benchmark named GraphInstruct, which comprehensively includes 21 classical graph reasoning tasks, providing diverse graph generation pipelines and detailed reasoning steps. Based on GraphInstruct, we further construct GraphLM through efficient instruction-tuning, which shows prominent graph understanding capability. In order to enhance the LLM with graph reasoning capability as well, we propose a step mask training strategy, and construct a model named GraphLM+. As one of the pioneering efforts to enhance the graph understanding and reasoning abilities of LLMs, extensive experiments have demonstrated the superiority of GraphLM and GraphLM+ over other LLMs. We look forward to more researchers exploring the potential of LLMs in the graph data mining domain through GraphInstruct. Our code for generating GraphInstruct is released publicly at: https://***/CGCL-codes/GraphInstruct. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

From Data Integrity to Global Model Integrity for Federated Learning: An MHT-based Approach

From Data Integrity to Global Model Integrity for Federated ...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Nannan Zhang Yao Zhao Y. Neil Qu Bruce Gu Keshav Sood Longxiang Gao Shui Yu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China School of IT Deakin University VIC Australia School of Computer Science University of Technology Sydney NSW Australia

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Federated Learning (FL) is a distributed machine learning (ML) approach that enables multiple edge nodes to collaboratively train ML models by sharing model parameters, thus addressing privacy concerns. However, in highly distributed, dynamic, and volatile FL environments, the global model is vulnerable to various corruptions. For instance, edge nodes might falsely claim that the received global model is incomplete, or the channel that transmits the global model is untrustworthy. Effectively verifying the integrity of the global model poses a critical challenge. To tackle this issue, we introduce a method for verifying model integrity called Federated learning global Model Integrity Verification (FMIV). It leverages Merkle Hash Tree (MHT) to generate integrity proofs of the global model during verification. To improve security, we integrate random security codes during proof generation. FMIV is capable of verifying the global model updated by the central server and shared with untrusted edge nodes, while efficiently identifying the edge node caching the incomplete global model. Furthermore, we conduct theoretical analysis and extensive experiments to validate the performance of FMIV. Compared to the two state-of-the-art approaches, FMIV consistently exhibits a notable improvement in verification efficiency and effectiveness in detecting model corruption.

关键词： Analytical models Privacy Codes Federated learning Computational modeling Image edge detection Data integrity Data models Security Servers

来源：评论

学校读者我要写书评

暂无评论

FedAA: A Reinforcement Learning Perspective on Adaptive Aggregation for Fair and Robust Federated Learning 39

FedAA: A Reinforcement Learning Perspective on Adaptive Aggr...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： He, Jialuo Chen, Wei Zhang, Xiaojin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China School of Microelectronics and Communication Engineering Chongqing University Chongqing 400044 China School of Software Engineering Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)157735897X

Federated Learning (FL) has emerged as a promising approach for privacy-preserving model training across decentralized devices. However, it faces challenges such as statistical heterogeneity and susceptibility to adversarial attacks, which can impact model robustness and fairness. Personalized FL attempts to provide some relief by customizing models for individual clients. However, it falls short in addressing server-side aggregation vulnerabilities. We introduce a novel method called FedAA, which optimizes client contributions via Adaptive Aggregation to enhance model robustness against malicious clients and ensure fairness across participants in non-identically distributed settings. To achieve this goal, we propose an approach involving a Deep Deterministic Policy Gradient-based algorithm for continuous control of aggregation weights, an innovative client selection method based on model parameter distances, and a reward mechanism guided by validation set performance. Empirically, extensive experiments demonstrate that, in terms of robustness, FedAA outperforms the state-of-the-art methods, while maintaining comparable levels of fairness, offering a promising solution to build resilient and fair federated systems. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：