<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection:</title>
  <link rel="alternate" href="http://hdl.handle.net/10204/3218" />
  <subtitle />
  <id>http://hdl.handle.net/10204/3218</id>
  <updated>2013-05-21T05:03:29Z</updated>
  <dc:date>2013-05-21T05:03:29Z</dc:date>
  <entry>
    <title>A forensic readiness model for Wireless Local Area Networks</title>
    <link rel="alternate" href="http://hdl.handle.net/10204/6654" />
    <author>
      <name>Ngobeni, S</name>
    </author>
    <author>
      <name>Venter, H</name>
    </author>
    <author>
      <name>Burke, I</name>
    </author>
    <id>http://hdl.handle.net/10204/6654</id>
    <updated>2013-04-11T21:55:17Z</updated>
    <published>2010-01-01T00:00:00Z</published>
    <summary type="text">Title: A forensic readiness model for Wireless Local Area Networks
Authors: Ngobeni, S; Venter, H; Burke, I
Abstract: Over the past decade, wireless mobile communications technology based on IEEE 802.11 wireless local area networks (WLANs) has been adopted worldwide on a massive scale. However, as the number of wireless users has soared, so has the possibility of cyber crime, where criminals deliberately and actively break into WLANs with the intent to cause harm or access sensitive information. WLAN digital forensics is seen not only as a response to cyber crime in wireless environments, but also as a means to stem the increase of cyber crime in WLANs. The challenge in WLAN digital forensics is to intercept and preserve all the communications generated by the mobile devices and conduct a proper digital forensic investigation. This paper attempts to address this issue by proposing a wireless forensic readiness model designed to help monitor, log and preserve wireless network traffic for digital forensic investigations. A prototype implementation of the wireless forensic readiness model is presented as a proof of concept.
Description: Copyright: Springer, Berlin, Heidelberg</summary>
    <dc:date>2010-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>An exploratory survey of design science research amongst South African computing scholars</title>
    <link rel="alternate" href="http://hdl.handle.net/10204/6620" />
    <author>
      <name>Naidoo, R</name>
    </author>
    <author>
      <name>Gerber, A</name>
    </author>
    <author>
      <name>Van der Merwe, A</name>
    </author>
    <id>http://hdl.handle.net/10204/6620</id>
    <updated>2013-03-25T21:55:39Z</updated>
    <published>2012-10-01T00:00:00Z</published>
    <summary type="text">Title: An exploratory survey of design science research amongst South African computing scholars
Authors: Naidoo, R; Gerber, A; Van der Merwe, A
Abstract: The debate ensues as to whether the traditional focus of computing research on theory development and verification and therefore has adequate immediate practical relevance. Despite increasing claims of the potential of design science research (DSR) to enhance the utility of the IT artifact and consequently practical relevance of research, many computing researchers seem to be reticent to accept this paradigm as a legitimate form of scholarly research. DSR is a relatively new paradigm in computing and little is known about its uptake in South Africa. In this paper, we investigate the opinions about DSR among South African computing scholars. Findings from a survey of 53 respondents indicate low adoption rates. The paper also investigates some of the key barriers preventing the uptake of DSR. The paper concludes with some implications as well as suggestions for building a local DSR community.
Description: SA Institute for Computer Scientists and IT (SAICSIT) 2012, Centurion, Pretoria, 1-3 October 2012. Published in ACM Digital library.</summary>
    <dc:date>2012-10-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>A note on the translation of conceptual data models into description logics: disjointness and covering assumptions</title>
    <link rel="alternate" href="http://hdl.handle.net/10204/6609" />
    <author>
      <name>Casini, G</name>
    </author>
    <author>
      <name>Gerber, A</name>
    </author>
    <author>
      <name>Meyer, T</name>
    </author>
    <id>http://hdl.handle.net/10204/6609</id>
    <updated>2013-03-25T21:55:42Z</updated>
    <published>2012-10-01T00:00:00Z</published>
    <summary type="text">Title: A note on the translation of conceptual data models into description logics: disjointness and covering assumptions
Authors: Casini, G; Gerber, A; Meyer, T
Abstract: Conceptual modeling is nowadays mostly done using languages such as Entity-Relationship (ER) Models, Unified Modeling Language (UML), and Object-Role Modeling (ORM). These models are used to depict the ontological organization of relevant concepts or entities. Such models share a common modeling approach, based on the notions of class or entity and the relations or associations between classes or entities. Recent developments in knowledge representation using logic-based ontologies have created new possibilities for conceptual data modeling. It also raises the question of how existing conceptual models using ER, UML or ORM could be translated into Description Logics (DLs), a family of logics that have proved to be particularly appropriate for formalizing ontologies and reasoning about them. Given a conceptual data model, two assumptions are usually made that are not explicitly stated but need to be clarified for its DL translation: (1) disjointness assumption: all the classes are to be assumed pairwise disjoint if not specified otherwise; and (2) covering assumption: the content of every class must correspond to the union of its immediate subclasses (this includes the assumption that we do not consider anything apart from what is expressed in the model). In this paper we propose two simple procedures to assist modelers with integrating these assumptions into their models, thereby allowing for a more complete translation into DLs.
Description: Copyright: 2012 ACM. This is an ABSTRACT ONLY.</summary>
    <dc:date>2012-10-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>A normal form for hypergraph-based module extraction for SROIQ</title>
    <link rel="alternate" href="http://hdl.handle.net/10204/6595" />
    <author>
      <name>Nortje, R</name>
    </author>
    <author>
      <name>Britz, K</name>
    </author>
    <author>
      <name>Meyer, T</name>
    </author>
    <id>http://hdl.handle.net/10204/6595</id>
    <updated>2013-03-25T21:55:28Z</updated>
    <published>2012-12-01T00:00:00Z</published>
    <summary type="text">Title: A normal form for hypergraph-based module extraction for SROIQ
Authors: Nortje, R; Britz, K; Meyer, T
Abstract: Modularization is an important part of the modular design and maintenance of large scale ontologies. Syntactic locality modules, with their desirable model theoretic properties, play an ever increasing role in the design of algorithms for modularization, partitioning and reasoning tasks such as classification. It has been shown that, for the DL EL+, the syntactic locality module extraction problem is equivalent to the reachability problem for hypergraphs. In this paper we investigate and introduce a normal form for the DL SROIQ which allows us to map any SROIQ ontology to an equivalent hypergraph. We then show that standard hyperpath search algorithms can be used to extract modules similar to syntactic locality modules for SROIQ ontologies.
Description: 8th Australasian Ontology Workshop, Sydney, Australia, 4 December 2012. Published in CAIR 2012</summary>
    <dc:date>2012-12-01T00:00:00Z</dc:date>
  </entry>
</feed>

