Soft Computing最新文献_第5页

Pozyx technology with SDN for advanced indoor air quality monitoring and management 采用 SDN 的 Pozyx 技术实现先进的室内空气质量监测和管理

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-08-05 DOI: 10.1007/s00500-024-09952-0

Mohamed Saifeddine Hadj Sassi, Lamia Chaari Fourati

引用次数: 0

Red deer algorithm to detect the secret key of the monoalphabetic cryptosystem 检测单字母密码系统秘钥的红鹿算法

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-08-05 DOI: 10.1007/s00500-024-09849-y

Ashish Jain, Sulabh Bansal, Nripendra Narayan Das, Shyam Sunder Gupta

引用次数: 0

On categories associated with crisp deterministic automata with fuzzy rough outputs and fuzzy rough languages 论与具有模糊粗糙输出和模糊粗糙语言的简明确定性自动机相关的范畴

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-08-05 DOI: 10.1007/s00500-024-09818-5

Mausam Kumari, Vijay K. Yadav, Shainky Ruhela, S. P. Tiwari

{"title":"On categories associated with crisp deterministic automata with fuzzy rough outputs and fuzzy rough languages","authors":"Mausam Kumari, Vijay K. Yadav, Shainky Ruhela, S. P. Tiwari","doi":"10.1007/s00500-024-09818-5","DOIUrl":"https://doi.org/10.1007/s00500-024-09818-5","url":null,"abstract":"The categorical concepts, tools, and techniques advanced not only the theory of automata and languages but also developed the theory of fuzzy automata and languages and played a significant role in many other branches of theoretical computer science. Unlike theory of classical/fuzzy automata with output and their languages, this paper aims to incorporate the concept of fuzziness and roughness together in the theory of automata with output and their languages, to introduce the concepts of crisp deterministic automata with fuzzy rough output, and fuzzy rough language and study their categorical aspects. We have shown that the crisp deterministic automata with fuzzy rough outputs and fuzzy rough languages, along with their morphisms, respectively, form categories CDAFRO and FRL. We have also shown the existence of a functor between the categories CDAFRO and FRL. The categorical concepts of product and coproduct of a subfamily of object-class, equalizer, and coequalizer of a pair of parallel morphisms in category CDAFRO are studied. Finally, for a given fuzzy rough language, a minimal crisp deterministic automaton having fuzzy rough output recognizing it is constructed using the fuzzy generalization of foremost Myhill–Nerode’s theory of automata and languages.","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"13 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969070","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}

引用次数: 0

Predicting axial-bearing capacity of fully grouted rock bolting systems by applying an ensemble system 采用集合系统预测全灌浆岩石锚固系统的轴向承载能力

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-08-02 DOI: 10.1007/s00500-024-09828-3

Shahab Hosseini, Behshad Jodeiri Shokri, Ali Mirzaghorbanali, Hadi Nourizadeh, Shima Entezam, Amin Motallebiyan, Alireza Entezam, Kevin McDougall, Warna Karunasena, Naj Aziz

{"title":"Predicting axial-bearing capacity of fully grouted rock bolting systems by applying an ensemble system","authors":"Shahab Hosseini, Behshad Jodeiri Shokri, Ali Mirzaghorbanali, Hadi Nourizadeh, Shima Entezam, Amin Motallebiyan, Alireza Entezam, Kevin McDougall, Warna Karunasena, Naj Aziz","doi":"10.1007/s00500-024-09828-3","DOIUrl":"https://doi.org/10.1007/s00500-024-09828-3","url":null,"abstract":"In this paper, the potential of the five latest artificial intelligence (AI) predictive techniques, namely multiple linear regression (MLR), multi-layer perceptron neural network (MLPNN), Bayesian regularized neural network (BRNN), generalized feed-forward neural networks (GFFNN), extreme gradient boosting (XGBoost), and their ensemble soft computing models were evaluated to predict of the maximum peak load (PL) and displacement (DP) values resulting from pull-out tests. For this, 34 samples of the fully cementitious grouted rock bolts were prepared and cast. After conducting pull-out tests and building a dataset, twenty-four tests were randomly considered as a training dataset, and the remaining measurements were chosen to test the models’ performance. The input parameters were water-to-grout ratio (%) and curing time (day), while peak loads and displacement values were the outputs. The results revealed that the ensemble XGBoost model was superior to the other models. It was because having higher values of R2 (0.989, 0.979) and VAF (99.473, 98.658) and lower values of RMSE (0.0201, 0.0435) were achieved for testing the dataset of PL and DP’ values, respectively. Besides, sensitivity analysis proved that curing time was the most influential parameter in estimating values of peak loads and displacements. Also, the results confirmed that the ensemble XGBoost method was positioned to predict the axial-bearing capacity of the fully cementitious grouted rock bolting system with extreme performance and accuracy. Eventually, the results of the ensemble XGBoost modeling technique suggested that this novel model was more economical, less time-consuming, and less complicated than laboratory activities.","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"366 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886911","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}

引用次数: 0

Uncertain Chinese postman problem with budget constraint: a robust optimization approach 具有预算约束的不确定中国邮差问题：一种稳健优化方法

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-07-31 DOI: 10.1007/s00500-024-09837-2

M. Das, C. Nahak, M. P. Biswal

引用次数: 0

Integrated operating room planning and scheduling: an ILP-Based off-line approach for emergency responsiveness at a local hospital in Naples 手术室综合规划与调度：基于 ILP 的离线方法，提高那不勒斯一家地方医院的应急响应能力

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-07-31 DOI: 10.1007/s00500-024-09945-z

Maurizio Boccia, Andrea Mancuso, Adriano Masone, Claudio Sterle

{"title":"Integrated operating room planning and scheduling: an ILP-Based off-line approach for emergency responsiveness at a local hospital in Naples","authors":"Maurizio Boccia, Andrea Mancuso, Adriano Masone, Claudio Sterle","doi":"10.1007/s00500-024-09945-z","DOIUrl":"https://doi.org/10.1007/s00500-024-09945-z","url":null,"abstract":"This paper addresses a real-world Integrated Operating Room Planning and Scheduling (IORPS) problem encountered by a local hospital in Naples, characterized by stringent emergency management constraints, requiring treatment initiation within a 20-minute time-window. We tackle this problem by an original Integer Linear Programming formulation, capable of dealing with different operating room management strategies (open, block and block-modified). Our work differs from conventional cost-focused models by adopting a patient-oriented objective function, aligning with public hospitals obligations. The proposed method has been validated using real-world data provided by the hospital. The performed experimentation demonstrates the efficiency of the approach, capable of determining the optimal solution within an acceptable computation time that aligns with hospital requirements. Moreover, it also highlights the relevance of using our optimization approach to reduce delays in emergency responsiveness. This confirms its practical usage as a substitute for the current manual procedure.","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"146 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868018","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}

引用次数: 0

Snail Homing and Mating Search algorithm: a novel bio-inspired metaheuristic algorithm 蜗牛归巢与交配搜索算法：一种新颖的生物启发元启发式算法

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-07-31 DOI: 10.1007/s00500-024-09858-x

Anand J. Kulkarni, Ishaan R. Kale, Apoorva Shastri, Aayush Khandekar

{"title":"Snail Homing and Mating Search algorithm: a novel bio-inspired metaheuristic algorithm","authors":"Anand J. Kulkarni, Ishaan R. Kale, Apoorva Shastri, Aayush Khandekar","doi":"10.1007/s00500-024-09858-x","DOIUrl":"https://doi.org/10.1007/s00500-024-09858-x","url":null,"abstract":"In this paper, a novel Snail Homing and Mating Search (SHMS) algorithm is proposed. It is inspired from the biological behaviour of the snails. Snails continuously travel to find food and a mate, leaving behind a trail of mucus that serves as a guide for their return. Snails tend to navigate by following the available trails on the ground and responding to cues from nearby shelter homes. The proposed SHMS algorithm is investigated by solving several unimodal and multimodal functions. The solutions are validated using standard statistical tests such as two-sided and pairwise signed rank Wilcoxon test and Friedman rank test. The solutions obtained from the SHMS algorithm exhibited superior robustness as well as search space exploration capabilities with less computational cost. The real-world application of the SHMS algorithm is successfully demonstrated in the engineering design domain by solving three cases of design and economic optimization Shell and Tube Heat Exchanger (STHE) problem. The objective function value and other statistical results obtained using SHMS algorithm are compared with other well-known metaheuristic algorithms. For Solving STHE Case 1 the SHMS algorithm achieved 0.5–35% minimization of the total cost. For Case 2, 0.6–29% minimization of the total cost has been attained. Furthermore, for Case 3, 0.3%, 0.4% and 52% minimization of total cost is achieved when compared with the ARGA & CI, GA, and original study, respectively. The analysis regarding the convergence of the SHMS algorithm is discussed in detail. The contributions in this paper have opened up several avenues for further applicability of the algorithm for solving complex real-world problems.","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":"141868019","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}

引用次数: 0

NeVer2: learning and verification of neural networks NeVer2：神经网络的学习与验证

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-07-31 DOI: 10.1007/s00500-024-09907-5

Stefano Demarchi, Dario Guidotti, Luca Pulina, Armando Tacchella

{"title":"NeVer2: learning and verification of neural networks","authors":"Stefano Demarchi, Dario Guidotti, Luca Pulina, Armando Tacchella","doi":"10.1007/s00500-024-09907-5","DOIUrl":"https://doi.org/10.1007/s00500-024-09907-5","url":null,"abstract":"NeVer2 is an open-source, cross-platform tool aimed at designing, training, and verifying neural networks. It seamlessly integrates popular learning libraries with our verification backend, offering their functionalities via a graphical interface. Users can design the structure of a neural network by intuitively arranging blocks on a canvas. Subsequently, network training involves specifying dataset sources and hyperparameters through dialog boxes. After training, the verification process entails two steps: (i) incorporating input preconditions and output postconditions via dedicated blocks, and (ii) initiating verification with a simple “push-button” action. To our knowledge, there is currently no other publicly available tool that encompasses all these features. In this paper, we present a comprehensive description of NeVer2, illustrating its complete integration of design, training, and verification through examples. Additionally, we conduct experimental analyses on various verification benchmarks to illustrate the trade-off between completeness and computability using different algorithms. We also include a comparison with state-of-the-art tools such as (alpha ),(beta )-CROWN and NNV for reference.","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"212 1","pages":""},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868022","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}

引用次数: 0

Method of shapelet discovery for time series ordinal classification 用于时间序列序数分类的小形发现方法

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-07-31 DOI: 10.1007/s00500-024-09928-0

Siyuan Jing, Jun Yang

引用次数: 0

Specification and counterexample generation for cyber-physical systems 网络物理系统的规范和反例生成

IF 4.1 3区计算机科学

Soft Computing Pub Date : 2024-07-31 DOI: 10.1007/s00500-024-09793-x

Zhen Li, Zining Cao, Fujun Wang, Chao Xing

{"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":"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.","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}

引用次数: 0