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

23rd Wind and Solar Integration Workshop, WIW 2024

作者： Hajtaleb, Salah Bahrani, Behrooz Electrical and Computer Systems Engineering Department Monash University Melbourne Australia

ISBN: (纸本)9781837242689

Grid-forming control is considered to be essential in the transition to renewables-dominated power systems. However, grid-forming Type-3 wind turbine generators present unique challenges due to their electromechanical coupling with the grid and the limited kinetic energy in their drive-trains. This prevents active power control methods that emulate synchronous-machine behaviour from delivering robust and stable performance in Type-3 turbines. These limitations become more evident during recovery from severe grid disturbances. To overcome these limitations, this paper proposes a lead-compensator (LC)-based approach for synchronisation and active-power control as an alternative to virtual-synchronous-generators (VSG). The proposed approach is intended to demonstrate that the system damping and the overall transient stability can be improved solely by altering the control structure. Therefore, several time-domain studies have been conducted under different grid-strength levels and current-limitation mechanisms, and the comparison of post-fault recovery performance of the two controllers are presented. The results show that excessive active power oscillations and rotor speed deviations observed with VSG control are substantially mitigated using the proposed LC approach. More importantly, this is achieved without compromising inertia and droop settings, or utilising frequency measurements. Reduced turbine mechanical stress and enhanced robustness are among the benefits of this approach. © Energynautics GmbH.

关键词： Kinetic energy

来源：评论

学校读者我要写书评

暂无评论

Python-Based Cross-Platform Impedance Benchmarking Tool (CroZBenMa) for IBR's EMT Models in Matlab/Simulink and PSCAD/EMTDC 10

Python-Based Cross-Platform Impedance Benchmarking Tool (Cro...

引用

10th IEEE International Power Electronics and Motion Control Conference, IPEMC 2024 ECCE Asia

作者： Zhou, Weihua Mohammed, Nabil Bahrani, Behrooz Monash University Department of Electrical and Computer Systems Engineering Melbourne Australia

ISBN: (纸本)9798350351330

This paper presents a Python-driven graphical user interface (GUI) explicitly crafted for benchmarking the electromagnetic transient (EMT) models of inverter-based resources (IBRs) across Matlab/Simulink and PSCAD/EMTDC platforms through impedance measurement techniques. The GUI ensures a user-friendly experience, enabling seamless interactions between these platforms while offering advanced visualization of impedance measurement results and associated benchmarking errors. This paper delves into the Python-based implementation that powers these features. Through a series of case studies, the tool's efficacy in benchmarking IBR's EMT models is validated. The benchmarking methodology and corresponding GUI design are extensible to other leading EMT platforms such as DIgSILENT/PowerFactory, PSSE, EMTP-RV, EMTP-ATP, and DSAToolsTM/SSAT, fostering expansive and holistic research in the stability analysis of the IBR-based modern power systems. © 2024 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Online Mechanism Design for Differentially Private Data Acquisition 63

Online Mechanism Design for Differentially Private Data Acqu...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Anjarlekar, Ameya Etesami, Rasoul Srikant, R. Uiuc Department of Electrical and Computer Engineering United States Uiuc Faculty of Electrical and Computer Engineering and Industrial and Systems Engineering United States Uiuc Faculty of Electrical and Computer Engineering United States

ISBN: (纸本)9798350316339

We address a problem involving a buyer seeking to train a logistic regression model by acquiring data from privacy-sensitive sellers. Along with compensating the sellers for their data, the buyer provides differential privacy guarantees to them where the payments depend on the privacy guarantees. In addition, each seller has a different privacy sensitivity associated with their data, which is the cost per unit of loss of privacy. The buyer transacts sequentially with the sellers, wherein the seller will disclose their privacy sensitivity, and the buyer immediately provides a payment and guarantees differential privacy. After receiving the payment, the seller provides their data to the buyer. The buyer's goal is to optimize a weighted combination of test loss and payments, i.e., achieve a tradeoff between getting a good ML model and limiting its payments. Additionally, the buyer must design the payments and differential privacy guarantees in an online fashion. Further, the online problem is historydependent, which adds to the challenge. Consequently, we design a payment mechanism that ensures incentive compatibility and individual rationality and is asymptotically optimal. Additionally, we also provide experimental results to validate our findings. © 2024 IEEE.

关键词： Logistic regression

来源：评论

学校读者我要写书评

暂无评论

Improvement of dynamic phosphene presentation for a cortical visual prosthesis is task-specific 46

Improvement of dynamic phosphene presentation for a cortical...

引用

46th Annual International Conference of the IEEE engineering in Medicine and Biology Society, EMBC 2024

作者： Wang, Haozhe Zac Wong, Yan Tat Monash University Department of Electrical and Computer Systems Engineering ClaytonVIC3800 Australia Monash University Department of Electrical and Computer Systems Engineering Department of Physiology ClaytonVIC3800 Australia

ISBN: (纸本)9798350371499

Cortical visual prostheses can restore vision by directly stimulating the neurons in the visual cortex. The goal of these prostheses is to elicit sufficient light perception, known as phosphenes, to represent complex scenes. However, stimulating a large number of electrodes in cortical visual prostheses can be problematic. This may result in distorted visual perception and failure to present the desired visual stimuli. Previous studies have successfully presented simple patterns, such as letters, by dynamically utilizing a single phosphene. To represent more complex scenes, we propose a new method of information presentation. This method limits the number of phosphenes elicited simultaneously while sequentially presenting the contours of a visual scene. We evaluated its effectiveness with 8 participants across four different tasks. We found that the improvement provided by this method is task-specific. Our findings underscore the importance of considering the temporal features of prosthetic vision in future designs. © 2024 IEEE.

关键词： Prosthetics

来源：评论

学校读者我要写书评

暂无评论

Latency Bounds for TSN Scheduling in the Presence of Clock Synchronization

IEEE Networking Letters

引用

IEEE Networking Letters 2025年第1期7卷 41-45页

作者： Ghosh, Aviroop Yousefi, Saleh Kunz, Thomas Carleton University Department of Systems and Computer Engineering OttawaONK1S 5B6 Canada Urmia University Department of Electrical and Computer Engineering Urmia57561-51818 Iran

The IEEE 802.1Qbv (80.21Qbv) standard is designed for traffic requiring deterministic and bounded latencies through strict periodic time synchronization, as specified by IEEE 802.1AS standard. However, internal clock drift in devices causes timing misalignment, introducing further challenges to 802.1Qbv scheduling. Existing solutions, using either complex optimization approaches or non-trivial scheduling heuristics, address this by scheduling frame transmissions only once they are guaranteed to have been fully received, even in the presence of clock drifts. However, this approach introduces additional delays that can impact deadline requirements. This letter analytically derives tight end-to-end latency bounds, allowing us to determine if stream deadlines for a given network will be violated without the need to solve for any scheduling algorithms. It also proposes an approach that results in tighter bounds based on information collected from the synchronization process. The analytical results are compared with simulation results, confirming their validity. © 2019 IEEE.

关键词： Synchronization Clocks Delays Standards Schedules Logic gates Scheduling algorithms Payloads Jitter Data models

来源：评论

学校读者我要写书评

暂无评论

Oversampling-Enhanced Feature Fusion-Based Hybrid ViT-1DCNN Model for Ransomware Cyber Attack Detection

引用

computer Modeling in engineering & Sciences 2025年第2期142卷 1667-1695页

作者： Muhammad Armghan Latif Zohaib Mushtaq Saifur Rahman Saad Arif Salim Nasar Faraj Mursal Muhammad Irfan Haris Aziz Department of Computer and Information System Cleveland State UniversityOhio44115USA Department of Electrical Electronics and Computer SystemsCollege of Engineering and TechnologyUniversity of SargodhaSargodha40100Pakistan Electrical Engineering Department College of EngineeringNajran UniversityNajran61441Saudi Arabia Department of Mechanical Engineering College of EngineeringKing Faisal UniversityAl Ahsa31982Saudi Arabia Department of Mechanical Industrial and Energy System EngineeringUniversity of SargodhaSargodha40100Pakistan

Ransomware attacks pose a significant threat to critical infrastructures,demanding robust detection *** study introduces a hybrid model that combines vision transformer(ViT)and one-dimensional convolutional neural network(1DCNN)architectures to enhance ransomware detection *** common challenges in ransomware detection,particularly dataset class imbalance,the synthetic minority oversampling technique(SMOTE)is employed to generate synthetic samples for minority class,thereby improving detection *** integration of ViT and 1DCNN through feature fusion enables the model to capture both global contextual and local sequential features,resulting in comprehensive ransomware *** on the UNSW-NB15 dataset,the proposed ViT-1DCNN model achieved 98%detection accuracy with precision,recall,and F1-score metrics surpassing conventional *** approach not only reduces false positives and negatives but also offers scalability and robustness for real-world cybersecurity *** results demonstrate the model’s potential as an effective tool for proactive ransomware detection,especially in environments where evolving threats require adaptable and high-accuracy solutions.

关键词： Ransomware attacks cybersecurity vision transformer convolutional neural network feature fusion encryption threat detection

来源：评论

学校读者我要写书评

暂无评论

Formulations and Approximations of Branch Flow Model for General Power Networks

引用

Journal of Modern Power systems and Clean Energy 2022年第5期10卷 1110-1126页

作者： Zhao Yuan Electrical Power Systems Laboratory(EPS-Lab) Department of Electrical and Computer EngineeringUniversity of IcelandReykjavikIceland IEEE

The formulations and approximations of the branch flow model for general(radial and mesh) power networks(General-BranchFlow) are given in this paper. Using different sets of the power flow equations, six formats of the exact General-BranchFlow model are listed. The six formats are mathematically equivalent with each other. Linear approximation and second-order cone programming(SOCP) are then used to derive the six formats of the convex General-BranchFlow model. The branch ampacity constraints considering the shunt conductance and capacitance of the transmission line Π-model are derived. The key foundation of deriving the ampacity constraints is the correct interpretation of the physical meaning of the transmission line Π-model. An exact linear expression of the ampacity constraints of the power loss variable is derived. The applications of the General-BranchFlow model in deriving twelve formats of the exact optimal power flow(OPF) model and twelve formats of the approximate OPF model are formulated and analyzed. Using the Julia programming language, the extensive numerical investigations of all formats of the OPF models show the accuracy and computational efficiency of the General-BranchFlow model. A penalty function based approximation gap reduction method is finally proposed and numerically validated to improve the AC-feasibility of the approximate General-BranchFlow model.

关键词： Branch flow linear approximation second-order cone programming ampacity constraint optimal power flow radial network mesh network

来源：评论

学校读者我要写书评

暂无评论

Computationally efficient reductions between some statistical models 36

Computationally efficient reductions between some statistica...

引用

36th International Conference on Algorithmic Learning Theory, ALT 2025

作者： Lou, Mengqi Bresler, Guy Pananjady, Ashwin School of Industrial and Systems Engineering Georgia Tech United States Department of Electrical Engineering and Computer Science MIT United States Schools of Industrial and Systems Engineering and Electrical and Computer Engineering Georgia Tech United States

We study the problem of approximately transforming a sample from a source statistical model to a sample from a target statistical model without knowing the parameters of the source model, and construct several computationally efficient such reductions between canonical statistical experiments. In particular, we provide computationally efficient procedures that approximately reduce uniform, Erlang, and Laplace location models to general target families. We illustrate our methodology by establishing nonasymptotic reductions between some canonical high-dimensional problems, spanning mixtures of experts, phase retrieval, and signal denoising. Notably, the reductions are structure-preserving and can accommodate missing data. We also point to a possible application in transforming one differentially private mechanism to another. © 2025 M. Lou, G. Bresler & A. Pananjady.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Reliable Task Offloading for 6G-Based IoT Applications

引用

computers, Materials & Continua 2025年第2期82卷 2255-2274页

作者： Usman Mahmood Malik Muhammad Awais Javed Ahmad Naseem Alvi Mohammed Alkhathami Department of Computer Software Engineering National University of Science and Technology(NUST)Islamabad44000Pakistan Department of Electrical and Computer Engineering COMSATS University IslamabadIslamabad45550Pakistan Information Systems Department College of Computer and Information SciencesImam Mohammad Ibn Saud Islamic University(IMSIU)Riyadh11432Saudi Arabia

Fog computing is a key enabling technology of 6G systems as it provides quick and reliable computing,and data storage services which are required for several 6G *** Intelligence(AI)algorithms will be an integral part of 6G systems and efficient task offloading techniques using fog computing will improve their performance and *** this paper,the focus is on the scenario of Partial Offloading of a Task to Multiple Helpers(POMH)in which larger tasks are divided into smaller subtasks and processed in parallel,hence expediting task ***,using POMH presents challenges such as breaking tasks into subtasks and scaling these subtasks based on many interdependent factors to ensure that all subtasks of a task finish simultaneously,preventing resource ***,applying matching theory to POMH scenarios results in dynamic preference profiles of helping devices due to changing subtask sizes,resulting in a difficult-to-solve,externalities *** paper introduces a novel many-to-one matching-based algorithm,designed to address the externalities problem and optimize resource allocation within POMH ***,we propose a new time-efficient preference profiling technique that further enhances time optimization in POMH *** performance of the proposed technique is thoroughly evaluated in comparison to alternate baseline schemes,revealing many advantages of the proposed *** simulation findings indisputably show that the proposed matching-based offloading technique outperforms existing methodologies in the literature,yielding a remarkable 52 reduction in task latency,particularly under high workloads.

关键词： 6G IoT task offloading fog computing

来源：评论

学校读者我要写书评

暂无评论

DASA: Delay-Adaptive Multi-Agent Stochastic Approximation 63

DASA: Delay-Adaptive Multi-Agent Stochastic Approximation

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Fabbro, Nicolo Dal Adibi, Arman Poor, H. Vincent Kulkarni, Sanjeev R. Mitra, Aritra Pappas, George J. University of Pennsylvania Electrical and Systems Engineering Department United States Princeton University Department of Electrical and Computer Engineering United States North Carolina State University Electrical and Computer Engineering Department United States

ISBN: (纸本)9798350316339

We consider a setting in which N agents aim to speedup a common Stochastic Approximation (SA) problem by acting in parallel and communicating with a central server. We assume that the up-link transmissions to the server are subject to asynchronous and potentially unbounded time-varying delays. To mitigate the effect of delays and stragglers while reaping the benefits of distributed computation, we propose DASA, a Delay-Adaptive algorithm for multi-agent Stochastic Approximation. We provide a finite-time analysis of DASA assuming that the agents' stochastic observation processes are independent Markov chains. Significantly advancing existing results, DASA is the first algorithm whose convergence rate depends only on the mixing time τm i x and on the average delay τa v g while jointly achieving an N-fold convergence speedup under Markovian sampling. Our work is relevant for various SA applications, including multi-agent and distributed temporal difference (TD) learning, Q-learning and stochastic optimization with correlated data. © 2024 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：