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

arXiv 2024年

作者： Wu, Jiageng Wang, Zhiguo Liu, Ya-Feng Liu, Fan The School of Mathematics Jilin University Changchun130012 China The College of Mathematics Sichuan University Sichuan Chengdu610064 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Department of Electrical and Electronic Engineering Southern University of Science and Technology Shenzhen518055 China

In this paper, we propose a multi-input multi-output transmit beamforming optimization model for joint radar sensing and multi-user communications, where the design of the beamformers is formulated as an optimization problem whose objective is a weighted combination of the sum rate and the Cramér-Rao bound, subject to the transmit power budget. Obtaining the global solution for the formulated nonconvex problem is a challenging task, since the sum-rate maximization problem itself (even without considering the sensing metric) is known to be NP-hard. The main contributions of this paper are threefold. Firstly, we derive an optimal closed-form solution to the formulated problem in the single-user case and the multi-user case where the channel vectors of different users are orthogonal. Secondly, for the general multi-user case, we propose a novel branch and bound (B&B) algorithm based on the McCormick envelope relaxation. The proposed algorithm is guaranteed to find the globally optimal solution to the formulated problem. Thirdly, we design a graph neural network (GNN) based pruning policy to determine irrelevant nodes that can be directly pruned in the proposed B&B algorithm, thereby significantly reducing the number of unnecessary enumerations therein and improving its computational efficiency. Simulation results show the efficiency of the proposed vanilla and GNN-based accelerated B&B algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Modeling subgrid-scale force and divergence of heat flux of compressible isotropic turbulence by artificial neural network

引用

Physical Review Fluids 2019年第10期4卷 104605-104605页

作者： Chenyue Xie Ke Li Chao Ma Jianchun Wang Shenzhen Key Laboratory of Complex Aerospace Flows Center for Complex Flows and Soft Matter Research Department of Mechanics and Aerospace Engineering Southern University of Science and Technology Shenzhen 518055 People's Republic of China Institute of Computational Mathematics and Scientific Engineering Computing Chinese Academy of Sciences Beijing 100190 People's Republic of China The Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544 USA

In this paper, the subgrid-scale (SGS) force and the divergence of SGS heat flux of compressible isotropic turbulence are modeled directly by an artificial neural network (ANN), which serves as a data-driven SGS modeling tool for large-eddy simulations (LESs). The unclosed SGS force and divergence of SGS heat flux are modeled based on the local stencil geometry with Galilean invariance. The input features include the first-order and second-order derivatives of filtered velocity and temperature, filtered density, and its first-order derivative. It is shown that the proposed ANN-F7 model shows an advantage over the gradient model in the a priori test. Specifically, the ANN-F7 model gives larger correlation coefficients and smaller relative errors than the gradient model. In an a posteriori analysis, the ANN-F7 model performs better than the dynamic Smagorinsky model (DSM) and dynamic mixed model (DMM) in the prediction of the statistical properties of flow fields at the Taylor microscale Reynolds number Reλ ranging from 180 to 250. The DSM and DMM models lead to the typical tilted spectral distribution of velocity, where low wave numbers are too energy rich, while those near the cutoff are damped too strongly. In contrast, it is shown that the velocity spectrum predicted by the ANN-F7 model almost overlaps with the filtered direct numerical simulation data. Besides, the ANN-F7 model reconstructs the probability density functions of SGS force and divergence of SGS heat flux much better than the DSM and DMM models. An artificial neural network with reasonable physical input features can deepen our understanding of turbulence modeling.

关键词： Compressible flows Turbulence Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Strategic priorities for transformative progress in advancing biology with proteomics and artificial intelligence

arXiv

引用

arXiv 2025年

作者： Sun, Yingying Jun, A. Liu, Zhiwei Sun, Rui Qian, Liujia Payne, Samuel H. Bittremieux, Wout Ralser, Markus Li, Chen Chen, Yi Dong, Zhen Perez-Riverol, Yasset Khan, Asif Sander, Chris Aebersold, Ruedi Vizcaíno, Juan Antonio Krieger, Jonathan R. Yao, Jianhua Wen, Han Zhang, Linfeng Zhu, Yunping Xuan, Yue Sun, Benjamin Boyang Qiao, Liang Hermjakob, Henning Tang, Haixu Gao, Huanhuan Deng, Yamin Zhong, Qing Chang, Cheng Bandeira, Nuno Li, Ming Weinan, E. Sun, Siqi Yang, Yuedong Omenn, Gilbert S. Zhang, Yue Xu, Ping Fu, Yan Liu, Xiaowen Overall, Christopher M. Wang, Yu Deutsch, Eric W. Chen, Luonan Cox, Jürgen Demichev, Vadim He, Fuchu Huang, Jiaxing Jin, Huilin Liu, Chao Li, Nan Luan, Zhongzhi Song, Jiangning Yu, Kaicheng Wan, Wanggen Wang, Tai Zhang, Kang Zhang, Le Bell, Peter A. Mann, Matthias Zhang, Bing Guo, Tiannan Affiliated Hangzhou First People’s Hospital State Key Laboratory of Medical Proteomics School of Medicine Westlake University Zhejiang Province Hangzhou China Westlake Center for Intelligent Proteomics Westlake Laboratory of Life Sciences and Biomedicine Zhejiang Province Hangzhou China Biology Department Brigham Young University ProvoUT84602 United States Department of Computer Science University of Antwerp Antwerp2020 Belgium Department of Biochemistry CharitéUniversitätsmedizin Berlin Berlin Germany Biomedicine Discovery Institute Department of Biochemistry and Molecular Biology Monash University MelbourneVICVIC 3800 Australia Wellcome Genome Campus Hinxton CambridgeCB10 1SD United Kingdom Harvard Medical School Ludwig Center at Harvard United States Harvard Medical School Broad Institute Ludwig Center at Harvard Dana-Farber Cancer Institute United States Department of Biology Institute of Molecular Systems Biology ETH Zürich Zürich Switzerland Bruker Ltd. MiltonONL9T 6P4 Canada AI for Life Sciences Lab Tencent Shenzhen518057 China State Key Laboratory of Medical Proteomics AI for Science Institute Beijing100080 China Beijing Institute of Lifeomics Beijing102206 China Thermo Fisher Scientific GmbH Hanna-Kunath Str. 11 Bremen28199 Germany Informatics and Predictive Sciences Research Bristol Myers Squibb United States Department of Chemistry Fudan University Songhu Road 2005 Shanghai200438 China Department of Computer Science Luddy School of Informatics Computing and Engineering Indiana University IN47408 United States ProCan® Children’s Medical Research Institute Faculty of Medicine and Health The University of Sydney WestmeadNSW Australia La Jolla CA United States Central China Institute of Artificial Intelligence University of Waterloo Canada AI for Science Institute Center for Machine Learning Research School of Mathematical Sciences Peking University China Research Institute of Intelligent Complex Systems Fudan U

Artificial intelligence (AI) is transforming scientific research, including proteomics. Advances in mass spectrometry (MS)-based proteomics data quality, diversity, and scale, combined with groundbreaking AI techniques, are unlocking new challenges and opportunities in biological discovery. Here, we highlight key areas where AI is driving innovation, from data analysis to new biological insights. These include developing an AI-friendly ecosystem for proteomics data generation, sharing, and analysis;improving peptide and protein identification and quantification;characterizing protein-protein interactions and protein complexes;advancing spatial and perturbation proteomics;integrating multi-omics data;and ultimately enabling AI-empowered virtual cells. © 2025, CC BY.

关键词： Biotic

来源：评论

学校读者我要写书评

暂无评论

Secure dual-functional radar-communication transmission: Exploiting interference for resilience against target eavesdropping

arXiv

引用

arXiv 2021年

作者： Su, Nanchi Liu, Fan Wei, Zhongxiang Liu, Ya-Feng Masouros, Christos Department of Electronic and Electrical Engineering University College London LondonWC1E 7JE United Kingdom Department of Electrical and Electronic Engineering Southern University of Science and Technology Shenzhen518055 China College of Electronic and Information Engineering Tongji University Shanghai China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematicsand Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

We study security solutions for dual-functional radar communication (DFRC) systems, which detect the radar target and communicate with downlink cellular users in millimeter-wave (mmWave) wireless networks simultaneously. Uniquely for such scenarios, the radar target is regarded as a potential eavesdropper which might surveil the information sent from the base station (BS) to communication users (CUs), that is carried by the radar probing signal. Transmit waveform and receive beamforming are jointly designed to maximize the signalto- interference-plus-noise ratio (SINR) of the radar under the security and power budget constraints. We apply a Directional Modulation (DM) approach to exploit constructive interference (CI), where the known multiuser interference (MUI) can be exploited as a source of useful signal. Moreover, to further deteriorate the eavesdropping signal at the radar target, we utilize destructive interference (DI) by pushing the received symbols at the target towards the destructive region of the signal constellation. Our numerical results verify the effectiveness of the proposed design showing a secure transmission with enhanced performance against benchmark DFRC techniques. Copyright © 2021, The Authors. All rights reserved.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

A prediction-correction based iterative convolution-thresholding method for topology optimization of heat transfer problems

arXiv

引用

arXiv 2024年

作者： Chen, Huangxin Dong, Piaopiao Wang, Dong Wang, Xiao-Ping School of Mathematical Sciences Fujian Provincial Key Laboratory on Mathematical Modeling and High Performance Scientific Computing Xiamen University Fujian361005 China School of Science and Engineering The Chinese University of Hong Kong Guangdong Shenzhen518172 China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data Guangdong518172 China

In this paper, we propose an iterative convolution-thresholding method (ICTM) based on prediction-correction for solving the topology optimization problem in steady-state heat transfer equations. The problem is formulated as a constrained minimization problem of the complementary energy, incorporating a perimeter/surface-area regularization term, while satisfying a steady-state heat transfer equation. The decision variables of the optimization problem represent the domains of different materials and are represented by indicator functions. The perimeter/surface-area term of the domain is approximated using Gaussian kernel convolution with indicator functions. In each iteration, the indicator function is updated using a prediction-correction approach. The prediction step is based on the variation of the objective functional by imposing the constraints, while the correction step ensures the monotonically decreasing behavior of the objective functional. Numerical results demonstrate the efficiency and robustness of our proposed method, particularly when compared to classical approaches based on the ICTM. Copyright © 2024, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A Prediction-Correction Based Iterative Convolution-Thresholding Method for Topology Optimization of Heat Transfer Problems

SSRN

引用

SSRN 2024年

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Covariance-Based Activity Detection in Cooperative Multi-Cell Massive MIMO: Scaling Law and Efficient Algorithms

arXiv

引用

arXiv 2023年

作者： Wang, Ziyue Liu, Ya-Feng Wang, Zhaorui Yu, Wei The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China Guangdong Provincial Key Laboratory of Future Networks of Intelligence The Chinese University of Hong Kong Shenzhen518172 China The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada

This paper focuses on the covariance-based activity detection problem in a multi-cell massive multiple-input multiple-output (MIMO) system. In this system, active devices transmit their signature sequences to multiple base stations (BSs), and the BSs cooperatively detect the active devices based on the received signals. While the scaling law for the covariance-based activity detection in the single-cell scenario has been extensively analyzed in the literature, this paper aims to analyze the scaling law for the covariance-based activity detection in the multi-cell massive MIMO system. Specifically, this paper demonstrates a quadratic scaling law in the multi-cell system, under the assumption that the path-loss exponent of the fading channel γ > 2. This finding shows that, in the multi-cell massive MIMO system, the maximum number of active devices that can be correctly detected in each cell increases quadratically with the length of the signature sequence and decreases logarithmically with the number of cells (as the number of antennas tends to infinity). Moreover, in addition to analyzing the scaling law for the signature sequences randomly and uniformly distributed on a sphere, the paper also establishes the scaling law for signature sequences based on a finite alphabet, which are easier to generate and store. Finally, this paper proposes two efficient accelerated coordinate descent (CD) algorithms with a convergence guarantee for solving the device activity detection problem. The first algorithm reduces the complexity of CD by using an inexact coordinate update strategy. The second algorithm avoids unnecessary computations of CD by using an active set selection strategy. Simulation results show that the proposed algorithms exhibit excellent performance in terms of computational efficiency and detection error probability. Copyright © 2023, The Authors. All rights reserved.

关键词： Fading channels

来源：评论

学校读者我要写书评

暂无评论

Probabilistic methods for approximate archetypal analysis

arXiv

引用

arXiv 2021年

作者： Han, Ruijian Osting, Braxton Wang, Dong Xu, Yiming Department of Statistics The Chinese University of Hong Kong Hong Kong Department of Mathematics University of Utah Salt Lake City United States School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Scientific Computing and Imaging Institute University of Utah Salt Lake City United States

Archetypal analysis is an unsupervised learning method for exploratory data analysis. One major challenge that limits the applicability of archetypal analysis in practice is the inherent computational complexity of the existing algorithms. In this paper, we provide a novel approximation approach to partially address this issue. Utilizing probabilistic ideas from high-dimensional geometry, we introduce two preprocessing techniques to reduce the dimension and representation cardinality of the data, respectively. We prove that provided the data is approximately embedded in a low-dimensional linear subspace and the convex hull of the corresponding representations is well approximated by a polytope with a few vertices, our method can effectively reduce the scaling of archetypal analysis. Moreover, the solution of the reduced problem is near-optimal in terms of prediction errors. Our approach can be combined with other acceleration techniques to further mitigate the intrinsic complexity of archetypal analysis. We demonstrate the usefulness of our results by applying our method to summarize several moderately large-scale datasets. Copyright © 2021, The Authors. All rights reserved.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

A Survey of Recent Advances in Optimization Methods for Wireless Communications

arXiv

引用

arXiv 2024年

作者： Liu, Ya-Feng Chang, Tsung-Hui Hong, Mingyi Wu, Zheyu So, Anthony Man-Cho Jorswieck, Eduard A. Yu, Wei The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The School of Science and Engineering The Chinese University of Hong Kong Shenzhen Shenzhen China Shenzhen Research Institute of Big Data China The Department of Electrical and Computer Engineering University of Minnesota MinneapolisMN55455 United States The Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong The Institute for Communication Technology Technische Universitat Braunschweig Germany The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada

Mathematical optimization is now widely regarded as an indispensable modeling and solution tool for the design of wireless communications systems. While optimization has played a significant role in the revolutionary progress in wireless communication and networking technologies from 1G to 5G and onto the future 6G, the innovations in wireless technologies have also substantially transformed the nature of the underlying mathematical optimization problems upon which the system designs are based and have sparked significant innovations in the development of methodologies to understand, to analyze, and to solve those problems. In this paper, we provide a comprehensive survey of recent advances in mathematical optimization theory and algorithms for wireless communication system design. We begin by illustrating common features of mathematical optimization problems arising in wireless communication system design. We discuss various scenarios and use cases and their associated mathematical structures from an optimization perspective. We then provide an overview of recently developed optimization techniques in areas ranging from nonconvex optimization, global optimization, and integer programming, to distributed optimization and learning-based optimization. The key to successful solution of mathematical optimization problems is in carefully choosing or developing suitable algorithms (or neural network architectures) that can exploit the underlying problem structure. We conclude the paper by identifying several open research challenges and outlining future research directions. Copyright © 2024, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Capacity optimality of AMP in coded systems

arXiv

引用

arXiv 2021年

作者： Liu, Lei Liang, Chulong Ma, Junjie Ping, Li Department of Electronic Engineering City University of Hong Kong Hong Kong School of Information Science Japan Institute of Science and Technology Nomi923-1292 Japan State Key Laboratory of Mobile Network and Mobile Multimedia Technology ZTE Corporation Shenzhen518057 China Institute of Computational Mathematics and Scientific Engineering Computing Chinese Academy of Sciences China

This paper studies a large random matrix system (LRMS) model involving an arbitrary signal distribution and forward error control (FEC) coding. We establish an area property based on the approximate message passing (AMP) algorithm. Under the assumption that the state evolution for AMP is correct for the coded system, the achievable rate of AMP is analyzed. We prove that AMP achieves the constrained capacity of the LRMS with an arbitrary signal distribution provided that a matching condition is satisfied. We provide related numerical results of binary signaling using irregular low-density parity-check (LDPC) codes. We show that the optimized codes demonstrate significantly better performance over unmatched ones under AMP. For quadrature phase shift keying (QPSK) modulation, bit error rate (BER) performance within 1 dB from the constrained capacity limit is observed. © 2021, CC BY-NC-SA.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：