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

Interpreting Industrial IoT Data Streams Through Fuzzy Querying With Hysteretic Fuzzy Sets on Apache Kafka

IEEE Transactions on Fuzzy systems 2024年第8期32卷 4671-4684页

作者： Bożena Małysiak-Mrozek Bartłomiej Ryba Marek Molęda Che-Lun Hung Witold Pedrycz Weiping Ding Dariusz Mrozek Department of Distributed Systems and Informatic Devices Silesian University of Technology Gliwice Poland Department of Applied Informatics Silesian University of Technology Gliwice Poland Institute of Biomedical Informatics National Yang Ming Chiao Tung University Taipei City Taiwan Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada Department of Measurements and Control Systems Silesian University of Technology Gliwice Poland Research Center of Performance and Productivity Analysis Istinye University Istanbul Türkiye School of Artificial Intelligence and Computer Science Nantong University Nantong China Faculty of Data Science City University of Macau Macau China

In industrial settings, querying data streams from Internet of Things (IoT) devices benefits from utilizing elastic criteria to enhance the interpretability of the current state of the monitored environment. Fuzzy sets provide this elasticity, enabling the aggregation and representation of similar values in a human-comprehensible manner. However, many sensor signals exhibit temporal oscillations, leading to varying interpretations of the signal based on its current trend (rising or falling). This hysteresis in signal (and subsequently of the production device) interpretation inspired us to introduce this phenomenon into data stream processing, resulting in the novel concept of hysteretic fuzzy sets. This article demonstrates how fuzzy searching and grouping can be applied to IoT sensor signals in flexible Big Data stream processing on Apache Kafka. We illustrate the impact of data stream querying with KSQL queries involving fuzzy sets (encompassing fuzzy filtering of data stream events, fuzzy transformation of data stream attributes, fuzzy grouping, and joining) on the flexibility of executed operations and computational resources utilized by the Kafka processing engine. Finally, our experiments with hysteretic fuzzy sets while analyzing sensor signals in power plants demonstrate that this novel approach effectively reduces the number of alarms while monitoring the state of the production machine.

关键词： Streams Fuzzy sets Internet of Things Big Data Monitoring Production Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Fractional discrete neural networks with variable order: solvability, finite time stability and synchronization

引用

The European Physical Journal Special Topics 2024年 1-14页

作者： Hioual, Amel Alomari, Saleh Al-Tarawneh, Hassan Ouannas, Adel Grassi, Giuseppe Laboratory of Dynamical Systems and Control University of Oum El-Bouaghi Oum El Bouaghi Algeria Faculty of Science and Information Technology Software Engineering Jadara University Irbid Jordan Department of Data Sciences and Artificial Intelligence Al-Ahliyya Amman University Amman Jordan Department of Mathematics and Computer Science University of Oum EL-Bouaghi Oum El Bouaghi Algeria Dipartimento Ingegneria Innovazione Universita del Salento Lecce Italy

Research in the field of dynamic behaviors in neural networks with variable-order differences is currently a thriving area, marked by various significant discoveries. However, when it comes to discrete-time neural networks featuring fractional variable-order nonlocal and nonsingular kernels, there has been limited exploration. This paper stands as one of the initial contributions to this subject, focusing primarily on the topics of stability and synchronization in finite-time within discrete neural networks. The research employs the nabla ABC variable-order difference operator, with a primary approach involving the investigation of a novel Gronwall inequality using the Atangana-Baleanu difference variable-order sum operator. This analysis leads to the development of a uniqueness theorem and a criterion for the stability in finite-time of variable-order discrete neural networks. Furthermore, the requirements stemming from this type of stability and the novel Gronwall inequality serve as the foundation for establishing the conditions necessary for achieving finite-time synchronization in these networks, employing a specific control using state feedback method. Finally, the study utilizes numerical solutions to validate the obtained results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Survey of Distributed Algorithms for Resource Allocation over Multi-Agent systems

arXiv

引用

arXiv 2024年

作者： Doostmohammadian, Mohammadreza Aghasi, Alireza Pirani, Mohammad Nekouei, Ehsan Zarrabi, Houman Keypour, Reza Rikos, Apostolos I. Johansson, Karl H. Faculty of Mechanical Engineering Semnan University Semnan Iran Department of Electrical Engineering and Computer Science Oregon State University United States Department of Mechanical Engineering University of Ottawa OttawaON Canada City University of Hong Kong China Tehran Iran Faculty of Electrical Engineering Semnan University Semnan Iran Department of Electrical and Computer Engineering Division of Systems Engineering Boston University BostonMA United States Division of Decision and Control Systems KTH Royal Institute of Technology Sweden

Resource allocation and scheduling in multi-agent systems present challenges due to complex interactions and decentralization. This survey paper provides a comprehensive analysis of distributed algorithms for addressing the distributed resource allocation (DRA) problem over multi-agent systems. It covers a significant area of research at the intersection of optimization, multiagent systems, and distributed consensus-based computing. The paper begins by presenting a mathematical formulation of the DRA problem, establishing a solid foundation for further exploration. Real-world applications of DRA in various domains are examined to underscore the importance of efficient resource allocation, and relevant distributed optimization formulations are presented. The survey then delves into existing solutions for DRA, encompassing linear, nonlinear, primal-based, and dual-formulation-based approaches. Furthermore, this paper evaluates the features and properties of DRA algorithms, addressing key aspects such as feasibility, convergence rate, and network reliability. The analysis of mathematical foundations, diverse applications, existing solutions, and algorithmic properties contributes to a broader comprehension of the challenges and potential solutions for this domain. © 2024, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Completion with Low-Dimensional Gated Hierarchical Hyperbolic Embedding

SSRN

引用

SSRN 2024年

作者： Fang, Yan Liu, Xiaodong Lu, Wei Pedrycz, Witold Lang, Qi Yang, Jianhua School of Control Science and Engineering Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Dalian116024 China Department of Electrical and Computer Engineering University of Alberta EdmontonT6R 2V4 AB Canada Systems Research Institute Polish Academy of Sciences Warsaw00-901 Poland Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia School of Computer Science and Information Technology Northeast Normal University Changchun130117 China

Knowledge Graph Embedding aims to advance the learning performance of knowledge graphs by deliberating the complexity of hierarchical data structures in a finite-dimensional space. Most traditional Euclidean models struggle to accurately describe and navigate the intricate hierarchical relationships between nodes. The hyperbolic embedding methods, particularly in conjunction with graph neural networks, offer promise in effectively modeling complex hierarchies in a limited-dimensional space. These methods can accommodate more information about nodes under the same conditions but are also more susceptible to interference from complex neighborhood features. This paper introduces HyperGatE, which novelty combines a hyperbolic graph hierarchical neighbor structure based on a gated filter and a hyperbolic isometric rotation model for knowledge graph completion. By analyzing the hierarchical structure of the knowledge base and using a gated mechanism to form multi-layer embedding networks of entity-relational paths, the gated filter selects diverse uneven multi-hop relations within the entity neighborhood and measures them through graph attention networks. Furthermore, the simplified hyperbolic isometric model allows for uncovering hierarchical structures in the data. HyperGatE experimentally surpasses the state-of-the-art Euclidean and hyperbolic space models in high and low dimensions across four well-known data, namely WN18RR, FB15k-237, NELL-995, and Kinship. © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Defining, measuring, and modeling passenger's in-vehicle experience and acceptance of automated vehicles

arXiv

引用

arXiv 2023年

作者： Bhide, Neeraja Hashimoto, Nanami Dokurno, Kazimierz Van der Hoorn, Chris Hoogendoorn-Lanser, Sascha Nordhoff, Sina Delft Center for Systems and Control Delft University of Technology Netherlands Department of Cognitive Robotics Delft University of Technology Netherlands Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Netherlands Department Transport & Planning Delft University of Technology Netherlands

Automated vehicle acceptance (AVA) has been measured mostly subjectively by questionnaires and interviews, with a main focus on drivers inside automated vehicles (AVs). To ensure that AVs are widely accepted by the public, ensuring the acceptance by both drivers and passengers is key. The in-vehicle experience of passengers will determine the extent to which AVs will be accepted by passengers. A comprehensive understanding of potential assessment methods to measure the passenger experience in AVs is needed to improve the in-vehicle experience of passengers and thereby the acceptance. The present work provides an overview of assessment methods that were used to measure a driver's behavior, and cognitive and emotional states during (automated) driving. The results of the review have shown that these assessment methods can be classified by type of data-collection method (e.g., questionnaires, interviews, direct input devices, sensors), object of their measurement (i.e., perception, behavior, state), time of measurement, and degree of objectivity of the data collected. A conceptual model synthesizes the results of the literature review, formulating relationships between the factors constituting the in-vehicle experience and AVA acceptance. It is theorized that the in-vehicle experience influences the intention to use, with intention to use serving as predictor of actual use. The model also formulates relationships between actual use and well-being. A combined approach of using both subjective and objective assessment methods is needed to provide more accurate estimates for AVA, and advance the uptake and use of AVs. © 2023, CC BY.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further 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 among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Weighting factor for attributes based on reduct cardinality

引用

Procedia computer science 2021年 192卷 1255-1264页

作者： Urszula Stańczyk Department of Graphics Computer Vision and Digital Systems Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Akademicka 2A 44-100 Gliwice Poland

Estimation of attribute importance can be obtained by a mechanism that allows to assign some weight to variables. Weighting attributes can lead to their ordering, which, in turn, can be exploited for feature selection and reduction. Decision reducts constitute an example of a mechanism aiming at dimensionality reduction, embedded in rough set approach to data mining. The paper presents research works, where the process of weighting was driven by the proposed factor based on reducts, with varying their sets, and the results were analysed through the perspective of reduct cardinality, since it is typically considered as the most significant indicator of reduct quality. Constructed rankings of variables were used for inferring sets of decision rules from gradually decreasing numbers of features, and then the performance of the rule classifiers was tested. The experiments show that for the weighting factor to be useful for feature reduction, not only reduct cardinalities, but also the numbers of reducts found need to be taken into account.

关键词： Weighting Ranking Feature selection Rough set theory Decision reduct Reduct cardinality

来源：评论

学校读者我要写书评

暂无评论

Distributed formation control of networked mechanical systems

引用

IFAC-PapersOnLine 2022年第13期55卷 294-299页

作者： N. Javanmardi P. Borja M.J. Yazdanpanah J.M.A. Scherpen Control and Intelligent Processing Center of Excellence School of Electrical and Computer Engineering University of Tehran Tehran Iran Department of Cognitive Robotics Delft University of Technology Delft The Netherlands Jan C. Wilems Center for Systems and Control ENTEG Faculty of Science and Engineering University of Groningen Groningen The Netherlands

This paper investigates a distributed formation tracking control law for large-scale networks of mechanical systems. In particular, the formation network is represented by a directed communication graph with leaders and followers, where each agent is described as a port-Hamiltonian system with a constant mass matrix. Moreover, we adopt a distributed parameter approach to prove the scalable asymptotic stability of the network formation, i.e., the scalability with respect to the network size and the specific formation preservation. A simulation case illustrates the effectiveness of the proposed control approach.

关键词： Autonomous systems Cooperative control Networked control systems Large-scale systems Port-Hamiltonian systems Scalability

来源：评论

学校读者我要写书评

暂无评论

Standard vs. non-standard cross-validation: evaluation of performance in a space with structured distribution of datapoints

引用

Procedia computer science 2021年 192卷 1245-1254页

作者： Grzegorz Baron Urszula Stańczyk Department of Graphics Computer Vision and Digital Systems Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Akademicka 2A 44-100 Gliwice Poland

Cross-validation is a popularly used approach to evaluation of performance for classifiers. It relies on random selection of independent samples for training and testing, and assumes that if any similarities among samples exist, they do not lead to known grouping of datapoints in the input space. If these conditions are violated, as it may happen for datasets with some structure of samples included, standard cross-validation can return biased results even for many folds. In the paper the research on cross-validation was reported for application to stylometric datasets, describing a task of authorship attribution. The comparison of standard and non-standard processing was presented. In the latter case, selected subsets of examples were swapped over between training and test sets several times. The experiments with three popular classifiers showed that standard cross-validation tended to give over-optimistic results, whereas non-standard processing was more guarded, and by that more reliable. To avoid high computational costs involved, evaluation based on averaged predictions for limited numbers of test sets can be considered as a reasonable compromise.

关键词： Cross-validation Fold Evaluation of Performance Classification Distribution Stylometry

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant control of semi-active suspension in case of oil leakage of magnetorheological damper

Fault-tolerant control of semi-active suspension in case of ...

引用

European control Conference (ECC)

作者： Hakan Basargan Filip Jeniš András Mihály Péter Gáspár Department of Control for Transportation and Vehicle Systems Budapest University of Technology and Economics Stoczek u. 2 Budapest Hungary Faculty of Mechanical Engineering Institute of Machine and Industrial Designs Brno University of Technology Technicka 2 Brnos Czech Republic Systems and Control Laboratory Institute for Computer Science and Control (SZTAKI) Eötvös Loránd Research Network (ELKH) Kende u. 13-17 Budapest Hungary

The paper presents a reconfigurable fault-tolerant control strategy for a semi-active suspension using magnetorheological (MR) damper. The aim of the control reconfiguration is to handle the adverse behaviour of the MR damper due to oil leakage induced by the wear of the suspension component. The proposed method relies on the data driven model of the MR damper, using an estimation procedure to quantify the healthiness of the damper and to estimate the performance degradation due to the oil leakage. The reconfiguration control strategy is founded on the Linear Parameter Varying (LPV) framework, where a scheduling variable is defined to represent the healthiness level of the MR damper. By the scaling of the control action through the scheduling variable, the performance degradation of the MR damper can be compensated to match the behaviour of the healthy dampers. The proposed method is demonstrated through simulations, comparing the performance of the fault-tolerant LPV control to conventional semi-active control methods

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：