Software-related security aspects are a growing and legitimate concern,especially with 5G data available just at our palms.To conduct research in this field,periodic comparative analysis is needed with the new techniq...Software-related security aspects are a growing and legitimate concern,especially with 5G data available just at our palms.To conduct research in this field,periodic comparative analysis is needed with the new techniques coming up rapidly.The purpose of this study is to review the recent developments in the field of security integration in the software development lifecycle(SDLC)by analyzing the articles published in the last two decades and to propose a way forward.This review follows Kitchenham’s review protocol.The review has been divided into three main stages including planning,execution,and analysis.From the selected 100 articles,it becomes evident that need of a collaborative approach is necessary for addressing critical software security risks(CSSRs)through effective risk management/estimation techniques.Quantifying risks using a numeric scale enables a comprehensive understanding of their severity,facilitating focused resource allocation and mitigation efforts.Through a comprehensive understanding of potential vulnerabilities and proactive mitigation efforts facilitated by protection poker,organizations can prioritize resources effectively to ensure the successful outcome of projects and initiatives in today’s dynamic threat landscape.The review reveals that threat analysis and security testing are needed to develop automated tools for the future.Accurate estimation of effort required to prioritize potential security risks is a big challenge in software security.The accuracy of effort estimation can be further improved by exploring new techniques,particularly those involving deep learning.It is also imperative to validate these effort estimation methods to ensure all potential security threats are addressed.Another challenge is selecting the right model for each specific security threat.To achieve a comprehensive evaluation,researchers should use well-known benchmark checklists.展开更多
Heuristic and metaheuristic techniques are used for solving computationally hard optimization problems. Local search is a heuristic technique while Ant colony optimization (ACO), inspired by the ants' foraging beh...Heuristic and metaheuristic techniques are used for solving computationally hard optimization problems. Local search is a heuristic technique while Ant colony optimization (ACO), inspired by the ants' foraging behavior, is one of the most recent metaheuristic technique. These techniques are used for solving optimization problems. Multiple-Input Multiple-Output (MIMO) detection problem is an NP-hard combinatorial optimization problem. We present heuristic and metaheuristic approaches for symbol detection in multi-input multi-output (MIMO) system. Since symbol detection is an NP-hard problem so ACO is particularly attractive as ACO algorithms are one of the most successful strands of swarm intelligence and are suitable for applications where low complexity and fast convergence is of absolute importance. Maximum Likelihood (ML) detector gives optimal results but it uses exhaustive search technique. We show that 1-Opt and ACO based detector can give near-optimal bit error rate (BER) at much lower complexity levels. Comparison of ACO with another nature inspired technique, Particle Swarm Optimization (PSO) is also discussed. The simulation results suggest that the proposed detectors give an acceptable performance complexity trade-off in comparison with ML and VBLAST detectors.展开更多
文摘Software-related security aspects are a growing and legitimate concern,especially with 5G data available just at our palms.To conduct research in this field,periodic comparative analysis is needed with the new techniques coming up rapidly.The purpose of this study is to review the recent developments in the field of security integration in the software development lifecycle(SDLC)by analyzing the articles published in the last two decades and to propose a way forward.This review follows Kitchenham’s review protocol.The review has been divided into three main stages including planning,execution,and analysis.From the selected 100 articles,it becomes evident that need of a collaborative approach is necessary for addressing critical software security risks(CSSRs)through effective risk management/estimation techniques.Quantifying risks using a numeric scale enables a comprehensive understanding of their severity,facilitating focused resource allocation and mitigation efforts.Through a comprehensive understanding of potential vulnerabilities and proactive mitigation efforts facilitated by protection poker,organizations can prioritize resources effectively to ensure the successful outcome of projects and initiatives in today’s dynamic threat landscape.The review reveals that threat analysis and security testing are needed to develop automated tools for the future.Accurate estimation of effort required to prioritize potential security risks is a big challenge in software security.The accuracy of effort estimation can be further improved by exploring new techniques,particularly those involving deep learning.It is also imperative to validate these effort estimation methods to ensure all potential security threats are addressed.Another challenge is selecting the right model for each specific security threat.To achieve a comprehensive evaluation,researchers should use well-known benchmark checklists.
文摘Heuristic and metaheuristic techniques are used for solving computationally hard optimization problems. Local search is a heuristic technique while Ant colony optimization (ACO), inspired by the ants' foraging behavior, is one of the most recent metaheuristic technique. These techniques are used for solving optimization problems. Multiple-Input Multiple-Output (MIMO) detection problem is an NP-hard combinatorial optimization problem. We present heuristic and metaheuristic approaches for symbol detection in multi-input multi-output (MIMO) system. Since symbol detection is an NP-hard problem so ACO is particularly attractive as ACO algorithms are one of the most successful strands of swarm intelligence and are suitable for applications where low complexity and fast convergence is of absolute importance. Maximum Likelihood (ML) detector gives optimal results but it uses exhaustive search technique. We show that 1-Opt and ACO based detector can give near-optimal bit error rate (BER) at much lower complexity levels. Comparison of ACO with another nature inspired technique, Particle Swarm Optimization (PSO) is also discussed. The simulation results suggest that the proposed detectors give an acceptable performance complexity trade-off in comparison with ML and VBLAST detectors.
