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

IEEE Energy Conversion Congress and Exposition, ECCE

作者： Yidi Shen Daniel Zakzewski Arafat Hasnain Rakesh Resalayyan Alireza Khaligh Department of Electrical and Computer Engineering and The Institute for Systems Research Maryland Power Electronics Laboratory University of Maryland College Park MD USA

Active power decoupling (APD) circuit is of great importance in single-phase photovoltaic (PV) inverter systems for eliminating the fluctuating power drawn from the PV panel. The control of APD circuit is the key to the power decoupling performance and maximum power point tracking (MPPT) efficiency. This paper proposes a control approach for parallel boost type APD circuit with a single sensor, reducing the count of sensors compared to the conventional APD control approach. Operation of the APD circuit with control approach utilizing only the readings from the decoupling capacitor voltage sensor is analyzed in this work. Specifically, controller design for the APD circuit with reduced sensor applicable to a 40 V, 400 W microinverter is presented and experimentally verified with a GaN-based prototype.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heart Failure: Machine Learning Prediction Within a 5-Year Framework 24

Heart Failure: Machine Learning Prediction Within a 5-Year F...

引用

24th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2024

作者： Tsarapatsani, Konstantina-Helen Tsakanikas, Vasilios D. Sakellarios, Antonis Trampisch, Hans J. Karapintzou, Efterpi Rudolf, Henrik Matsopoulos, George K. Fotiadis, Dimitrios I. Biomedical Research Institute Foundation for Research and Technology-Hellas Ioannina Greece Ruhr University Bochum Department of Medical Informatics Biometry and Epidemiology Bochum Germany University of Ioannina Unit of Medical Technology and Intelligent Information Systems Dept. of Materials Science and Engineering Greece Institute for Biostatistics and Informatics in Medicine and Ageing Research University Medical Center Rostock Germany School of Electrical and Computer Engineering National Technical University of Athens Athens Greece University of Ioannina and Biomedical Research Institute-FORTH Unit of Medical Technology and Intelligent Information Systems Dept. of Materials Science and Engineering Ioannina Greece

ISBN: (纸本)9798331518622

Heart failure (HF) is a complex syndrome that is affected by many factors and causes. It is crucial to early recognize the disease subtypes and the unidentified clinical pathways that give rise to it. Machine learning (ML) is the tool that assist to deal with these challenges and improve the prediction of HF. In this work, the HF risk prediction was implemented by employed ML classifiers, such as Random Forest (RF), Extreme Grading Boosting (XGBoost) and Light Gradient-Boosting Machine (LGBM). We utilized the data from the German epidemiological trial on ankle brachial index - getABI cohort, which includes 6,454 patients. The performance of classifiers was estimated by Accuracy (ACC), Sensitivity, Specificity and the area under the receiver operating characteristic curve (AUC) in mean values for each ML classifier. The results were also interpreted using the Explainable artificial intelligence (XAI) approach, the Shapley Additive exPlanations (SHAP) values. Our work reveals that LGBM classifier predict the HF risk within 5 years follow-up in general population with 68 % accuracy. Moreover, the N-terminal pro-B-type natriuretic peptide (NT-proBNP) was identified as the most important feature for HF risk prediction. © 2024 IEEE.

关键词： Risk perception

来源：评论

学校读者我要写书评

暂无评论

Dead-time Compensation Method for Bus-clamping Modulated Voltage Source Inverter

Dead-time Compensation Method for Bus-clamping Modulated Vol...

引用

IEEE Energy Conversion Congress and Exposition, ECCE

作者： Reza Asrar Ghaderloo Yidi Shen Chanaka Singhabahu Rakesh Resalayyan Alireza Khaligh Department of Electrical and Computer Engineering and The Institute for Systems Research Maryland Power Electronics Laboratory University of Maryland College Park MD USA

Bus-clamping Pulse Width Modulation (PWM) is an effective method to reduce the switching loss in a three-phase voltage source inverter (VSI). In bus-clamping PWM scheme, the phase legs are switched using high frequency PWM signals for two-third of the line cycle, while for the remaining duration of cycle, the pole voltage is clamped to either positive or negative rail of the DC bus. In PWM operation of a half bridge, a dead-time is applied between the gate signals of complementary switches to ensure safe and reliable operation. However, introduction of dead-time leads to poor power quality, increased Total Harmonic Distortion (THD) and variation in actual voltage compared to the intended pole voltage. Moreover, when the bus-clamping technique is used, the PWM has both high frequency switching region and clamped region in a line cycle, and consequently, the undesired effects of dead-time are further aggravated. Therefore, in order to enhance the quality of output voltage, this paper presents a dead-time compensation strategy for a VSI operating with bus-clamping PWM. The proposed method calculates the required compensation term to be added on the modulation signal considering wide range of operating conditions. Additionally, the compensation includes a new strategy for low current conditions near zero-crossing to avoid distortion. The proposed method is verified by simulation and experiments in a three-phase VSI with a switching frequency of 100 kHz and a fundamental frequency of 60Hz.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Survey of Distributed Algorithms for Resource Allocation over Multi-Agent systems

arXiv

引用

arXiv 2024年

作者： Doostmohammadian, Mohammadreza Aghasi, Alireza Pirani, Mohammad Nekouei, Ehsan Zarrabi, Houman Keypour, Reza Rikos, Apostolos I. Johansson, Karl H. Faculty of Mechanical Engineering Semnan University Semnan Iran Department of Electrical Engineering and Computer Science Oregon State University United States Department of Mechanical Engineering University of Ottawa OttawaON Canada City University of Hong Kong China Tehran Iran Faculty of Electrical Engineering Semnan University Semnan Iran Department of Electrical and Computer Engineering Division of Systems Engineering Boston University BostonMA United States Division of Decision and Control Systems KTH Royal Institute of Technology Sweden

Resource allocation and scheduling in multi-agent systems present challenges due to complex interactions and decentralization. This survey paper provides a comprehensive analysis of distributed algorithms for addressing the distributed resource allocation (DRA) problem over multi-agent systems. It covers a significant area of research at the intersection of optimization, multiagent systems, and distributed consensus-based computing. The paper begins by presenting a mathematical formulation of the DRA problem, establishing a solid foundation for further exploration. Real-world applications of DRA in various domains are examined to underscore the importance of efficient resource allocation, and relevant distributed optimization formulations are presented. The survey then delves into existing solutions for DRA, encompassing linear, nonlinear, primal-based, and dual-formulation-based approaches. Furthermore, this paper evaluates the features and properties of DRA algorithms, addressing key aspects such as feasibility, convergence rate, and network reliability. The analysis of mathematical foundations, diverse applications, existing solutions, and algorithmic properties contributes to a broader comprehension of the challenges and potential solutions for this domain. © 2024, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

MSMB-GCN: Multi-scale Multi-branch Fusion Graph Convolutional Networks for 3D Human Pose Estimation

MSMB-GCN: Multi-scale Multi-branch Fusion Graph Convolutiona...

引用

IEEE International Conference on robotics and Biomimetics

作者： Shanshan Ji Qiwei Meng Wen Wang Zheyuan Lin Te Li Minhong Wan Chunlong Zhang Jason Gu Research Center for Intelligent Robotics Research Institute of Interdisciplinary Innovation Zhejiang Laboratory Hangzhou China Department of Electrical and Computer Engineering Dalhousie University Halifax NS Canada

In human-robot interaction (HRI), human pose estimation is a necessary technology for the robot to perceive the dynamic environment and make interactive actions. Recently, graph convolutional networks (GCNs) have been increasingly used for 2D to 3D pose estimation tasks since the skeleton topologies can be viewed as graph structures. In this paper, we propose a novel graph convolutional network architecture, Multi-scale Multi-branch Fusion Graph Convolutional Networks (MSMB-GCN), for 3D Human Pose Estimation(3D HPE) task. The proposed model consists of multiple GCN blocks with a multi-branch architecture. This multi-branch architecture enables the model to get multi-scale features for human skeletal representations. The group of GCN blocks, which has strong multi-level feature extraction capabilities, allows the model to learn global and local features, lower-level and higher-level features. Experiment results on the HumanPose benchmark demonstrate that our model outperforms the state-of-the-art and ablation studies validate the effectiveness of our approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Validating a Chaos Based PRBG Under Different Chaotic Maps

Validating a Chaos Based PRBG Under Different Chaotic Maps

引用

2024 Panhellenic Conference on Electronics and Telecommunications, PACET 2024

作者： Moysis, Lazaros Lawnik, Marcin Volos, Christos Baptista, Murilo S. Fragulis, George F. Goudos, Sotirios K. University of Western Macedonia Department of Electrical and Computer Engineering Kozani Greece Aristotle University of Thessaloniki Laboratory of Nonlinear Systems - Circuits and Complexity Physics Department Thessaloniki Greece University of Western Macedonia Department of Mechanical Engineering Kozani Greece Silesian University of Technology Faculty of Applied Mathematics Department of Mathematics Applications and Methods for Artificial Intelligence Gliwice44-100 Poland Supa University of Aberdeen Institute for Complex Systems and Mathematical Biology Department of Physics AberdeenAB24 3UX United Kingdom Aristotle University of Thessaloniki ELEDIA@AUTH Physics Department Thessaloniki Greece

ISBN: (纸本)9798350318845

Chaos-based random bit generators are abundantly used in chaos-based encryption and security applications, as a fast, deterministic source of randomness, to perform actions like permutation and substitution. The chaotic map used as a source of randomness though may heavily affect the bit generator's statistical randomness, key space, and speed. Thus, any given bit generator may not be equally efficient for all the chaotic maps used as a seed. Motivated by this, the present work considers a bit generator that utilizes a common modulo-based hashing technique, and studies its performance under a plethora of different chaotic maps. For each map, the generator is evaluated with respect to randomness, key space, and operations per bit ratio. This analysis can serve as a guideline for random bit generator usage in future chaos-based encryption designs. © 2024 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Autoencoder and Teaching-learning-based Optimizer for Mobile Edge Computing System Optimization Problems

Autoencoder and Teaching-learning-based Optimizer for Mobile...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Dian Xu Mengchu Zhou Haitao Yuan Institute of Systems Engineering Macau University of Science and Technology Macao China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark USA School of Automation Science and Electrical Engineering Beihang University Beijing China

By using an autoencoder as a dimension reduction tool, an Autoencoder-embedded Teaching-Learning Based Optimization (ATLBO) has been proved to be effective in solving high-dimensional computationally expensive problems through several widely used function problems. However, the following two crucial issues have not been resolved, 1) ATLBO should be verified by solving real-life optimization problems; and 2) how autoencoder parameters and structures impact AEO's performance. In this work, ATLBO is verified by an energy consumption minimization problem (ECM) in mobile edge computing systems. To design an effective autoencoder for ATLBO, this work proposes a parameter tuning optimization strategy for autoencoders. By using the proposed Autoencoder Parameter Tuning (APT) strategy, ATLBO can enjoy higher robustness than those without it. The experimental results show that it is three to six times better than state-of-the-art methods in solving ECM. We consider the strategy-induced overhead and take the execution time as the primary criterion to evaluate them. In addition, the experimental results show that, against the conventional wisdom that higher-accuracy auto encoders bring higher system performance, lower-accuracy ones can actually assist ATLBO in locating the best solutions. This work promotes a novel application of autoencoders in optimization theory and practice.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal Control of Connected Automated Vehicles with Event-Triggered Control Barrier Functions: a Test Bed for Safe Optimal Merging

Optimal Control of Connected Automated Vehicles with Event-T...

引用

Control Technology and Applications (CCTA),

作者： Ehsan Sabouni H.M. Sabbir Ahmad Wei Xiao Christos G. Cassandras Wenchao Li Department of Electrical & Computer Engineering Division of Systems Engineering Boston University Boston MA USA Computer Science & Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA USA

We address the problem of safely coordinating a network of Connected and Automated Vehicles (CAVs) in conflict areas of a traffic network. Such problems can be solved through a combination of tractable optimal control problems and Control Barrier Functions (CBFs) that guarantee the satisfaction of all constraints. These solutions can be reduced to a sequence of Quadratic Programs (QPs) which are efficiently solved online over discrete time steps. However, guaranteeing the feasibility of the CBF-based QP method within each discretized time interval requires the careful selection of time steps which need to be sufficiently small. This creates computational requirements and communication rates between agents which may limit the controller’s application to real CAVs. We tackle this limitation by adopting an event-triggered control approach for CAVs such that the next QP is triggered by properly defined events with a safety guarantee. We present a laboratory-scale test bed developed to emulate merging roadways using mobile robots as CAVs. We present results to demonstrate how the event-triggered scheme is computationally efficient and can handle measurement uncertainties and noise compared to time-driven control while guaranteeing safety.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Tube-based Control Synthesis of Stochastic Multi-Agent systems under Signal Temporal Logic

Probabilistic Tube-based Control Synthesis of Stochastic Mul...

引用

IEEE Conference on Decision and Control

作者： Eleftherios E. Vlahakis Lars Lindemann Pantelis Sopasakis Dimos V. Dimarogonas Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Computer Science Viterbi School of Engineering University of Southern California Los Angeles CA USA School of Electronics Electrical Engineering and Computer Science Queen’s University Belfast Northern Ireland UK

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

We consider the control design of stochastic discrete-time linear multi-agent systems (MASs) under a global signal temporal logic (STL) specification to be satisfied at a predefined probability. By decomposing the dynamics into deterministic and error components, we construct a probabilistic reachable tube (PRT) as the Cartesian product of reachable sets of the individual error systems driven by disturbances lying in confidence regions (CRs) with a fixed probability. By bounding the PRT probability with the specification probability, we tighten all state constraints induced by the STL specification by solving tractable optimization problems over segments of the PRT, and relax the underlying stochastic problem with a deterministic one. This approach reduces conservatism compared to tightening guided by the STL structure. Additionally, we propose a recursively feasible algorithm to attack the resulting problem by decomposing it into agent-level subproblems, which are solved iteratively according to a scheduling policy. We demonstrate our method on a ten-agent system, where existing approaches are impractical.

关键词： Control design Scalability Linearity Probabilistic logic Scheduling Optimization Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Optimal Constrained Task Planning as Mixed Integer Programming

arXiv

引用

arXiv 2022年

作者： Adu-Bredu, Alphonsus Devraj, Nikhil Jenkins, Odest Chadwicke The Robotics Institute Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI United States

For robots to successfully execute tasks assigned to them, they must be capable of planning the right sequence of actions. These actions must be both optimal with respect to a specified objective and satisfy whatever constraints exist in their world. We propose an approach for robot task planning that is capable of planning the optimal sequence of grounded actions to accomplish a task given a specific objective function while satisfying all specified numerical constraints. Our approach accomplishes this by encoding the entire task planning problem as a single mixed integer convex program, which it then solves using an off-the-shelf Mixed Integer Programming solver. We evaluate our approach on several mobile manipulation tasks in both simulation and on a physical humanoid robot. Our approach is able to consistently produce optimal plans while accounting for all specified numerical constraints in the mobile manipulation tasks. Open-source implementations of the components of our approach as well as videos of robots executing planned grounded actions in both simulation and the physical world can be found at this url: https://***/gtpmip © 2022, CC BY.

关键词： Anthropomorphic robots

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：