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

50th Annual Conference of the IEEE Industrial Electronics Society, IECON 2024

作者： Davarpanah, Gholamreza Mohammadi, Sajjad Kirtley, James L. Department of Electrical Engineering Amirkabir University of Technology Tehran Iran Department of Electrical Engineering and Computer Science MIT Cambridge United States

ISBN: (纸本)9781665464543

This paper investigates the optimized combination of rotor and stator teeth in a three-phase switched reluctance motor featuring a connected C-core topology to attain a larger winding area and, thus, a higher electrical loading capability, leading to a higher torque density. The general formulation is discussed. Additionally, the shorter flux path within the design leads to a reduced core loss. The finite element method is employed in the design and field analysis. A comparison with a conventional motor shows the superiority of the proposed configuration. The optimized design is prototyped and tested. Both static and dynamic torques are extracted. A good correlation between simulation and experimental results is observed. © 2024 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

FEDERATED NEURAL BANDITS 11

FEDERATED NEURAL BANDITS

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Dai, Zhongxiang Shu, Yao Verma, Arun Fan, Flint Xiaofeng Low, Bryan Kian Hsiang Jaillet, Patrick Department of Computer Science National University of Singapore Singapore Department of Electrical Engineering and Computer Science MIT United States

Recent works on neural contextual bandits have achieved compelling performances due to their ability to leverage the strong representation power of neural networks (NNs) for reward prediction. Many applications of contextual bandits involve multiple agents who collaborate without sharing raw observations, thus giving rise to the setting of federated contextual bandits. Existing works on federated contextual bandits rely on linear or kernelized bandits, which may fall short when modeling complex real-world reward functions. So, this paper introduces the federated neural-upper confidence bound (FN-UCB) algorithm. To better exploit the federated setting, FN-UCB adopts a weighted combination of two UCBs: UCBa allows every agent to additionally use the observations from the other agents to accelerate exploration (without sharing raw observations), while UCBb uses an NN with aggregated parameters for reward prediction in a similar way to federated averaging for supervised learning. Notably, the weight between the two UCBs required by our theoretical analysis is amenable to an interesting interpretation, which emphasizes UCBa initially for accelerated exploration and relies more on UCBb later after enough observations have been collected to train the NNs for accurate reward prediction (i.e., reliable exploitation). We prove sub-linear upper bounds on both the cumulative regret and the number of communication rounds of FN-UCB, and empirically demonstrate its competitive performance. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Federated Learning: Attacks, Defenses, Opportunities and Challenges 11

Federated Learning: Attacks, Defenses, Opportunities and Cha...

引用

11th International Symposium on Telecommunication, IST 2024

作者： Shirvani, Ghazaleh Ghasemshirazi, Saeid Beigzadeh, Behzad Carleton University School of Computer Science Ottawa Canada Tarbiat Modares University Department of Electrical and Computer Engineering Tehran Iran

ISBN: (纸本)9798350356250

Using dispersed data and training, federated learning (FL) moves AI capabilities to edge devices or does tasks locally. Many consider FL the start of a new era in AI, yet it is still immature. FL has not garnered the community's trust since its security, and privacy implications are controversial FL's security and privacy concerns must be discovered, analyzed, and recorded before widespread usage and adoption. A solid comprehension of risk variables allows an FL practitioner to construct a secure environment and provide researchers with a clear perspective of potential study fields, making FL the best solution in situations where security and privacy are primary issues. This research aims to deliver a complete overview of FL's security and privacy features to help bridge the gap between current federated AI and broad adoption in the future. In this paper, we present a comprehensive overview of the attack surface to investigate FL's existing challenges and defense measures to evaluate its robustness and reliability. According to our study, security concerns regarding FL are more frequent than privacy issues. Communication bottlenecks, poisoning, and backdoor attacks represent FL's privacy's most significant security threats. In the final part, we detail future research that will assist FL in adapting to real-world settings. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Optical Flow Estimation in Dense Foggy Scenes with Domain-Adaptive Networks

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第6期4卷 1777-1788页

作者： Yan, Wending Sharma, Aashish Tan, Robby T. National University of Singapore Electrical and Computer Engineering Department Singapore Singapore Agency for Science Technology and Research Singapore Singapore

Estimating optical flow in dense foggy scenes is a challenging task. The basic assumptions for computing flow such as brightness and gradient constancy become invalid. To address the problem, we introduce a semisupervised deep learning method that can learn from real fog images without requiring the corresponding optical flow ground-truths. Our method is a multitask network, integrating the domain transformation and optical flow networks in one framework. The domain transformation is performed between foggy and clean domains. Under our semisupervised training strategy, we train our method in a supervised manner with a pair of synthetic fog images, their corresponding clean images and optical flow ground-truths. Subsequently, given a pair of real fog images and a pair of clean images that are not corresponding to each other (unpaired), in the next training batch, we train our network in an unsupervised manner. The supervised and unsupervised training processes are alternated iteratively. Since our method relies on unsupervised learning for real data, we show that it can be used for test-time training. We show in our experiments that performing test-time training improves the results further on our test data. Extensive experiments show that our method outperforms the state-of-the-art methods in estimating optical flow in dense foggy scenes. © 2020 IEEE.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Priority based k-coverage hole restoration and m-connectivity using whale optimization scheme for underwater wireless sensor networks

引用

International Journal of Intelligent Networks 2023年第1期4卷 240-252页

作者： Kumari, Sangeeta Mishra, Pavan Kumar Sangaiah, Arun Kumar Anand, Veena School of Computer Science Engineering and Technology Bennett University U.P Greater Noida India India Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon India

Coverage hole restoration and connectivity is a typical problem for underwater wireless sensor networks. In underwater applications like underwater oilfield reservoirs, undersea minerals and monitoring etc., where nodes face many hurdles and are unable to cover the required region during a natural disaster such as tsunami, flood, earthquakes, and environmental interference. It creates a coverage hole and consumes high energy with bad network quality. This problem considered as an NP-complete problem where a set of sensor nodes is required to identify the k-coverage hole and m-connectivity. In the literature, researchers have not focused on k-coverage hole restoration and m-connectivity issues during natural disasters and environmental interference. To mitigate this problem, we proposed priority-based coverage hole restoration and -connection using a whale optimization scheme to restore coverage holes and extract relevant information for the construction of undersea oilfield reservoirs, minerals, and mines. In this scheme, we identified the list of k-coverage holes and addressed autonomous underwater vehicles (AUVs) to place the additional mobile nodes in an appropriate coverage hole. A novel multi-objective function is formulated to obtain the optimal path for AUVs. Furthermore, while restoring coverage holes, we checked the connectivity of nodes. In the network, each node coordinated sleep scheduling with neighbor nodes to maintain energy efficiency. Performance evaluation of the proposed scheme shows better results than the existing schemes under different network scenarios which provide maximum coverage and connectivity, less energy consumption with a high convergence rate. © 2023 The Authors

关键词： Autonomous underwater vehicles

来源：评论

学校读者我要写书评

暂无评论

HDXpose: Harnessing Hyperdimensional Computing’s Explainability for Adversarial Attacks 24

HDXpose: Harnessing Hyperdimensional Computing’s Explainabi...

引用

43rd International Conference on computer-Aided Design, ICCAD 2024

作者： Asgarinejad, Fatemeh Pozina, Flavio Gungor, Onat Rosing, Tajana Aksanli, Baris Department of Computer Science and Engineering UC San Diego La Jolla CA92093 United States Department of Electrical and Computer Engineering SDSU CA92182 United States

ISBN: (纸本)9798400710773

Hyperdimensional Computing (HDC), a promising alternative to address the limitations of edge devices, is not exempt from the security challenges confronted by machine learning algorithms, in particular, adversarial attacks. The limited body of research exploring the security implications of HDC overlooks its inherent algorithm. In this paper, we propose a novel and effective adversarial attack technique targeting HDC. Our approach analyzes and prioritizes the impact of input features as well as encoded elements on decision boundaries and perturbs the input towards incorrect decisions in a guided manner. We evaluate our method on different datasets and attack models (i.e., untargeted/targeted, white-box/gray-box). Experimental results indicate that our proposed design, HDXpose, significantly outperforms the state-of-the-art attack techniques by achieving higher success rate with smaller distortion and execution time, rendering its efficacy for real-time attack generation. © 2024 Copyright is held by the owner/author(s).

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Design of a Model-Free Controller based on Predictive Functional Control

IEEJ Transactions on Electronics, Information and Systems

引用

IEEJ Transactions on Electronics, Information and Systems 2024年第1期144卷 15-20页

作者： Ashida, Yoichiro Katayama, Masaru Department of Electrical Engineering and Computer Science National Institute of Technology Matsue College 14-4 Nishi-Ikuma Shimane Matsue690-8518 Japan

Intelligent-PID (i-PID) control proposed by Fliess is a simple control algorithm. The controller is designed based on ultra-local model, and consisted of PID type controller and derivatives of reference signal and controlled variables. Authors have considered discrete i-PID controller and its properties, and one of the result was that PD controller was sufficient in discrete time domain. In discrete i-PID controller, PD type controller is still required to ensure convergence of controlled error to zero, and PD type parameters affects convergence property, fast-response property and stability. In this paper, predictive functional control (PFC) based on an ultra-local model is proposed. By introducing of PFC, controlled variable converge to reference value without PD type controller. User-specified parameters of the proposed controller is smaller than the conventional i-PID controller. Characteristics of the proposed controller are compared with discrete i-PID controller by numerical examples. © 2024 The Institute of electrical Engineers of Japan.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

RISK-AWARE REINFORCEMENT LEARNING WITH COHERENT RISK MEASURES AND NON-LINEAR FUNCTION APPROXIMATION 11

RISK-AWARE REINFORCEMENT LEARNING WITH COHERENT RISK MEASURE...

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Lam, Thanh Verma, Arun Low, Bryan Kian Hsiang Jaillet, Patrick Department of Computer Science National University of Singapore Singapore Department of Electrical Engineering and Computer Science MIT United States

We study the risk-aware reinforcement learning (RL) problem in the episodic finite-horizon Markov decision process with unknown transition and reward functions. In contrast to the risk-neutral RL problem, we consider minimizing the risk of having low rewards, which arise due to the intrinsic randomness of the MDPs and imperfect knowledge of the model. Our work provides a unified framework to analyze the regret of risk-aware RL policy with coherent risk measures in conjunction with non-linear function approximation, which gives the first sub-linear regret bounds in the setting. Finally, we validate our theoretical results via empirical experiments on synthetic and real-world data. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

引用

International Journal of Information and Communication Technology 2024年第2期24卷 145-155页

作者： Wang, Kaiku Huang, Congkuan Yang, Yang Department of Computer Science and Technology Beijing University of Aeronautics and Astronautics Beijing100191 China Department of Electrical Engineering and Automation Hefei University of Technology Hefei230009 China

Aiming at the problem of low precision and large cleaning error in multi-link similar data mining, a multi-link similar data mining cleaning method based on Bayesian algorithm is proposed in this paper. On the basis of extracting multi-link data, the data is preprocessed and the similarity between the data is calculated. The data with high similarity is input into the Bayesian network, and the data cleaning process is completed according to the maximum likelihood value of the data. Experimental results show that the mining accuracy of the proposed method for similar data can reach 98.51%, and the cleaning error is about 1.22%, indicating that the proposed method can more effectively complete the mining and cleaning of similar data in multi-links. Copyright © 2024 Inderscience Enterprises Ltd.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Enhancing Time Series Prediction in Industrial Processes: A Self-Attention BiLSTM Approach 7

Enhancing Time Series Prediction in Industrial Processes: A ...

引用

7th International Conference on Robotics, Control and Automation engineering, RCAE 2024

作者： Wen, Sicheng Xu, Jiajun University of Engineering Science Department of Electronic and Electrical Engineering Shanghai Shanghai China University of Shanghai for Science and Technology Department of Optical-Electrical and Computer Engineering Shanghai China

ISBN: (纸本)9798350355642

The development of data-driven soft sensors for modeling complex data, particularly in scenarios characterized by strong nonlinearity, high dimensionality, cross-correlation and autocorrelation, remains a significant challenge in process data analysis. Bidirectional Long Short-Term Memory (BiLSTM) networks are highly effective in capturing both forward and backward dependencies within sequences, thereby enhancing the extraction of temporal features from time series data. However, BiLSTM networks may struggle to capture global dependencies, especially in long sequences. To address this limitation, the self-attention mechanism, which excels in modeling global relationships across all positions in the input sequence, can be integrated with BiLSTM by applying weighted attention to the two different directions of BiLSTM, thereby enhancing its performance. This study proposes a novel method called SA-BiLSTM, which combines the strengths of the BiLSTM network and the self- attention mechanism. The self-attention layer captures global dependencies, while the BiLSTM layer extracts comprehensive temporal features in both directions, which are then passed to a fully connected layer for final prediction. Extensive comparisons with traditional methods such as BiLSTM, LSTM with added self-attention mechanism, LSTM, RNN, and SVM validate the superior performance of the proposed SA-BiLSTM method in handling complex time series data. © 2024 IEEE.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：