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

arXiv 2023年

作者： Shi, Zhaoyuan Lu, Huabing Xie, Xianzhong Yang, Helin Huang, Chongwen Cai, Jun Ding, Zhiguo The Key Laboratory of Intelligent Perception and Computing of Anhui Province Anqing Normal University Anqing China The Key Laboratory of Intelligent Control and Optimization for Industrial Equipment Ministry of Education Dalian University of Technology Dalian116024 China Chongqing Key Lab of Computer networks and Communication Technology Chongqing University of Posts and Telecommunications Chongqing China The Department of Information and Communication Engineering School of Informatics Xiamen University Xiamen361005 China The College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China Department of Electrical and Computer Engineering Concordia University MontrealQCH3G 1M8 Canada The Department of Electrical Engineering Princeton University PrincetonNJ08544 United States The School of Electrical and Electronic Engineering The University of Manchester Manchester United Kingdom

An active reconfigurable intelligent surface (RIS)-aided multi-user downlink communication system is investigated, where non-orthogonal multiple access (NOMA) is employed to improve spectral efficiency, and the active RIS is powered by energy harvesting (EH). The problem of joint control of the RIS’s amplification matrix and phase shift matrix is formulated to maximize the communication success ratio with considering the quality of service (QoS) requirements of users, dynamic communication state, and dynamic available energy of RIS. To tackle this non-convex problem, a cascaded deep learning algorithm namely long short-term memory-deep deterministic policy gradient (LSTM-DDPG) is designed. First, an advanced LSTM based algorithm is developed to predict users’ dynamic communication state. Then, based on the prediction results, a DDPG based algorithm is proposed to joint control the amplification matrix and phase shift matrix of the RIS. Finally, simulation results verify the accuracy of the prediction of the proposed LSTM algorithm, and demonstrate that the LSTM-DDPG algorithm has a significant advantage over other benchmark algorithms in terms of communication success ratio performance. Copyright © 2023, The Authors. All rights reserved.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Domain Adaptation on Person Re-Identification via Dual-level Asymmetric Mutual Learning

arXiv

引用

arXiv 2023年

作者： Wu, Qiong Li, Jiahan Dai, Pingyang Ye, Qixiang Cao, Liujuan Wu, Yongjian Ji, Rongrong Institute of Artificial Intelligence The Media Analytics and Computing Laboratory Department of Artificial Intelligence School of Informatics Xiamen University Xiamen361005 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221000 China The Media Analytics and Computing Laboratory Department of Artificial Intelligence School of Informatics Xiamen University Xiamen361005 China The Peng Cheng Laboratory Shenzhen518066 China The School of Electronics Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China The Media Analytics and Computing Lab Department of Computer Science School of Informatics Xiamen University Xiamen361005 China The Youtu Laboratory Tencent Shanghai200233 China The Fujian Engineering Research Center of Trusted Artificial Intelligence Analysis and Application Institute of Artificial Intelligence Xiamen University Xiamen361005 China

Unsupervised domain adaptation person re-identification (Re-ID) aims to identify pedestrian images within an unlabeled target domain with an auxiliary labeled source-domain dataset. Many existing works attempt to recover reliable identity information by considering multiple homogeneous networks. And take these generated labels to train the model in the target domain. However, these homogeneous networks identify people in approximate subspaces and equally exchange their knowledge with others or their mean net to improve their ability, inevitably limiting the scope of available knowledge and putting them into the same mistake. This paper proposes a Dual-level Asymmetric Mutual Learning method (DAML) to learn discriminative representations from a broader knowledge scope with diverse embedding spaces. Specifically, two heterogeneous networks mutually learn knowledge from asymmetric subspaces through the pseudo label generation in a hard distillation manner. The knowledge transfer between two networks is based on an asymmetric mutual learning manner. The teacher network learns to identify both the target and source domain while adapting to the target domain distribution based on the knowledge of the student. Meanwhile, the student network is trained on the target dataset and employs the ground-truth label through the knowledge of the teacher. Extensive experiments in Market-1501, CUHK-SYSU, and MSMT17 public datasets verified the superiority of DAML over state-of-the-arts. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

HRaft: Adaptive Erasure Coded Data Maintenance for Consensus in Distributed Networks

HRaft: Adaptive Erasure Coded Data Maintenance for Consensus...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Yulei Jia Guangping Xu Chi Wan Sung Salwa Mostafa Yulei Wu School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Department of Electrical Engineering City University of Hong Kong Hong Kong SAR China College of Engineering Mathematics and Physical Sciences University of Exeter Exeter UK

Distributed data services usually rely on consensus protocols like Paxos and Raft to provide fault-tolerance and data consistency across global and local-distributed data centers. Erasure coding replication has appealing storage and network cost saving compared with full copy replication, which helps consensus protocols achieve low latency, high fault tolerance, and high throughput for data access. Applying erasure coding in consensus protocols directly will degrade the liveness level when the number of failure servers reaches a certain level. To address the challenge, CRaft just stores full copy replication instead of erasure coding replication when the number of failed servers reaches a certain threshold. In such situation, CRaft will be downgraded sharply to the same storage and network costs as Raft. To overcome the shortcoming of CRaft, we propose a protocol, called HRaft, which can adapt the placement of data blocks in order to always have enough blocks to recover the stored value when servers fail. By replenishing some coded blocks in healthy servers instead of full copy replication, it can avoid switching to the full replication when a certain threshold on the number of failures is reached. We designed and implemented a key-value (KV) storage prototype to validate the proposed protocol and evaluate its performance. The experimental results show HRaft can significantly reduce storage and network costs and improve write performance while keeping the liveness level compared to CRaft.

关键词： Fault tolerance Costs System performance Fault tolerant systems Distributed databases Switches Throughput

来源：评论

学校读者我要写书评

暂无评论

Foundation Models for Atomistic Simulation of Chemistry and Materials

arXiv

引用

arXiv 2025年

作者： Yuan, Eric C.-Y. Liu, Yunsheng Chen, Junmin Zhong, Peichen Raja, Sanjeev Kreiman, Tobias Vargas, Santiago Xu, Wenbin Head-Gordon, Martin Yang, Chao Blau, Samuel M. Cheng, Bingqing Krishnapriyan, Aditi Head-Gordon, Teresa Kenneth S. Pitzer Theory Center Department of Chemistry United States Department of Chemical and Biomolecular Engineering United States Electrical Engineering and Computer Science United States Bakar Institute of Digital Materials for the Planet University of California BerkeleyCA94720 United States Chemical Sciences Division United States Applied Mathematics and Computational Research Division United States Energy Technologies Area United States National Energy Research Scientific Computing Center Lawrence Berkeley National Laboratory BerkeleyCA94720 United States

Given the power of large language and large vision models, it is of profound and fundamental interest to ask if a foundational model based on data and parameter scaling laws and pre-training strategies is possible for learned simulations of chemistry and materials. The scaling of large and diverse datasets and highly expressive architectures for chemical and materials sciences should result in a foundation model that is more efficient and broadly transferable, robust to out-of-distribution challenges, and easily fine-tuned to a variety of downstream observables, when compared to specific training from scratch on targeted applications in atomistic simulation. In this Perspective we aim to cover the rapidly advancing field of machine learned interatomic potentials (MLIP), and to illustrate a path to create chemistry and materials MLIP foundation models at larger scale. © 2025, CC BY-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MatterChat: A Multi-Modal LLM for Material science

arXiv

引用

arXiv 2025年

作者： Tang, Yingheng Xu, Wenbin Cao, Jie Gao, Weilu Farrell, Steven Erichson, Benjamin Mahoney, Michael W. Nonaka, Andy Yao, Zhi Applied Mathematics and Computational Research Division Lawrence Berkeley National Laboratory BerkeleyCA United States National Energy Research Scientific Computing Center Lawrence Berkeley National Laboratory BerkeleyCA United States NSF National AI Institute for Student-AI Teaming University of Colorado at Boulder Boulder United States Department of Electrical and Computer Engineering The University of Utah Salt Lake CityUT United States Scientific Data Division Lawrence Berkeley National Laboratory BerkeleyCA United States International Computer Science Institute BerkeleyCA United States Department of Statistics University of California at Berkeley BerkeleyCA United States

Understanding and predicting the properties of inorganic materials is crucial for accelerating advancements in materials science and driving applications in energy, electronics, and beyond. Integrating material structure data with language-based information through multi-modal large language models (LLMs) offers great potential to support these efforts by enhancing human–AI interaction. However, a key challenge lies in integrating atomic structures at full resolution into LLMs. In this work, we introduce MatterChat, a versatile structure-aware multi-modal LLM that unifies material structural data and textual inputs into a single cohesive model. MatterChat employs a bridging module to effectively align a pretrained universal machine learning interatomic potential with a pretrained LLM, reducing training costs and enhancing flexibility. Our results demonstrate that MatterChat significantly improves performance in material property prediction and human-AI interaction, surpassing general-purpose LLMs such as GPT-4. We also demonstrate its usefulness in applications such as more advanced scientific reasoning and step-by-step material synthesis. © 2025, CC BY.

关键词： Structure (composition)

来源：评论

学校读者我要写书评

暂无评论

Line Drawing Guided Progressive Inpainting of Mural Damage

arXiv

引用

arXiv 2022年

作者： Li, Luxi Zou, Qin Zhang, Fan Yu, Hongkai Chen, Long Song, Chengfang Huang, Xianfeng Wang, Xiaoguang Li, Qingquan Department of Computer Science Technology United International College of Beijing Normal University HongKong Baptist University Zhuhai China Machine Vision and Robotics Laboratory School of Computer Science Wuhan University Wuhan China State Key Laboratory of Surveying Mapping and Remote Sensing Information Engineering Wuhan University Wuhan China Department of Electrical Engineering and Computer Science Cleveland State University OH United States Institute of Automation Chinese Academy of Sciences Beijing China Cultural Heritage Intelligent Computing Laboratory Wuhan University Wuhan China Guangming Laboratory Shenzhen University Shenzhen China

Mural image inpainting is far less explored compared to its natural image counterpart and remains largely unsolved. Most existing image-inpainting methods tend to take the target image as the only input and directly repair the damage to generate a visually plausible result. These methods obtain high performance in restoration or completion of some pre-defined objects, e.g., human face, fabric texture, and printed texts, etc., however, are not suitable for repairing murals with varying subjects and large damaged areas. Moreover, due to discrete colors in paints, mural inpainting may suffer from apparent color bias. To this end, in this paper, we propose a line drawing guided progressive mural inpainting method. It divides the inpainting process into two steps: structure reconstruction and color correction, implemented by a structure reconstruction network (SRN) and a color correction network (CCN), respectively. In structure reconstruction, SRN utilizes the line drawing as an assistant to achieve large-scale content authenticity and structural stability. In color correction, CCN operates a local color adjustment for missing pixels which reduces the negative effects of color bias and edge jumping. The proposed approach is evaluated against the current state-of-the-art image inpainting methods. Qualitative and quantitative results demonstrate the superiority of the proposed method in mural image inpainting. The codes and data are available at https://***/qinnzou/mural-image-inpainting . © 2022, CC BY-NC-ND.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

GEOM-GCN: GEOMETRIC GRAPH CONVOLUTIONAL NETWORKS 8

GEOM-GCN: GEOMETRIC GRAPH CONVOLUTIONAL NETWORKS

引用

8th International Conference on Learning Representations, ICLR 2020

作者： Pei, Hongbin Wei, Bingzhe Chang, Kevin Chen-Chuan Lei, Yu Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign United States Department of Computer Science University of Illinois Urbana-Champaign United States Department of Computing Hong Kong Polytechnic University Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoods and lacking the ability to capture long-range dependencies in disassortative graphs. Few studies have noticed the weaknesses from different perspectives. From the observations on classical neural network and network geometry, we propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The behind basic idea is the aggregation on a graph can benefit from a continuous space underlying the graph. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs. Experimental results show the proposed Geom-GCN achieved state-of-the-art performance on a wide range of open datasets of graphs. © 2020 8th International Conference on Learning Representations, ICLR 2020. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

EXPLICIT RUNGE–KUTTA METHODS THAT ALLEVIATE ORDER REDUCTION

arXiv

引用

arXiv 2023年

作者： Biswas, Abhijit Ketcheson, David I. Roberts, Steven Seibold, Benjamin Shirokoff, David Computer Electrical and Mathematical Sciences & Engineering Division King Abdullah University of Science and Technology Thuwal23955 Saudi Arabia Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA94550 United States Department of Mathematics Temple University PhiladelphiaPA19122 United States Department of Mathematical Sciences New Jersey Institute of Technology NewarkNJ07102 United States

Explicit Runge–Kutta (RK) methods are susceptible to a reduction in the observed order of convergence when applied to initial-boundary value problem with time-dependent boundary conditions. We study conditions on explicit RK methods that guarantee high-order convergence for linear problems;we refer to these conditions as weak stage order conditions. We prove a general relationship between the method’s order, weak stage order, and number of stages. We derive explicit RK methods with high weak stage order and demonstrate, through numerical tests, that they avoid the order reduction phenomenon up to any order for linear problems and up to order three for nonlinear *** Codes 65L04, 65L20, 65M12 Copyright © 2023, The Authors. All rights reserved.

关键词： Runge Kutta methods

来源：评论

学校读者我要写书评

暂无评论

Model-Based Reinforcement Learning for Quantized Federated Learning Performance Optimization

Model-Based Reinforcement Learning for Quantized Federated L...

引用

GLOBECOM 2022 - 2022 IEEE Global Communications Conference

作者： Nuocheng Yang Sihua Wang Mingzhe Chen Christopher G. Brinton Changchuan Yin Walid Saad Shuguang Cui Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China State Key Laboratory Of Networking And Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Bradley Department of Electrical and Computer Engineering Virginia Tech Arlington VA USA Shenzhen Research Institute of Big Data (SRIBD) and the Future Network of Intelligence Institute (FNii) Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9781665435413

This paper considers improving wireless communication and computation efficiency in federated learning (FL) via model quantization. In the proposed bitwidth FL scheme, edge devices train and transmit quantized versions of their local FL model parameters to a coordinating server, which, in turn, aggregates them into a quantized global model and synchronizes the devices. With the goal of jointly determining the set of participating devices in each training iteration and the bitwidths employed at the devices, we pose an optimization problem for minimizing the training loss of quantized FL under a device sampling budget and delay requirement. Our analytical results show that the improvement of FL training loss between two consecutive iterations depends on not only the device selection and quantization scheme, but also on several parameters inherent to the model being learned. As a result, we propose, a model-based reinforcement learning (RL) method to optimize action selection over iterations. Compared to model-free RL, the proposed approach leverages the derived mathematical characterization of the FL training process to discover an effective device selection and quantization scheme without imposing additional device communication overhead. Numerical evaluations show that the proposed FL framework can achieve the same classification performance while reducing the number of training iterations needed for convergence by 20% compared to model-free RL-based FL.

关键词： Training Performance evaluation Wireless communication Quantization (signal) Computational modeling Reinforcement learning Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Imaging 3D Chemistry at 1 nm Resolution with Fused Multi-Modal Electron Tomography

arXiv

引用

arXiv 2023年

作者： Schwartz, Jonathan Di, Zichao Wendy Jiang, Yi Manassa, Jason Pietryga, Jacob Qian, Yiwen Cho, Min Gee Rowell, Jonathan L. Zheng, Huihuo Robinson, Richard D. Gu, Junsi Kirilin, Alexey Rozeveld, Steve Ercius, Peter Fessler, Jeffrey A. Xu, Ting Scott, Mary Hovden, Robert Department of Materials Science and Engineering University of Michigan Ann ArborMI United States Mathematics and Computer Science Division Argonne National Laboratory LemontIL United States Advanced Photon Source Facility Argonne National Laboratory LemontIL United States Department of Material Science and Engineering Northwestern University EvanstonIL United States Department of Materials Science and Engineering University of California at Berkeley BerkeleyCA United States Department of Chemistry and Chemical Biology Cornell University IthacaNY United States Argonne Leadership Computing Facility Argonne National Laboratory LemontIL United States Department of Material Science and Engineering Cornell University IthacaNY United States Kavli Institute at Cornell for Nanoscale Science Cornell University IthacaNY United States Dow Chemical Co. MidlandMI United States National Center for Electron Microscopy Molecular Foundry Lawrence Berkeley National Laboratory BerkeleyCA United States Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI United States Materials Science Division Lawrence Berkeley National Laboratory BerkeleyCA United States Applied Physics Program University of Michigan Ann ArborMI United States

Measuring the three-dimensional (3D) distribution of chemistry in nanoscale matter is a longstanding challenge for metrological science. The inelastic scattering events required for 3D chemical imaging are too rare, requiring high beam exposure that destroys the specimen before an experiment completes. Even larger doses are required to achieve high resolution. Thus, chemical mapping in 3D has been unachievable except at lower resolution with the most radiation-hard materials. Here, high-resolution 3D chemical imaging is achieved near or below one nanometer resolution in a Au-Fe3O4 metamaterial, Co3O4 - Mn3O4 core-shell nanocrystals, and ZnS-Cu0.64S0.36 nanomaterial using fused multi-modal electron tomography. Multi-modal data fusion enables high-resolution chemical tomography often with 99% less dose by linking information encoded within both elastic (HAADF) and inelastic (EDX / EELS) signals. Now sub-nanometer 3D resolution of chemistry is measurable for a broad class of geometrically and compositionally complex materials. © 2023, CC BY.

关键词： Zinc sulfide

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：