| 1. |
- Al-Dhaqm, Arafat, et al.
(författare)
-
Digital Forensics Subdomains : The State of the Art and Future Directions
- 2021
-
Ingår i: IEEE Access. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 2169-3536. ; 9, s. 152476-152502
-
Tidskriftsartikel (refereegranskat)abstract
- For reliable digital evidence to be admitted in a court of law, it is important to apply scientifically proven digital forensic investigation techniques to corroborate a suspected security incident. Mainly, traditional digital forensics techniques focus on computer desktops and servers. However, recent advances in digital media and platforms have seen an increased need for the application of digital forensic investigation techniques to other subdomains. This includes mobile devices, databases, networks, cloud-based platforms, and the Internet of Things (IoT) at large. To assist forensic investigators to conduct investigations within these subdomains, academic researchers have attempted to develop several investigative processes. However, many of these processes are domain-specific or describe domain-specific investigative tools. Hence, in this paper, we hypothesize that the literature is saturated with ambiguities. To further synthesize this hypothesis, a digital forensic model-orientated Systematic Literature Review (SLR) within the digital forensic subdomains has been undertaken. The purpose of this SLR is to identify the different and heterogeneous practices that have emerged within the specific digital forensics subdomains. A key finding from this review is that there are process redundancies and a high degree of ambiguity among investigative processes in the various subdomains. As a way forward, this study proposes a high-level abstract metamodel, which combines the common investigation processes, activities, techniques, and tasks for digital forensics subdomains. Using the proposed solution, an investigator can effectively organize the knowledge process for digital investigation.
|
|
| 2. |
- Nasser, Abdullah B., et al.
(författare)
-
An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite
- 2018
-
Ingår i: International Journal of Bio-Inspired Computation (IJBIC). - : Interscience Publishers. - 1758-0366 .- 1758-0374. ; 12:2, s. 115-127
-
Tidskriftsartikel (refereegranskat)abstract
- In line with the upcoming of a new field called search-based software engineering (SBSE), many newly developed t-way strategies adopting meta-heuristic algorithms can be seen in the literature for constructing interaction test suite (such as simulated annealing (SA), genetic algorithm (GA), ant colony optimisation algorithm (ACO), particle swarm optimisation (PSO), harmony search (HS) and cuckoo search (CS). Although useful, most of the aforementioned t-way strategies have assumed sequence-less interactions amongst input parameters. In the case of reactive system, such an assumption is invalid as some parameter operations (or events) occur in sequence and hence, creating a possibility of bugs triggered by the order (or sequence) of input parameters. If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. In line with such a need, this paper presents a unified strategy based on the new meta-heuristic algorithm, called the elitist flower pollination algorithm (eFPA), for sequence and sequence-less coverage. Experimental results demonstrate the proposed strategy gives sufficiently competitive results as compared with existing works.
|
|
| 3. |
- Nasser, Abdullah B., et al.
(författare)
-
Hybrid flower pollination algorithm strategies for t-way test suite generation
- 2018
-
Ingår i: PLOS ONE. - : Public library science. - 1932-6203. ; 13:5
-
Tidskriftsartikel (refereegranskat)abstract
- The application of meta-heuristic algorithms for t-way testing has recently become prevalent. Consequently, many useful meta-heuristic algorithms have been developed on the basis of the implementation of t-way strategies (where t indicates the interaction strength). Mixed results have been reported in the literature to highlight the fact that no single strategy appears to be superior compared with other configurations. The hybridization of two or more algorithms can enhance the overall search capabilities, that is, by compensating the limitation of one algorithm with the strength of others. Thus, hybrid variants of the flower pollination algorithm (FPA) are proposed in the current work. Four hybrid variants of FPA are considered by combining FPA with other algorithmic components. The experimental results demonstrate that FPA hybrids overcome the problems of slow convergence in the original FPA and offers statistically superior performance compared with existing t-way strategies in terms of test suite size.
|
|
