Procedia Computer Science最新文献

英文中文

Short cycle covers and the colouring defect of a cubic graph 三次图的短周期盖和着色缺陷

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-11-25 DOI: 10.1016/j.procs.2025.10.293

Ján Karabáš , Edita Máčajová , Roman Nedela , Martin Škoviera

A longstanding conjecture of Alon and Tarsi, and independly Jaeger (1985), suggests that the edges of every bridgeless graph can be covered with cycles of total length at most 7/5 • m, where m is the number of edges. We study the relationship between cycle covers and structural properties of cubic graphs, focusing on their colouring defect. This invariant, introduced by Steffen in 2015, is defined as the minimum number of edges left uncovered by any set of three perfect matchings of a cubic graph. We show that every bridgeless cubic graph with colouring defect not exceeding 3 admits a cycle cover of length at most 4/3 • m + 1, just one step above the universal lower bound of 4/3 • m for all cubic graphs. We also prove that, regardless of defect, the same bound holds for bridgeless cubic graphs that have an edge whose endvertices removed yield a 3-edge-colourable graph and the edge lies on a 5-cycle. Motivated by our investigations, we introduce a new invariant for cubic graphs, their covering excess, to measure the deviation of the length of a shortest cycle cover from the mentioned lower bound. Finally, we show that every bridgeless cubic graph with covering excess at most 1 admits a cycle double cover.

Alon和Tarsi以及Jaeger（1985）的一个长期猜想表明，每个无桥图的边都可以被总长度最多为7/5•m的环所覆盖，其中m是边的数量。研究了三次图的循环盖与结构性质之间的关系，重点讨论了三次图的着色缺陷。这个不变量是Steffen在2015年引入的，它被定义为三次图的任何三个完美匹配的集合所未覆盖的最小边数。我们证明了每一个有色缺陷不超过3的无桥三次图都有一个长度不超过4/3•m + 1的循环覆盖，仅比所有三次图的4/3•m的一般下界高一步。我们还证明，无论缺陷如何，相同的界适用于无桥三次图，其边缘的顶点被移除后产生一个3边可着色图，并且边缘位于5环上。基于我们的研究，我们为三次图引入了一个新的不变量，即三次图的覆盖过量，用于测量最短周期覆盖长度与上述下界的偏差。最后，我们证明了每一个覆盖过剩不超过1的无桥三次图都存在一个循环双覆盖。

{"title":"Short cycle covers and the colouring defect of a cubic graph","authors":"Ján Karabáš , Edita Máčajová , Roman Nedela , Martin Škoviera","doi":"10.1016/j.procs.2025.10.293","DOIUrl":"10.1016/j.procs.2025.10.293","url":null,"abstract":"<div><div>A longstanding conjecture of Alon and Tarsi, and independly Jaeger (1985), suggests that the edges of every bridgeless graph can be covered with cycles of total length at most 7/5 • <em>m</em>, where <em>m</em> is the number of edges. We study the relationship between cycle covers and structural properties of cubic graphs, focusing on their colouring defect. This invariant, introduced by Steffen in 2015, is defined as the minimum number of edges left uncovered by any set of three perfect matchings of a cubic graph. We show that every bridgeless cubic graph with colouring defect not exceeding 3 admits a cycle cover of length at most 4/3 • <em>m</em> + 1, just one step above the universal lower bound of 4/3 • <em>m</em> for all cubic graphs. We also prove that, regardless of defect, the same bound holds for bridgeless cubic graphs that have an edge whose endvertices removed yield a 3-edge-colourable graph and the edge lies on a 5-cycle. Motivated by our investigations, we introduce a new invariant for cubic graphs, their covering excess, to measure the deviation of the length of a shortest cycle cover from the mentioned lower bound. Finally, we show that every bridgeless cubic graph with covering excess at most 1 admits a cycle double cover.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"273 ","pages":"Pages 156-162"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145584206","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}

引用次数: 0

Domination in Johnson graphs Johnson图中的支配

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-11-25 DOI: 10.1016/j.procs.2025.10.302

María Gracia Cornet , Tanja Dravec , Pablo Torres

In this paper we study domination number of Johnson graphs J (n, r). We establish general bounds for the domination number of Johnson graph J(n, r) and prove that it is non-decreasing with n. We also compute exact values for γ(J(n, r)) in specific cases, showing that γ(J(n,2)) = ⌊n/2⌋ for n ≥ 4, and we determine γ(J(n, 3)) for even n ≥ 6, which depends quadratically on n. For odd n ≥ 7, we provide an upper bound for γ(J(n, 3)), which we conjecture to be tight. Our approach relies on translating the problem of computing γ(J(n, 3)) into the problem of finding a minimum edge covering by triangles among all graphs of order n with independence number at most 2.

本文研究了Johnson图J （n, r）的支配数。我们建立了Johnson图J（n, r）的支配数的一般边界，并证明了它随n不减小。我们还计算了在特定情况下γ(J(n, r))的精确值，表明当n≥4时γ(J(n,2)) =⌊n/2⌋，并且我们确定了偶n≥6时γ(J(n, 3))，它依赖于n。对于奇数n≥7，我们给出了γ(J(n, 3))的上界，我们推测该上界是紧的。我们的方法依赖于将计算γ(J(n, 3))的问题转化为在独立数最多为2的所有n阶图中找到由三角形覆盖的最小边的问题。

引用次数: 0

Optimized Routing for Residential Waste Collection in Mixed-Density Areas 混合密度地区生活垃圾收集路径的优化

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-11-25 DOI: 10.1016/j.procs.2025.10.303

P.E. Coll , E.M. López

This study presents an integer linear programming (ILP) approach that integrates clustering techniques, such as k-means, to optimize vehicle routing for the household waste collection system in General Rodríguez, a municipality in Buenos Aires Province, Argentina. The goal is to minimize the number of routes while adhering to time and waste capacity restrictions, in addition to fulfilling the service requirements for areas covered three and six times per week. Our analysis of the data revealed significant heterogeneity in both waste generation and spatial distribution. To address this, we propose a solution that divides the area into smaller zones using clustering techniques, which are then integrated into an ILP model. Once the zones are determined, a second ILP model is solved to combine a daily zone with one or two alternating zones into a single route. The results are compared with those from licensed software, which produced more routes and required significantly longer computation time.

本研究提出了一种整数线性规划（ILP）方法，该方法集成了聚类技术，如k-means，以优化阿根廷布宜诺斯艾利斯省General Rodríguez市家庭垃圾收集系统的车辆路线。除了满足每周三次和六次覆盖区域的服务要求外，目标是在遵守时间和废物处理能力限制的情况下，最大限度地减少路线数量。我们对数据的分析揭示了废物产生和空间分布的显著异质性。为了解决这个问题，我们提出了一个解决方案，使用聚类技术将区域划分为更小的区域，然后将其集成到ILP模型中。区域确定后，求解第二个ILP模型，将每日区域与一个或两个交替区域合并为单个路线。结果与授权软件的结果进行了比较，后者产生的路由更多，计算时间也明显更长。

引用次数: 0

Exploring subgraph complementation to bounded degree graphs 探索有界度图的子图补

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-11-25 DOI: 10.1016/j.procs.2025.10.304

Ivo Koch , Nina Pardal , Vinicius F. dos Santos

Graph modification problems are computational tasks where the goal is to change an input graph G using operations from a fixed set, in order to make the resulting graph satisfy a target property, which usually entails membership to a desired graph class C. Some well-known examples of operations include vertex-deletion, edge-deletion, edge-addition and edge-contraction. In this paper we address an operation known as subgraph complement.

Given a graph G and a subset S of its vertices, the subgraph complement G ⊕ S is the graph resulting from complementing the edge set of the subgraph induced by S in G. We say that a graph H is a subgraph complement of G if there is an S such that H is isomorphic to G⊕S. For a graph class C, the Subgraph complementation to C is the problem of deciding, for a given graph G, whether G has a subgraph complement in C. This problem has been studied and its complexity has been settled for many classes C such as H-free graphs, for various families H, and for classes of bounded degeneracy. In this work, we focus on classes of graphs of minimum/maximum degree upper/lower bounded by some value k. In particular, we answer an open question of Antony et al. [Information Processing Letters 188, 106530 (2025)], by showing that Subgraph complementation to C is NP-complete when C is the class of graphs of minimum degree at least k, if k is part of the input. We also show that Subgraph complementation to k-regular parameterized by k is fixed-parameter tractable.

图修改问题是一种计算任务，其目标是使用固定集合的操作改变输入图G，以使结果图满足目标属性，这通常需要加入所需的图类c。一些著名的操作示例包括顶点删除，边删除，边添加和边收缩。在本文中，我们讨论一种称为子图补的运算。给定一个图G及其顶点的子集S，子图补G⊕S是由S在G中引出的子图的边集补而成的图，如果存在一个S使得H同构于G⊕S，则图H是G的子图补。对于一类图C，对C的子图补是判定对于给定的图G， G在C中是否有子图补的问题。对于许多类C，如无H图，对于各种族H，以及对于有界退化的类，这个问题已经被研究并解决了它的复杂性。在这项工作中，我们专注于最小/最大度上/下界为某个值k的图类。特别是，我们回答了Antony等人的一个开放问题[信息处理快报188,106530(2025)]，通过证明当C是最小度至少k的图类时，如果k是输入的一部分，则子图对C的补是np完全的。我们还证明了k正则参数化的子图补是定参数可处理的。

{"title":"Exploring subgraph complementation to bounded degree graphs","authors":"Ivo Koch , Nina Pardal , Vinicius F. dos Santos","doi":"10.1016/j.procs.2025.10.304","DOIUrl":"10.1016/j.procs.2025.10.304","url":null,"abstract":"<div><div>Graph modification problems are computational tasks where the goal is to change an input graph <em>G</em> using operations from a fixed set, in order to make the resulting graph satisfy a target property, which usually entails membership to a desired graph class <em>C.</em> Some well-known examples of operations include vertex-deletion, edge-deletion, edge-addition and edge-contraction. In this paper we address an operation known as <em>subgraph complement.</em></div><div>Given a graph <em>G</em> and a subset <em>S</em> of its vertices, the subgraph complement <em>G</em> ⊕ <em>S</em> is the graph resulting from complementing the edge set of the subgraph induced by <em>S</em> in <em>G.</em> We say that a graph <em>H</em> is a <em>subgraph complement</em> of <em>G</em> if there is an <em>S</em> such that <em>H</em> is isomorphic to G⊕S. For a graph class C, the Subgraph complementation to <em>C</em> is the problem of deciding, for a given graph G, whether <em>G</em> has a subgraph complement in <em>C.</em> This problem has been studied and its complexity has been settled for many classes <em>C</em> such as <em>H</em>-free graphs, for various families <em>H</em>, and for classes of bounded degeneracy. In this work, we focus on classes of graphs of minimum/maximum degree upper/lower bounded by some value <em>k.</em> In particular, we answer an open question of Antony et al. [Information Processing Letters 188, 106530 (2025)], by showing that Subgraph complementation to <em>C</em> is NP-complete when <em>C</em> is the class of graphs of minimum degree at least <em>k</em>, if <em>k</em> is part of the input. We also show that Subgraph complementation to <em>k</em>-regular parameterized by <em>k</em> is fixed-parameter tractable.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"273 ","pages":"Pages 239-246"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145584215","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}

引用次数: 0

Spectral properties of stellohedra 星面体的光谱特性

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-11-25 DOI: 10.1016/j.procs.2025.10.310

Ana Gargantini , Adrián Pastine , Pablo Torres , Mario Valencia-Pabon

In this article we contribute to the analysis of the spectral properties of graph associahedra, providing a lower bound for the second largest eigenvalue of the graph associahedra A(G) of G. Additionally, using equitable partitions, we analyze the spectrum of stellohedra A(K₁,_n), proving the existence of an eigenvalue in the interval (n - 2, n - 1] and identifying two additional small eigenvalues.

在本文中，我们对关联面体图的谱性质进行了分析，给出了G的关联面体图a (G)的第二大特征值的下界。此外，我们利用公平划分，分析了stlohedra a （K1,n）的谱，证明了在区间（n - 2, n - 1）中存在一个特征值，并识别了另外两个小特征值。

引用次数: 0

Sovereignty in Automated Stroke Prediction and Recommendation System with Explanations and Semantic Reasoning 具有解释和语义推理的自动中风预测和推荐系统的主权

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-03-05 DOI: 10.1016/j.procs.2025.02.079

Ayan Chatterjee

Personalized approaches are required for stroke management due to the variability in symptoms, triggers, and patient characteristics. An innovative stroke recommendation system that integrates automatic predictive analysis with semantic knowledge to provide personalized recommendations for stroke management is proposed by this paper. Stroke exacerbation are predicted and the recommendations are enhanced by the system, which leverages automatic Tree-based Pipeline Optimization Tool (TPOT) and semantic knowledge represented in an OWL Ontology (StrokeOnto). Digital sovereignty is addressed by ensuring the secure and autonomous control over patient data, supporting data sovereignty and compliance with jurisdictional data privacy laws. Furthermore, classifications are explained with Local Interpretable Model-Agnostic Explanations (LIME) to identify feature importance. Tailored interventions based on individual patient profiles are provided by this conceptual model, aiming to improve stroke management. The proposed model has been verified using public stroke dataset, and the same dataset has been utilized to support ontology development and verification. In TPOT, the best Variance Threshold + DecisionTree Classifier pipeline has outperformed other supervised machine learning models with an accuracy of 95.2%, for the used datasets. The Variance Threshold method reduces feature dimensionality with variance below a specified threshold of 0.1 to enhance predictive accuracy. To implement and evaluate the proposed model in clinical settings, further development and validation with more diverse and robust datasets are required.

由于症状、触发因素和患者特征的可变性，需要个性化的方法来进行脑卒中管理。本文提出了一种新颖的脑卒中推荐系统，将自动预测分析与语义知识相结合，为脑卒中管理提供个性化推荐。该系统利用基于树的自动管道优化工具（TPOT）和OWL本体（StrokeOnto）表示的语义知识来预测中风恶化并增强建议。数字主权是通过确保对患者数据的安全和自主控制、支持数据主权和遵守管辖数据隐私法来解决的。此外，用局部可解释模型不可知论解释（LIME）来解释分类，以确定特征的重要性。该概念模型提供了基于个体患者概况的量身定制的干预措施，旨在改善卒中管理。使用公共笔划数据集验证了所提出的模型，并使用相同的数据集支持本体的开发和验证。在TPOT中，对于使用的数据集，最佳方差阈值 + 决策树分类器管道以95.2%的准确率优于其他有监督机器学习模型。方差阈值法通过降低方差小于0.1的特征维数来提高预测精度。为了在临床环境中实施和评估所提出的模型，需要使用更多样化和更可靠的数据集进一步开发和验证。

{"title":"Sovereignty in Automated Stroke Prediction and Recommendation System with Explanations and Semantic Reasoning","authors":"Ayan Chatterjee","doi":"10.1016/j.procs.2025.02.079","DOIUrl":"10.1016/j.procs.2025.02.079","url":null,"abstract":"<div><div>Personalized approaches are required for stroke management due to the variability in symptoms, triggers, and patient characteristics. An innovative stroke recommendation system that integrates automatic predictive analysis with semantic knowledge to provide personalized recommendations for stroke management is proposed by this paper. Stroke exacerbation are predicted and the recommendations are enhanced by the system, which leverages automatic Tree-based Pipeline Optimization Tool <strong>(TPOT)</strong> and semantic knowledge represented in an <strong>OWL Ontology (StrokeOnto). Digital sovereignty</strong> is addressed by ensuring the secure and autonomous control over patient data, supporting data sovereignty and compliance with jurisdictional data privacy laws. Furthermore, classifications are explained with Local Interpretable Model-Agnostic Explanations <strong>(LIME)</strong> to identify feature importance. Tailored interventions based on individual patient profiles are provided by this conceptual model, aiming to improve stroke management. The proposed model has been verified using public stroke dataset, and the same dataset has been utilized to support ontology development and verification. In TPOT, the best <strong>Variance Threshold + DecisionTree Classifier</strong> pipeline has outperformed other supervised machine learning models with an accuracy of <strong>95.2%,</strong> for the used datasets. The Variance Threshold method reduces feature dimensionality with variance below a specified threshold of 0.1 to enhance predictive accuracy. To implement and evaluate the proposed model in clinical settings, further development and validation with more diverse and robust datasets are required.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"254 ","pages":"Pages 201-210"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143550880","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}

引用次数: 0

CNN-swarm intelligence hybrid model for facial expression recognition 人脸表情识别的cnn -群智能混合模型

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-11-06 DOI: 10.1016/j.procs.2025.09.027

Andry Chowanda , Mohamed Imran Bin Mohamed Ariff

Emotion is essential to our social interactions, as it allows us to communicate with others effectively. Emotion is expressed through facial expressions, voice prosody, and body language. As technology advances rapidly to facilitate human connection, the capac- ity to discern emotions through facial expressions, voice prosody, and body language has markedly improved. Facial expressions serve as non-verbal indicators for interpreting emotions. Recent research indicates that models utilising extensive datasets and deep learning architectures, such as Convolutional Neural Networks (CNN) and Vision Transformers, have strong performance on benchmarks for face expression datasets. Nevertheless, significant constraints exist when representing emotions through facial expressions (i.e., image or video-based). The variance and illumination significantly impact the model’s performance. This study seeks to examine the effectiveness of combining a conventional optimisation technique (i.e., gradient-based optimisation) with a metaheuristic search approach (i.e., swarm intelligence) to improve model performance. An inception-based architecture is utilised to model emotion recognition from facial cues. A hybrid optimisation approach that integrates gradient-based and swarm intelli- gence techniques is employed to improve the architectures. All the offered models demonstrate significantly enhanced performance relative to the baseline. Model B (20-5) attained a training accuracy of 99.15%, a validation accuracy of 100%, a training loss of 0.0934, and a validation loss of 0.0402.

情感对我们的社交互动至关重要，因为它使我们能够有效地与他人沟通。情感是通过面部表情、声音韵律和肢体语言来表达的。随着技术的迅速发展，促进了人与人之间的联系，通过面部表情、声音韵律和肢体语言来辨别情绪的能力已经显著提高。面部表情是解释情绪的非语言指标。最近的研究表明，利用广泛的数据集和深度学习架构的模型，如卷积神经网络（CNN）和视觉变形器，在面部表情数据集的基准测试中表现出色。然而，当通过面部表情（即基于图像或视频）表达情感时，存在显著的限制。方差和光照对模型的性能有显著影响。本研究旨在检验将传统优化技术（即基于梯度的优化）与元启发式搜索方法（即群体智能）相结合以提高模型性能的有效性。基于inception的架构被用于从面部线索中建模情感识别。采用基于梯度和群体智能技术的混合优化方法来改进结构。所有提供的模型都显示了相对于基线的显著增强的性能。模型B（20-5）的训练准确率为99.15%，验证准确率为100%，训练损失为0.0934，验证损失为0.0402。

{"title":"CNN-swarm intelligence hybrid model for facial expression recognition","authors":"Andry Chowanda , Mohamed Imran Bin Mohamed Ariff","doi":"10.1016/j.procs.2025.09.027","DOIUrl":"10.1016/j.procs.2025.09.027","url":null,"abstract":"<div><div>Emotion is essential to our social interactions, as it allows us to communicate with others effectively. Emotion is expressed through facial expressions, voice prosody, and body language. As technology advances rapidly to facilitate human connection, the capac- ity to discern emotions through facial expressions, voice prosody, and body language has markedly improved. Facial expressions serve as non-verbal indicators for interpreting emotions. Recent research indicates that models utilising extensive datasets and deep learning architectures, such as Convolutional Neural Networks (CNN) and Vision Transformers, have strong performance on benchmarks for face expression datasets. Nevertheless, significant constraints exist when representing emotions through facial expressions (i.e., image or video-based). The variance and illumination significantly impact the model’s performance. This study seeks to examine the effectiveness of combining a conventional optimisation technique (i.e., gradient-based optimisation) with a metaheuristic search approach (i.e., swarm intelligence) to improve model performance. An inception-based architecture is utilised to model emotion recognition from facial cues. A hybrid optimisation approach that integrates gradient-based and swarm intelli- gence techniques is employed to improve the architectures. All the offered models demonstrate significantly enhanced performance relative to the baseline. Model B (20-5) attained a training accuracy of 99.15%, a validation accuracy of 100%, a training loss of 0.0934, and a validation loss of 0.0402.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"269 ","pages":"Pages 844-852"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145448535","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}

引用次数: 0

Differentiated or deficient? Perspective on multidimensional maturity models – Evidence from a structured literature review 分化还是缺陷？多维成熟度模型的视角——来自结构化文献综述的证据

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-11-06 DOI: 10.1016/j.procs.2025.09.135

Alexander Sprengel , Patrick Ulrich

This paper explores the intricacies and challenges involved in developing and deploying digital maturity models within organizations undergoing digital transformation. Additionally, it investigates the transition from unidimensional to multidimensional digital maturity models, focusing on the difficulties arising from the lack of structured methodologies and precise definitions in existing models. Through a systematic literature review, this paper critically evaluates how multidimensional models can more accurately reflect the complexities inherent in organizational digital transformation. The results indicate that, although multidimensional models provide a more thorough assessment of organizational capabilities, ambiguities in their definitions and applications remain, highlighting the need for clearer differentiation and integration in their evaluation methods. The paper concludes by emphasizing the necessity for empirical research to improve the validity and robustness of maturity models, and it suggests future research directions to refine these tools for both practical and theoretical advancements in digital transformation strategies.

本文探讨了在进行数字化转型的组织中开发和部署数字成熟度模型所涉及的复杂性和挑战。此外，它还研究了从一维到多维数字成熟度模型的过渡，重点关注现有模型中缺乏结构化方法和精确定义所带来的困难。通过系统的文献回顾，本文批判性地评估了多维模型如何更准确地反映组织数字化转型中固有的复杂性。结果表明，尽管多维模型提供了对组织能力的更彻底的评估，但其定义和应用中的模糊性仍然存在，突出表明需要在其评估方法中进行更清晰的区分和整合。最后，本文强调了提高成熟度模型有效性和鲁棒性的实证研究的必要性，并提出了未来的研究方向，以完善这些工具，以促进数字化转型战略的实践和理论进步。

{"title":"Differentiated or deficient? Perspective on multidimensional maturity models – Evidence from a structured literature review","authors":"Alexander Sprengel , Patrick Ulrich","doi":"10.1016/j.procs.2025.09.135","DOIUrl":"10.1016/j.procs.2025.09.135","url":null,"abstract":"<div><div>This paper explores the intricacies and challenges involved in developing and deploying digital maturity models within organizations undergoing digital transformation. Additionally, it investigates the transition from unidimensional to multidimensional digital maturity models, focusing on the difficulties arising from the lack of structured methodologies and precise definitions in existing models. Through a systematic literature review, this paper critically evaluates how multidimensional models can more accurately reflect the complexities inherent in organizational digital transformation. The results indicate that, although multidimensional models provide a more thorough assessment of organizational capabilities, ambiguities in their definitions and applications remain, highlighting the need for clearer differentiation and integration in their evaluation methods. The paper concludes by emphasizing the necessity for empirical research to improve the validity and robustness of maturity models, and it suggests future research directions to refine these tools for both practical and theoretical advancements in digital transformation strategies.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"270 ","pages":"Pages 164-173"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145448781","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}

引用次数: 0

Research on Crack Segmentation and Detection of Red Brick Wall Structure based on Deep Learning 基于深度学习的红砖墙体结构裂缝分割与检测研究

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-05-24 DOI: 10.1016/j.procs.2025.04.240

Wenjuan Peng , Wei Zhao , Qiusheng Zhang , Zhuoya Bai , Ying Zeng , Mingyang Qi , Jinshun Nan

The present paper discusses a technique for crack segmentation and detection in red brick walls that is based on deep learning. This technology is designed to improve the efficiency and accuracy of assessing building safety. With the development of the construction industry, the detection of cracks in red brick walls has become particularly important. Traditional detection methods are labor-intensive and error-prone, while deep learning models provide an efficient and reliable solution. In this paper, we study a variety of deep learning models, including PSPNet, DeepLabV3+, ERFNet, ANN, CCNet, and SegFormer, and compare their performance in the wall crack detection and segmentation task through experiments that use a real scene dataset to validate the model’s accuracy and generalization ability in the presence of interfering factors. Experimental results show that the SegFormer model performs best in IoU, F1, ACC and Recall, reaching 65.99%, 77.37%, 99.87%, and 80.79%, respectively, and with the addition of the attention mechanism to the SegFormer model for optimization, the model’s IoU and F1 are improved by 1.16% and 1.13%, respectively. The performance was significantly improved. The results provide technical support for detecting and repairing cracks in red brick walls, which helps to detect and repair potential safety hazards in a timely manner.

本文讨论了一种基于深度学习的红砖墙体裂缝分割与检测技术。该技术旨在提高建筑安全评估的效率和准确性。随着建筑业的发展，红砖墙体裂缝的检测变得尤为重要。传统的检测方法是劳动密集型且容易出错的，而深度学习模型提供了高效可靠的解决方案。本文研究了多种深度学习模型，包括PSPNet、DeepLabV3+、ERFNet、ANN、CCNet和SegFormer，并通过使用真实场景数据集的实验，比较了它们在墙体裂缝检测和分割任务中的性能，验证了模型在干扰因素存在下的准确性和推广能力。实验结果表明，SegFormer模型在IoU、F1、ACC和Recall方面表现最好，分别达到65.99%、77.37%、99.87%和80.79%，并且在SegFormer模型中加入注意机制进行优化后，模型的IoU和F1分别提高了1.16%和1.13%。性能得到了显著提高。研究结果为红砖墙体裂缝检测与修复提供了技术支持，有助于及时发现和修复安全隐患。

{"title":"Research on Crack Segmentation and Detection of Red Brick Wall Structure based on Deep Learning","authors":"Wenjuan Peng , Wei Zhao , Qiusheng Zhang , Zhuoya Bai , Ying Zeng , Mingyang Qi , Jinshun Nan","doi":"10.1016/j.procs.2025.04.240","DOIUrl":"10.1016/j.procs.2025.04.240","url":null,"abstract":"<div><div>The present paper discusses a technique for crack segmentation and detection in red brick walls that is based on deep learning. This technology is designed to improve the efficiency and accuracy of assessing building safety. With the development of the construction industry, the detection of cracks in red brick walls has become particularly important. Traditional detection methods are labor-intensive and error-prone, while deep learning models provide an efficient and reliable solution. In this paper, we study a variety of deep learning models, including PSPNet, DeepLabV3+, ERFNet, ANN, CCNet, and SegFormer, and compare their performance in the wall crack detection and segmentation task through experiments that use a real scene dataset to validate the model’s accuracy and generalization ability in the presence of interfering factors. Experimental results show that the SegFormer model performs best in IoU, F1, ACC and Recall, reaching 65.99%, 77.37%, 99.87%, and 80.79%, respectively, and with the addition of the attention mechanism to the SegFormer model for optimization, the model’s IoU and F1 are improved by 1.16% and 1.13%, respectively. The performance was significantly improved. The results provide technical support for detecting and repairing cracks in red brick walls, which helps to detect and repair potential safety hazards in a timely manner.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"261 ","pages":"Pages 512-519"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144124575","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}

引用次数: 0

Construction of Intelligent Electronic Fence System Based on Computer Vision Algorithm 基于计算机视觉算法的智能电子围栏系统构建

Procedia Computer Science

Pub Date : 2025-01-01 Epub Date: 2025-05-24 DOI: 10.1016/j.procs.2025.04.239

Yaokuan Wen, Qingyu Zhi, Kan Zhang, Yong Li, Yichen Cui, Haiyang Du

With the continuous development of technology, electronic fences face more and more security issues and challenges. This paper used convolutional neural network (CNN) technology to establish an intrusion detection system to achieve high-precision recognition and real-time response to intrusion behavior. The system used image preprocessing technology to improve image quality and reduce environmental interference, and used multi-sensor information fusion to improve system robustness. In order to improve real-time response capabilities, the system uses multi-threaded design and model optimization to achieve rapid and accurate identification of safety hazards in complex environments. At the same time, the system also integrates functions such as behavior recognition and remote control to achieve automated intrusion defense and rapid response. The results show that the intelligent electronic fence system is superior to the traditional system in terms of response time, with an average response time of 109.1 milliseconds. The false alarm rate and missed alarm rate are significantly lower than those of the traditional system. The false alarm rate and missed alarm rate for flame detection are 0.7% and 0.1% respectively, and the detection range is superior to other systems under different conditions. The intelligent electronic fence system has significant advantages in improving security and protection capabilities, and provides a new technical solution for modern security protection.

随着科技的不断发展，电子围栏面临越来越多的安全问题和挑战。本文利用卷积神经网络（CNN）技术建立入侵检测系统，实现对入侵行为的高精度识别和实时响应。该系统采用图像预处理技术提高图像质量，减少环境干扰，采用多传感器信息融合技术提高系统鲁棒性。为了提高实时响应能力，系统采用多线程设计和模型优化，实现了复杂环境下安全隐患的快速准确识别。同时，系统还集成了行为识别、远程控制等功能，实现了自动化入侵防御和快速响应。结果表明，智能电子围栏系统在响应时间上优于传统系统，平均响应时间为109.1毫秒。虚警率和漏警率明显低于传统系统。火焰检测虚警率和漏警率分别为0.7%和0.1%，不同条件下的检测范围优于其他系统。智能电子围栏系统在提高安全防护能力方面具有显著优势，为现代安全防护提供了新的技术解决方案。

{"title":"Construction of Intelligent Electronic Fence System Based on Computer Vision Algorithm","authors":"Yaokuan Wen, Qingyu Zhi, Kan Zhang, Yong Li, Yichen Cui, Haiyang Du","doi":"10.1016/j.procs.2025.04.239","DOIUrl":"10.1016/j.procs.2025.04.239","url":null,"abstract":"<div><div>With the continuous development of technology, electronic fences face more and more security issues and challenges. This paper used convolutional neural network (CNN) technology to establish an intrusion detection system to achieve high-precision recognition and real-time response to intrusion behavior. The system used image preprocessing technology to improve image quality and reduce environmental interference, and used multi-sensor information fusion to improve system robustness. In order to improve real-time response capabilities, the system uses multi-threaded design and model optimization to achieve rapid and accurate identification of safety hazards in complex environments. At the same time, the system also integrates functions such as behavior recognition and remote control to achieve automated intrusion defense and rapid response. The results show that the intelligent electronic fence system is superior to the traditional system in terms of response time, with an average response time of 109.1 milliseconds. The false alarm rate and missed alarm rate are significantly lower than those of the traditional system. The false alarm rate and missed alarm rate for flame detection are 0.7% and 0.1% respectively, and the detection range is superior to other systems under different conditions. The intelligent electronic fence system has significant advantages in improving security and protection capabilities, and provides a new technical solution for modern security protection.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"261 ","pages":"Pages 504-511"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144124574","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}

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Procedia Computer Science

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀