Soft Computing最新文献

{"title":"Specification and counterexample generation for cyber-physical systems","authors":"Zhen Li, Zining Cao, Fujun Wang, Chao Xing","doi":"10.1007/s00500-024-09793-x","DOIUrl":"https://doi.org/10.1007/s00500-024-09793-x","url":null,"abstract":"<p>Cyber-Physical Systems (CPS) are complex systems that integrate information control devices with physical resources, which can be automatically and formalized verified by model checking according to the expected requirements in the formal specification. The counterexamples in model checking are witnesses to the violation of the specification properties of the system and can provide important diagnostic information for debugging, controlling, and synthesizing CPS. Designing a rational specification language for CPS and generating effective counterexamples allows security vulnerabilities to be detected and addressed early in the system development. However, CPS involve frequent interactions between cyber and physical systems and often operate in unreliable environments, which poses new challenges for comprehensive modeling and designing specification languages for CPSs with discrete, continuous, time, probabilistic, and concurrent behaviors. Moreover, finding the smallest counterexample of CPS with probabilistic behavior in the shortest possible time has been identified as a Non-Deterministic Polynomial-complete (NP-complete) problem. Although a number of heuristics have been devised to address this challenge, the accuracy and efficiency of the solved counterexamples need to be improved due to the difficulty in determining the heuristic functions. We first provide a comprehensive model for CPS by introducing the Hybrid Probabilistic Time Labeled Transition System (HPTLTS). Subsequently, we design a specification language HPTLTS Temporal Logic (HPTLTS-TL) that can describe the properties of CPS. In addition, we propose an optimization algorithm CACO-A, which combines the Ant Colony Optimization (ACO) algorithm and the A-algorithm to efficiently generate the counterexample of CPS, which is represented as the diagnostic subgraph. Finally, we discuss a typical CPS example to demonstrate the feasibility of our approach.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"46 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On zero-divisor graphs of infinite posets","authors":"Radomír Halaš, Jozef Pócs","doi":"10.1007/s00500-024-09958-8","DOIUrl":"https://doi.org/10.1007/s00500-024-09958-8","url":null,"abstract":"<p>It is known that the so-called Beck’s conjecture, i.e. the equality of the finite clique and chromatic numbers of a zero-divisor graph, holds for partially ordered sets Halaš and Jukl (Discrete Math 309(13):4584–4589, 2009). In this paper we present a simple direct proof of this fact. Also, the case when the finiteness assumption of the clique number is omitted is investigated. We have shown that the conjecture fails in general and a bunch of counterexamples is presented.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"74 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An efficient and accurate approach to identify similarities between biological sequences using pair amino acid composition and physicochemical properties","authors":"L. Hooshyar, M. B. Hernández-Jiménez, A. Khastan, M. Vasighi","doi":"10.1007/s00500-024-09834-5","DOIUrl":"https://doi.org/10.1007/s00500-024-09834-5","url":null,"abstract":"<p>Our study presents a novel method for analyzing biological sequences, utilizing Pairwise Amino Acid Composition and Amino Acid physicochemical properties to construct a feature vector. This step is pivotal, as by utilizing pairwise analysis, we consider the order of amino acids, thereby capturing subtle nuances in sequence structure. Simultaneously, by incorporating physicochemical properties, we ensure that the hidden information encoded within amino acids is not overlooked. Furthermore, by considering both the frequency and order of amino acid pairs, our method mitigates the risk of erroneously clustering different sequences as similar, a common pitfall in older methods. Our approach generates a concise 48-member vector, accommodating sequences of arbitrary lengths efficiently. This compact representation retains essential amino acid-specific features, enhancing the accuracy of sequence analysis. Unlike traditional approaches, our algorithm avoids the introduction of sparse vectors, ensuring the retention of important information. Additionally, we introduce fuzzy equivalence relationships to address uncertainty in the clustering process, enabling a more nuanced and flexible clustering approach that captures the inherent ambiguity in biological data. Despite these advancements, our algorithm is presented in a straightforward manner, ensuring accessibility to researchers with varying levels of computational expertise. This enhancement improves the robustness and interpretability of our method, providing researchers with a comprehensive and user-friendly tool for biological sequence analysis.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"46 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Bayesian inference and ant colony optimization for multi-rumor mitigation in online social networks","authors":"Priyanka Parimi, Rashmi Ranjan Rout","doi":"10.1007/s00500-024-09810-z","DOIUrl":"https://doi.org/10.1007/s00500-024-09810-z","url":null,"abstract":"<p>With the increasing popularity of social media, Online Social Networks (OSNs) are being used for promoting or discrediting various products or persons. As such, rumors are spread in the networks to increase or decrease the popularity of the target. Limiting the spread of rumors is an important research problem. In a promotion or smear campaign, we see multiple rumors about the target. Many existing works have explored rumor propagation and mitigation in social networks for a single rumor. However, users become biased towards the topic due to multiple rumors about it. A user influenced by the previous rumors about a topic is more likely to believe a rumor with similar content. Therefore, in this work, we analyze the spread of multiple rumors about a topic and formulate an optimization problem to identify the top <i>k</i> rumor spreaders. A Bayesian Inference has been applied to model the user bias caused by multiple rumors based on rumor content and user opinion about the topic. An Adaptive Ant Colony Optimization algorithm has been proposed to determine the top <i>k</i> rumor spreaders, who may be isolated from the network to reduce the impact of the rumors in the OSN. The efficacy of the proposed approaches is shown through experimentation on two datasets by considering the budget <i>k</i>.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"8 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A modified U-Net CNN model for enhanced battery component segmentation in X-ray phone images","authors":"Muhammad Syahid Zuhri Bin Suardi, Norma Alias, Muhammad Asim Khan","doi":"10.1007/s00500-024-09831-8","DOIUrl":"https://doi.org/10.1007/s00500-024-09831-8","url":null,"abstract":"<p>This article highlights the expanding issue of e-waste caused by the accessibility and widespread utilisation of electronics. Because precious metals in e-waste have high value, it is vital to recycle them while minimising their loss. Batteries in e-waste are identified and located using image processing techniques, such as semantic segmentation, which categorizes each pixel in an image. The article describes a modified U-Net Convolutional Neural Network approach with pre-processing procedures to assure clean raw photos for image segmentation of the battery component. Key matrices were used to analyse the output of three distinct CNN models with loss functions. The study comes to the conclusion that the improved model for battery segmentation of X-ray images is the modified U-Net with dice coefficient. The development of more efficient e-waste recycling methods with the help of this research could lead to a more sustainable future.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"113 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A biased random-key genetic algorithm for the knapsack problem with forfeit sets","authors":"Raffaele Cerulli, Ciriaco D’Ambrosio, Andrea Raiconi","doi":"10.1007/s00500-024-09948-w","DOIUrl":"https://doi.org/10.1007/s00500-024-09948-w","url":null,"abstract":"<p>This work addresses the Knapsack Problem with Forfeit Sets, a recently introduced variant of the 0/1 Knapsack Problem considering subsets of items associated with contrasting choices. Some penalty costs need to be paid whenever the number of items in the solution belonging to a forfeit set exceeds a predefined allowance threshold. We propose an effective metaheuristic to solve the problem, based on the Biased Random-Key Genetic Algorithm paradigm. An appropriately designed decoder function assigns a feasible solution to each chromosome, and improves it using some additional heuristic procedures. We show experimentally that the algorithm outperforms significantly a previously introduced metaheuristic for the problem.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"51 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Consensus dynamics under asymmetric interactions in low dimensions","authors":"Silvia Bortot, Ricardo Alberto Marques Pereira, Anastasia Stamatopoulou","doi":"10.1007/s00500-024-09653-8","DOIUrl":"https://doi.org/10.1007/s00500-024-09653-8","url":null,"abstract":"<p>We consider a set <span>(N = { 1,ldots ,n })</span>, <span>(nge 2)</span>, of interacting agents whose individual opinions <span>( x_{i})</span>, with <span>(i in N )</span>, take values in some domain <span>(mathbb {D}subseteq mathbb {R})</span>. The interaction among the agents represents the degree of reciprocal influence which the agents exert upon each other and it is expressed by a general asymmetric interaction matrix with null diagonal and off-diagonal coefficients in the open unit interval. The present paper examines the asymmetric generalization of the linear consensus dynamics model discussed in previous publications by the same authors, in which symmetric interaction was assumed. We are mainly interested in determining the form of the asymptotic convergence towards the consensual opinion. In this respect, we present some general results plus the study of three particular versions of the linear consensus dynamics, depending on the relation between the interaction structure and the degrees of proneness to evaluation review of the various individual opinions. In the general asymmetric case, the analytic form of the asymptotic consensual solution <span>(tilde{x})</span> is highly more complex than that under symmetric interaction, and we have obtained it only in two low-dimensional cases. Nonetheless, we are able to write those complex analytic forms arranging the numerous terms in an intelligible way which might provide useful clues to the open quest for the analytic form of the asymptotic consensual solution in higher-dimensional cases.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"33 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A defect detection network for painted wall surfaces based on YOLOv5 enhanced by attention mechanism and bi-directional FPN","authors":"Hongyang Zhang, Shuai Ji, Yingxin Ye, Hepeng Ni, Xiaoming Gao, Buyao Liu","doi":"10.1007/s00500-024-09799-5","DOIUrl":"https://doi.org/10.1007/s00500-024-09799-5","url":null,"abstract":"<p>Automatic detection of defects on painted wall surfaces (DPWSs) based on machine vision is meaningful for reducing manpower consumption and shorting lead time, which is one of the critical components of intelligent construction. Conventional detection methods suffer from some challenges due to the multi-scale defects and unstructured detection environment. In this study, a detection network for DPWSs is developed based on the enhanced You Only Look Once version 5 (YOLOv5). First, the convolutional block attention module (CBAM) is inserted into the backbone of YOLOv5 to boost the feature extraction and suppress noise, which can sufficiently extract the features of the defects with blurry edges. Then, to improve the adaptability for multi-scale defects and reduce the model size, the Bi-directional Feature Pyramid Network (BiFPN) is employed in the neck of YOLOv5 to enhance the feature fusion, where the multi-scale objects can be fully captured. Finally, the decoupled head is proposed to replace the original convolution layer in the You Only Look Once (YOLO) head, which separates the classification and localization tasks to improve detection speed and robustness. Since there is no publicly available data set, a data set of DPWSs is constructed, and a series of comparative experiments are conducted. The results show that the detection accuracy is improved by 15.6% and the model size is reduced by 30.8% compared with YOLOv5. Meanwhile, the proposed network has better adaptability to DPWSs with higher detection accuracy and smaller model sizes compared with other advanced methods. As to the general applicability aspect of the model, the proposed model holds significant academic and practical implications in the realms of intelligent construction. Besides the model’s primary application domain of construction quality control, it can also be applied to defect detection in other scenarios that have multi-scale defects and unstructured environments. This versatility benefits a wide spectrum of construction projects.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"171 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An extended Vogel’s approximation algorithm for efficiently solving Fermatean fuzzy solid transportation problems","authors":"Shivani, Deepika Rani","doi":"10.1007/s00500-024-09812-x","DOIUrl":"https://doi.org/10.1007/s00500-024-09812-x","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>This paper aims to solve a solid transportation problem, wherein the uncertain parameters related to the problem are represented using triangular Fermatean fuzzy numbers. Fermatean fuzzy sets offer a relatively novel and wider alternative by providing the decision-makers with more versatile means of managing the uncertain information throughout the decision-making process. As per our literature survey, no algorithm exists in the literature for fuzzy solid transportation problems with parameters as triangular Fermatean fuzzy numbers. Therefore, in this study, the existing Vogel’s approximation method for the initial basic feasible solution (IBFS) of the traditional transportation problems is extended for the Fermatean fuzzy solid transportation problems. Further, a new method for getting the optimal solution from the obtained IBFS is proposed. The computational complexity and operational efficacy of the proposed algorithm are also discussed. Two application examples have been solved to illustrate the practicality of the proposed algorithm. For the comparative study, the problems are also solved with LINGO 20.0 software. The obtained results of IBFS are found to be significantly lower than those obtained by certain existing methods and the optimal values are comparable with those generated by the LINGO 20.0 optimization solver. Through a comparative analysis, it has been found that the proposed algorithm consistently produces optimal transportation costs for both application examples, adding to the novelty of the proposed work. Finally, the conclusion and future scope of this study are described.</p><h3 data-test=\"abstract-sub-heading\">Graphical abstract</h3><p>Graphical depiction of abstract</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"15 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An optimal equity-linked pure endowment contract: optimal stochastic control approach","authors":"Saman Vahabi, Amir T. Payandeh Najafabadi","doi":"10.1007/s00500-024-09870-1","DOIUrl":"https://doi.org/10.1007/s00500-024-09870-1","url":null,"abstract":"<p>This article explores pure-endowment contracts with investments that are simultaneously allocated in risk-free and risky financial markets. Employing the optimal stochastic control method and assuming that the jumps of the risky financial market follow either a finite or infinite activity Lévy process, and that the policyholder’s utility function is a Constant Relative Risk Aversion (CRRA) utility function, the article derives an optimal investment strategy and optimal policyholder consumption, with dependency on the mortality rate. Various mortality models and jump parameters are utilized to investigate the sensitivity of our findings. Finally, the article establishes the fair price of such contracts under different circumstances, showcasing practical applications through several examples.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"56 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}