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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Approach For Faults Recognition of Dissolved Oxygen Sensor in Wastewater Treatment Plants

A Deep Learning Approach For Faults Recognition of Dissolved...

引用

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Liliana Maria Ghinea Mihaela Miron Harsha Ratnaweera Department of Automatic Control and Electrical Engineering Department Faculty of Automation Computers Electrical Engineering and Electronics Galați Romania Department of Computer Science and Information Technology Faculty of Automation Computers Electrical Engineering and Electronics Galați Romania Faculty of Science and Technology Norwegian University of Life Sciences Oslo Norway

Fault diagnosis in wastewater treatment plants (WWTPs) is important to protect communities and ecosystems from toxic elements discharged into water. In this sense, fault identification of sensors plays an important role as they are the key components of the water plants control, especially because environmental legislation is very strict when referring to failures or anomalies in WWTPs. This paper analyzes the performances of two Deep Learning models, a Feedforward Neural Network (FFNN) and a 1D Convolution Neural Network (1DCNN) for identifying five operating states of the dissolved oxygen (DO) sensor: normal and faulty (bias, stuck, spike and precision degradation faults). The experiments were conducted on the Benchmark Simulator Model No 2 (BSM2) developed by the IWA Task Group. The performance of the Deep Learning (DL) classifiers was evaluated via accuracy, precision, recall, and F1-score metrics. The best overall classification accuracy was obtained by FFNN, 98.32% for training and 98.30% for testing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An iterative Jacobi-like algorithm to compute a few sparse eigenvalue-eigenvector pairs

arXiv

引用

arXiv 2021年

作者： Rusu, Cristian Faculty of Automatic Control and Computer Science University Politehnica of Bucharest Romania Department of Computer Science Faculty of Mathematics and Computer Science University of Bucharest Romania

In this paper, we describe a new algorithm to compute the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi transformation method for symmetric matrix diagonalization to the case where we want to compute just a few eigenvalues/eigenvectors. The method is also particularly well suited for the computation of sparse eigenspaces. We show the effectiveness of the method for sparse low-rank approximations and show applications to random symmetric matrices, graph Fourier transforms, and with the sparse principal component analysis in image classification experiments. Copyright © 2021, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

The Use of Mathematical Fractional-Calculus to Modeling of Changes in Concentrations of Polycyclic Aromatic Hydrocarbons (Pahs) in Sewage Sludge

SSRN

引用

SSRN 2024年

作者： Wlodarczyk-Makula, Maria Wlodarczyk, Maciej Czestochowa University of Technology Faculty of Infrastructure and Environment 69 Dąbrowskiego Str. Czestochowa42-201 Poland Kielce University of Technology Faculty of Electrical Engineering Automatic Control and Computer Science 7 Av. Tysiąclecia Państwa Polskiego Kielce25-314 Poland

Sewage sludge constitutes waste generated during wastewater treatment in any treatment plant. Sludge that meets the quality conditions specified in the legal regulations, due to fertilising properties, can be used for natural purposes (use in the recovery process on the surface of the earth or for the reclamation cover of landfills). However, sewage sludge contains various organic microcontaminants, such as, for example, PAHs that are toxic to aquatic and soil organisms, and the legal regulations do not specify the acceptable concentrations of these compounds. However, restrictions concerning PAHs in European legislation are proposed. The aim of the study was to use fractional order derivatives to develop a mathematical model describing changes in the concentration of polycyclic aromatic hydrocarbons (PAHs) in sewage sludge stored in natural conditions. The concentrations of selected PAHs were monitored for 3 months at fixed time intervals under conditions reflecting the use of sludge for natural purposes. A qualitative and quantitative analysis of PAHs was carried out using the GC-MS system. For the mathematical description of changes in the concentration values of individual compounds, fractional order derivatives were used and approximation was carried out using the classical equation of the first order. The developed mathematical model allows for predicting changes in PAH concentrations regarding sludge as well as determining the time necessary to obtain the required concentration of these compounds. © 2024, The Authors. All rights reserved.

关键词： Polycyclic aromatic hydrocarbons

来源：评论

学校读者我要写书评

暂无评论

An iterative coordinate descent algorithm to compute sparse low-rank approximations

arXiv

引用

arXiv 2021年

作者： Rusu, Cristian The Faculty of Automatic Control and Computer Science University Politehnica of Bucharest Romania Department of Computer Science Faculty of Mathematics and Computer Science University of Bucharest Romania

In this paper, we describe a new algorithm to build a few sparse principal components from a given data matrix. Our approach does not explicitly create the covariance matrix of the data and can be viewed as an extension of the Kogbetliantz algorithm to build an approximate singular value decomposition for a few principal components. We show the performance of the proposed algorithm to recover sparse principal components on various datasets from the literature and perform dimensionality reduction for classification applications. Copyright © 2021, The Authors. All rights reserved.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Ranking of attributes—comparative study based on data from stylometric domain

引用

Procedia computer science 2022年 207卷 2737-2746页

作者： Beata Zielosko Urszula Stańczyk Krzysztof Żabiński Institute of Computer Science University of Silesia in Katowice Będzińska 39 41-200 Sosnowiec Poland 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

The area of feature selection methods constantly expands along with the development of artificial intelligence domain, and has great impact on almost every field, whenever data is processed and explored. The paper presents research where a ranking method was proposed, inspired by an approach which comes from an algorithm for induction of decision rules. The ranking procedure was based on calculation of standard deviation for attributes, taking into account assigned class labels. This method was compared with another ranking mechanism, a modified version of popular Relief algorithm, with incorporating characteristics of variables by supervised discretisation. Comparison of obtained results included the aspect of knowledge representation as well as the perspective of the accuracy for constructed rule-based classifiers. The experiments were performed on datasets from stylometry domain, where authorship attribution was considered as a classification task, and stylometric descriptors as characteristic features defining writing styles of authors.

关键词： Feature selection Ranking of attributes Relief Standard deviation Decision rules Stylometry Supervised discretisation Authorship attribution

来源：评论

学校读者我要写书评

暂无评论

Awakened at CheckThat! 2022: Fake News Detection using BiLSTM and Sentence Transformer

Awakened at CheckThat! 2022: Fake News Detection using BiLST...

引用

2022 Conference and Labs of the Evaluation Forum, CLEF 2022

作者： Truică, Ciprian-Octavian Apostol, Elena-Simona Paschke, Adrian Department of Information Technology Uppsala University Lägerhyddsvägen 1 Uppsala75105 Sweden Computer Science and Engineering Department Faculty of Automatic Control and Computers University Politehnica of Bucharest Splaiul Independentei 313 Bucharest060042 Romania Fraunhofer Institute for Open Communication Systems Berlin10589 Germany

In recent years, online social networks and online news venues have become some of the main news and event-related information spreading mediums. Although using these mediums has facilitated the speed of accessing information, it also created a new phenomenon used for propaganda and disinformation: fake news. As fake news has detrimental consequences to society, new technologies need to be developed in order to stop their harmful effects. In this paper, we propose two Bidirectional Long Short-Term Memory (BiLSTM) architectures with sentence transformers to solve two tasks: (1) a multi-class mono-lingual fake news detection task (i.e., mono-lingual task);and (2) a multi-class cross-lingual fake news detection task (i.e., cross-lingual task). For the mono-lingual task, we train and test a BiLSTM with BART sentence transformers model on an English dataset and obtain an accuracy of ∼ 0.53 and an F1-Score of ∼ 0.32. For the cross-lingual task, we train a BiLSTM with XLM sentence transformers model on an English dataset and test the model using transfer learning on a German dataset. For this task, we obtain an accuracy of ∼ 0.28 and an F1-Score of ∼ 0.19. © 2022 Copyright for this paper by its authors.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

On the link between explicit MPC and the face lattice of the lifted feasible domain

引用

IFAC-PapersOnLine 2022年第16期55卷 308-313页

作者： Ştefan S. Mihai Florin Stoican Bogdan D. Ciubotaru Department of Automatic Control and Systems Engineering University "Politehnica" of Bucharest 313 Splaiul Independenţei Sector 6 060042 Bucharest Romania Research Center for Logic Optimization and Security (LOS) Department of Computer Science Faculty of Mathematics and Computer Science University of Bucharest.

The paper provides a geometric interpretation for the explicit solution of the quadratic cost, linear-constrained MPC (model predictive control) problem. We link the face lattice of the lifted feasible domain (defined in the input and parameter space) with the critical regions which partition the parameter space and serve as polyhedral support for the piecewise affine explicit MPC solution. We provide geometric (face visibility) and algebraic (polyhedron emptiness) tests for the pruning of the candidate sets of active constraints.

关键词： Model Predictive control (MPC) Explicit MPC Face Lattice Constrained-Optimization Problem

来源：评论

学校读者我要写书评

暂无评论

A note on a ode model of micro rna-dependent regulation of messenger rna levels

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2021年第4期83卷 171-176页

作者： Olteanu, Mircea Ştefan, Radu Department of Mathematical Methods and Models Faculty of Applied Sciences University "Politehnica" of Bucharest Romania Department of Automatic Control and Systems Engineering Faculty of Automatic Control and Computer Science University "Politehnica" of Bucharest Romania

We study the qualitative behavior (invariance, boundedness and equilibria) of the solutions of a mathematical model describing the dynamics of microRNA AGO complexes and mRNA targets interaction. © 2021, Politech... 详细信息

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：