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

3rd IEEE International Virtual Conference on Innovations in Power and Advanced Computing Technologies, i-PACT 2021

作者： Kumar, K. Vinoth Sujitha, S. Stalin, B. Buvana, D. Josh, F.T. Vinodha, K. Ramya, K.C. Saravanakumar, R. Logeswaran, D. New Horizon College of Engineering Department of Electrical and Electronics Engineering Bengaluru India Dr. MGR Polytechnic College Department of Electrical and Electronics Engineering Arni India Dhanalakshmi College of Engineering Department of Electrical and Electronics Engineering Chennai India Karunya Institute of Technology and Sciences Department of Electrical and Electronics Engineering Coimbatore India PES University Electronic City Campus Department of Computer Science Engineering Bengaluru India Sri Krishna College of Engineering and Technology Department of Electrical and Electronics Engineering Coimbatore India School of Electrical Engineering Vellore Institute of Technology Department of Control and Automation Vellore India Kongu Engineering College Department of Electrical and Electronics Engineering Perundurai India

ISBN: (纸本)9781665426916

This paper outlines potential demand for electric vehicles, charging station infrastructure and its challenges for the India scenario, as well as the increasing liberalization and expansion of production, transmission and distribution. Distributed and renewable electricity generation and distribution, as well as market processes related to energy allocation and energy mix. is the subject of evolutionary development with improved performance and reliability. Structural analysis of respective parameters was performed for the commercial scope of electric vehicles in the existing energy market and regulatory concerns are taken into account to describe a scenario in which a company global control of electric vehicle charging and service provision of ancillary networks. Experimental results show confirmatory results. © 2021 IEEE.

关键词： Commercial vehicles

来源：评论

学校读者我要写书评

暂无评论

A Machine-learning and Discrete Multi-verse-optimizer-based Hybrid Method for Feature Selection

A Machine-learning and Discrete Multi-verse-optimizer-based ...

引用

IEEE International Conference on Networking, Sensing and control

作者： Shuo Zhang YingJun Ji XiWang Guo ShuJin Qin Qi Kang Moitrayee Chatterjee Information and Control Engineering Liaoning Petrochemical University Fushun China Faculty of Information Liaoning University Shenyang China Economics and Management Shangqiu Normal University Shangqiu China Electrical and Computer Engineering New Jersey Institute of Technology Newark New Jersey USA Department of Computer Science New Jersey City University New Jersey USA

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Accurately identifying key quality features can significantly streamline the manufacturing process by reducing the number of controlled variables and enhancing product quality prediction. To maximize prediction accuracy while minimizing the number of features, this study proposes a Machine-learning and Discrete Multi-verse-optimizer-based Hybrid method called MDMH. MDMH combines machine learning and the discrete Multi-verse optimizer, utilizing hierarchical clustering for effective feature grouping and employing a wrapper technique to find the optimal solution. After comparing its results with those of the exact solver and other intelligent optimization methods, the proposed method demonstrates superiority in terms of accuracy.

关键词： Accuracy Manufacturing processes Process control Optimization methods Machine learning Feature extraction Product design Quality assessment Sensors Manufacturing

来源：评论

学校读者我要写书评

暂无评论

Game Theory for Autonomy: From Min-Max Optimization to Equilibrium and Bounded Rationality Learning

Game Theory for Autonomy: From Min-Max Optimization to Equil...

引用

American control Conference (ACC)

作者： Kyriakos G. Vamvoudakis Filippos Fotiadis João P. Hespanha Raphael Chinchilla Guosong Yang Mushuang Liu Jeff S. Shamma Lacra Pavel Daniel Guggenheim School of Aerospace Engineering Georgia Institute of Technology Atlanta GA USA Center for Control Dynamical Systems and Computation University of California Santa Barbara CA Department of Electrical and Computer Engineering Rutgers University Piscataway NJ USA Department of Mechanical and Aerospace Engineering University of Missouri Columbia MO USA Department of Industrial and Enterprise Systems Engineering University of Illinois at Urbana-Champaign IL USA Department of Electrical and Computer Engineering University of Toronto Canada

Finding Nash equilibria in non-cooperative games can be, in general, an exceptionally challenging task. This is owed to various factors, including but not limited to the cost functions of the game being nonconvex/nonconcave, the players of the game having limited information about one another, or even due to issues of computational complexity. The present tutorial draws motivation from this harsh reality and provides methods to approximate Nash or min-max equilibria in non-ideal settings using both optimization- and learning-based techniques. The tutorial acknowledges, however, that such techniques may not always converge, but instead lead to oscillations or even chaos. In that respect, tools from passivity and dissipativity theory are provided, which can offer explanations about these divergent behaviors. Finally, the tutorial highlights that, more frequently than often thought, the search for equilibrium policies is simply vain; instead, bounded rationality and non-equilibrium policies can be more realistic to employ owing to some players’ learning imperfectly or being relatively naive – "bounded rational." The efficacy of such plays is demonstrated in the context of autonomous driving systems, where it is explicitly shown that they can guarantee vehicle safety.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optical Data Center Implementation within Data Center Networks Context Based on Mininet

Optical Data Center Implementation within Data Center Networ...

引用

electrical, Energy, and Artificial Intelligence (EICEEAI), International engineering Conference on

作者： Esraa Ali Abdulmahdi Adnan Hussein Ali Raed Khalid Ibrahim Ali Al-Askery Hayder Jasim Alhamdane Amal Ibrahim Mahmood Student at Dept. of Computer Engineering Techniques Electrical Engineering College Middle Technical University Baghdad Iraq Electrical Techniques Department Institute of Technology Middle Technical University Baghdad Iraq Department of Medical Instruments Engineering Techniques Al-Farahidi University Baghdad Iraq Department of Control and Automation Technical Engineering Electrical Engineering College Middle Technical University Baghdad Iraq College of Applied Arts Middle Technical University Baghdad Iraq Dept. of Computer Engineering Techniques Electrical Engineering College Middle Technical University Baghdad Iraq

ISBN: (数字)9798350373363

ISBN: (纸本)9798350373370

The technology of reconfigurable optical networks (RONs) is growing to be a promising solution to effectively cater to the rapidly increasing traffic generated by the digital society. Optical technology emerges as a viable alternative because to its capacity to offer a substantial bandwidth, little latency, and enhanced overall performance. Nevertheless, it is imperative to effectively manage the physical resources comprising a data center. This study provides an experimental demonstration of the RONs, which is enhanced by a control plane. The implementation relies on the monitoring of real-time network statistics. This enables the execution of various activities, including as network slice provisioning and reconfiguration, assignment of packet priority classes, and dynamic operations. These actions are performed to ensure the attainment of the desired Quality of Service level. The experimental results show the successfully implementation of RONs using Mininet Emulator and sFlow traffic monitoring technology. The results approve that optical datacenter has minimum delay with low OSNR even with long distance and fast switching time.

关键词： Data centers Optical switches Optical fiber networks Traffic control Real-time systems Service-oriented architecture Monitoring

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE Transactions on Instrumentation and Measurement 2024年 1-1页

作者： Wu, Jin Wang, Chaoqun Li, Chong Jiang, Yi Zhang, Chengxi Huang, Yulong Qi, Yuhua Xue, Bohuan Jiao, Jianhao Fan, Rui Zhang, Wei Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong China School of Control Science and Engineering Shandong University Jinan China Department of Automation and Measurement Ocean University of China Qingdao China Department of Electrical Engineering City University of Hong Kong Hong Kong China School of Internet of Things Jiangnan University Wuxi China Department of Automation Harbin Engineering University Harbin China School of Systems Science and Engineering Sun Yat-Sen University China College of Electronics and Information Engineering Tongji University Shanghai China

Similarity transformation problems are important in robotic instrumentation and computer vision based measurements since in many cases the information of visually observed scene scale is unknown and must be restored for accurate 3-dimensional reconstruction. In existing solvers, the scale is often considered as a scalar, i.e., isotropic, which may be invalid for anisotropic-scale setups. This paper exploits some mathematical coincidences that will lead to efficient solution to these problems. Possible further applications also include hand-eye calibration and structure-from-motion. We revisit pose estimation problems within the framework of similarity transformation, the one that considers scale-stretching, rotation and translation simultaneously. Two major problems are taken into account, i.e., the scale-stretching point-cloud registration and perspective-n-points (PnP). It has been found out that these two problems are quite similar. Moreover, we solve the anisotropic-scale registration problem that is important and is a remaining unsolved one in previous literatures. To compute the globally optimal solution of these non-convex problems, algebraic solution is obtained to compute all local minima using computationally efficient methods. The designed algorithm is deployed for robotic-arm pose estimation. We also extend the algorithm for solving the problem of robust magnetometer calibration. Visual pose experiments verify the superiority of the proposed method compared with representatives, including P3P, Lambda-Twist P3P and EPnP, which can be reproduced by repository in https://***/zarathustr/APnP. IEEE

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

GBMIA: Gradient-based Membership Inference Attack in Federated Learning

GBMIA: Gradient-based Membership Inference Attack in Federat...

引用

IEEE International Conference on Communications (ICC)

作者： Xiaodong Wang Naiyu Wang Longfei Wu Zhitao Guan Xiaojiang Du Mohsen Guizani School of Control and Computer Engineering North China Electric Power University China Department of Mathematics & Computer Science Fayetteville State University Fayetteville NC USA Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken NJ USA Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence Abu Dhabi UAE

Membership inference attack (MIA) has been proved to pose a serious threat to federated learning (FL). However, most of the existing membership inference attacks against FL rely on the specific attack models built from the target model behaviors, which make the attacks costly and complicated. In addition, directly adopting the inference attacks that are originally designed for machine learning models into the federated scenarios can lead to poor performance. We propose GBMIA, an attack model-free membership inference method based on gradient. We take full advantage of the federated learning process by observing the target model's behaviors after gradient ascent tuning. And we combine prediction correctness and the gradient norm-based metric for membership inference. The proposed GBMIA can be conducted by both global and local attackers. We conduct experimental evaluations on three real-world datasets to demonstrate that GBMIA can achieve a high attack accuracy. We further apply the arbitration mechanism to increase the effectiveness of GBMIA which can lead to an attack accuracy close to 1 on all three datasets. We also conduct experiments to substantiate that clients going offline and the overlap of clients' training sets have great effect on the membership leakage in FL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sensing metric-based hybrid underlay/overlay transmission framework for CR-IoT networks for smart city applications

Sensing metric-based hybrid underlay/overlay transmission fr...

引用

7th IET Smart Cities Symposium (SCS 2023)

作者： Indu Bala Maad M. Mijwil Mostafa Abotaleb El-Sayed M. El-kenawy Abdelhameed Ibrahim School of Electrical and Electronics Engineering Lovely Professional University Punjab India Computer Techniques Engineering Department Baghdad College of Economic Sciences University Baghdad Iraq Department of System Programming South Ural State University Chelyabinsk Russia Department of Communications and Electronics Delta Higher Institute of Engineering and Technology Egypt Computer Engineering and Control Systems Department Faculty of Engineering Mansoura University Mansoura Egypt

With the increasing number of IoT devices, there is a growing need for bandwidth to support their communication. Unfortunately, there is a shortage of available bandwidth due to preallocated bands for various services. To address this issue, Cognitive Internet of Things (CR-IoT) enables devices to optimize their efficiency and enhance their communication capabilities by intelligently accessing available bandwidth. This is achieved through the use of soft sensing metrics, where devices continuously monitor the RF environment and transmit data opportunistically in overlay mode if a free channel is detected, or in underlay mode if not. In this paper, a soft sensing metric based hybrid transmission framework is proposed for CR-IoT devices to meet the data rate requirement for the smart city applications. The efficacy of this approach is demonstrated through simulation results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization for Quadratic Cost Functions over Large-Scale Networks with Quantized Communication and Finite-Time Convergence

arXiv

引用

arXiv 2023年

作者： Rikos, Apostolos I. Grammenos, Andreas Kalyvianaki, Evangelia Hadjicostis, Christoforos N. Charalambous, Themistoklis Johansson, Karl H. The Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden The Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom The Alan Turing Institute London United Kingdom The Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia1678 Cyprus

We propose two distributed iterative algorithms that can be used to solve, in finite time, the distributed optimization problem over quadratic local cost functions in large-scale networks. The first algorithm exhibits synchronous operation whereas the second one exhibits asynchronous operation. Both algorithms share salient features. Specifically, the algorithms operate exclusively with quantized values, which means that the information stored, processed and exchanged between neighboring nodes is subject to deterministic uniform quantization. The algorithms rely on event-driven updates in order to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage. Finally, once the algorithms converge, nodes distributively terminate their operation. We prove that our algorithms converge in a finite number of iterations to the exact optimal solution depending on the quantization level, and we present applications of our algorithms to (i) optimal task scheduling for data centers, and (ii) global model aggregation for distributed federated learning. We provide simulations of these applications to illustrate the operation, performance, and advantages of the proposed algorithms. Additionally, it is shown that our proposed algorithms compare favorably to algorithms in the current literature. Quantized communication and asynchronous updates increase the required time to completion, but finite-time operation is maintained. © 2023, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

CRB-Rate Tradeoff in RSMA-enabled Near-Field Integrated Multi-Target Sensing and Multi-User Communications

arXiv

引用

arXiv 2025年

作者： Zhou, Jiasi Zhou, Cong Sun, Yanjing Tellambura, Chintha School of Medical Information and Engineering Xuzhou Medical University Xuzhou221004 China School of Electronic and Information Engineering Harbin Institute of Technology Harbin150001 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada

Extremely large-scale antenna arrays enhance spectral efficiency and spatial resolution in integrated sensing and communication (ISAC) networks while expanding the Rayleigh distance, triggering a shift from conventional far-field plane waves to near-field (NF) spherical waves. However, full-digital beamforming is infeasible due to the need for dedicated radio frequency (RF) chains. To address this, NF-ISAC with a rate-splitting multiple access (RSMA) scheme is developed for advanced interference management, considering fully-connected and partially-connected hybrid analog and digital (HAD) beamforming architectures. Specifically, the Cramér-Rao bound (CRB) for joint distance and angle sensing is derived, and the achievable performance region between the max-min communication rate and the multi-target CRB is defined. To fully characterize the Pareto boundary of the CRB-rate region, a sensing-centric minimization problem is formulated under communication rate constraints for two HAD beamforming architectures. A penalty dual decomposition (PDD)-based double-loop algorithm is developed to optimize fully-connected HAD beamformers. To reduce computational complexity, a two-stage design algorithm for fully connected HAD beamforming is also proposed. Additionally, the PDD-based double-loop algorithm is extended to the partially-connected HAD architecture. Simulations demonstrate the proposed schemes and algorithms: 1) achieve performance comparable to a fully digital beamformer with fewer RF chains, 2) outperform space division multiple access and far-field ISAC, and 3) yield enhanced CRB-rate trade-off performance. Copyright © 2025, The Authors. All rights reserved.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

Robust Phase Retrieval from Quantized and Noisy Measurements

Robust Phase Retrieval from Quantized and Noisy Measurements

引用

Acoustics, Speech, and Signal Processing Workshops (ICASSPW), IEEE International Conference on

作者： Yihong Gao Luteng Zhu Zhuoyang An Mingjie Shao Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong SAR China School of Information Science and Engineering Shandong University Qingdao China Computer School Beijing Information Science and Technology University Beijing China Key Laboratory of System and Control AMSS Chinese Academy of Sciences Beijing China

ISBN: (数字)9798331519315

ISBN: (纸本)9798331519322

The phase retrieval (PR) problem involves recovering a signal from amplitude-only measurements and has been extensively studied in various physical measurement and signal processing systems. Recently, there has been increasing interest in the quantized phase retrieval (QPR) problem, where the observed amplitude is quantized to binary values. The existing studies have focused on the noiseless case. In this paper, we address a robust QPR problem that accounts for both quantization and noise. We formulate the robust QPR problem using maximum-likelihood estimation (MLE), which results in a non-convex and challenging optimization problem due to the complexity of its likelihood function. To obtain a high-quality solution, we develop an expectation-maximization (EM) algorithm combined with the Wirtinger flow, allowing us to convert the problem into a more manageable form at each iteration. Our method is implemented on both randomly generated synthetic data and image reconstruction tasks. The results demonstrate that our approach significantly enhances signal recovery performance under the combined effects of quantization and noise. Additionally, the proposed method exhibits better runtime efficiency compared to existing approaches.

关键词： Maximum likelihood estimation Phase measurement Quantization (signal) Runtime Noise Signal processing algorithms Noise measurement Speech processing Optimization Synthetic data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：