AI and Cybersecurity Research Publications

@inbook{592,
  author = {Cobus Venter and Ignus Swart and Louise Leenen and Tommie Meyer and Jan Roodt and Herman le Roux},
  title = {Command and Control},
  abstract = {},
  year = {2012},
  journal = {South African Army Technical Symposium},
  month = {April 2012},
  publisher = {DPSS, CSIR},
  address = {South Africa},
}

@inbook{591,
  author = {Louise Leenen and Alex Terlunen and Herman le Roux},
  title = {A Constraint Programming Solution for the Military Unit Path Finding Problem},
  abstract = {},
  year = {2012},
  journal = {Mobile Intelligent Autonomous Systems: Recent Advances},
  month = {August 2012},
  publisher = {CRC Press},
  address = {United States of America},
}

@misc{597,
  author = {W.A. Labuschagne and M.M. Eloff and Namosha Veerasamy and Louise Leenen and Mathias Mujinga},
  title = {Design of a Cyber Security Awareness Campaign for Internet Cafe Users in Rural Areas},
  abstract = {},
  year = {2011},
  journal = {Proceedings of the First IFIP TC9/TC11 Southern African Cyber Security Awareness Workshop (SACSAW 2011)},
  month = {12 May 2011},
  address = {Gaborone, Botswana},
}

In this paper we describe a research project to develop an optimal information retrieval system in an Information Operations domain. Information Operations is the application and management of information to gain an advantage over an opponent and to defend one’s own interests. Corporations, governments, and military forces are facing increasing exposure to strategic information-based actions. Most national defence and security organisations regard Information Operations as both a defensive and offensive tool, and some commercial institutions are also starting to recognise the value of Information Operations. An optimal information retrieval system should have the capability to extract relevant and reasonably complete information from different electronic data sources which should decrease information overload. Information should be classified in a way such that it can be searched and extracted effectively. The authors of this paper have completed an initial phase in the investigation and design of a knowledge system that can be used to extract relevant and complete knowledge for the planning and execution of Information Operations. During this initial phase of the project, we performed a needs analysis and problem analysis and our main finding is the recommendation of the use of logic-based ontologies: it has the advantage of an unambiguous semantics, facilitates intelligent search, provides an optimal trade-off between expressivity and complexity, and yields optimal recall of information. The risk of adopting this technology is its status as an emerging technology and therefore we include recommendations for the development of a prototype system.

@{465,
  author = {Louise Leenen and Ronell Alberts and Katarina Britz and Aurona Gerber and Tommie Meyer},
  title = {Developing a Knowledge System for Information Operations},
  abstract = {In this paper we describe a research project to develop an optimal information retrieval system in an Information Operations domain. Information Operations is the application and management of information to gain an advantage over an opponent and to defend one’s own interests. Corporations, governments, and military forces are facing increasing exposure to strategic information-based actions. Most national defence and security organisations regard Information Operations as both a defensive and offensive tool, and some commercial institutions are also starting to recognise the value of Information Operations. An optimal information retrieval system should have the capability to extract relevant and reasonably complete information from different electronic data sources which should decrease information overload. Information should be classified in a way such that it can be searched and extracted effectively. The authors of this paper have completed an initial phase in the investigation and design of a knowledge system that can be used to extract relevant and complete knowledge for the planning and execution of Information Operations. During this initial phase of the project, we performed a needs analysis and problem analysis and our main finding is the recommendation of the use of logic-based ontologies: it has the advantage of an unambiguous semantics, facilitates intelligent search, provides an optimal trade-off between expressivity and complexity, and yields optimal recall of information. The risk of adopting this technology is its status as an emerging technology and therefore we include recommendations for the development of a prototype system.},
  year = {2011},
  journal = {6th International Conference on Information Warfare and Security},
  month = {17/03-18/03},
  address = {Washington D.C., United States of America},
  isbn = {978-1-906638-93-1},
  doi = {10204/4951},
}

@{598,
  author = {Louise Leenen and Johannes Vorster and W.H. le Roux},
  title = {A Constraint-based Solver for the Military Unit Path Finding Problem},
  abstract = {},
  year = {2010},
  journal = {Proceedings of the 2010 Spring Simulation Multiconference: Military Modelling and Simulation Symposium (SpringSim 2010)},
  month = {April 2010},
  address = {Orlando, United States of America},
}

@{599,
  author = {Louise Leenen and M.A. Modise and W.H. le Roux},
  title = {A Model for Peace Support Operations: an Overview of the ICT and Interoperability Requirements},
  abstract = {},
  year = {2009},
  journal = {Proceedings of the 4th International Conference on Information Warfare (ICIW 2009)},
  month = {March 2009},
  publisher = {Academic Conferences International},
  address = {Cape Town, South Africa},
}

@{600,
  author = {Louise Leenen and Aditya Ghose},
  title = {Branch and Bound Algorithms to Solve Semiring Constraint Satisfaction Problems},
  abstract = {},
  year = {2008},
  journal = {Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2008)},
  month = {December 2008},
  publisher = {Springer},
  address = {Hanoi, Vietnam},
}

@article{602,
  author = {Louise Leenen and Tommie Meyer and Aditya Ghose},
  title = {Relaxations of Semiring Constraint Satisfaction Problems},
  abstract = {},
  year = {2007},
  journal = {Information Processing Letters},
  volume = {103},
  issue = {5},
  publisher = {Elsevier},
}

@{601,
  author = {Louise Leenen and Anbulagan and Tommie Meyer and Aditya Ghose},
  title = {Modelling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT},
  abstract = {},
  year = {2007},
  journal = {Proceedings of the 20th Australasian Joint Conference on Artificial Intelligence},
  month = {December 2007},
  publisher = {Springer},
  address = {Gold Coast, Australia},
}

@{603,
  author = {Louise Leenen and Tommie Meyer and P. Harvey and Aditya Ghose},
  title = {A Relaxation of a Semiring Constraint Satisfaction Problem Using Combined Semirings},
  abstract = {},
  year = {2006},
  journal = {Proceedings of the 9th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2006)},
  month = {August 2006},
  publisher = {Springer},
  address = {Guilin, China},
}

@misc{604,
  author = {Louise Leenen and Tommie Meyer and Aditya Ghose},
  title = {Relaxations of Semiring Constraint Satisfaction Problems},
  abstract = {},
  year = {2005},
  journal = {Workshop on Soft Constraints and Preferences at CP2005},
  month = {October 2005},
  address = {Sitges, Spain},
}

@{605,
  author = {Louise Leenen and Katarina Britz and L.M. Venter},
  title = {A Pre-processing Algorithm for Solving Constraint Satisfaction Problems},
  abstract = {},
  year = {2003},
  journal = {Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT 2003)},
  month = {September 2003},
  address = {Stellenbosch, South Africa},
}

Although AGM theory contraction (Alchourron et al., 1985; Alchourron and Makinson, 1985) occupies a central position in the literature on belief change, there is one aspect about it that has created a fair amount of controversy. It involves the inclusion of the postulate known as Recovery. As a result, a number of alternatives to AGM theory contraction have been proposed that do not always satisfy the Recovery postulate (Levi, 1991, 1998; Hansson and Olsson, 1995; Ferme, 1998; Ferme and Rodriguez, 1998; Rott and Pagnucco, 1999). In this paper we present a new addition, systematic withdrawal, to the family of withdrawal operations, as they have become known. We define systematic withdrawal semantically, in terms of a set of preorders, and show that it can be characterised by a set of postulates. In a comparison of withdrawal operations we show that AGM contraction, systematic withdrawal and the severe withdrawal of Rott and Pagnucco (1999) are intimately connected by virtue of their definition in terms of sets of preorders. In a future paper it will be shown that this connection can be extended to include the epistemic entrenchment orderings of Gardenfors (1988) and Gardenfors and Makinson (1988) and the refined entrenchment orderings of Meyer et al. (2000).

@article{583,
  author = {Tommie Meyer and Johannes Heidema and Willem Labuschagne and Louise Leenen},
  title = {Systematic Withdrawal},
  abstract = {Although AGM theory contraction (Alchourron et al., 1985; Alchourron and Makinson, 1985) occupies a central position in the literature on belief change, there is one aspect about it that has created a fair amount of controversy. It involves the inclusion of the postulate known as Recovery. As a result, a number of alternatives to AGM theory contraction have been proposed that do not always satisfy the Recovery postulate (Levi, 1991, 1998; Hansson and Olsson, 1995; Ferme, 1998; Ferme and Rodriguez, 1998; Rott and Pagnucco, 1999). In this paper we present a new addition, systematic withdrawal, to the family of withdrawal operations, as they have become known. We define systematic withdrawal semantically, in terms of a set of preorders, and show that it can be characterised by a set of postulates. In a comparison of withdrawal operations we show that AGM contraction, systematic withdrawal and the severe withdrawal of Rott and Pagnucco (1999) are intimately connected by virtue of their definition in terms of sets of preorders. In a future paper it will be shown that this connection can be extended to include the epistemic entrenchment orderings of Gardenfors (1988) and Gardenfors and Makinson (1988) and the refined entrenchment orderings of Meyer et al. (2000).},
  year = {2002},
  journal = {Journal of Philosophical Logic},
  volume = {31},
  pages = {415-443},
  issue = {5},
  publisher = {Springer},
  doi = {10.1023/A:1020199115746},
}

@{608,
  author = {Louise Leenen and T.H.C. Smith},
  title = {Solving the Travelling Salesman Problem Using the Branch-and-Bound Method},
  abstract = {},
  year = {1991},
  journal = {Proceedings of the Conference of the South African Lecturer's Association},
  month = {1991},
  address = {Caledon, South Africa},
}

@{607,
  author = {Louise Leenen and T.H.C. Smith},
  title = {An Efficient Dual Simplex Implementation for the Continuous 2-Matching Problem with Side Constraints},
  abstract = {},
  year = {1991},
  journal = {14th International Symposium on Mathematical Programming},
  month = {1991},
  address = {Amsterdam, Netherlands},
}