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

International Conference on control, Automation and Diagnosis (ICCAD)

作者： Kamal Shahid Muhammad Majid Gulzar Muhammad Ali Raza Salman Habib Hasnain Ahmad Institute of Electrical Electronics and Computer Engineering University of the Punjab Lahore Pakistan Department of Control & Instrumentation Engineering King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia Interdisciplinary Research Center for Sustainability Energy Systems (IRC-SES) King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia Interdisciplinary Research Center for Smart Mobility and Logistics (IRC-SML) King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia Department of Electrical Engineering Pakistan Institute of Engineering and Applied Sciences (PIEAS) Islamabad Pakistan

ISBN: (数字)9798350361025

ISBN: (纸本)9798350361032

In this work, a Non-Intrusive Load Monitoring (NILM) system is designed for smart homes based on smart energy meters. The proposed solution simplifies the monitoring process by using a single set of sensors, in contrast to conventional systems that call for several sensors. From different appliances and their combinations, crucial electrical information, such as voltage, current, active power, reactive power, apparent power, power factor, and frequency was gathered. Proposed intelligent data analysis employing machine learning methods, particularly Artificial Neural Networks (ANN) and Deep Neural Networks (DNN), is the key innovation. These methods accurately categorize various appliance kinds, with DNN performing best in real-time circumstances. Additionally, there is a built-in email alert system that activates whenever there are odd electrical surges. The streamlined user interface, offers accurate identification of individual appliances and combinations in real-time forecasts based on past data. Future developments include a larger appliance data-set, improved categorization methods, load forecasting, and the creation of a smartphone app for real-time energy consumption data and automatic control, among other things. In a net-shell, this study offers an effective, single-sensorbased solution for load monitoring in smart homes, representing a substantial development in NILM technology. This technology claims to improve resource utilization and energy management in both domestic and commercial settings.

关键词： Meters Load monitoring Reactive power Artificial neural networks Smart homes Machine learning User interfaces

来源：评论

学校读者我要写书评

暂无评论

On the Existence and Uniqueness of Steady State Solutions of a Class of Dynamic Hydraulic Networks via Actuator Placement

On the Existence and Uniqueness of Steady State Solutions of...

引用

IEEE Conference on Decision and control

作者： Mark Jeeninga Juan E. Machado Michele Cucuzzella Giacomo Como Jacquelien Scherpen Department of Automatic Control Lund University Lund Sweden Chair of Control Systems and Network Control Technology Faculty 3 Mechanical Engineering Electrical and Energy Systems Brandenburg University of Technology Cottbus - Senftenberg Cottbus Germany Department of Electrical Computer Science and Biomedical Engineering Univeristy of Pavia Pavia Italy Department of Mathematical Science “G.L. Lagrange” Politecnico di Torino Torino Italy Department of Automatic Control Lund University Faculty of Science and Engineering Jan C. Willems Center for Systems and Control ENTEG University of Groningen Groningen the Netherlands

In this paper, using tools from graph theory we provide verifiable necessary and sufficient conditions for the existence of a unique hydraulic equilibrium in district heating systems of meshed topology and containing multiple heat sources. Even though numerous publications have addressed the design of efficient algorithms for numerically finding hydraulic equilibria in the general context of water distribution networks, this is not the case for the analysis of existence and uniqueness. Moreover, most of the existing work dealing with these aspects exploit the equivalence between the nonlinear algebraic equations describing the hydraulic equilibria and the KKT conditions of a suitably defined nonlinear convex optimization problem. Differently, this paper proposes necessary and sufficient graph-theoretic conditions on the actuator placement for the existence and uniqueness of a hydraulic equilibrium, independent of the actuators' control objective. An example based on a representative district heating network is considered to illustrate the key aspects of our contribution, and an explicit formulation of the steady state solution is given for the case in which pressure drops through pipes are linear with respect to the flow rate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Equivalence of Dubins Path on Sphere with Geographic Coordinates and Moving Frames

arXiv

引用

arXiv 2024年

作者： Kumar, Deepak Prakash Darbha, Swaroop Manyam, Satyanarayana G. Casbeer, David W. Pachter, Meir Mechanical Engineering 3123 TAMU College StationTX77843 United States DCS Corporation 4023 Col. Glenn Hwy DaytonOH United States Control Science Center AFRL AIAA United States Department of Electrical and Computer Engineering Air Force Institute of Technology United States

In this article, two methods of addressing path planning for a Dubins vehiclemoving on a sphere are considered, wherein either spherical coordinates or amoving frame are considered to describe the vehicle's motion. The primarycontribution of this article is to show the equivalence of these twoapproaches, which in turn shows that the results known for the movingframe-based description transfer to the model utilizing spherical coordinates. Copyright © 2024, The Authors. All rights reserved.

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Riemannian Online Optimistic Algorithms with Dynamic Regret

引用

IEEE Transactions on Automatic control 2025年

作者： Wang, Xi Yuan, Deming Hong, Yiguang Hu, Zihao Wang, Lei Shi, Guodong University of New South Wales School of Electrical Engineering & Telecommunications SydneyNSW2052 Australia Nanjing University of Science and Technology School of Automation Nanjing210094 China Tongji University Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Hong Kong University of Science and Technology Department of Mathematics Hong Kong Zhejiang University College of Control Science and Engineering Zhejiang 310058 China The University of Sydney Australian Center for Robotics School of Aerospace Mechanical and Mechatronic Engineering NSW2006 Australia

In this paper, we consider Riemannian online convex optimization with dynamic regret, which involves minimizing the cumulative loss difference between a learner's decisions and a sequence of adaptive decisions across dynamic environments over time on Riemannian manifolds. First, we propose Riemannian Online Optimistic Gradient Descent (R-OOGD), which extends the classical optimistic algorithms to Riemannian manifolds, requiring one gradient inquiry per round. We then propose Riemannian Adaptive Online Optimistic Gradient Descent (R-AOOGD) by incorporating the meta-expert framework into R-OOGD. We analyze the dynamic regret of R-OOGD and R-AOOGD in terms of the regularity of the sequence of cost functions and comparators. The dynamic regret bound matches the results in Euclidean space and with a scale adjustment of O(1+κ D2/√1-KD2) related to the sectional curvature lower bound κ, sectional curvature upper bound and feasible set diameter. Finally, we provide numerical experiments to illustrate the performance of the proposed algorithms. © 1963-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

2-D GCANet Applied to Denoise 1-D EEG Signals in Online Remote Teaching Scenarios

Journal of Network Intelligence

引用

Journal of Network Intelligence 2023年第4期8卷 1289-1302页

作者： Huang, Ting-Qing Wang, Chuan-Sheng Chen, Zhao-Qi Zhang, Fu-Quan Meng, Xiang-Long Grau, Antoni Chen, Yang Huang, Jing-Wei College of Computer and Control Engineering Minjiang University Fuzhou University Town No. 200 Xiyuangong Road Fuzhou China Department of Automatic Control Technical Polytechnic University of Catalonia Autonomous Region of Catalonia Barcelona Spain College of Computer and Big Data Fuzhou University Fuzhou University Town No. 2 Wulong Jiangbei Avenue Fuzhou China Digital Media Art Key Laboratory of Sichuan Province Sichuan Conservatory of Music No. 2 Wannianchang Street Chenghua District Sichuan Province Chengdu City China Fuzhou Technology Innovation Center of intelligent Manufacturing information System Minjiang University Fuzhou University Town NO. 200 Xiyuangong Road Fuzhou China Fujian Province University No. 599 Quanxiu Road Juyuanzhou Ecological Civilization District Fujian Province Fuzhou City China College of Electronic Engineering Shandong University of Science and Technology No. 579 Qianwangang Road Huangdao District Qingdao China School of Mechanical and Automotive Engineering Fujian University of Technology No. 33 Xuefu South Road University New District Fujian Province Fuzhou City China

When EEG signals are used to assess the level of student engagement in online teaching tasks, they are often interfered by noise. It is a challenge to effectively remove these noises. Currently, deep learning methods have been applied to the field of EEG denoising. However, existing methods still have some problems. The denoised signals still have obvious noise residue, or the original EEG signals are damaged, and the model fitting speed is too slow. Image dehazing, as a typical denoising task in the field of image enhancement, has achieved great success in recent years. Therefore, inspired by advanced models in this field, we introduce CNN into EEG denoising tasks. In this paper, we take GCANet, an excellent image enhancement model, as an example. The dilated convolutions and gate fusion subnetworks included in GCANet enable more efficient EEG signal denoising. The results demonstrate that the proposed model effectively reduces noise while preserving essential features. Furthermore, in comparison to other state-of-the-art models, our proposed model exhibits enhanced robustness and faster convergence, as evidenced by achieving lower loss values after five epochs. Its good performance provides a new development idea for the field of EEG denoising. © 2023, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Secrets Behind Advanced Artificial Intelligence Language Models in Deidentifying Chinese-English Mixed Clinical Text: Development and Validation Study

引用

Journal of Medical Internet Research 2024年第1期26卷 e48443页

作者： Lee, You-Qian Chen, Ching-Tai Chen, Chien-Chang Lee, Chung-Hong Chen, Peitsz Wu, Chi-Shin Dai, Hong-Jie Dialogue System Technical Department Asustek Computer Inc Taipei Taiwan Intelligent System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Bioinformatics and Medical Engineering Asia University Taichung Taiwan Center for Precision Health Research Asia University Taichung Taiwan Electromagnetic Sensing Control and AI Computing System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Knowledge Discovery and Data Mining Lab Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Chemical Engineering Feng Chia University Taichung Taiwan National Center for Geriatrics and Welfare Research National Health Research Institutes Zhunan Taiwan National Institute of Cancer Research National Health Research Institutes Tainan Taiwan School of Post-Baccalaureate Medicine College of Medicine Kaohsiung Medical University Kaohsiung Taiwan Center for Big Data Research Kaohsiung Medical University Kaohsiung Taiwan

Background: The widespread use of electronic health records in the clinical and biomedical fields makes the removal of protected health information (PHI) essential to maintain privacy. However, a significant portion of information is recorded in unstructured textual forms, posing a challenge for deidentification. In multilingual countries, medical records could be written in a mixture of more than one language, referred to as code mixing. Most current clinical natural language processing techniques are designed for monolingual text, and there is a need to address the deidentification of code-mixed text. Objective: The aim of this study was to investigate the effectiveness and underlying mechanism of fine-tuned pretrained language models (PLMs) in identifying PHI in the code-mixed context. Additionally, we aimed to evaluate the potential of prompting large language models (LLMs) for recognizing PHI in a zero-shot manner. Methods: We compiled the first clinical code-mixed deidentification data set consisting of text written in Chinese and English. We explored the effectiveness of fine-tuned PLMs for recognizing PHI in code-mixed content, with a focus on whether PLMs exploit naming regularity and mention coverage to achieve superior performance, by probing the developed models’ outputs to examine their decision-making process. Furthermore, we investigated the potential of prompt-based in-context learning of LLMs for recognizing PHI in code-mixed text. Results: The developed methods were evaluated on a code-mixed deidentification corpus of 1700 discharge summaries. We observed that different PHI types had preferences in their occurrences within the different types of language-mixed sentences, and PLMs could effectively recognize PHI by exploiting the learned name regularity. However, the models may exhibit suboptimal results when regularity is weak or mentions contain unknown words that the representations cannot generate well. We also found that the availability of cod

关键词： ChatGPT code mixing deidentification electronic health record large language model pretrained language model

来源：评论

学校读者我要写书评

暂无评论

RFT Based Efficient Broadband Chebyshev Filter Design of (K and Ka) Range

RFT Based Efficient Broadband Chebyshev Filter Design of (K ...

引用

International Conference on engineering and Emerging Technologies (ICEET)

作者： Raqia S. Almusali Dogu Cagdas Atilla Department of electrical and computer science Altinbas university Electric Autonomous Unmanned Vehicle Application and Research Center (AUTONOM) Altinbas University Istanbul Türkıye Faculty of Engineering and Architecture Altinbas University Istanbul Türkıye

ISBN: (数字)9798350316926

ISBN: (纸本)9798350316933

A stepped impedance bandpass Chebyshev filter design covers the K and Ka bands which includes three of 5G RF2 bands n257, n258, and n261 via real frequency technique (RFT) is studied, synthesized and simulated in this work. RFT is a complex math work, for that reason MATLAB employed for generating polynomials needed for this technique, ADS utilized for designing and simulating the BP-filter for verifying the resulted gain of the circuit. The characteristics of the filter listed in details in this paper, the characteristics of the final design after optimization are fl, f2 are 22.22, and 29.5 GHz respectively, Insertion Loss (IL) is set as 0.5dB. The achieved attenuation reached -55, the initial and final number of order before and after the optimization are n=3 and n=8 respectively. RFT technique yielded an accurate synthesized values, small size, and sharp slop.

关键词： Band-pass filters Microstrip filters Regulators Simulation Chebyshev approximation Attenuation Broadband communication

来源：评论

学校读者我要写书评

暂无评论

Clustering Interval and Triangular Granular Data: Modeling, Execution, and Assessment

引用

IEEE Transactions on Neural Networks and Learning Systems 2024年第6期36卷 10000-10014页

作者： Yiming Tang Wenbin Wu Witold Pedrycz Jianwei Gao Xianghui Hu Zhaohong Deng Rui Chen Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Hefei China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada School of Computer and Information Hefei University of Technology Hefei China Faculty of Automatic Control Electronics and Computer Science Silesian University of Tecghnology Gliwice Poland Research Center of Performance and Productivity Analysis Istinye University Istanbul TÃrkiye School of Computer Science and Engineering Southeast University Nanjing China School of Artificial Intelligence and Computer Jiangnan University Wuxi Jiangsu China

In current granular clustering algorithms, numeric representatives were selected by users or an ordinary strategy, which seemed simple; meanwhile, weight settings for granular data could not adequately express their structural characteristics. Aiming at these problems, in this study, a new scheme called a granular weighted kernel fuzzy clustering (GWKFC) algorithm is put forward. We propose the representative selection and granularity generation (RSGG) algorithm enlightened by the density peak clustering (DPC) algorithm. We build interval and triangular granular data on the strength of numeric representatives obtained by RSGG under the principle of justifiable granularity (PJG), in which we establish some combinations of functions and boundary constraints and prove their properties. Furthermore, we present a novel distance formula via the kernel function for granular data and design new weights to affect the coverage and specificity of granular data. In addition, based upon these factors, we come up with the GWKFC algorithm of granular clustering, and its performance with different granularity is assessed. To sum up, a macro framework involving granular modeling, granular clustering, and assessment has been set up. Lastly, the GWKFC algorithm and ten other granular clustering algorithms are compared by experiments on some artificial and UCI datasets together with datasets with large data or those of high dimensionality. It is found that the GWKFC algorithm can provide better granular clustering results by contrast with other algorithms. The originality is embodied as follows. First, we improve the previous density radius and present the RSGG algorithm to acquire numeric representatives. Second, we propose a new strategy to determine granular data boundaries and further obtain novel weights enlightened by the idea of volume. Lastly, we employ the kernel function to calculate the distance between granular data, which has a stronger spatial division ability than the pr

关键词： Clustering algorithms Data models Computational modeling Numerical models Kernel Phase change materials Granular computing Uncertainty Fuzzy sets Noise

来源：评论

学校读者我要写书评

暂无评论

Multi-Vehicle Cooperative Persistent Coverage for Random Target Search

引用

IEEE Robotics and Automation Letters 2025年第7期10卷 6680-6687页

作者： Li, Zhuo Li, Guangzheng Sadeghi, Alireza Sun, Jian Wang, Gang Wang, Jialin Beijing Institute of Technology National Key Lab of Autonomous Intelligent Unmanned Systems School of Automation Beijing100084 China Chongqing Innovation Center Beijing Institute of Technology Chongqing401120 China University of Minnesota Department of Electrical and Computer Engineering MinneapolisMN55455 United States Intelligent Game and Decision Laboratory China Academy of Launch Vehicle Technology Beijing100071 China

This letter investigates the target search problem for a network of autonomous vehicles, aiming to maximize the detection of randomly appearing targets within a given area. Considering no prior knowledge of the targets is available, we propose a multi-vehicle cooperative persistent coverage scheme under the framework of multi-agent reinforcement learning, in contrast to heuristic and model-based optimization methods in existing works. We model the persistent coverage problem as a partially observable Markov decision process (POMDP) due to the vehicles' limited observation ranges, and introduce a knowability map to characterize their knowledge of the target area. Each vehicle employs a distributed estimator, leveraging its own observations and shared information from neighboring vehicles, to construct a globally estimated knowability map - thereby mitigating partial observability. The persistent coverage policies are learned with the architecture of centralized training and distributed execution, enabling cooperative and efficient target search by fully exploiting shared information. Moreover, we propose an adaptive partition method for the target area to ensure a fixed dimension of the state space in the POMDP, which can improve scalability of the learned policy to target areas with various sizes. Simulations validate effectiveness and scalability of the proposed cooperative scheme. © 2025 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：