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

arXiv 2024年

作者： Chen, Wei-Kun Liu, Ya-Feng Dai, Yu-Hong Luo, Zhi-Quan The School of Mathematics and Statistics Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 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 Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China

In this paper, we consider the network slicing (NS) problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and manage network resources to meet diverse quality of service (QoS) requirements. We propose a mixed-integer nonlinear programming (MINLP) formulation for the considered NS problem that can flexibly route the traffic flow of the services on multiple paths and provide end-to-end delay and reliability guarantees for all services. To overcome the computational difficulty due to the intrinsic nonlinearity in the MINLP formulation, we transform the MINLP formulation into an equivalent mixed-integer linear programming (MILP) formulation and further show that their continuous relaxations are equivalent. In sharp contrast to the continuous relaxation of the MINLP formulation which is a nonconvex nonlinear programming problem, the continuous relaxation of the MILP formulation is a polynomial-time solvable linear programming problem, which significantly facilitates the algorithmic design. Based on the newly proposed MILP formulation, we develop a customized column generation (cCG) algorithm for solving the NS problem. The proposed cCG algorithm is a decomposition-based algorithm and is particularly suitable for solving large-scale NS problems. Numerical results demonstrate the efficacy of the proposed formulations and the proposed cCG algorithm. Copyright © 2024, The Authors. All rights reserved.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Parallel finite-volume discrete Boltzmann method for inviscid compressible flows on unstructured grids

引用

Physical Review E 2021年第2期103卷 023306-023306页

作者： Lei Xu Rongliang Chen Xiao-Chuan Cai Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen 518055 China Shenzhen Key Laboratory for Exascale Engineering and Scientific Computing Shenzhen 518055 China Department of Mathematics University of Macau Macau China

In this paper, a finite-volume discrete Boltzmann method based on a cell-centered scheme for inviscid compressible flows on unstructured grids is presented. In the new method, the equilibrium distribution functions are obtained from the circle function in two-dimensions (2D) and the spherical function in three-dimensions (3D). Moreover, the advective fluxes are evaluated by Roe's flux-difference splitting scheme, the gradients of the density and total energy distribution functions are computed with a least-squares method, and the Venkatakrishnan limiter is employed to prevent oscillations. To parallelize the method we use a graph-based partitioning approach that also guarantees the load balancing. The method is validated by seven benchmark problems: (a) a 2D flow pasting a bump, (b) a 2D Riemann problem, (c) a 2D flow passing the RAE2822 airfoil, (d) flows passing the NACA0012 airfoil, (e) 2D supersonic flows around a cylinder, (f) an explosion in a 3D box, and (g) a 3D flow around the ONERA M6 wing. The benchmark tests show that the results obtained by the proposed method match well with the published results, and the parallel numerical experiments show that the proposed parallel implementation has close to linear strong scalability, and parallel efficiencies of 95.31% and 94.56% are achieved for 2D and 3D problems on a supercomputer with up to 4800 processor cores, respectively.

关键词： Aerodynamics High-speed flow Lattice-Boltzmann methods

来源：评论

学校读者我要写书评

暂无评论

QoS-based Beamforming and Compression Design for Cooperative Cellular Networks via Lagrangian Duality

arXiv

引用

arXiv 2023年

作者： Fan, Xilai Liu, Ya-Feng Liu, Liang Chang, Tsung-Hui 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 Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong School of Science and Engineering The Chinese University of Hong Kong Shenzhen Research Institute of Big Data Shenzhen Shenzhen China

This paper considers the quality-of-service (QoS)based joint beamforming and compression design problem in the downlink cooperative cellular network, where multiple relay-like base stations (BSs), connected to the central processor via rate-limited fronthaul links, cooperatively transmit messages to the users. The problem of interest is formulated as the minimization of the total transmit power of the BSs, subject to all users’ signal-to-interference-plus-noise ratio (SINR) constraints and all BSs’ fronthaul rate constraints. In this paper, we first show that there is no duality gap between the considered joint optimization problem and its Lagrangian dual by showing the tightness of its semidefinite relaxation (SDR). Then, we propose an efficient algorithm based on the above duality result for solving the considered problem. The proposed algorithm judiciously exploits the special structure of an enhanced Karush-Kuhn-Tucker (KKT) conditions of the considered problem and finds the solution that satisfies the enhanced KKT conditions via two fixed point iterations. Two key features of the proposed algorithm are: (1) it is able to detect whether the considered problem is feasible or not and find its globally optimal solution when it is feasible;(2) it is highly efficient because both of the fixed point iterations in the proposed algorithm are linearly convergent and evaluating the functions in the fixed point iterations are computationally cheap. Numerical results show the global optimality and efficiency of the proposed algorithm. Copyright © 2023, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing

arXiv

引用

arXiv 2023年

作者： Chen, Wei-Kun Wu, Zheyu Zhang, Rui-Jin Liu, Ya-Feng Dai, Yu-Hong Luo, Zhi-Quan The School of Mathematics and Statistics Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 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 Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China

This paper considers the network slicing (NS) problem which attempts to map multiple customized virtual network requests to a common shared network infrastructure and allocate network resources to meet diverse service requirements. This paper proposes an efficient customized Benders decomposition algorithm for globally solving the large-scale NP-hard NS problem. The proposed algorithm decomposes the hard NS problem into two relatively easy function placement (FP) and traffic routing (TR) subproblems and iteratively solves them enabling the information feedback between each other, which makes it particularly suitable to solve large-scale problems. Specifically, the FP subproblem is to place service functions into cloud nodes in the network, and solving it can return a function placement strategy based on which the TR subproblem is defined;and the TR subproblem is to find paths connecting two nodes hosting two adjacent functions in the network, and solving it can either verify that the solution of the FP subproblem is an optimal solution of the original problem, or return a valid inequality to the FP subproblem that cuts off the current infeasible solution. The proposed algorithm is guaranteed to find the globally optimal solution of the NS problem. By taking the special structure of the NS problem into consideration, we successfully develop two families of valid inequalities that render the proposed algorithm converge much more quickly and thus much more efficient. Numerical results demonstrate that the proposed valid inequalities effectively accelerate the convergence of the decomposition algorithm, and the proposed algorithm significantly outperforms the existing algorithms in terms of both solution efficiency and quality. Copyright © 2023, The Authors. All rights reserved.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Non-invasive assessment of intracranial wall shear stress using high-resolution magnetic resonance imaging in combination with computational fluid dynamics technique

引用

Fundamental Research 2022年第2期2卷 329-334页

作者： Yuwen Chen Jia Liu Mingli Li Yannan Yu Zhengzheng Yan Wenshin Shiu Bokai Wu Zaiheng Cheng Yao Meng Yang Liu Weizhuang Yuan Zongmuyu Zhang Weihai Xu Department of Neurology State Key Laboratory of Complex Severe and Rare DiseasesPeking Union Medical Cllege HospitalChinese Academy of Medical Sciences and Peking Union Medical College1 ShuaifuyuanBeijing 100005China Department of Cardiology Second Afliated Hospital of Zhejiang University School of MedicineHangzhouZhejiang 310009China Shenzhen Instiutes of Advanced Technology Chinese Academy of SciencesShenzhen 518055China Shenzhen Key Laboratory for Exascale Engineering and Scientific Computing Shenzhen 518055China Department of Radiology Peking Union Medical College HospitalChinese Acadermy of Medical Sciences1 ShuaifiryuanBeijing 100005China Department of Radiology Stanford UniversityCaliformia 94305United States Department of Neurology Saarland UniversityKirrberger StraSe 66421Germany

In vivo studies on association between wall shear stress(WSS)and intracranial plaque are *** on the three-dimensional T1-weighted high-resolution magnetic resonance imaging(3DT1 HR-MRI)data of patients with low-grade stenotic(<50%)atherosclerotic middle cerebral artery(MCA)and subjects with normal MCA,we built a three-dimensional reconstructed WSS model by computational fluid dynamics(CFD)***-dimensional registration of the CFD model to the HR-MRI was performed with projections based on the resolution and thickness of the *** relationships between the Wss at each side of the vessel wall and plaque location were analyzed.A total of 94 MCA plaques from 43 patients and 50 normal MCAs were *** the normal MCAs,WSS was lower at the ventral-inferior wall than at the dorsal-superior wall(proximal segment,p<0.001;middle segment,p<0.001)and lower at the inner wall than at the outer wall of the MCA curve(p<0.001).In atherosclerotic MCAs,similar low Wss regions were observed where plaques *** WSS ratio of the ventral-inferior wall to the dorsal-superior wall in atherosclerotic MCAs was lower than that in normal MCAs(p=0.002).The WSS_(inmer-outer)ratio in atherosclerotic MCAs was lower than that in normal MCAs(p=0.002).Low WSS was associated with MCA atherosclerosis formation and occurred mainly at the ventral inferior wall,which was anatomically opposite the orifices of penetrating arteries,and at the inner wall of the MCA ***,the results were well consistent with the low WSS theory in atherosclerosis *** reconstructed WSS model is a promising novel method for assessing an individualized vascular profile once validated by further studies.

关键词： Intracranial atherosclerosis Wall shear stress Atherosclerotic plaque High-resolution magnetic resonance imaging Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS AND APPROXIMATION TO PARABOLIC OPTIMAL CONTROL PROBLEMS WITH MEASURE-VALUED CONTROLS IN TIME

arXiv

引用

arXiv 2024年

作者： Gong, Wei Liang, Dongdong The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics National Center for Mathematics and Interdisciplinary Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Hong Kong Polytechnic University Shenzhen Research Institute Shenzhen518057 China

In this paper, we investigate an optimal control problem governed by parabolic equations with measure-valued controls over time. We establish the well-posedness of the optimal control problem and derive the first-order optimality condition using Clarke’s subgradients, revealing a sparsity structure in time for the optimal control. Consequently, these optimal control problems represent a generalization of impulse control for evolution equations. To discretize the optimal control problem, we employ the space-time finite element method. Here, the state equation is approximated using piecewise linear and continuous finite elements in space, alongside a Petrov-Galerkin method utilizing piecewise constant trial functions and piecewise linear and continuous test functions in time. The control variable is discretized using the variational discretization concept. For error estimation, we initially derive a priori error estimates and stabilities for the finite element discretizations of the state and adjoint equations. Subsequently, we establish weak-* convergence for the control under the norm M(I¯c;L2(ω)), with a convergence order of O(h 21 + τ 41 ) for the *** Codes 65M06, 68M99, 49M40 © 2024, CC BY-SA.

关键词： Optimal control systems

来源：评论

学校读者我要写书评

暂无评论

Device Activity Detection in mMTC with Low-Resolution ADC: A New Protocol

arXiv

引用

arXiv 2023年

作者： Wang, Zhaorui Liu, Ya-Feng Wang, Ziyue Liu, Liang Pan, Haoyuan Cui, Shuguang The Future Network of Intelligence Institute The School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 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 Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong College of Computer Science and Software Engineering Shenzhen University Shenzhen China

This paper investigates the effect of low-resolution analog-to-digital converters (ADCs) on device activity detection in massive machine-type communications (mMTC). The low-resolution ADCs induce two challenges on the device activity detection compared with the traditional setup with the assumption of infinite ADC resolution. First, the codebook design for signal quantization by the low-resolution ADC is particularly important since a good design of the codebook can lead to small quantization error on the received signal, which in turn has significant influence on the activity detector performance. To this end, prior information about the received signal power is needed, which depends on the number of active devices K. This is sharply different from the activity detection problem in traditional setups, in which the knowledge of K is not required by the BS as a prerequisite. Second, the covariance-based approach achieves good activity detection performance in traditional setups while it is not clear if it can still achieve good performance in this paper. To solve the above challenges, we propose a communication protocol that consists of an estimator for K and a detector for active device identities: 1) For the estimator, the technical difficulty is that the design of the ADC quantizer and the estimation of K are closely intertwined and doing one needs the information/execution from the other. We propose a progressive estimator which iteratively performs the estimation of K and the design of the ADC quantizer;2) For the activity detector, we propose a custom-designed stochastic gradient descent algorithm to estimate the active device identities. Numerical results demonstrate the effectiveness of the communication protocol. © 2023, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Global Algorithms for Transmit Beamforming Design in ISAC Systems

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Random ISAC Signals Deserve Dedicated Precoding

arXiv

引用

arXiv 2023年

作者： Lu, Shihang Liu, Fan Dong, Fuwang Xiong, Yifeng Xu, Jie Liu, Ya-Feng Jin, Shi Southern University of Science and Technology Shenzhen518055 China The School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Shenzhen518172 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 National Mobile Communications Research Laboratory Southeast University Nanjing210096 China

Radar systems typically employ well-designed deterministic signals for target sensing, while integrated sensing and communications (ISAC) systems have to adopt random signals to convey useful information. This paper analyzes the sensing and ISAC performance relying on random signaling in a multi-antenna system. Towards this end, we define a new sensing performance metric, namely, ergodic linear minimum mean square error (ELMMSE), which characterizes the estimation error averaged over random ISAC signals. Then, we investigate a data-dependent precoding (DDP) scheme to minimize the ELMMSE in sensing-only scenarios, which attains the optimized performance at the cost of high implementation overhead. To reduce the cost, we present an alternative data-independent precoding (DIP) scheme by stochastic gradient projection (SGP). Moreover, we shed light on the optimal structures of both sensing-only DDP and DIP precoders. As a further step, we extend the proposed DDP and DIP approaches to ISAC scenarios, which are solved via a tailored penalty-based alternating optimization algorithm. Our numerical results demonstrate that the proposed DDP and DIP methods achieve substantial performance gains over conventional ISAC signaling schemes that treat the signal sample covariance matrix as deterministic, which proves that random ISAC signals deserve dedicated precoding designs. © 2023, CC BY.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：