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

Towards Efficient Large-Scale Network Slicing: An LP Dynamic Rounding-and-Refinement Approach

学校读者我要写书评

暂无评论

arXiv 2021年

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

In this paper, we propose an efficient algorithm for the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse service requirements. The problem has been formulated as a mixed integer linear programming (MILP) formulation in the literature. We first propose a novel linear programming (LP) relaxation of the MILP formulation. We show that compared with a natural LP relaxation of the MILP formulation, the novel LP relaxation is much more compact in terms of smaller numbers of variables and constraints, and much stronger in terms of providing a better LP bound, which makes it particularly suitable to be embedded in an LP relaxation based algorithm. Then we design an efficient two-stage LP dynamic rounding-and-refinement algorithm based on this novel LP relaxation. In the first stage, the proposed algorithm uses an LP dynamic rounding procedure to place the virtual network functions of all services into cloud nodes while taking traffic routing of all services into consideration;in the second stage, the proposed algorithm uses an iterative LP refinement procedure to obtain a solution for traffic routing of all services with their end-to-end delay constraints being satisfied. Compared with the existing algorithms which either have an exponential complexity or return a low-quality solution, our proposed algorithm achieves a better trade-off between the solution quality and the computational complexity. In particular, the worst-case complexity of our proposed algorithm is polynomial, which makes it suitable for solving large-scale problems. Numerical results demonstrate the effectiveness and efficiency of our proposed algorithm. Copyright © 2021, The Authors. All rights reserved.

关键词： Iterative methods

Rubric-based holistic review represents a change from traditional graduate admissions approaches in physics

学校读者我要写书评

暂无评论

Physical Review Physics Education Research 2023年第1期19卷 010134-010134页

作者： Nicholas T. Young N. Verboncoeur Dao Chi Lam Marcos D. Caballero Department of Physics and Astronomy Michigan State University East Lansing Michigan 48824 USA Department of Computational Mathematics Science and Engineering Michigan State University East Lansing Michigan 48824 USA Department of Statistics Michigan State University East Lansing Michigan 48824 USA Center for Computing in Science Education and Department of Physics University of Oslo N-0316 Oslo Norway CREATE for STEM Institute Michigan State University East Lansing Michigan 48824 USA

Rubric-based admissions are claimed to help make the graduate admissions process more equitable, possibly helping to address the historical and ongoing inequities in the U.S. physics graduate school admissions process that have often excluded applicants from minoritized races, ethnicities, genders, and backgrounds. Yet, no studies have examined whether rubric-based admissions methods represent a fundamental change in the admissions process or simply represent a new tool that achieves the same outcome. To address that, we developed supervised machine learning models of graduate admissions data collected from our department over a seven-year period. During the first four years, our department used a traditional admission process and switched to a rubric-based process for the following three years, allowing us to compare which parts of the applications were driving admissions decisions. We find that faculty focused on applicants’ physics GRE scores and grade-point averages when making admissions decisions before the implementation of the rubric. While we were able to develop a sufficiently good model whose results we could trust for the data before the implementation of the rubric, we were unable to do so for the data collected after the implementation of the rubric, despite multiple modifications to the algorithms and data such as implementing Tomek Links. Our inability to model the second dataset despite being able to model the first combined with model comparison analyses suggests that rubric-based admission does change the underlying process. These results suggest that rubric-based holistic review is a method that could make the graduate admission process in physics more equitable.

关键词： Diversity & inclusion Educational policy Graduate students

Quantum Rényi Entropy Functionals for Bosonic Gaussian Systems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Lee, Junseo Jeong, Kabgyun School of Electrical and Electronic Engineering Yonsei University Seoul03722 Korea Republic of Quantum Computing R&D Norma Inc. Seoul04799 Korea Republic of Research Institute of Mathematics Seoul National University Seoul08826 Korea Republic of School of Computational Sciences Korea Institute for Advanced Study Seoul02455 Korea Republic of

In this study, the quantum Rényi entropy power inequality of order p > 1 and power κ is introduced as a quantum analog of the classical Rényi-p entropy power inequality. To derive this inequality, we first exploit the Wehrl-p entropy power inequality on bosonic Gaussian systems via the mixing operation of quantum convolution, which is a generalized beam-splitter operation. This observation directly provides a quantum Rényi-p entropy power inequality over a quasi-probability distribution for D-mode bosonic Gaussian regimes. The proposed inequality is expected to be useful for the nontrivial computing of quantum channel capacities, particularly universal upper bounds on bosonic Gaussian quantum channels, and a Gaussian entanglement witness in the case of Gaussian amplifier via squeezing operations. © 2022, CC BY.

关键词： Quantum entanglement

A New Global Divergence Free and Pressure-Robust HDG Method for Tangential Boundary Control of Stokes Equations

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chen, Gang Gong, Wei Mateos, Mariano Singler, John R. Zhang, Yangwen School of Mathematics Sichuan University Chengdu China NCMIS LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China Dpto. de Matemáticas Universidad de Oviedo Campus de Gijón Spain Department of Mathematics and Statistics Missouri University of Science and Technology RollaMO United States Department of Mathematical Science Carnegie Mellon University PittsburghPA United States

In [ESAIM: M2AN, 54(2020), 2229-2264], we proposed an HDG method to approximate the solution of a tangential boundary control problem for the Stokes equations and obtained an optimal convergence rate for the optimal control that reflects its global regularity. However, the error estimates depend on the pressure, and the velocity is not divergence free. The importance of pressure-robust numerical methods for fluids was addressed by John et al. [SIAM Review, 59(2017), 492-544]. In this work, we devise a new HDG method to approximate the solution of the Stokes tangential boundary control problem;the HDG method is also of independent interest for solving the Stokes equations. This scheme yields a H(div) conforming, globally divergence free, and pressure-robust solution. To the best of our knowledge, this is the first time such a numerical scheme has been obtained for an optimal boundary control problem for the Stokes equations. We also provide numerical experiments to show the performance of the new HDG method and the advantage over the non pressure-robust *** Codes 35Q35, 49M25, 65N30 Copyright © 2022, The Authors. All rights reserved.

关键词： Numerical methods

DMNER: Biomedical Named Entity Recognition by Detection and Matching

学校读者我要写书评

暂无评论

DMNER: Biomedical Named Entity Recognition by Detection and ...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Junyi Bian Rongze Jiang Weiqi Zhai Tianyang Huang Xiaodi Huang Hong Zhou Shanfeng Zhu School of Computer Science Fudan University Shanghai China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai China School of Computing Mathematics and Engineering Charles Sturt University New South Wales Australia Atypon Systems LLC UK Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Institute of Science and Technology for Brain-Inspired Intelligence and MOE Frontiers Center for Brain Science Shanghai Key Lab of Intelligent Information Processing Zhangjiang Fudan International Innovation Center Fudan University Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Biomedical Named Entity Recognition (NER) is a crucial task in extracting information from biomedical texts. However, the diversity of professional terminology, semantic complexity, and the widespread presence of synonyms pose significant challenges. Traditional methods that rely on sequence labeling training datasets often struggle to handle these complexities. To address this, we introduce a novel framework for BioNER, termed DMNER, which leverages external knowledge and operates in two steps: entity boundary detection and entity category identification through matching. The core of DMNER is its second step, which determines the entity category by retrieving similar entities and their categories from a knowledge dictionary using semantic similarity matching. Our experiments on 10 biomedical datasets demonstrate that DMNER outperforms baselines across these tasks, proving its effectiveness and adaptability. DMNER is versatile and can be applied to various NER tasks, including supervised NER, distantly supervised NER, and NER on multiple datasets with disjoint label sets. The DMNER code is publicly available 1 .

关键词： Training Dictionaries Codes Semantics Named entity recognition Complexity theory Labeling Data mining Bioinformatics

Efficient CI-Based One-Bit Precoding for Multiuser Downlink Massive MIMO Systems with PSK Modulation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Zheyu Jiang, Bo Liu, Ya-Feng Shao, Mingjie Dai, Yu-Hong 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 Ministry of Education Key Laboratory for NSLSCS School of Mathematical Sciences Nanjing Normal University Nanjing210023 China The School of Information Science and Engineering Shandong University Qingdao China

In this paper, we consider the one-bit precoding problem for the multiuser downlink massive multiple-input multiple-output (MIMO) system with phase shift keying (PSK) modulation. We focus on the celebrated constructive interference (CI)-based problem formulation. We first establish the NP-hardness of the problem (even in the single-user case), which reveals the intrinsic difficulty of globally solving the problem. Then, we propose a novel negative 1 penalty model for the considered problem, which penalizes the one-bit constraint into the objective by a negative 1-norm term, and show the equivalence between (global and local) solutions of the original problem and the penalty problem when the penalty parameter is sufficiently large. We further transform the penalty model into an equivalent min-max problem and propose an efficient alternating proximal/projection gradient descent ascent (APGDA) algorithm for solving it, which performs a proximal gradient decent over one block of variables and a projection gradient ascent over the other block of variables alternately. The APGDA algorithm enjoys a low per-iteration complexity and is guaranteed to converge to a stationary point of the min-max problem and a local minimizer of the penalty problem. To further reduce the computational cost, we also propose a low-complexity implementation of the APGDA algorithm, where the values of the variables will be fixed in later iterations once they satisfy the one-bit constraint. Numerical results show that, compared to the state-of-the-art CI-based algorithms, both of the proposed algorithms generally achieve better bit-error-rate (BER) performance with lower computational cost. Copyright © 2021, The Authors. All rights reserved.

关键词： Gradient methods

Asynchronous Activity Detection for Cell-Free Massive MIMO: From Centralized to Distributed Algorithms

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Yang Lin, Qingfeng Liu, Ya-Feng Ai, Bo Wu, Yik-Chung Shenzhen Research Institute of Big Data Shenzhen518172 China State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong 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 Peng Cheng Laboratory Shenzhen518055 China Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China

Device activity detection in the emerging cell-free massive multiple-input multiple-output (MIMO) systems has been recognized as a crucial task in machine-type communications, in which multiple access points (APs) jointly identify the active devices from a large number of potential devices based on the received signals. Most of the existing works addressing this problem rely on the impractical assumption that different active devices transmit signals synchronously. However, in practice, synchronization cannot be guaranteed due to the low-cost oscillators, which brings additional discontinuous and nonconvex constraints to the detection problem. To address this challenge, this paper reveals an equivalent reformulation to the asynchronous activity detection problem, which facilitates the development of a centralized algorithm and a distributed algorithm that satisfy the highly nonconvex constraints in a gentle fashion as the iteration number increases, so that the sequence generated by the proposed algorithms can get around bad stationary points. To reduce the capacity requirements of the fronthauls, we further design a communication-efficient accelerated distributed algorithm. Simulation results demonstrate that the proposed centralized and distributed algorithms outperform state-of-the-art approaches, and the proposed accelerated distributed algorithm achieves a close detection performance to that of the centralized algorithm but with a much smaller number of bits to be transmitted on the fronthaul links. Copyright © 2022, The Authors. All rights reserved.

关键词： Internet of things

Unifying Farkas lemma and S-lemma: New theory and applications in nonquadratic nonconvex optimization

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yang, Meijia Xia, Yong Wang, Shu School of Mathematics and Physics University of Science and Technology Beijing Beijing100083 China State Key Laboratory of Software Development Environment LMIB of the Ministry of Education School of Mathematics and System Sciences Beihang University Beijing100191 China Institute of Computational Mathematics and Scientific/Engineering Computing State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

We unify nonlinear Farkas lemma and S-lemma to a generalized alternative theorem for nonlinear nonconvex system. It provides fruitful applications in globally solving nonconvex non-quadratic optimization problems via ... 详细信息

关键词： Quadratic programming

Automation Intervention for Monitoring Agriculture Farming Scale: A Review

学校读者我要写书评

暂无评论

Automation Intervention for Monitoring Agriculture Farming S...

International Conference on computing and Networking Technology (ICCNT)

作者： Kapil Joshi Santosh Kumar Shruti Bhatla Vishal Kaushik Harishchander Anandaram Anil Kumar Department of CSE Uttaranchal Institute of Technology Uttaranchal University Dehradun India Department of Mathematics Sharda School of Basic Sciences and Research Sharda University Greater Noida UP India Department of Computer Science and Engineering Graphic Era Hill University Dehradun Uttarakhand India School of Computer Science UPES Dehradun India Centre for Computational Engineering and Networking Amrita Vishwa Vidyapeetham Coimbatore Tamil Nadu India School of Computing DIT University Dehradun India

Agricultural data is only valuable when it has been managed successfully. As data has evolved into the fundamental ingredient in contemporary agriculture to assist farmers with vital decision, latest developments in managing data are causing Smart Agriculture to rise dramatically. With factual information obtained by sensors, significant advantages emerge with the goal of enhancing production and ecology. This type of data-driven farm management is built on information that can boost efficiency by preventing resource waste and contamination of the ecosystem. Data-driven farming, with the assistance of automated solutions using artificial intelligence techniques, lays the groundwork for potential sustainable *** article analyses the current state of sophisticated agricultural systems by rehashing each critical step, from data processing in field crops to variable interest rate implementations, so that farmers can make optimised decision making to save funds while safeguarding the natural environment and converting how meal would be generated to meet the upcoming population explosion.

关键词：