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

FlexDRAN: Flexible Centralization in Disaggregated Radio Access Networks

IEEE ACCESS 2022年 10卷 11789-11808页

作者： Chang, Chia-Yu Nikaein, Navid Spyropoulos, Thrasyvoulos De Schepper, Koen Nokia Bell Labs B-2018 Antwerp Belgium EURECOM F-06904 Sophia Antipolis France

Radio Access Network (RAN) disaggregation allows operators to mix-and-match multivendor components and bring RAN services from one end to the other. Despite this goal, issues of resource misuse or performance undershoot may arise because of inflexible RAN function deployment and uncoordinated decision-making across different network segments. To address these issues, this paper considers full flexibility in the synthesis of end-to-end RAN services from a set of disaggregated and uncoordinated components. In particular, five design factors are jointly considered to maximize the overall network spectral efficiency: (1) User association, (2) Remote radio unit clustering, (3) RAN functional split, (4) Fronthaul network routing, and (5) Baseband unit placement. To efficiently deal with the formulated problem, we propose a two-level turbo-based solution and compare its performance with several related works. The simulation results show that our proposed solution can not only achieve a 1.33-times spectral efficiency gain compared with state-of-the-art methods, but also provides 1.27 and 1.74 multiplexing benefits for computing and networking resources, respectively.

关键词： Uplink Routing Radio access networks Multiplexing 3GPP Network topology Costs Radio access networks 5G mobile communication algorithm design and analysis disaggregated network functional split

来源：评论

学校读者我要写书评

暂无评论

A tractable non-adaptative group testing method for non-binary measurements*

引用

ESAIM-PROBABILITY AND STATISTICS 2022年第0期26卷 283-303页

作者： Joly, Emilien Mallein, Bastien CIMAT Guanajuato Mexico Univ Sorbonne Paris Nord LAGA UMR 7539 F-93430 Villetaneuse France Univ PSL Ecole Normale Super DMA F-75005 Paris France

The original problem of group testing consists in the identification of defective items in a collection, by applying tests on groups of items that detect the presence of at least one defective element in the group. The aim is then to identify all defective items of the collection with as few tests as possible. This problem is relevant in several fields, among which biology and computer sciences. In the present article we consider that the tests applied to groups of items returns a load, measuring how defective the most defective item of the group is. In this setting, we propose a simple non-adaptative algorithm allowing the detection of all defective items of the collection. Items are put on an n x n grid and pools are organised as lines, columns and diagonals of this grid. This method improves on classical group testing algorithms using only the binary response of the test. Group testing recently gained attraction as a potential tool to solve a shortage of COVID-19 test kits, in particular for RT-qPCR. These tests return the viral load of the sample and the viral load varies greatly among individuals. Therefore our model presents some of the key features of this problem. We aim at using the extra piece of information that represents the viral load to construct a one-stage pool testing algorithm on this idealized version. We show that under the right conditions, the total number of tests needed to detect contaminated samples can be drastically diminished.

关键词： Group testing one-stage algorithm non-adaptative group testing algorithm design and analysis non binary test

来源：评论

学校读者我要写书评

暂无评论

design of Soccer League Optimization Based Hybrid Controller for Solar-Battery Integrated UPQC

引用

IEEE ACCESS 2022年 10卷 107116-107136页

作者： Srilakshmi, Koganti Srinivas, Nakka Balachandran, Praveen Kumar Reddy, Jonnala Ganesh Prasad Gaddameedhi, Sravanthy Valluri, Nagaraju Selvarajan, Shitharth Sreenidhi Inst Sci & Technol Dept Elect & Elect Engn Hyderabad 501301 Telangana India Vardhaman Coll Engn Dept Elect & Elect Engn Hyderabad 501218 Telangana India Sree Vahini Inst Sci & Technol Dept Elect & Elect Engn Tirvuru 521235 Andhra Pradesh India Sreenidhi Inst Sci & Technol Dept Elect & Commun Engn Hyderabad 501301 Telangana India Kebri Dehar Univ Dept Comp Sci & Engn Somali 001 Ethiopia

Nowadays, integration of renewable energy source like solar, wind etc in the grid is encouraged to reduce the losses and meet the demand. However, the integration of these renewable sources, power electronic devices, non-linear and un-balanced loads leads to the power quality issues this motivated power researchers for the development of new controllers and techniques. This paper develops a soccer-league algorithm based optimal tuned hybrid controller for the unified power quality conditioner associated with the solar power and battery-storage systems with the Boost converter and Buck Boost converter. The UPQC simultaneously performs both the functions of Shunt active power filter and series active power filter. The proposed optimally designed controller adapts both the properties of fuzzy logic-controller and SOL algorithm tuned proportional-integral controllers. The Kp, Ki values of shunt and series controllers are treated as control variables, which are optimally tuned by SOL to satisfy the objective function. The key contributions of the proposed work are the reduction of total harmonics in current waveforms thereby enhancing the power factor, quick action to maintain the constant DC-Link capacitor voltage during the solar irradiation variations, elimination of voltage sag/swell/large disturbance, and appropriate compensation for the un-balanced networks and loads. The performance investigation of SLOHC was carried-out with four test studies for different combinations of unbalanced/balanced loads and supply voltage of 3-phase distribution network. Comparative analysis was carried out with those of standard methods like a genetic algorithm, biogeography-based optimization, and proportional-integral controllers. The proposed method reduces the total harmonic distortion to 2.06%, 2.44%, 2.40%, and 2.32% which are much lower than those of existing methods available in literature. The design has been performed on MATLAB/simulink software.

关键词： Harmonic analysis Voltage fluctuations Power harmonic filters Voltage control Reactive power Power quality Optimization algorithm design and analysis Solar power generation Photovoltaics Fuzzy logic Battery chargers Reactive power Renewable energy sources Radiation effects Power quality soccer league optimization UPQC fuzzy logic PI-C battery storage system solar PV system

来源：评论

学校读者我要写书评

暂无评论

A Fair SINR Performance Comparison of FBMC/OQAM and FBMC/QAM Multicarrier Communication Systems in the Discrete-Time Framework

引用

IEEE ACCESS 2022年 10卷 107716-107728页

作者： Khrouf, Wafa Siala, Mohamed Abdelkefi, Fatma Univ Carthage MEDIATRON Lab Higher Sch Commun Tunis SUPCOM Ariana 2083 Tunisia

In the last couple of decades, multicarrier modulations have witnessed a considerable interest in wireless communication networks due to their ability to fight against multipath fading and offer multiple access with flexible resource sharing. One of the well known multicarrier modulation systems is filter-bank multi-carrier with an offset quadrature amplitude modulation (FBMC/OQAM), which was proposed as a powerful solution during the standardization of 5G. In this paper, we derive a closed-form expression of the signal to interference plus noise ratio (SINR) for FBMC/OQAM systems in the discrete-time context, for arbitrary wide sense stationary uncorrelated scattering (WSSUS) channels as well as transmitter (Tx) and receiver (Rx) waveforms. We quantify the potential gains in SINR brought by FBMC/OQAM, which exclusively operates on critical lattice density, with respect to FBMC/QAM, which have the flexibility to operate on critical or non-critical lattice densities. For completeness, we compare the performance of FBMC/OQAM in the discrete-time context, sweeping the discrete space of waveforms supports, with that of FBMC/OQAM in the continuous-time context, using the Hermite functions, and show how they perform similarly. Simulation results prove that FBMC/OQAM optimization algorithm, performing with the ping-pong optimized pulse shaping (POPS) paradigm, converges rapidly to excellent SINR values, even with small supports durations, in discrete-time context, which is equivalent to a reduced number of Hermite functions, in the continuous-time context.

关键词： Interference Signal to noise ratio OFDM Time-frequency analysis Lattices Optimization Spectral efficiency algorithm design and analysis Quadrature amplitude modulation OFDM FBMC OQAM QAM interference SINR optimization waveform POPS algorithm

来源：评论

学校读者我要写书评

暂无评论

A Multi-Mechanism Particle Swarm Optimization algorithm Combining Hunger Games Search and Simulated Annealing

引用

IEEE ACCESS 2022年 10卷 116697-116708页

作者： Wang, Ting Shao, Peng Liu, Shanhui Li, Guangquan Yang, Fuhao Jiangxi Agr Univ Sch Comp & Informat Engn Nanchang 330045 Peoples R China

Particle Swarm Optimization (PSO) algorithm is a meta-heuristic algorithm inspired by the foraging behavior of birds, which has received a lot of attention from many scholars because of its simple principle and fast convergence rate. However, the traditional particle update mechanism limits the performance of the algorithm and makes it easy to fall into local extremums, leading to a reduced convergence rate at a later stage. In this paper, we propose a Multi-Mechanism Particle Swarm Optimization (HGSPSO) algorithm. The algorithm optimizes the position update formula of the particles by the Hunger Game Search (HGS) algorithm to accelerate the convergence speed at the later stage of the algorithm, and then the Simulated Annealing (SA) algorithm is introduced to dynamically update the inertia weights to balance the exploration and utilization of the algorithm to help the particles jump out of the local extrema. In addition, the double variational restrictions strategy is used to simultaneously restrict the velocity and position of the particles to avoid particle transgressions. We tested the proposed algorithm with five compare algorithms on 20 benchmark functions in 30, 50, 100, and 1000 dimensions using Eclipse Kepler Release software. The experimental results show that HGSPSO shows significant superiority in all four evaluation metrics and five assessment schemes.

关键词： Heuristic algorithms Particle swarm optimization algorithm design and analysis Games Simulated annealing Behavioral sciences Prediction algorithms Hunger game search metaheuristic algorithm particle swarm optimization swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Finding Agreement Cherry-Reduced Subnetworks in Level-1 Networks 1

引用

20th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG)

作者： Landry, Kaari Tremblay-Savard, Olivier Lafond, Manuel Univ Manitoba Winnipeg MB Canada Univ Sherbrooke Sherbrooke PQ Canada

ISBN: (数字)9783031369117

ISBN: (纸本)9783031369100;9783031369117

Phylogenetic networks are increasingly being considered as better suited to represent the complexity of the evolutionary relationships between species. One class of phylogenetic networks that has received a lot of attention recently is the class of orchard networks, which is composed of networks that can be reduced to a single leaf using cherry reductions. Cherry reductions, also called cherry-picking operations, remove either a leaf of a simple cherry (sibling leaves sharing a parent) or a reticulate edge of a reticulate cherry (two leaves whose parents are connected by a reticulate edge). In this paper, we present a fixed-parameter tractable algorithm to solve the problem of finding a maximum agreement cherry-reduced subnetwork (MACRS) between two rooted binary level-1 networks. This is the first exact algorithm proposed to solve the MACRS problem. As proven in earlier work, there is a direct relationship between finding an MACRS and calculating a distance based on cherry operations. As a result, the proposed algorithm also provides a distance that can be used for the comparison of level-1 networks. Supplementary material for this paper can be found on ***.

关键词： Cherry operations Graphs and networks Trees Network problems algorithm design and analysis Biology and genetics Phylogenetic Networks

来源：评论

学校读者我要写书评

暂无评论

Introduction to the Special Section on Resilience in Networked Robotic Systems

引用

IEEE TRANSACTIONS ON ROBOTICS 2022年第1期38卷 2-4页

作者： Prorok, Amanda Kumar, Vijay Sadler, Brian Sukhatme, Gaurav Univ Cambridge Cambridge England Univ Penn Philadelphia PA 19104 USA Army Res Lab Adelphi MD USA Univ Southern Calif Los Angeles CA 90007 USA

The 17 papers in this special section focus on resilience in networked robotic systems. This collection of articles aims to provide a deeper understanding of resilience as it pertains to multirobot systems, and to disseminate the current advances in designing and operating networked robotic systems. We understand resilience to be a characteristic that enables amultirobot system to withstand or overcome unexpected adverse conditions or shocks, and unknown, unmodeled disturbances. It refers to the contingent nature of the robots’ behaviors that is aimed at preserving their functionality or minimizing the time periods during which their functionality is compromised. The papers explore new algorithmic and mathematical foundations toward resilience.

关键词： Special issues and sections Robot kinematics Multi-robot systems Communication networks Probablistic logic Resilience algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Deterministic Parameter Control Applied to the Grouping Genetic algorithm with Controlled Gene Transmission 10

Deterministic Parameter Control Applied to the Grouping Gene...

引用

10th International Conference on Soft Computing and Machine Intelligence (ISCMI)

作者： Flores-Torres, Leonardo Amador-Larrea, Stephanie Quiroz-Castellanos, Marcela Ramos-Figueroa, Octavio Univ Veracruzana Artificial Intelligence Res Inst Xalapa Veracruz Mexico

ISBN: (纸本)9798350359374

An experimental study was performed where deterministic parameter control is applied to the crossover and mutation ratios of the Grouping Genetic algorithm with Controlled Gene Transmission (GGA-CGT) considering several control functions with different characteristics in order to solve the off-line One-Dimensional Bin Packing Problem (1-D BPP). Such control is mainly based on sinusoidal behavior to allow the algorithm to experience small variations in the parameter to control, and another control scheme based on the same sinusoidal behavior was designed to experiment smaller and larger parameter stepsize values even in the last stages of the run. An additional form of control is also included based on linear growth. The obtained performance is compared against the tuned version of the algorithm. Obtained results show that the GGA-CGT could benefit from the sinusoidal control scheme under small variations for the crossover ratio and from the linear control scheme for the mutation ratio. Lastly, the control schemes that showed the best results were tested in the Grouping Genetic algorithm with Intelligent Heuristic Strategies (GGA-IHS) designed to solve the Parallel-machine scheduling problem with unrelated machines and makespan minimization (R||C-max) showing promising results.

关键词： genetic algorithms combinatorial algorithms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Sequential Convex Programming Approach to Solving Quadratic Programs and Optimal Control Problems With Linear Complementarity Constraints

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 536-541页

作者： Hall, Jonas Nurkanovic, Armin Messerer, Florian Diehl, Moritz Univ Freiburg Dept Microsyst Engn IMTEK D-79110 Freiburg Germany Siemens Technol Res Digitalizat & Automat Autonomous Syst & Control Germany D-81739 Munich Germany Univ Freiburg Dept Math D-79110 Freiburg Germany

Mathematical programs with complementarity constraints are notoriously difficult to solve due to their nonconvexity and lack of constraint qualifications in every feasible point. This letter focuses on the subclass of quadratic programs with linear complementarity constraints. A novel approach to solving a penalty reformulation using sequential convex programming and a homotopy on the penalty parameter is introduced. Linearizing the necessarily nonconvex penalty function yields convex quadratic subproblems, which have a constant Hessian matrix throughout all iterates. This allows solution computation with a single KKT matrix factorization. Furthermore, a globalization scheme is introduced in which the underlying merit function is minimized analytically, and guarantee of descent is provided at each iterate. The algorithmic features and possible computational speedups are illustrated in a numerical experiment.

关键词： Programming Globalization Convergence Optimal control Economics Three-dimensional displays Taylor series Mathematical programming quadratic programming algorithm design and analysis optimal control

来源：评论

学校读者我要写书评

暂无评论

Optimized thread-block arrangement in a GPU implementation of a linear solver for atmospheric chemistry mechanisms

引用

COMPUTER PHYSICS COMMUNICATIONS 2024年 302卷

作者： Ruiz, Christian Guzman Acosta, Mario Jorba, Oriol Galobardes, Eduardo Cesar Dawson, Matthew Oyarzun, Guillermo Garcia-Pando, Carlos Perez Serradell, Kim Barcelona Supercomp Ctr Barcelona Spain Univ Autonoma Barcelona Bellaterra Spain Natl Ctr Atmospher Res Atmospher Chem Observat & Modeling Lab Boulder CO 80307 USA Catalan Inst Res & Adv Studies ICREA Barcelona Spain

Earth system models (ESM) demand significant hardware resources and energy consumption to solve atmospheric chemistry processes. Recent studies have shown improved performance from running these models on GPU accelerators. Nonetheless, there is room for improvement in exploiting even more GPU resources. This study proposes an optimized distribution of the chemical solver's computational load on the GPU, named Block-cells. Additionally, we evaluate different configurations for distributing the computational load in an NVIDIA GPU. We use the linear solver from the Chemistry Across Multiple Phases (CAMP) framework as our test bed. An intermediate-complexity chemical mechanism under typical atmospheric conditions is used. Results demonstrate a 35x speedup compared to the single-CPU thread reference case. Even using the full resources of the node (40 physical cores) on the reference case, the Block-cells version outperforms them by 50%. The Block-cells approach shows promise in alleviating the computational burden of chemical solvers on GPU architectures.

关键词： High-performance computing GPU acceleration Climate simulation algorithm design and analysis Performance evaluation Kernel optimization

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：