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

International Conference on CAD Systems in Microelectronics (CADSM)

作者： Iwona Grobelna Andrei Karatkevich Autom. Control Electronics and Electr. Eng. University of Zielona Góra Zielona Góra Poland Dept. of Applied Computer Science AGH University of Science and Technology Kraków Poland

In the article a novel deadlock recovery policy for flexible m a nufacturing systems, modelled by the Petrinets, proposed. Deadlocks in manufacturing systems are costly, as then the system gets stuck in one of its states and does not evolve. The proposed policy is based on full reachability graph analysis and considers the paths from deadlock markings to preceding legal markings. As a result, the system may recover from all deadlock markings and continue its operation, and - at the same time - the number of recovery transitions added to the basic Petri net is minimal and the existing state space is not modified. The introduced policyisil lustrated with some weI known examples from the literature and confronted with the different approaches. The preliminary results indicate that the proposed deadlock recovery policy achieves good results in the respect of added recovery transitions.

关键词： Automation Law Petri nets System recovery Control systems Flexible manufacturing systems Manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

A Quick Heuristic Algorithm for Enforcing the Liveness of S3PR Petri Nets

A Quick Heuristic Algorithm for Enforcing the Liveness of S3...

引用

International Symposium on INFOTEH-JAHORINA (INFOTEH)

作者： Andrei Karatkevich Iwona Grobelna Dept. of Applied Computer Science AGH University of Science and Technology Kraków Poland Autom. Control Electronics and Electr. Eng. University of Zielona Góra Zielona Góra Poland

The optimal deadlock avoiding, deadlock recovery, as well as deadlock detection in Petri nets are the NP-hard problems. For this reason, heuristic algorithms for finding the approximate solutions of such problems are of a great interest. In the paper a heuristic method of deadlock recovery for the S 3 PR nets, which are often used for modelling of manufacturing systems, is proposed. The method is based on the idea of resetting the process instances in the S 3 PR nets and a heuristic for breaking the cycles in the wait-for graphs. The method does not require any time consuming operations such as construction of the reachability graph, explicit detecting of all reachable deadlocks or all elementary cycles in a wait-for graph, hence it is quick. The simple recovery transitions are added to the net providing recovery from both global and local deadlocks.

关键词： NP-hard problem Heuristic algorithms Petri nets Phantoms System recovery Control systems Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

IoT-Enabled Smart Manhole Management System for Real-time Status, Water Level, and Gas Detection

IoT-Enabled Smart Manhole Management System for Real-time St...

引用

Intelligent Systems for Cybersecurity (ISCS), International Conference on

作者： Md Asif Imran S M Masfequier Rahman Swapno Gunjan Chhabra Keshav KaushiK Md. Arif Anzum Mahi Md Babul Islam Rezaul Haque Dept. of Computer Science and Engineering Bangladesh University of Business and Technology Dhaka Bangladesh Department of CSE Graphic Era Hill University Dehradun Uttarakhand India Adjunct Professor Graphic Era Deemed to be University Dehradun Uttarakhand India School of Computer Science University of Petroleum and Energy Studies Dehradun Uttarakhand India Dept. of Computer Modeling Electronic and System Engineering UNICAL Rende Italy Applied Bahari Big Data Research House Dhaka Bangladesh Department of Computer Modeling Electronic and System Engineering UNICAL Rende Italy

ISBN: (数字)9798350375237

ISBN: (纸本)9798350375244

Regular monitoring of the maintenance manhole system is imperative to uphold the city's health and cleanliness standards. Our study offers an intelligent manhole that monitors the manhole's condition, water level, and gases. We tested the status, gas, and water levels of our revolutionary, innovative manhole in several places. Our system's Blink app position tracking of our smart manhole is critical. This capability improves monitoring efficiency and speeds up issue resolution. Our work revolutionizes municipal utility maintenance and safety by optimizing manhole performance. Integrating a Node MCU, GPS module, gas sensor, ultrasonic sensor, and Android Blynk software creates a complete real-time monitoring and data-collecting system. Combining these technologies, our Manhole Monitoring System improves safety and streamlines maintenance, making municipal infrastructure more robust and efficient. This paper highlights the promising features of IoT and shows how it may be used to improve the smart manhole. In the future, this creative method may result in a more durable and better intelligent city.

关键词： Surveillance Urban areas Robot vision systems Transforms Cameras Real-time systems Maintenance

来源：评论

学校读者我要写书评

暂无评论

Genetic Algorithm-Based Feature Selection for Accurate Breast Cancer Classification

Genetic Algorithm-Based Feature Selection for Accurate Breas...

引用

2023 International Conference on IT and Industrial Technologies, ICIT 2023

作者： Shabbir, Attia Ali, Raja Hashim Shabbir, Muhammad Zeeshan Abideen, Zain Ul Khan, Talha Ali Ijaz, Ali Zeeshan Ali, Nisar Imad, Muhammad Bakar, Muhammad Abu Gik Institute of Engg. Sciences & Technology Faculty of Computer Science & Engineering Topi Pakistan University of Europe for Applied Sciences Dept. of Technology & Software Engineering Berlin Germany Department of Electrical Engineering Lahore Pakistan BCMaterials Basque Center for Materials Applications & Nanostructure Basque Country Leioa Spain University of Regina Faculty of Electronic Systems Engineering Regina Canada

ISBN: (纸本)9798350315974

Breast cancer is a significant global healthcare challenge, particularly in developing and underdeveloped countries, with profound physical, emotional, and psychological consequences, including mortality. Timely diagnosis and accurate treatment are crucial in addressing this issue. We propose the utilization of a feature selection technique to identify the most relevant features from among all features for breast cancer diagnosis, and show that Genetic Algorithms are impressive for this task. The study compares the results of GA with no selection and an alternative method, Principle Component Analysis (PCA). Three machine learning models, all based on supervised learning with data split into training and test data, are employed for binary classification using the selected feature subset. The evaluation metrics employed encompass accuracy, precision, recall, and F1-score. Among the selected models, Random Forest demonstrates the most favorable outcomes, achieving an accuracy score of 0.96, precision score of 0.96, recall value of 0.98, and an F1-score of 0.97. These results underscore the effectiveness of GA in feature selection for breast cancer diagnosis. Consequently, the integration of Genetic Algorithms (GA) with Random Forest showcases the superior performance among the evaluated models. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

HTN Replanning from the Middle 35th

HTN Replanning from the Middle

引用

35th International Florida Artificial Intelligence Research Society Conference, FLAIRS-35 2022

作者： Bansod, Yash Patra, Sunandita Nau, Dana Roberts, Mark Institute for Systems Research Univ. of Maryland College ParkMD United States Dept. of Computer Science Univ. of Maryland College ParkMD United States Navy Center for Applied Research in AI Naval Research Laboratory Washington DC United States

When an actor executes a plan, action failures and exogenous events may lead to unexpected states that require replanning from the middle of plan execution. In Hierarchical Task Network (HTN) planning, unless the HTN methods have been carefully written to work well in unexpected states, replanning may either fail or produce plans that perform poorly. To overcome this problem, we introduce IPyHOP, a reentrant version of GTPyhop (a SHOP-like HTN plan-ner), and Run-Lazy-Refineahead, a modification of the Run-Lazy-Lookahead actor that utilizes IPyHOP’s reentrant replanning capability to replan during plan execution. In our experiments, Run-Lazy-Refineahead and IPyHOP expend less search effort (fewer decomposi-tions and fewer iterations), find revised plans with fewer actions and lower total action cost, and finish execution with fewer failures. © 2021 by the authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Clipping and Intersection Algorithms: Short Survey and References

arXiv

引用

arXiv 2022年

作者： Skala, Vaclav University of West Bohemia Faculty of Applied Sciences Dept. of Computer Science and Engineering PilsenCZ 301 00 Czech Republic

This contribution presents a brief survey of clipping and intersection algorithms in E2 and E3 with a nearly complete list of relevant references. Some algorithms use the projective extension of the Euclidean space and vector−vector operations, which supports GPU and SSE use. This survey is intended as help to researchers, students, and practitioners dealing with intersection and clipping *** Codes 68xx, 68U05 © 2022, CC BY.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Analysing capacity challenges in the Multi-Airport System of Mexico City 34

Analysing capacity challenges in the Multi-Airport System of...

引用

34th European Modeling and Simulation Symposium, EMSS 2022

作者： Mota, Miguel Mujica Berastegui, Irene Izco Faulin, Javier Amsterdam University of Applied Sciences Weesperzijde 190 Amsterdam1097DZ Netherlands Institute of Smart Cities Public University of Navarre Pamplona31006 Spain Institute of Smart Cities Dept. Statistics Computer Science and Mathematics Public University of Navarre Pamplona31006 Spain

The relentless growth in Mexico City’s aviation traffic has inevitably strained capacity development of its airport, raising the dilemma between the possible solutions. In the present study, Mexico’s Multi-Airport System is subjected to analysis by means of multi-model simulation, focusing on the capacity-demand problem of the system. The methodology combines phases of modelling, data collection, simulation, experimental design, and analysis. Drawing a distinction from previous works involving two-airport systems. It also explores the challenges raised by the Covid-19 pandemic in Mexico City airport operations, with a discrete-event simulation model of a multi-airport system composed by three airports (MEX, TLC, and the new airport NLU). The study is including the latest data of flights, infrastructures, and layout collected in 2021. Therefore, the paper aims to answer to the question of whether the system will be able to cope with the expected demand in a short-, medium-, and long-term by simulating three future scenarios based on aviation forecasts. The study reveals potential limitations of the system as time evolves and the feasibility of a joint operation to absorb the demand in such a big region like Mexico City. © 2022 The Authors.

关键词： Airports

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Finding an Exact Maximum Distance in E2 with Oexp(N) Complexity: Analysis and Experimental Results

arXiv

引用

arXiv 2022年

作者： Skala, Vaclav Dept. of Computer Science and Engineering Faculty of Applied Sciences University of West Bohemia PilsenCZ 301 00 Czech Republic

Finding a maximum distance of points in E2 or in E3 is one of those. It is a frequent task required in many applications. In spite of the fact that it is an extremely simple task, the known "Brute force" algorithm is of O(N2) complexity. Due to this complexity the run-time is very long and unacceptable especially if medium or larger data sets are to be processed. An alternative approach is convex hull computation with complexity higher than O(N) followed by diameter computation with O(M2) complexity. The situation is similar to sorting, where the bubble sort algorithm has O(N2) complexity that cannot be used in practice even for medium data sets. This paper describes a novel and fast, simple and robust algorithm with O(N) expected complexity which enables to decrease run-time needed to find the maximum distance of two points in E2. It can be easily modified for the Ek case in general. The proposed algorithm has been evaluated experimentally on larger different datasets in order to verify it and prove expected properties of it. Experiments proved the advantages of the proposed algorithm over the standard algorithms based on the "Brute force", convex hull or convex hull diameters approaches. The proposed algorithm gives a significant speed-up to applications, when medium and large data sets are processed. It is over 10 000 times faster than the standard "Brute force" algorithm for 106 points randomly distributed points in E2 and over 4 times faster than convex hull diameter computation. The speed-up of the proposed algorithm grows with the number of points *** Codes 02.60.-x, ***, 02.60 Dc, *** © 2022, CC BY.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

SS-SFR: Synthetic Scenes Spatial Frequency Response on Virtual KITTI and Degraded Automotive Simulations for Object Detection 26

SS-SFR: Synthetic Scenes Spatial Frequency Response on Virtu...

引用

26th Irish Machine Vision and Image Processing Conference, IMVIP 2024

作者： Jakab, Daniel Braun, Alexander Agnew, Cathaoir Mohandas, Reenu Deegan, Brian Michael Molloy, Dara Ward, Enda Scanlan, Anthony Eising, Ciarán Dept. of Electronic and Computer Engineering University of Limerick Castletroy LimerickV94 T9PX Ireland Faculty of Electrical Engineering & Information Technology University of Applied Sciences Düsseldorf40476 Germany Dept. of Electrical and Electronic Engineering University of Galway GalwayH91 TK33 Ireland Valeo Vision Systems GalwayDY1 22DJ Ireland Lero the Science Foundation Ireland Research Centre for Software University of Limerick LimerickV94 T9PX Ireland

ISBN: (纸本)9781837242672

Automotive simulation can potentially compensate for a lack of training data in computer vision applications. However, there has been little to no image quality evaluation of automotive simulation and the impact of optical degradations on simulation is little explored. In this work, we investigate Virtual KITTI and the impact of applying variations of Gaussian blur on image sharpness. Furthermore, we consider object detection, a common computer vision application on three different state-of-the-art models, thus allowing us to characterize the relationship between object detection and sharpness. It was found that while image sharpness (MTF50) degrades from an average of 0.245cy/px to approximately 0.119cy/px;object detection performance stays largely robust within 0.58%(Faster RCNN), 1.45%(YOLOF) and 1.93%(DETR) across all respective held-out test sets. © This is an open access article published by the IET under the Creative Commons Attribution License (http://***/licenses/by/3.0/)

关键词： Automobile simulators

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Goal-Biased Curriculum for Training Reinforcement Learning 35th

A Hierarchical Goal-Biased Curriculum for Training Reinforce...

引用

35th International Florida Artificial Intelligence Research Society Conference, FLAIRS-35 2022

作者： Patra, Sunandita Cavolowsky, Mark Kulaksizoglu, Onur Li, Ruoxi Hiatt, Laura M. Roberts, Mark Nau, Dana Dept. of Computer Science Univ. of Maryland College ParkMD United States Institute for Systems Research Univ. of Maryland College ParkMD United States Navy Center for Applied Research in AI Naval Research Laboratory Washington DC United States

Hierarchy and curricula are two techniques commonly used to improve training for Reinforcement Learning (RL) agents. Yet few works have examined how to leverage hierarchical planning to generate a curriculum for training RL Options. We formalize a goal skill that extends an RL Option with state-based conditions that must hold during training and execution. We then define a Goal-Skill Network that integrates a Hierarchical Goal Network, a variant of hierarchical planning, with goal skills as the leaves of the network. An automatically generated plan for a Goal-Skill Network correctly orders goal skills such that (1) it is a Goal-Biased Curriculum for training the goal skills, and (2) it can be executed to achieve top-level goals. In a set of six distinct gridworld environments using up to ten goal skills, we demonstrate that these contributions train nearly perfect policies significantly faster than learning a whole policy from scratch. © 2021 by the authors. All rights reserved.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：