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

IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Atul Bohara Jordi Ros-Giralt Ghada Elbez Alfonso Valdes Klara Nahrstedt William H. Sanders Information Trust Institute University of Illinois at Urbana-Champaign Reservoir Labs Institute of Automation and Applied Informatics Karlsruhe Institute of Technology

ISBN: (数字)9781728161273

ISBN: (纸本)9781728163598

Devices in IEC 61850 substations use the generic object-oriented substation events (GOOSE) protocol to exchange protection-related events. Because of its lack of authentication and encryption, GOOSE is vulnerable to man-in-the-middle attacks. An adversary with access to the substation network can inject carefully crafted messages to impact the grid's availability. One of the most common such attacks, GOOSE-based poisoning, modifies the StNum and SqNum fields in the protocol data unit to take over GOOSE publications. We present ED4GAP, a network- level system for efficient detection of the poisoning attacks. We define a finite state machine model for network communication concerning the attacks. Guided by the model, ED4GAP analyzes network traffic out-of-band and detects attacks in real-time. We implement a prototype of the system and evaluate its detection accuracy. We provide a systematic approach to assessing bottlenecks, improving performance, and demonstrating that ED4GAP has low overhead and meets GOOSE's timing constraints.

关键词： Substations Protocols Relays IEC Standards Security Real-time systems Ethernet

来源：评论

学校读者我要写书评

暂无评论

*** – A Julia Package for Polynomial Chaos in Systems and Control

arXiv

引用

arXiv 2020年

作者： Mühlpfordt, Tillmann Zahn, Frederik Hagenmeyer, Veit Faulwasser, Timm Institute for Automation and Applied Informatics Karlsruhe Institute of Technology Karlsruhe Germany Department of Electrical Engineering and Information Technology Technical University Dortmund Dortmund Germany

Polynomial chaos expansion (pce) is an increasingly popular technique for uncertainty propagation and quantification in systems and control. Based on the theory of Hilbert spaces and orthogonal polynomials, pce allows for a unifying mathematical framework to study systems under arbitrary uncertainties of finite variance;we introduce this problem as a so-called mapping under uncertainty. For practical pce-based applications we require orthogonal polynomials relative to given probability densities, and their quadrature rules. With *** we provide a Julia software package that delivers the desired functionality: given a probability density function, *** offers several numerical routines to construct the respective orthogonal polynomials, and the quadrature rules together with tensorized scalar products. *** is the first pce-related software written in Julia, a scientific programming language that combines the readability of scripted languages with the speed of compiled languages. We provide illustrating numerical examples that show both pce and *** in action. Copyright © 2020, The Authors. All rights reserved.

关键词： Orthogonal functions

来源：评论

学校读者我要写书评

暂无评论

Automated File Labeling for Heterogeneous Files Organization Using Machine Learning

引用

Computers, Materials & Continua 2023年第2期74卷 3263-3278页

作者： Sagheer Abbas Syed Ali Raza MAKhan Muhammad Adnan Khan Atta-ur-Rahman Kiran Sultan Amir Mosavi School of Computer Science National College of Business Administration&EconomicsLahore54000Pakistan Department of Computer Science GC University LahorePakistan Riphah School of Computing&Innovation Faculty of ComputingRiphah International UniversityLahore CampusLahore54000Pakistan Department of Software Pattern Recognition and Machine Learning LabGachon UniversitySeongnam13120Korea Department of Computer Science College of Computer Science and Information Technology(CCSIT)Imam Abdulrahman Bin Faisal University(IAU)P.O.Box 1982Dammam31441Saudi Arabia Department of CIT The Applied CollegeKing Abdulaziz UniversityJeddah31261Saudi Arabia John von Neumann Faculty of Informatics Obuda UniversityBudapest1034Hungary Institute of Information Engineering Automation and MathematicsSlovak University of Technology in BratislavaBratislava81107Slovakia Faculty of Civil Engineering TU-DresdenDresden01062Germany

File labeling techniques have a long history in analyzing the anthological trends in computational *** situation becomes worse in the case of files downloaded into systems from the ***,most users either have to change file names manually or leave a meaningless name of the files,which increases the time to search required files and results in redundancy and duplications of user ***,no significant work is done on automated file labeling during the organization of heterogeneous user files.A few attempts have been made in topic ***,one major drawback of current topic modeling approaches is better *** rely on specific language types and domain similarity of the *** this research,machine learning approaches have been employed to analyze and extract the information from heterogeneous corpus.A different file labeling technique has also been used to get the meaningful and`cohesive topic of the *** results show that the proposed methodology can generate relevant and context-sensitive names for heterogeneous data files and provide additional insight into automated file labeling in operating systems.

关键词： Automated file labeling file organization machine learning topic modeling

来源：评论

学校读者我要写书评

暂无评论

FedKDC: Consensus-Driven Knowledge Distillation for Personalized Federated Learning in EEG-Based Emotion Recognition

引用

IEEE Journal of Biomedical and Health informatics 2025年 PP卷 PP页

作者： Qiu, Xihang Qiu, Wanyong Zhang, Ye Qian, Kun Li, Chun Hu, Bin Schuller, Bjorn W. Yamamoto, Yoshiharu Beijing100081 China Beijing Institute of Technology School of Automation School of Medical Technology Beijing100081 China Shenzhen MSU-BIT University MSU-BIT-SMBU Joint Research Center of Applied Mathematics Shenzhen518172 China Beijing Institute of Technology School of Mathematics and Statistics Beijing100081 China Imperial College London GLAM – the Group on Language Audio & Music LondonSW7 2AZ United Kingdom Technische Universität München CHI Chair of Health Informatics Munich80333 Germany Germany Educational Physiology Laboratory Graduate School of Education University of Tokyo Tokyo1138654 Japan

Federated learning (FL) has gained prominence in electroencephalogram (EEG)-based emotion recognition because of its ability to enable secure collaborative training without centralized data. However, traditional FL faces challenges due to model and data heterogeneity in smart healthcare settings. For example, medical institutions have varying computational resources, which creates a need for personalized local models. Moreover, EEG data from medical institutions typically face data heterogeneity issues stemming from limitations in participant availability, ethical constraints, and cultural differences among subjects, which can slow model convergence and degrade model performance. To address these challenges, we propose FedKDC, a novel FL framework that incorporates clustered knowledge distillation (CKD). This method introduces a consensus-based distributed learning mechanism to facilitate the clustering process. It then enhances the convergence speed through intraclass distillation and reduces the negative impact of heterogeneity through interclass distillation. Additionally, we introduce a DriftGuard mechanism to mitigate client drift, along with an entropy reducer to decrease the entropy of aggregated knowledge. The framework is validated on the SEED, SEED-IV, SEED-FRA, and SEED-GER datasets, demonstrating its effectiveness in scenarios where both the data and the models are heterogeneous. Experimental results show that FedKDC outperforms other FL frameworks in emotion recognition, achieving a maximum average accuracy of 85.2%, and in convergence efficiency, with faster and more stable convergence. © 2013 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Evaluating contextualized language models for Hungarian

arXiv

引用

arXiv 2021年

作者： Ács, Judit Lévai, Dániel Nemeskey, Dávid Márk Kornai, András Department of Automation and Applied Informatics Budapest University of Technology and Economics Hungary Institute for Computer Science and Control Hungary Alfréd Rényi Institute of Mathematics Hungary

We present an extended comparison of contextualized language models for Hungarian. We compare huBERT, a Hungarian model against 4 multilingual models including the multilingual BERT model. We evaluate these models through three tasks, morphological probing, POS tagging and NER. We find that huBERT works better than the other models, often by a large margin, particularly near the global optimum (typically at the middle layers). We also find that huBERT tends to generate fewer subwords for one word and that using the last subword for token-level tasks is generally a better choice than using the first one. Copyright © 2021, The Authors. All rights reserved.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Mixed-Integer vs. Real-Valued Formulations of Battery Scheduling Problems

引用

IFAC-PapersOnLine 2018年第28期51卷 350-355页

作者： Murray, Alexander Faulwasser, Timm Hagenmeyer, Veit Institute for Automation and Applied Informatics Karlsruhe Institute of Technology Karlsruhe Germany

Coordinating the charging and discharging of a population of batteries with respect to load and generation forecasts decreases operating costs. However, in the case of asymmetric charging and discharging efficiencies the mathematical formulation of this problem is not straightforward. This paper compares the scheduling problem for a population of batteries in two formulations: mixed-integer (MINLP) and non-convex real-valued (NLP). In the case of the latter, the resulting separable NLP is solved using the Augmented Lagrangian based Alternating Direction Inexact Newton (ALADIN). In the case of the latter, the resulting MINLP is solved in hierarchical distributed fashion, we propose a mixed-integer extension of ALADIN. Real load and generation data is used to create an example of 54 batteries demonstrating improved performance for the MINLP formulation. © 2018

关键词： Charging (batteries) Constrained optimization Natural language processing systems Operating costs Scheduling Secondary batteries Standby power systems ALADIN Alternating directions Augmented Lagrangians Distributed optimization Generation forecast Mathematical formulation MINLP Scheduling problem

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Distributed Mixed-Integer Optimization for Reactive Power Dispatch

引用

IFAC-PapersOnLine 2018年第28期51卷 368-373页

作者： Murray, Alexander Engelmann, Alexander Hagenmeyer, Veit Faulwasser, Timm Institute for Automation and Applied Informatics Karlsruhe Institute of Technology Karlsruhe Germany

One key aspect of power system operation is the minimization of line losses while maintaining voltages within certain limits. Doing so can be achieved through the use of voltage regulators, tap changing transformers, and shunt capacitors. However, both tap changing transformers and/or shunt capacitors are operated in a discrete manner, i.e. the inputs can only take finitely many discrete values. Thus, the problem of minimizing line losses while maintaining voltage stability can be cast as a mixed-integer optimization problem. For large grids or cases where independent entities have concurrent control of the system, distributed optimization provides a solution. The present paper discusses a hierarchically distributed approach; i.e. the problem is partitioned into local subproblems and solved using a mixed-integer extension of the Augmented Lagrangian based Alternating Direction Inexact Newton (ALADIN) algorithm. We present results for the IEEE 14- and 30-bus systems and compare them with previous approaches, such as particle swarm optimization and genetic algorithms. © 2018

关键词： Electric load dispatching Concurrency control Constrained optimization Electric load flow Genetic algorithms Integer programming Particle swarm optimization (PSO) Reactive power Voltage regulators Alternating directions Distributed approaches Distributed optimization Mixed integer optimization Mixed integer problems Optimal power flows Power system operations Reactive power dispatch

来源：评论

学校读者我要写书评

暂无评论

Current-saving sampling for the embedded implementation of positive position feedback 49

Current-saving sampling for the embedded implementation of p...

引用

49th International Congress and Exposition on Noise Control Engineering, INTER-NOISE 2020

作者： Takács, Gergely Mikuláš, Erik Vrícan, Martin Gulan, Martin Slovak University of Technology in Bratislava Faculty of Mechanical Engineering Institute of Automation Measurement and Applied Informatics Námestie slobody 17 Bratislava812 31 Slovakia

ISBN: (纸本)9788994021362

Battery powered embedded applications of active vibration control must conserve energy as much as possible, in order to prolongate effective service time between charging. Besides the power requirements of actuators and sensors, the microcontroller unit executing the feedback control algorithm drains the battery as well. Reducing the current drain of the microcontroller is possible by slowing down its clock frequency;or, sending the device into sleep mode when idle. This paper attempts to provide a definitive answer as to which of these strategies is better. A simple theoretical approximation derived here suggests that running the microcontroller at maximum frequency, then sending it to a low power mode is always preferable. We confirm this by laboratory experiments measuring the microcontroller power requirements of the positive position feedback algorithm. For this algorithm and choice of sampling time a five-fold current saving is possible on the Microchip (Atmel) ATmega 328p microcontroller unit, reducing its current draw from 15 mA to 3 mA. The experimental current and instantaneous power measurements shown in the paper confirm our prediction and general conclusion. © Proceedings of 2020 International Congress on Noise Control Engineering, INTER-NOISE 2020. All rights reserved.

关键词： Microcontrollers

来源：评论

学校读者我要写书评

暂无评论

Control of a Smart Walker for Training Using Interaction-Energy and Personalized Parameters ⁎

引用

IFAC-PapersOnLine 2020年第2期53卷 10154-10161页

作者： Denis Stogl Daniel Zumkeller Manuel Muth Björn Hein Institute for Anthropomatics and Robotics Intelligent Process Automation and Robotics Lab (IAR-IPR) Karlsruhe Institute of Technology (KIT) Karlsruhe Germany Karlsruhe University of Applied Science Karlsruhe Germany

Smart walkers with admittance controller usually have limited dynamics and low maximal velocity to provide stable and safe behavior. To enable physically challenging training with smart walker control strategies enabling faster dynamics is needed. However, in certain situations, this can lead to instabilities, which further complicates the finding of suitable parameters for the envisioned training functionalities. To overcome these issues, we have introduced an interaction-energy limiter and developed a strategy to automatically determine individual user parameters for an adaptive admittance controller. The energy limiter bounds the controller and training elements to avoid uncomfortable and dangerous situations. These training elements are placed on a 2D map of a training environment. If the user passes these training elements with our smart walker - RoboTrainer - they are triggered. Therefore we call them spatial control actions. We can show that interaction-energy limiter successfully avoids instabilities and dangerous situations when spatial control actions are triggered. The evaluation with 22 users, which used Robo Trainer with and without individualized parameters, successfully demonstrate the benefits of the parameterization method. The presented method could be generally valuable for the implementation of smart walkers in everyday life since it provides a solution for dealing with users with different skills and a solution for safe interaction with smart walkers using high-dynamic control.

关键词： Human-machine interface Human-machine interaction Admittance control Model-based control Human-centered design Nonlinear gain Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Linear layouts of complete graphs

arXiv

引用

arXiv 2021年

作者： Felsner, Stefan Merker, Laura Ueckerdt, Torsten Valtr, Pavel Institute of Mathematics Technische Universität Berlin Germany Institute of Theoretical Informatics Karlsruhe Institute of Technology Germany Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Prague Czech Republic

A page (queue) with respect to a vertex ordering of a graph is a set of edges such that no two edges cross (nest), i.e., have their endpoints ordered in an abab-pattern (abba-pattern). A union page (union queue) is a vertex-disjoint union of pages (queues). The union page number (union queue number) of a graph is the smallest k such that there is a vertex ordering and a partition of the edges into k union pages (union queues). The local page number (local queue number) is the smallest k for which there is a vertex ordering and a partition of the edges into pages (queues) such that each vertex has incident edges in at most k pages (queues). We present upper and lower bounds on these four parameters for the complete graph Knon n vertices. In three cases we obtain the exact result up to an additive constant. In particular, the local page number of Knis n/3±O(1), while its local and union queue number is (1-1= p 2)n±O(1). The union page number of Kn is between n=3-O(1) and 4n=9 + O(1). © 2021, CC BY.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：