Research Articles (Computer Science)

Research Articles (Computer Science)

 

Recent Submissions

  • Mohiuddin, Mohammad A.; Khan, S.A. (Salman Ahmad); Engelbrecht, Andries (Springer, 2016-10)
    The open shortest path first (OSPF) routing protocol is a well-known approach for routing packets from a source node to a destination node. The protocol assigns weights (or costs) to the links of a network. These ...
  • Kebande, Victor R.; Venter, Hein S. (Taylor and Francis, 2016-06)
    The need to perform digital investigations has over the years led to the exponential growth of the field of Digital Forensics (DF). However, quite a number of challenges face the act of proving – for purposes of Digital ...
  • Bella, M.A. Bihina; Eloff, Jan H.P. (Elsevier, 2016-02)
    Digital forensics has been proposed as a methodology for doing root-cause analysis of major software failures for quite a while. Despite this, similar software failures still occur repeatedly. A reason for this is the ...
  • Hauger, Werner K.; Olivier, Martin S. (South African Institute of Electrical Engineers, 2015-06)
    An aspect of database forensics that has not received much attention in the academic research community yet is the presence of database triggers. Database triggers and their implementations have not yet been thoroughly ...
  • Fouche, Mark-Anthony; Solms, Fritz; Tofan, Dan; Galster, Matthias; Lytra, Ioanna; Avgeriou, Paris; Zdun, Uwe; De Boer, Remco (Elsevier, 2016-04)
    CONTEXT : Many software architectural decisions are group decisions rather than decisions made by individuals. Consensus in a group of decision makers increases the acceptance of a decision among decision makers and their ...
  • Mouton, Francois; Venter, Hein S.; Leenen, Louise (Elsevier, 2016-06)
    The field of information security is a fast-growing discipline. Even though the effectiveness of security measures to protect sensitive information is increasing, people remain susceptible to manipulation and thus the ...
  • Leonard, Barend J.; Engelbrecht, Andries P.; Cleghorn, Christopher Wesley (Springer, 2015-12)
    This article investigates various aspects of angle modulated particle swarm optimisers (AMPSO). Previous attempts at improving the algorithm have only been able to produce better results in a handful of test cases. With ...
  • Gruner, Stefan; Bartelmann, Matthias (Cosmos and History Publishing Co-op, 2015)
    Hegel's historically transient notion of 'aether', developed and finally abandoned again during his short period of time at the University of Jena in the early years of the 19th century, has received comparatively little ...
  • Scheepers, Christiaan; Engelbrecht, Andries P. (Springer, 2016-02)
    A new competitive coevolutionary team-based particle swarm optimiser (CCPSO(t)) algorithm is developed to train multi-agent teams from zero knowledge. The CCPSO(t) algorithm is applied to train a team of agents to play ...
  • Valjarevic, Aleksandar; Venter, Hein S. (Wiley, 2015-11)
    Performing a digital forensic investigation (DFI) requires a standardized and formalized process. There is currently neither an international standard nor does a global, harmonized DFI process (DFIP) exist. The authors ...
  • Olivier, Martin S. (Vaal Triangle Faculty of Northwest University in South Africa, 2015-11)
    This essay traces two research programmes in broad strokes. Both programmes start from the same observation — the behaviour of an ant (or termite) colony and the ability of the ant colony to act in a collective manner ...
  • Karie, Nickson M.; Venter, Hein S. (Wiley, 2015-07)
    Since its inception, over a decade ago, the field of digital forensics has faced numerous challenges. Despite different researchers and digital forensic practitioners having studied and analysed various known digital ...
  • Engelbrecht, Andries P. (Springer, 2016-02)
    Since its inception in 1995, many improvements to the original particle swarm optimization (PSO) algorithm have been developed. This paper reviews one class of such PSO variations, i.e. PSO algorithms that make use of ...
  • Engelbrecht, Andries P.; Bosman, Phlippie (Springer, 2014)
    The diversity of a particle swarm can reflect the swarm's explorative/exploitative behaviour at a given time step. This paper pro- poses a diversity rate of change measure to quantify the rate at which particle swarms ...
  • Malan, Mercia M.; Mouton, Francois; Kimppa, Kai K.; Venter, Hein S. (Elsevier, 2015-11)
    Social engineering is deeply entrenched in the fields of both computer science and social psychology. Knowledge is required in both these disciplines to perform social engineering based research. Several ethical concerns ...
  • Valjarevic, Aleksandar; Venter, Hein S. (Taylor and Francis, 2016)
    Performing a digital forensic investigation requires a formalized process to be followed. It also requires that certain principles are applied, such as preserving of digital evidence and documenting actions. The need for ...
  • Hancke, Gerhard P.; Kruger, Carel; Fisher, Roy; Ledwaba, Lehlogonolo (MDPI Publishing, 2015)
    The concept of the Internet of Things is rapidly becoming a reality, with many applications being deployed within industrial and consumer sectors. At the ‘thing’ level—devices and inter-device network communication—the ...
  • Engelbrecht, Andries P.; Cleghorn, Christopher Wesley (Springer, 2015-09)
    This paper presents an objective function specially designed for the convergence analysis of a number of particle swarm optimization (PSO) variants. It was found that using a specially designed objective function for ...
  • Malan, Katherine Mary; Engelbrecht, Andries P. (Springer, 2014-12)
    The focus of research in swarm intelligence has been largely on the algorithmic side with relatively little attention being paid to the study of problems and the behaviour of algorithms in relation to problems. When a ...
  • Kourie, Derrick G.; Cleophas, L.G.W.A. (Loek); Watson, Bruce William (Computer Society of South Africa, 2014-08)
    In indexing of, and pattern matching on, DNA and text sequences, it is often important to represent all factors of a sequence. One e cient, compact representation is the factor oracle (FO). At the same time, any classical ...

View more