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

25th IEEE International Conference on Problems of Automated Electric Drive. Theory and Practice, PAEP 2020

作者： Nozhenko, Viktoriia Rodkin, Dmytro Tytiuk, Valerii Bohatyrov, Kostyantin Burdilna, Evgeniia Ilchenko, Oleksandr Kremenchuk Mykhailo Ostrohradskyi National University Electricity Consumption Systems and Power Management Department Kremenchuk Ukraine Kremenchuk Mykhailo Ostrohradskyi National University Systems of Automatic Control and Electric Drive Department Kremenchuk Ukraine Kryvyi Rih National University Department of Electromechanics Kryvyi Rih Ukraine Pjsc 'Poltava Mining and Concentrating Combine' Gorishni Plavni Ukraine Kremenchuk Mykhailo Ostrohradskyi National University Department of Automation and Computer-Integrated Technologies Kremenchuk Ukraine

ISBN: (纸本)9781728199351

The features of the resonance zone passing during the start-up of an above resonance vibration machine were considered. It has been noted that intense vibrations of the vibration machine actuating device occur during passing of the resonance zone, which leads to a number of negative consequences. The analysis of existing methods for reducing the amplitude of resonance oscillations using electric drive systems were carried out. It was suggested the application of a frequency-controlled electric drive to the above resonance vibration machines for the passing of the resonance zone, which will allow the use of drive motors with the power necessary for operation in the technological mode. Using mathematical modeling, the research of the frequency start-up of the above resonance vibration machine during the formation of a voltage-frequency characteristic of various forms have been carried out. © 2020 IEEE.

关键词： Induction motors

来源：评论

学校读者我要写书评

暂无评论

Decision support system based on pattern detection in iterative dermoscopic screening

引用

computer Methods and Programs in Biomedicine 2025年 269卷 108841页

作者： Salwowska, Natalia Kempski, Aleksander Zielonka, Piotr Pietkiewicz, Paweł Borys, Damian Department of Dermatology School of Medicine Medical University of Silesia Katowice Poland Department of Systems Biology and Engineering Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Gliwice Poland Dermatology Private Practice Polish Dermatoscopy Group Poznań Poland Biotechnology Centre Silesian University of Technology Gliwice Poland

Background and Objective: Videodermoscopy is the gold standard in melanoma diagnosis. A new research trend aims to support specialists’ work by automating this examination method, but most research focuses on developing detectors to replace dermatologists. Our study aims to present a novel idea which focuses on supporting the examination process instead of completely automating it. Instead of detecting and classifying all naevi each time, our approach focuses on full screening at the first visit and shortening the examination at subsequent visits. During the following examinations, images of all naevi are taken by supporting staff and are compared with previously taken images using feature-matching or co-registration-based algorithms. An unmatched naevus needs to be checked by the specialist, meaning that a new naevus appeared or an old one had changed. Methods: The similarity between images (ranging from 0% to 100%) was obtained with characteristic points searching (ORB method) and co-registration-based methods. No dataset presenting changes of naevi over time exists, so augmenting the images from PH2 and HAM10000 datasets was required to simulate the time flow. Results: The decision bound was set, so the true positive rate of each method was equal to 99%, giving the specificity of ORB equal to 97% (PH2) and 89% (HAM10000). Similar tests were performed using a co-registration algorithm giving specificity equal to 23% (PH2) and 19% (HAM10000). Conclusions: We believe that employing our approach will allow supporting staff to perform screening without experts’ help, decreasing examination time and costs and increasing the accessibility of dermoscopic examinations. © 2025 The Authors

关键词： Dermoscopy Machine vision Melanoma Pattern recognition Template matching

来源：评论

学校读者我要写书评

暂无评论

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization

arXiv

引用

arXiv 2025年

作者： Singh, Nitesh Kumar Necoara, Ion School of Computer Science University of Petroleum and Energy Studies Uttarakhand Dehradun248007 India Automatic Control and Systems Engineering Department University Politehnica Bucharest Bucharest060042 Romania Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy Bucharest050711 Romania

This paper considers smooth convex optimization problems with many functional constraints. To solve this general class of problems we propose a new stochastic perturbed augmented Lagrangian method, called SGDPA, where a perturbation is introduced in the augmented Lagrangian function by multiplying the dual variables with a subunitary parameter. Essentially, we linearize the objective and one randomly chosen functional constraint within the perturbed augmented Lagrangian at the current iterate and add a quadratic regularization that leads to a stochastic gradient descent update for the primal variables, followed by a perturbed random coordinate ascent step to update the dual variables. We provide a convergence analysis in both optimality and feasibility criteria for the iterates of SGDPA algorithm using basic assumptions on the problem. In particular, when the dual updates are assumed to be bounded, we prove sublinear rates of convergence for the iterates of algorithm SGDPA of order O(k−1/2) when the objective is convex and of order O(k−1) when the objective is strongly convex, where k is the iteration counter. Under some additional assumptions, we prove that the dual iterates are bounded and in this case we obtain convergence rates of order O(k−1/4) and O(k−1/2) when the objective is convex and strongly convex, respectively. Preliminary numerical experiments on problems with many quadratic constraints demonstrate the viability and performance of our method when compared to some existing state-of-the-art optimization methods and software. © 2025, CC BY.

关键词： Lagrange multipliers

来源：评论

学校读者我要写书评

暂无评论

Performance evaluations of a cloud computing physical machine with task reneging and task resubmission (feedback) 27th

Performance evaluations of a cloud computing physical machin...

引用

27th International Conference on computer Networks, CN 2020

作者： Kuaban, Godlove Suila Soodan, Bhavneet Singh Kumar, Rakesh Czekalski, Piotr Institute of Theoretical and Applied Informatics Polish Academy of Sciences Baltycka 5 Gliwice44-100 Poland School of Mathematics Shri Mata Vaishno Devi University KatraJammu and Kashmir182320 India Department of Computer Graphics Vision and Digital Systems Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Akademicka 16 Gliwice44-100 Poland

ISBN: (纸本)9783030507183

Cloud service providers (CSP) provide on-demand cloud computing services, reduces the cost of setting-up and scaling-up IT infrastructure and services, and stimulates shorter establishment times for start-ups that offer or use cloud-based services. Task reneging or dropping sometimes occur when a task waits in the queue longer than its timeout or execution deadline, or it is compromised and must be dropped from the queue or as an active queue management strategy to avoid tail dropping of tasks when the queues are full. Reneged or dropped tasks could be resubmitted provided they were not dropped due to security reasons. In this paper, we present a simple M/M/c/N queueing model of a cloud computing physical machine, where the interarrival times and the services times are exponentially distributed, with N buffer size and c virtual machines running in parallel. We present numerical examples to illustrate the effect of task reneging and task resubmission on the queueing delay, probability of task rejection, and the probability of immediate service. © Springer Nature Switzerland AG 2020.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Reachability Analysis for Piecewise Affine System

arXiv

引用

arXiv 2025年

作者： Xie, Peng Betz, Johannes Raimondo, Davide M. Alanwar, Amr TUM School of Computation Information and Technology Department of Computer Engineering Technical University of Munich Heilbronn74076 Germany TUM School of Engineering and Design Department of Autonomous Vehicles Systems Technical University of Munich Garching85748 Germany School of Automatic Control Department of Engineering and Architecture University of Trieste Via Valerio 10 Trieste34127 Italy

Hybrid systems play a crucial role in modeling real-world applications where discrete and continuous dynamics interact, including autonomous vehicles, power systems, and traffic networks. Safety verification for these systems requires determining whether system states can enter unsafe regions under given initial conditions and uncertainties—a question directly addressed by reachability analysis. However, hybrid systems present unique difficulties because their state space is divided into multiple regions with distinct dynamic models, causing traditional data-driven methods to produce inadequate over-approximations of reachable sets at region boundaries where dynamics change abruptly. This paper introduces a novel approach using hybrid zonotopes for data-driven reachability analysis of piecewise affine systems. Our method addresses the boundary transition problem by developing computational algorithms that calculate the family of set models guaranteed to contain the true system trajectories. Additionally, we extend and evaluate three methods for set-based estimation that account for input-output data with measurement noise. © 2025, CC BY.

关键词： Convergence of numerical methods

来源：评论

学校读者我要写书评

暂无评论

Compositional Synthesis of Symbolic Models for Infinite Networks ⁎

引用

IFAC-PapersOnLine 2020年第2期53卷 1868-1873页

作者： Abdalla Swikir Navid Noroozi Majid Zamani Department of Electrical and Computer Engineering Technical University of Munich Germany Laboratory for Systems Theory and Automatic Control Otto-von-Guericke University Magdeburg Germany Computer Science Department University of Colorado BoulderUSA. Institute of Informatics Ludwig Maximilian University Munich Germany

In this paper, we provide a compositional method for the construction of symbolic models (a.k.a. finite abstractions) for infinite networks of discrete-time control systems. The concrete infinite network and its symbolic model are related by a so-called alternating simulation function which allows one to quantify the mismatch between the output behavior of the infinite interconnection of concrete subsystems and that of their symbolic models. We show that such an alternating simulation function can be obtained compositionally by assuming some small-gain type conditions and composing so-called local alternating simulation functions constructed for subsystems. Assuming certain stability property of concrete subsystems, we also provide a technique to synthesize their symbolic models together with their corresponding local alternating simulation functions. Finally, we apply our results to a traffic network divided into infinitely many cells.

关键词： Compositionality interconnected systems small-gain condition infinite networks symbolic models

来源：评论

学校读者我要写书评

暂无评论

Reduct-based ranking of attributes

引用

Procedia computer Science 2020年 176卷 2576-2585页

作者： Beata Zielosko Urszula Stańczyk 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 paper is dedicated to the area of feature selection, in particular a notion of attribute rankings that allow to estimate importance of variables. In the research presented for ranking construction a new weighting factor was defined, based on relative reducts. A reduct constitutes an embedded mechanism of feature selection, specific to rough set theory. The proposed factor takes into account the number of reducts in which a given attribute exists, as well as lengths of reducts. Two approaches for reduct generation were employed and compared, with search executed by a genetic algorithm. To validate the usefulness of the reduct-based rankings in the process of feature reduction, for gradually decreasing subsets of attributes, selected through rankings, sets of decision rules were induced in classical rough set approach. The performance of all rule classifiers was evaluated, and experimental results showed that the proposed rankings led to at least the same, or even increased classification accuracy for reduced sets of features than in the case of operating on the entire set of condition attributes. The experiments were performed on datasets from stylometry domain, with treating authorship attribution as a classification task, and stylometric descriptors as characteristic features defining writing styles.

关键词： feature reduction reduct ranking of attributes rough sets decision rules classification stylometry

来源：评论

学校读者我要写书评

暂无评论

Assessing quality of decision reducts

引用

Procedia computer Science 2020年 176卷 3273-3282页

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

The paper presents research focused on decision reducts, a feature reduction mechanism inherent to rough sets theory. As a reduct enables to protect the discriminative properties of attributes with respect to described concepts, from the point of data representation, a reduct length is considered to be the most important measure of its quality. However, such approach is insufficient while taking into account the performance of a reduct-based rule classifier applied to test samples. When many reducts of the same length are available, they can lead to vastly different predictions. The paper provides a description for the proposed procedure for iterative reduct generation, which results in decrease of diversity in the observed levels of accuracy, supporting reduct selection. The procedure was applied for binary classification with balanced classes, for the stylometric task of authorship attribution.

关键词： reduct rough sets decision rules classification stylometry feature reduction

来源：评论

学校读者我要写书评

暂无评论

A market-based approach for enabling inter-area reserve exchange

arXiv

引用

arXiv 2021年

作者： Karaca, Orcun Delikaraoglou, Stefanos Kamgarpour, Maryam Automatic Control Laboratory D-ITET ETH Zürich ETL K12 Physikstrasse 3 Zürich8092 Switzerland Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA United States Electrical and Computer Engineering Department University of British Columbia Vancouver Canada

Considering the sequential clearing of energy and reserves in Europe, enabling inter-area reserve exchange requires optimally allocating inter-area transmission capacities between these two markets. To achieve this, we provide a market-based allocation framework and derive payments with desirable properties. The proposed min-max least core selecting payments achieve individual rationality, budget balance, and approximate incentive compatibility and coalitional stability. The results extend the works on private discrete items to a network of continuous public choices. Copyright © 2021, The Authors. All rights reserved.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

A spectral small-gain condition for input-to-state stability of infinite networks

引用

IFAC-PapersOnLine 2020年第2期53卷 5303-5308页

作者： Christoph Kawan Andrii Mironchenko Abdalla Swikir Navid Noroozi Majid Zamani Institute of Informatics Ludwig Maximilian University Munich Germany Faculty of Computer Science and Mathematics University of Passau Germany Department of Electrical and Computer Engineering Technical University of Munich Germany Otto-von-Guericke University Magdeburg Laboratory for Systems Theory and Automatic Control Germany Computer Science Department University of Colorado Boulder USA

This paper presents a tight small-gain theorem for networks composed of infinitely many finite-dimensional subsystems. Assuming that each subsystem is exponentially input-to-state stable, we show that if the gain operator, collecting all the information about the internal Lyapunov gains, has a spectral radius less than one, the overall infinite network is exponentially input-to-state stable. We illustrate the effectiveness of our result by applying it to traffic networks.

关键词： Nonlinear systems small-gain theorems infinite-dimensional systems input-to-state stability Lyapunov methods large-scale systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：