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

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

来源：评论

学校读者我要写书评

暂无评论

Microbiological and biological analysis of polymer-oxide coatings formed on dental implants enriched with clindamycin

引用

Materials Chemistry and Physics 2025年 344卷

作者： Knap, Hubert Jaśko, Weronika Maciak, Weronika Ślęzak-Prochazka, Izabella Kazek-Kęsik, Alicja Silesian University of Technology Faculty of Chemistry B. Krzywoustego Str. 6 Gliwice44–100 Poland Department of Systems Biology and Engineering Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Akademicka 16 Gliwice44–100 Poland Silesian University of Technology Biotechnology Centre Krzywoustego Str. 8 Gliwice44–100 Poland

Coatings on dental implants are still being developed in order to obtain an ideal balance between their cytocompatibility and antibacterial properties. This paper presents the bacteriostatic and biological properties of oxide-polymer layers with clindamycin on titanium dental implants. A layer was formed on the surface of titanium implants, which was composed of poly(lactic-co-glycolic acid) (PLGA) and clindamycin. The surface morphology was analyzed using an optical microscope and a scanning electron microscope (SEM). Clindamycin loaded into the polymer was successfully found to inhibit S. aureus and slightly inhibit E. coli bacteria. The average inhibition zone obtained for S. aureus was 14 mm. Only single bacteria were found to be adhered to the implant surface, and changes in their morphology were observed (SEM analysis). The cytocompatibility of the implant extracts was evaluated via the Alamar Blue test and by using cytometry techniques. More than 95 % of L929 cells were found to be living after 24 h of their culture with extracts collected from the implants with hybrid coatings. Additionally, the stability of different concentrations of clindamycin in aqueous solutions at various temperatures was analyzed. It was found that the storage of clindamycin at 4 °C caused the lowest changes in concentration. The concentration of clindamycin influenced both the L929 cells’ viability and bacterial inhibition. © 2025 The Authors

关键词： Dental prostheses

来源：评论

学校读者我要写书评

暂无评论

Correction to: Utilizing social media and machine learning for personality and emotion recognition using PERS

引用

Neural Computing and Applications 2023年第10期36卷 5649-5649页

作者： Talaat, Fatma M. El-Gendy, Eman M. Saafan, Mahmoud M. Gamel, Samah A. Faculty of Artificial Intelligence Kafrelsheikh University Kafrelsheikh Egypt Faculty of Computer Science and Engineering New Mansoura University Gamasa Egypt Nile Higher Institute for Engineering and Technology Mansoura Egypt Computers and Control Systems Engineering Department Faculty of Engineering Mansoura University Mansoura Egypt Electronics and Communication Engineering Department Faculty of Engineering Horus University Damietta Egypt

来源：评论

学校读者我要写书评

暂无评论

A Real-Time Balancing Market Optimization with Personalized Prices: From Bilevel to Convex

arXiv

引用

arXiv 2020年

作者： Shomalzadeh, Koorosh Scherpen, Jacquelien M.A. Camlibel, M. Kanat Jan C. Willems Center for Systems and Control Bernoulli Institute for Mathematics Computer Science and Artificial Intelligence Faculty of Science and Engineering University of Groningen Nijenborgh 9 Groningen9747 AG Netherlands Jan C. Willems Center for Systems and Control Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen Nijenborgh 4 Groningen9747 AG Netherlands

This paper studies the static economic optimization problem of a system with a single aggregator and multiple prosumers in a Real-Time Balancing Market (RTBM). The aggregator, as the agent responsible for portfolio balancing, needs to minimize the cost for imbalance satisfaction in real-time by proposing a set of optimal personalized prices to the prosumers. On the other hand, the prosumers, as price taker and self-interested agents, want to maximize their profit by changing their supplies or demands and providing flexibility based on the proposed personalized prices. We model this problem as a bilevel optimization problem. We first show that the optimal solution of this bilevel optimization problem can be found by solving an equivalent convex problem. In contrast to the state-of-the-art Mixed-Integer Programming (MIP)-based approach to solve bilevel problems, this convex equivalent has very low computation time and is appropriate for real-time applications. Next, we compare the optimal solutions of the proposed personalized scheme and a uniform pricing scheme. We prove that, under the personalized pricing scheme, more prosumers contribute to the RTBM and the aggregator's cost is less. Finally, we verify the analytical results of this work by means of numerical case studies and simulations. Copyright © 2020, The Authors. All rights reserved.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Structural Decomposition Approach to Design of No-Wait Cyclic Schedules for Repeatedly Operating Transport System Dedicated to Supply Loops

引用

IFAC-PapersOnLine 2020年第2期53卷 10542-10549页

作者： Robert Wójcik Arkadiusz Gola Jarosław Pempera Justyna Patalas-Maliszewska Department of Computer Engineering Faculty of Electronics Wrocław University of Science and Technology Wrocław Poland Institute of Technological Systems of Information Lublin University of Technology Lublin Poland Department of Control Systems and Mechatronics Faculty of Electronics Wrocław University of Science and Technology Wrocław Poland Institute of Mechanical Engineering University of Zielona Góra Zielona Góra Poland

The paper presents a method allowing to construct no-wait cyclical schedules for repetitive transport systems (e.g. the milk-run) servicing cyclic material supply loops in the production system using selected means of transport (e.g. AGVs). The transport means are following established routes and given arrival times. The routes are composed of sectors linking workstations. Transport trolleys may share specific sectors of the route in mutual exclusion mode and must wait in a given sector to enter the next sector of the route when another trolley occupies it. The job-shop repetitive transportation system is a system of cyclic processes with a fixed structure that are executing sequences of operations (routes) using shared resources (sectors). The work aims to find a no-wait cyclic schedule that guarantees the required delivery dates or establish that such a schedule does not exist. It considers cyclic process systems for which each resource can be used by at most two operations, and the deadlock state cannot occur as a result of waiting processes on shared resources. For specified initial operations of cyclic processes and their start times (the initial system state), the problem of determining no-wait cyclical schedules decomposes into subproblems. Each subproblem consists of the verification of necessary and sufficient conditions for the existence of solutions for each of 2-process subsystems composed of one shared resource and two processes using this resource. The method aims of prototyping various variants of process starting times for which the conditions guaranteeing no-wait property of the system hold simultaneously for each of the 2-process subsystems. It allows designing cyclic schedules for complex systems composed of 2-process subsystems that are structurally deadlock-free. The class of cyclical processes considered in this article is broader than the class of cascade-like (chain-like, sequential) process systems analysed so far in the literature. In this

关键词： repetitive delivery systems milk-run routing scheduling vehicle routing problem job-shop type transportation systems resource blocking deadlock problem no-wait cyclic schedule two cyclic processes with a shared resource decomposition of the system structure

来源：评论

学校读者我要写书评

暂无评论

Disturbance Attenuation via Nonlinear Feedback for Chemical Reaction Networks

引用

IFAC-PapersOnLine 2020年第2期53卷 11497-11502页

作者： Lőrinc Márton Katalin M. Hangos Gábor Szederkényi Department of Electrical Engineering Sapientia Hungarian University of Transylvania Tirgu Mures Romania Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary Faculty of Information Technology and Bionics Pázmány Péter Catholic University Budapest Hungary Department of Electrical Engineering and Information Systems University of Pannonia Veszprém Hungary

This paper deals with the setpoint control of Chemical Reaction Networks (CRNs) in the presence of disturbances. The addressed control problem is traced back to the output feedback-based stabilization of passive systems. First, the passivity properties of complex balanced CRNs are discussed. Second, it is shown that, by combining the kinetic feedback based control with the passivity theory-based output feedback approach, arbitrary disturbance attenuation in controlled CRNs can be achieved. A case study is provided to demonstrate the applicability of the proposed control design approach.

关键词： Chemical Reaction Networks Passivity Setpoint control Disturbance Attenuation

来源：评论

学校读者我要写书评

暂无评论

control and decision method for overtaking problem in autonomous vehicles 16

Control and decision method for overtaking problem in autono...

引用

16th Mini Conference on Vehicle System Dynamics, Identification and Anomalies, VSDIA 2018

作者： Hegedűs, Tamás Németh, Balázs Bede, Zsuzsanna Department of Control for Transportation and Vehicle Systems Faculty of Transportation Engineering and Vehicle Engineering Budapest University of Technology and Economics Stoczek utca. 2 BudapestH-1111 Hungary Systems and Control Laboratory Institute for Computer Science and Control Kende utca 13-17 BudapestH-1111 Hungary

In this paper we deal with an overtaking and lane change strategy for autonomous vehicles. The algorithm is divided into two main layers. The upper layer is responsible for the decision making (e.g lane changing). Before decision-making we predict the motion of other participants and divide the road into discrete sets in each interval, then we compute the probability of occupancy. Considering the state of the motion of ego vehicle we can compute the probability of collision. After assigning a graph points to discrete elements, the probability of collision is ordered to the graph edges, then we determine the route with the smallest cost. The decision-making algorithm is not able to control the vehicle, so it is necessary to design a traceable trajectory for the vehicle. Since we have a series of points to be reached for the future, this can be used as a reference vector for the trajectory design algorithm. One Model Predicitve controller (MPC) is responsible for the design of the trajectory so we can obtain limitations to several states to ensure comfort and security. Extending the algorithm, we can compute the longitudinal movement as well. In this paper the decision-making and the trajectory planning algorithm is presented, and the whole model validated in CarMaker. © 2019 Budapest University of Technology and Economics. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Distributing Potential Games on Graphs Part I. Game formulation

引用

IFAC-PapersOnLine 2020年第2期53卷 6697-6702页

作者： Mohamed I. El-Hawwary Jonas Mårtensson Division of Decision and Control Systems School of Electrical Engineering & Computer Science KTH Royal Institute of Technology SE-100 44 Stockholm Sweden Department of Electrical Power Engineering Faculty of Engineering Cairo University Giza 12613 Egypt

The paper presents the problem of distributing potential games over communication graphs. Suppose a potential game can be designed for a group of agents (players) where each has access to all others’ actions (strategies). The paper shows how to design a corresponding potential game for these agents if the full information assumption is replaced with communication over a network depicted by undirected graphs with certain properties. A state-based formulation for potential games is utilized. This provides degrees of freedom to handle the previous information limitation. Notions of Nash’s equilibria for the developed game (called here distributed potential game) are presented, and relations between these equilibria and those of the full information game are studied. In part II of the paper learning Nash equilibria for the newly developed game is studied. The development focuses on providing a way to utilize available algorithms of the full information game. The motivation for the results comes from a platoon matching problem for heavy duty vehicles. Utilizing the newly developed distributed game, recent results based on potential games can be extended, providing a basis for an on-the-go strategy where platoon matching on road networks can be solved locally.

关键词： Potential games distributed optimization multi-agents

来源：评论

学校读者我要写书评

暂无评论

Distributing Potential Games on Graphs Part II. Learning with application to platoon matching

引用

IFAC-PapersOnLine 2020年第2期53卷 6703-6708页

In part I of the paper the problem of distributing potential games over undirected graphs was formulated. A restricted information potential game was designed using state-based formulation. Here, learning Nash equilibria for this game is studied. An algorithm is developed with mainly two phases, an estimation phase and a learning phase. The setting allows for available learning methods of the full information game to be directly incorporated in the learning phase. The result matches the outcome (i.e. converges to the same equilibria) of the full information game. In addition, the design takes into account considerations of convergence time, and synchrony of actions update. The developed distributed game and learning algorithm are used to solve a platoon matching problem for heavy duty vehicles. This serves two objectives. First, it provides a motivation for the presented gaming results. Second, the problem addressed can facilitate platoon matching where it provides a basis for an on-the-go strategy.

关键词： Potential games distributed optimization multi-agents platoon matching

来源：评论

学校读者我要写书评

暂无评论

Investigation of the hyperchaos and control in the fractional order financial system with profit margin

引用

Partial Differential Equations in Applied Mathematics 2024年 9卷

作者： Johansyah, Muhamad Deni Sambas, Aceng Qureshi, Sania Zheng, Song Abed-Elhameed, Tarek M. Vaidyanathan, Sundarapandian Sulaiman, Ibrahim Mohammed Department of Mathematics Faculty of Informatics and Computing Universiti Sultan Zainal Abidin Campus Besut Terengganu 22200 Malaysia Department of Mechanical Engineering Universitas Muhammadiyah Tasikmalaya Tamansari Gobras Tasikmalaya 46196 Indonesia Department of Computer Science and Mathematics Lebanese American University Beirut 13-5053 Lebanon Department of Mathematics Near East University Mersin 99138 Turkey Department of Basic Sciences and Related Studies Mehran University of Engineering and Technology Jamshoro 72060 Pakistan School of Data Science Zhejiang University of Finance and Economics Hangzhou 310018 China Institute of Mathematics and Interdisciplinary Sciences Zhejiang University of Finance and Economics 310018 China Department of Mathematics Faculty of Science Assiut University Assiut 71516 Egypt Centre for Control Systems Vel Tech University Avadi Tamil Nadu Chennai 600062 India Institute of Strategic Industrial Decision Modelling School of Quantitative Sciences Universiti Utara Malaysia Sintok Bukit Kayu Hitam Kedah 06010 Malaysia Faculty of Education and Arts Sohar University Sohar 311 Oman

This research study proposes a novel hyperchaotic finance system with profit margin and then utilizes the Adomian Decomposition Method (ADM) to tackle the solution of the associated Caputo-derivative based fractional-order hyperchaotic finance system with profit margin. Numerical simulations and analyses, such as the evaluation of Lyapunov exponents (LE), the creation of bifurcation diagrams (BD), the complexity analysis (CA), and the 0-1 test, are used to get a full picture of the system. The results of our study demonstrate the occurrence of periodic, chaotic, and hyperchaotic dynamics in the system. Furthermore, the overall criteria for the existence and the uniqueness of the exact solutions for Caputo fractional-order models are presented. In addition, we present a control methodology for the fractional-order hyperchaotic financial system utilizing the Laplace transform and linear feedback control. Significantly, our research showcases a noteworthy correlation between the analytical results and numerical simulations, emphasizing the soundness and effectiveness of our methodology. © 2024 The Author(s)

关键词： Chaotic system Financial system Fractional order Hyperchaos

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：