The research is devoted to the development of an intelligent technology for diagnosing industrial equipment of oil and gas facilities based on an improved FMEA methodology (Analysis of Modes, Failures of their Influence, Degree of Criticality) in combination with a unified artificial immune system (UIIS) and the principles of immunological homeostasis. The main trends in the development of bioinspired artificial intelligence technologies are considered. A unified artificial immune system is built on the basis of modified algorithms of the artificial immune system (AIS) in order to identify the most effective ones (in data processing and forecasting) for a certain set of production data. The application of the principles of immunological homeostasis to assess modified algorithms allows identifying the «homeostasis area» in which the algorithms have the best predictive properties and can form an adequate immune response. The extension of the FMEA methodology with an intelligent block based on UAIS allows to automate the information processing previously carried out manually by experts, reduce time and resources when diagnosing equipment, and eliminate errors associated with the «human factor». The technology has been approbated on real data on equipment failures at TengizChevroil company (oil and gas industry) and on experimental data on equipment from Schneider Electric (Industrial Automation Lab).
{"title":"Data-driven machinery faults detection techniques using Artificial Intelligence in Industry 4.0 concept","authors":"Galina Samigulina , Zarina Samigulina , Daulet Bekeshev , Diana Butakova","doi":"10.1016/j.procs.2025.03.053","DOIUrl":"10.1016/j.procs.2025.03.053","url":null,"abstract":"<div><div>The research is devoted to the development of an intelligent technology for diagnosing industrial equipment of oil and gas facilities based on an improved FMEA methodology (Analysis of Modes, Failures of their Influence, Degree of Criticality) in combination with a unified artificial immune system (UIIS) and the principles of immunological homeostasis. The main trends in the development of bioinspired artificial intelligence technologies are considered. A unified artificial immune system is built on the basis of modified algorithms of the artificial immune system (AIS) in order to identify the most effective ones (in data processing and forecasting) for a certain set of production data. The application of the principles of immunological homeostasis to assess modified algorithms allows identifying the «homeostasis area» in which the algorithms have the best predictive properties and can form an adequate immune response. The extension of the FMEA methodology with an intelligent block based on UAIS allows to automate the information processing previously carried out manually by experts, reduce time and resources when diagnosing equipment, and eliminate errors associated with the «human factor». The technology has been approbated on real data on equipment failures at TengizChevroil company (oil and gas industry) and on experimental data on equipment from Schneider Electric (Industrial Automation Lab).</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"257 ","pages":"Pages 404-411"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-04-25DOI: 10.1016/j.procs.2025.03.062
Kevin Power, Yassine Lahlou-Kamal, Nikolay Aristov, Elenna Dugundji, Thomas Koch
This study uses a discrete-event simulation model, built with open-source software, to analyze import container flows at the Port of New York/New Jersey. The model integrates input and parameter distributions derived from extensive data analysis of publicly available import records, enhanced by machine learning techniques, including Natural Language Processing for commodity classification using unstructured shipping manifest product descriptions. Initial results demonstrate the effectiveness of Gaussian Kernel Density Estimate (KDE) and Fourier models in representing container dwell times, reducing mean absolute error compared to normal distribution by up to 39.5% for dry containers and 24.8% for reefers. A fine-tuned BERT model achieves over 80% accuracy in commodity classification to the four-digit HS code level, enabling improved input data structuring for simulation. Initial scenario testing indicates increasing outbound rail freight from 15% to 25% of total containers reduces truck congestion by 11.5% and decreases median dwell time by 1.52% for dry containers and 2.55% for reefers. These findings highlight the potential for logistical adjustments to improve efficiency and reduce congestion at the Port of New York/New Jersey.
{"title":"From Dock to Destination: Toward an End-to-End Simulation Study","authors":"Kevin Power, Yassine Lahlou-Kamal, Nikolay Aristov, Elenna Dugundji, Thomas Koch","doi":"10.1016/j.procs.2025.03.062","DOIUrl":"10.1016/j.procs.2025.03.062","url":null,"abstract":"<div><div>This study uses a discrete-event simulation model, built with open-source software, to analyze import container flows at the Port of New York/New Jersey. The model integrates input and parameter distributions derived from extensive data analysis of publicly available import records, enhanced by machine learning techniques, including Natural Language Processing for commodity classification using unstructured shipping manifest product descriptions. Initial results demonstrate the effectiveness of Gaussian Kernel Density Estimate (KDE) and Fourier models in representing container dwell times, reducing mean absolute error compared to normal distribution by up to 39.5% for dry containers and 24.8% for reefers. A fine-tuned BERT model achieves over 80% accuracy in commodity classification to the four-digit HS code level, enabling improved input data structuring for simulation. Initial scenario testing indicates increasing outbound rail freight from 15% to 25% of total containers reduces truck congestion by 11.5% and decreases median dwell time by 1.52% for dry containers and 2.55% for reefers. These findings highlight the potential for logistical adjustments to improve efficiency and reduce congestion at the Port of New York/New Jersey.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"257 ","pages":"Pages 477-484"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-04-25DOI: 10.1016/j.procs.2025.03.022
Jin Ki Eom , Seonhwa Jung , Kwang Sub Lee
In 2022, Korea introduced the MTC card to promote public transportation. The MTC card offers up to 30% savings on transportation costs by accumulating mileage based on walking or cycling distances and records data on first- and last-mile trips. A case study at Gangnam Station in Seoul, Korea analyzed combined transit transfer patterns during morning peak and evening peak hours at Gangnam Station by constructing multinomial logit model. The models focused on between two transit modes since the MTC data reported that the average transfer frequency of 1.32 for public transportation users in the Seoul metropolitan area. The four-transit mode combinations such as ‘Metro to Bus’, ‘Metro to Metro’, ‘Bus to Bus’, and ’ Bus to Metro’ were set as choice variables. The results show that during the morning peak hours, ‘Bus to Metro (BtoM)’ combination is mostly preferred, while the ‘Metro to Bus (MtoB)’ combination is favored in the evening. Morning commuters are more sensitive to time and costs than evening commuters. By identifying preferred transportation combinations for each time period, policymakers develop appropriate planning for public transportation services.
{"title":"Combined transit mode choice patterns for commuters from transit card data in Korea","authors":"Jin Ki Eom , Seonhwa Jung , Kwang Sub Lee","doi":"10.1016/j.procs.2025.03.022","DOIUrl":"10.1016/j.procs.2025.03.022","url":null,"abstract":"<div><div>In 2022, Korea introduced the MTC card to promote public transportation. The MTC card offers up to 30% savings on transportation costs by accumulating mileage based on walking or cycling distances and records data on first- and last-mile trips. A case study at Gangnam Station in Seoul, Korea analyzed combined transit transfer patterns during morning peak and evening peak hours at Gangnam Station by constructing multinomial logit model. The models focused on between two transit modes since the MTC data reported that the average transfer frequency of 1.32 for public transportation users in the Seoul metropolitan area. The four-transit mode combinations such as ‘Metro to Bus’, ‘Metro to Metro’, ‘Bus to Bus’, and ’ Bus to Metro’ were set as choice variables. The results show that during the morning peak hours, ‘Bus to Metro (BtoM)’ combination is mostly preferred, while the ‘Metro to Bus (MtoB)’ combination is favored in the evening. Morning commuters are more sensitive to time and costs than evening commuters. By identifying preferred transportation combinations for each time period, policymakers develop appropriate planning for public transportation services.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"257 ","pages":"Pages 150-157"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-04-25DOI: 10.1016/j.procs.2025.03.021
Belal Alghafri, Abdallah Tubaishat
AI-driven surveillance has emerged as a critical tool for enhancing public safety, enabling authorities to monitor and prevent crime and terrorism more effectively. In countries like the UAE and the USA, these systems are often implemented under the pretext of national security, offering advanced methods to track potential threats. However, the increasing reliance on AI for surveillance raises significant ethical concerns about privacy and individual freedoms. The boundary between protecting citizens and infringing on their privacy becomes increasingly blurred, potentially leading to abuses of power, diminished public trust, and a pervasive atmosphere of fear. This paper explores the complex relationship between privacy and security in AI-driven surveillance practices in the UAE and the USA. Despite their differing political and legal systems, both countries face similar challenges in managing the ethical implications of AI surveillance. While these technologies can improve accuracy and efficiency, unchecked surveillance poses risks to civil liberties, particularly regarding data collection, analysis, and utilization. The central ethical dilemma revolves around whether certain rights should be compromised for security. While some scholars argue that the benefits of AI surveillance justify its use, others contend that privacy and freedom must remain inviolable, even amid security threats. The paper also examines the distinct approaches of the UAE and the USA in implementing surveillance systems. In the UAE, a centralized authority and significant technological investments have enabled extensive state surveillance with minimal public resistance. In contrast, the USA, as a democratic nation, continues to grapple with legal and ethical debates surrounding the limitations of its surveillance programs. The study aims to compare surveillance practices, analyze legal frameworks, and evaluate the impact on citizen freedoms. It concludes with policy recommendations to ensure responsible AI use, balancing national security with fundamental human rights.
{"title":"Balancing Privacy and Security: A Comparative Analysis of AI-Driven Surveillance in the UAE and USA","authors":"Belal Alghafri, Abdallah Tubaishat","doi":"10.1016/j.procs.2025.03.021","DOIUrl":"10.1016/j.procs.2025.03.021","url":null,"abstract":"<div><div>AI-driven surveillance has emerged as a critical tool for enhancing public safety, enabling authorities to monitor and prevent crime and terrorism more effectively. In countries like the UAE and the USA, these systems are often implemented under the pretext of national security, offering advanced methods to track potential threats. However, the increasing reliance on AI for surveillance raises significant ethical concerns about privacy and individual freedoms. The boundary between protecting citizens and infringing on their privacy becomes increasingly blurred, potentially leading to abuses of power, diminished public trust, and a pervasive atmosphere of fear. This paper explores the complex relationship between privacy and security in AI-driven surveillance practices in the UAE and the USA. Despite their differing political and legal systems, both countries face similar challenges in managing the ethical implications of AI surveillance. While these technologies can improve accuracy and efficiency, unchecked surveillance poses risks to civil liberties, particularly regarding data collection, analysis, and utilization. The central ethical dilemma revolves around whether certain rights should be compromised for security. While some scholars argue that the benefits of AI surveillance justify its use, others contend that privacy and freedom must remain inviolable, even amid security threats. The paper also examines the distinct approaches of the UAE and the USA in implementing surveillance systems. In the UAE, a centralized authority and significant technological investments have enabled extensive state surveillance with minimal public resistance. In contrast, the USA, as a democratic nation, continues to grapple with legal and ethical debates surrounding the limitations of its surveillance programs. The study aims to compare surveillance practices, analyze legal frameworks, and evaluate the impact on citizen freedoms. It concludes with policy recommendations to ensure responsible AI use, balancing national security with fundamental human rights.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"257 ","pages":"Pages 142-149"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-03-07DOI: 10.1016/j.procs.2025.02.262
Giorgio Locicero , Antonio Di Maria , Salvatore Alaimo , Alfredo Pulvirenti
The complexity of networked systems, particularly interconnected networks, necessitates advanced simulation frameworks to accurately emulate real-world dynamics, especially in the context of big data and high-performance computing. Most software used for simulation and temporal inference usually falls short in large data and optimization, since it is generally used in particular contexts, like simulating the dynamics of a specific group of entities, such as cellular and community interactions. We present ”Multi-Agent Adaptive Simulation Framework for Evolution in Networks of Networks” (MASFENON). MASFENON employs a temporal multi-layered approach to simulate and analyze dynamic processes in interconnected networks. The framework leverages parallel programming techniques for matrix and linear algebra operations and distributed and reactive programming for agent and environment communication, all implemented in C++ using the Message Passing Interface (MPI) standard. MASFENON has been validated against several common network models and could simulate the behavior of real systems in the context of epidemic simulations (See [4]). The framework demonstrates sublinear speedup and scalability with network size. The implementation is open source and available in a regularly updated GitHub repository1. MASFENON's integration of MPI and distributed programming techniques provides a powerful and versatile tool for modeling complex network interactions and dynamics. Its capabilities extend beyond traditional models, offering new insights and applications in network science.
{"title":"MASFENON: implementing a multi-agent simulation framework for interconnected networks with distributed programming","authors":"Giorgio Locicero , Antonio Di Maria , Salvatore Alaimo , Alfredo Pulvirenti","doi":"10.1016/j.procs.2025.02.262","DOIUrl":"10.1016/j.procs.2025.02.262","url":null,"abstract":"<div><div>The complexity of networked systems, particularly interconnected networks, necessitates advanced simulation frameworks to accurately emulate real-world dynamics, especially in the context of big data and high-performance computing. Most software used for simulation and temporal inference usually falls short in large data and optimization, since it is generally used in particular contexts, like simulating the dynamics of a specific group of entities, such as cellular and community interactions. We present ”Multi-Agent Adaptive Simulation Framework for Evolution in Networks of Networks” (MASFENON). MASFENON employs a temporal multi-layered approach to simulate and analyze dynamic processes in interconnected networks. The framework leverages parallel programming techniques for matrix and linear algebra operations and distributed and reactive programming for agent and environment communication, all implemented in C++ using the Message Passing Interface (MPI) standard. MASFENON has been validated against several common network models and could simulate the behavior of real systems in the context of epidemic simulations (See [<span><span>4</span></span>]). The framework demonstrates sublinear speedup and scalability with network size. The implementation is open source and available in a regularly updated GitHub repository1. MASFENON's integration of MPI and distributed programming techniques provides a powerful and versatile tool for modeling complex network interactions and dynamics. Its capabilities extend beyond traditional models, offering new insights and applications in network science.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"255 ","pages":"Pages 73-82"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-03-07DOI: 10.1016/j.procs.2025.02.264
Thomas Geenen , Even Marius Nordhagen , Victor Sanchez , Cathal O'Brien , Simon Lang , Mihai Alexe , Ana Prieto Nemesio , Gert Mertes , Rakesh Prithiviraj , Jesper Dramsch , Baudouin Raoult , Florian Pinault , Helen Theissen , Sara Hahner , Mario Santa Cruz , Matthew Chantry , Nils Wedi
On October 13 2023 ECMWF released the first alpha version of its artificial intelligence forecasting system, AIFS, ECMWFs data-driven forecasts model. This first release came just a few months after ECMWF started the development of this new model that highlights the increased efforts in the field of machine learning (ML) that ECMWF has been building over the last few years. This paper describes the use of AIFS on EuroHPC systems in the context of DestinE. The main focus is on performance benchmarks on the different EuroHPC systems available to DestinE but also very much on the deployment and use of the tools to support the model lifecycle management. EuroHPC systems have already proven to be of great value for DestinE and in this paper, we describe how we leverage these systems for artificial intelligence (AI) and ML models in DestinE. We are closely working with EuroHPC and EuroHPC hosting sites through co-design and the optimization of existing solutions to optimize the usage of these systems in every step of the lifecycle management for AI and ML models. The performance benchmarks of our models on several EuroHPC systems showed that the speedup is close to linear up to several thousand GPUs, but that for each EuroHPC system a different optimization strategy must be used to achieve that. For model lifecycle management we found that we can use our in-house developed, domain specific, framework on EuroHPC systems and highlight some specific modifications and future improvements for EuroHPC systems. W e a l s o provide implementation details and share our experiences on how to retrieve and collect provenance data and information from models running on EuroHPC systems using (external to the EuroHPC system deployed) cloud native frameworks. Although we describe solutions in this paper that are designed to support our specific requirements and context, we believe that proposed solutions, developments and implementation details can also bring value beyond the broader NWP community.
{"title":"Towards full AI model lifecycle management on EuroHPC systems, experiences with AIFS for DestinE","authors":"Thomas Geenen , Even Marius Nordhagen , Victor Sanchez , Cathal O'Brien , Simon Lang , Mihai Alexe , Ana Prieto Nemesio , Gert Mertes , Rakesh Prithiviraj , Jesper Dramsch , Baudouin Raoult , Florian Pinault , Helen Theissen , Sara Hahner , Mario Santa Cruz , Matthew Chantry , Nils Wedi","doi":"10.1016/j.procs.2025.02.264","DOIUrl":"10.1016/j.procs.2025.02.264","url":null,"abstract":"<div><div>On October 13 2023 ECMWF released the first alpha version of its artificial intelligence forecasting system, AIFS, ECMWFs data-driven forecasts model. This first release came just a few months after ECMWF started the development of this new model that highlights the increased efforts in the field of machine learning (ML) that ECMWF has been building over the last few years. This paper describes the use of AIFS on EuroHPC systems in the context of DestinE. The main focus is on performance benchmarks on the different EuroHPC systems available to DestinE but also very much on the deployment and use of the tools to support the model lifecycle management. EuroHPC systems have already proven to be of great value for DestinE and in this paper, we describe how we leverage these systems for artificial intelligence (AI) and ML models in DestinE. We are closely working with EuroHPC and EuroHPC hosting sites through co-design and the optimization of existing solutions to optimize the usage of these systems in every step of the lifecycle management for AI and ML models. The performance benchmarks of our models on several EuroHPC systems showed that the speedup is close to linear up to several thousand GPUs, but that for each EuroHPC system a different optimization strategy must be used to achieve that. For model lifecycle management we found that we can use our in-house developed, domain specific, framework on EuroHPC systems and highlight some specific modifications and future improvements for EuroHPC systems. W e a l s o provide implementation details and share our experiences on how to retrieve and collect provenance data and information from models running on EuroHPC systems using (external to the EuroHPC system deployed) cloud native frameworks. Although we describe solutions in this paper that are designed to support our specific requirements and context, we believe that proposed solutions, developments and implementation details can also bring value beyond the broader NWP community.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"255 ","pages":"Pages 93-102"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-03-07DOI: 10.1016/j.procs.2025.02.267
Alan O'Cais , Kenneth Hoste , Jean-Noël Grad , Caspar van Leeuwen , Lara Peeters , Satish Kamath , Thomas Röblitz , Richard Topouchian , Bob Dröge , Pedro Santos Neves , Rudolf Weeber
One of the milestones of the EuroHPC Centre of Excellence MultiXscale is to be able to run the EESSI test suite on at least two different architectures available on EuroHPC Supercomputers. Our initial efforts focused on making the test suite portable across two different supercomputers: Karolina and Vega (the CPU partitions of both are a Zen2 micro-architecture).
More recently we have spent time getting the same test suite working on a more “exotic” architecture, the ARM A64FX architecture of Deucalion (which was in pre-production at the time of the experiment). This has raised some additional complications for EESSI as CernVM-FS (which is used to distribute EESSI) was not yet natively available there.
We show the current scalability of the ESPResSo application using the portable test suite. ESPResSo is already known to have scalability issues for both multi-node and multi-GPU configurations which are currently being analysed in collaboration with the POP Centre of Excellence. The purpose of this effort was to ensure that we can quickly and automatically record the performance of the application across a range of EuroHPC systems (i.e. ESPResSo acts as a pilot application for the full test suite)
{"title":"Portable test run of ESPResSo on EuroHPC systems via EESSI","authors":"Alan O'Cais , Kenneth Hoste , Jean-Noël Grad , Caspar van Leeuwen , Lara Peeters , Satish Kamath , Thomas Röblitz , Richard Topouchian , Bob Dröge , Pedro Santos Neves , Rudolf Weeber","doi":"10.1016/j.procs.2025.02.267","DOIUrl":"10.1016/j.procs.2025.02.267","url":null,"abstract":"<div><div>One of the milestones of the EuroHPC Centre of Excellence MultiXscale is to be able to run the EESSI test suite on at least two different architectures available on EuroHPC Supercomputers. Our initial efforts focused on making the test suite portable across two different supercomputers: Karolina and Vega (the CPU partitions of both are a Zen2 micro-architecture).</div><div>More recently we have spent time getting the same test suite working on a more “exotic” architecture, the ARM A64FX architecture of Deucalion (which was in pre-production at the time of the experiment). This has raised some additional complications for EESSI as CernVM-FS (which is used to distribute EESSI) was not yet natively available there.</div><div>We show the current scalability of the ESPResSo application using the portable test suite. ESPResSo is already known to have scalability issues for both multi-node and multi-GPU configurations which are currently being analysed in collaboration with the POP Centre of Excellence. The purpose of this effort was to ensure that we can quickly and automatically record the performance of the application across a range of EuroHPC systems (i.e. ESPResSo acts as a pilot application for the full test suite)</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"255 ","pages":"Pages 122-129"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143563320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-11-25DOI: 10.1016/j.procs.2025.10.316
Daniel A. Jaume, Diego G Martinez, Cristian Panelo, Kevin Pereyra
Motivated by Tutte’s 1953 characterization of graphs containing Sachs subgraphs, we introduce the notion of k-Sachs-critical graphs: graphs in which the removal of any set of k vertices results in a graph that admits a Sachs subgraph. We establish a Tutte-type characterization of these graphs. As a consequence, we provide a short proof of a generalization of Berge’s 1973 characterization theorem of graphs with the odd cycle property that admit a perfect matching.
{"title":"k-Sachs-Critical Graphs","authors":"Daniel A. Jaume, Diego G Martinez, Cristian Panelo, Kevin Pereyra","doi":"10.1016/j.procs.2025.10.316","DOIUrl":"10.1016/j.procs.2025.10.316","url":null,"abstract":"<div><div>Motivated by Tutte’s 1953 characterization of graphs containing Sachs subgraphs, we introduce the notion of <em>k</em>-Sachs-critical graphs: graphs in which the removal of any set of <em>k</em> vertices results in a graph that admits a Sachs subgraph. We establish a Tutte-type characterization of these graphs. As a consequence, we provide a short proof of a generalization of Berge’s 1973 characterization theorem of graphs with the odd cycle property that admit a perfect matching.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"273 ","pages":"Pages 333-340"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145584269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-11-25DOI: 10.1016/j.procs.2025.10.318
Prosenjit Bose , Guillermo Esteban , Tyler Tuttle
Let S be a set of n points in the plane. We present four different algorithms for finding a pair of points in S such that any disk that contains that pair must contain at least cn points of S, for some constant c > 0. The first is a randomized algorithm that finds a pair in O(n log n) expected time for points in general position and c = 1/2 − 1/√6 ≈ 1/10.9. The second algorithm, also for points in general position, takes O(n2) time but the constant c is improved to 1/2 − 1/√12 ≈ 1/4.7. Using this algorithm and applying binary search, we find the pair that achieves the optimal c in O(n2 log n) time. The final algorithm finds in linear time a pair of points such that any disk through them contains at least n/3 of the points of S when S is in convex position. We also adapt these algorithms to find a pair of points of S in a polygon P such that any geodesic disk that contains that pair must contain at least cn points of S for some constant c > 0.
{"title":"Computational aspects of disks enclosing many points","authors":"Prosenjit Bose , Guillermo Esteban , Tyler Tuttle","doi":"10.1016/j.procs.2025.10.318","DOIUrl":"10.1016/j.procs.2025.10.318","url":null,"abstract":"<div><div>Let <em>S</em> be a set of <em>n</em> points in the plane. We present four different algorithms for finding a pair of points in <em>S</em> such that any disk that contains that pair must contain at least <em>cn</em> points of <em>S</em>, for some constant <em>c ></em> 0. The first is a randomized algorithm that finds a pair in <em>O(n</em> log <em>n)</em> expected time for points in general position and c = 1/2 − 1/√6 ≈ 1/10.9. The second algorithm, also for points in general position, takes <em>O(n<sup>2</sup>)</em> time but the constant <em>c</em> is improved to 1/2 − 1/√12 ≈ 1/4.7. Using this algorithm and applying binary search, we find the pair that achieves the optimal <em>c</em> in <em>O(n<sup>2</sup></em> log <em>n</em>) time. The final algorithm finds in linear time a pair of points such that any disk through them contains at least n/3 of the points of <em>S</em> when <em>S</em> is in convex position. We also adapt these algorithms to find a pair of points of <em>S</em> in a polygon <em>P</em> such that any geodesic disk that contains that pair must contain at least <em>cn</em> points of <em>S</em> for some constant <em>c ></em> 0.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"273 ","pages":"Pages 349-356"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145584271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-11-25DOI: 10.1016/j.procs.2025.10.327
Arthur C. Gomes , Yoshiko Wakabayashi
A locating-dominating set of a graph G is a dominating set C of G such that, for each pair of distinct vertices u and v not in C, the neighborhood of u in C and the neighborhood of v in C are distinct. We study locating-dominating sets of minimum density on the infinite hexagonal grid Hk with finite height k. We show optimal solutions for Hk, k ≤ 5, and when k is a multiple of 3. We also present an ILP formulation to find periodic locating-dominating sets for Hk, which may be solved in reasonable time, when k is not so large. With this approach, we found feasible solutions for k = 7 and k = 8, which are within at most 1.3% of the optimum. Combining these results, we obtain upper bounds for minimum-density locating-dominating sets on Hk, for all fixed k ≥ 10, which are within 1% of the optimal solution. For the hexagonal grids, only results for the unrestricted case (unbounded height) have appeared in the literature. Results for Hk, k≥2, presented here have not appeared in the literature.
{"title":"Minimum-density locating-dominating sets on infinite hexagonal grids with bounded height","authors":"Arthur C. Gomes , Yoshiko Wakabayashi","doi":"10.1016/j.procs.2025.10.327","DOIUrl":"10.1016/j.procs.2025.10.327","url":null,"abstract":"<div><div>A locating-dominating set of a graph <em>G</em> is a dominating set <em>C</em> of <em>G</em> such that, for each pair of distinct vertices <em>u</em> and <em>v</em> not in <em>C</em>, the neighborhood of <em>u</em> in <em>C</em> and the neighborhood of <em>v</em> in <em>C</em> are distinct. We study locating-dominating sets of minimum density on the infinite hexagonal grid <em>H<sub>k</sub></em> with finite height <em>k.</em> We show optimal solutions for <em>H<sub>k</sub>, k</em> ≤ 5, and when <em>k</em> is a multiple of 3. We also present an ILP formulation to find periodic locating-dominating sets for <em>H<sub>k</sub></em>, which may be solved in reasonable time, when <em>k</em> is not so large. With this approach, we found feasible solutions for <em>k =</em> 7 and <em>k =</em> 8, which are within at most 1.3% of the optimum. Combining these results, we obtain upper bounds for minimum-density locating-dominating sets on <em>H<sub>k</sub></em>, for all fixed <em>k</em> ≥ 10, which are within 1% of the optimal solution. For the hexagonal grids, only results for the unrestricted case (unbounded height) have appeared in the literature. Results for <em>H<sub>k</sub>, k</em>≥<em>2</em>, presented here have not appeared in the literature.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"273 ","pages":"Pages 421-428"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145584280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号