Computing and Information Systems - Theses
Permanent URI for this collection
Search Results
1 - 10 of 42
-
ItemPractical declarative debugging of mercury programs(University of Melbourne, 2006)
-
ItemUnderstanding the business benefits of ERP system use( 2006)ERP systems are large, complex, integrated software packages used for business transaction processing by thousands of major organizations worldwide. Yet outcomes from ERP system implementation and use can be very different, and current understanding of how and why such variation exists is limited. Since most studies of ERP systems to date have focused on ERP implementation, this research focused on the post-implementation period. The aim was to better understand the 'what', 'how' and 'why' of achieving business benefits from ERP systems during ERP use. Achieving business benefits from ERP systems was considered as a process of organizational change occurring over time within various societal and organizational contexts. A retrospective, interpretive case study approach was used to study this process. The post-implementation periods of four Australian manufacturing organizations that had implemented ERP systems were studied. This study makes three important contributions to the information systems research literature. First, a new framework was developed to explain 'how' and 'why' business benefits were achieved from ERP systems. This explanatory framework is theoretically based and is firmly grounded in the empirical data. Three types of themes, along with the interrelationships between them, were identified as influencing the business benefits achieved from ERP systems. The first group of themes, the process themes, are 'Education, training and support', 'Technochange management' and 'People resources'. The second group of themes, the outcome themes, are 'Efficient and effective use of the ERP system', 'Business process improvement' and 'New projects to leverage off the ERP system'. The third group of themes, the contextual themes, are the 'External context', the 'Internal context' and the 'ERP planning and implementation phases'. This new framework makes a significant contribution to understanding how and why some organizations achieve more business benefits from ERP systems than others. Second, the case studies provide a rich description of four manufacturing organizations that have implemented and used ERP systems. Examining the 'what' of business benefits from ERP systems in these four manufacturing organizations resulted in a confirmed, amended and improved Shang and Seddon (2000) ERP business benefits framework. This replication and extension of previous research is the third contribution of this study. The results of this research are of interest not only to information systems researchers, but also to information systems practitioners and senior management in organizations that either plan to, or have implemented ERP systems. Overall this research provides an improved understanding of business benefits from ERP systems and a sound foundation for future studies of ERP system use.
-
ItemInterest-based negotiation in multi-agent systems( 2004)Software systems involving autonomous interacting software entities (or agents) present new challenges in computer science and software engineering. A particularly challenging problem is the engineering of various forms of interaction among agents. Interaction may be aimed at enabling agents to coordinate their activities, cooperate to reach common objectives, or exchange resources to better achieve their individual objectives. This thesis is concerned with negotiation: a process through which multiple self-interested agents can reach agreement over the exchange of scarce resources. In particular, I focus on settings where agents have limited or uncertain information, precluding them from making optimal individual decisions. I demonstrate that this form of bounded-rationality may lead agents to sub-optimal negotiation agreements. I argue that rational dialogue based on the exchange of arguments can enable agents to overcome this problem. Since agents make decisions based on particular underlying reasons, namely their interests, beliefs and planning knowledge, then rational dialogue over these reasons can enable agents to refine their individual decisions and consequently reach better agreements. I refer to this form of interaction as “interested-based negotiation.” (For complete abstract open document)
-
ItemThe logic of bunched implications: a memoir( 2006)This is a study of the semantics and proof theory of the logic of bunched implications (BI), which is promoted as a logic of (computational) resources, and is a foundational component of separation logic, an approach to program analysis. BI combines an additive, or intuitionistic, fragment with a multiplicative fragment. The additive fragment has full use of the structural rules of weakening and contraction, and the multiplicative fragment has none. Thus it contains two conjunctive and two implicative connectives. At various points, we illustrate a resource view of BI based upon the Kripke resource semantics. Our first original contribution is the formulation of a proof system for BI in the newly developed proof-theoretical formalism of the calculus of structures. The calculus of structures is distinguished by its employment of deep inference, but we already see deep inference in a limited form in the established proof theory for BI. We show that our system is sound with respect to the elementary Kripke resource semantics for BI, and complete with respect to a formulation of the partially-defined Kripke resource semantics. Our second contribution is the development from a semantic standpoint of preliminary ideas for a hybrid logic of bunched implications (HBI). We give a Kripke semantics for HBI in which nominal propositional atoms can be seen as names for resources, rather than as names for locations, as is the case with related proposals for BI-Loc and for intuitionistic hybrid logic.
-
ItemUsing minimal recursion semantics in Japanese question answering( 2006-09)Question answering is a research field with the aim of providing answers to a user’s question, phrased in natural language. In this thesis I explore some techniques used in question answering, working towards the twin goals of using deep linguistic knowledge robustly as well as using language-independent methods wherever possible. While the ultimate aim is cross-language question answering, in this research experiments are conducted over Japanese data, concentrating on factoid questions. The two main focus areas, identified as the two tasks most likely to benefit from linguistic knowledge, are question classification and answer extraction. In question classification, I investigate the issues involved in the two common methods used for this task—pattern matching and machine learning. I find that even with a small amount of training data (2000 questions), machine learning achieves better classification accuracy than pattern matching with much less effort. The other issue I explore in question classification is the classification accuracy possible with named entity taxonomies of different sizes and shapes. Results demonstrate that, although the accuracy decreases as the taxonomy size increases, the ability to use soft decision making techniques as well as high accuracies achieved in certain classes make larger, hierarchical taxonomies a viable option. For answer extraction, I use Robust Minimal Recursion Semantics (RMRS) as a sentence representation to determine similarity between questions and answers, and then use this similarity score, along with other information discovered during comparison, to score and rank answer candidates. Results were slightly disappointing, but close examination showed that 40% of errors were due to answer candidate extraction, and the scoring algorithm worked very well. Interestingly, despite the lower accuracy achieved during question classification, the larger named entity taxonomies allowed much better accuracy in answer extraction than the smaller taxonomies.
-
ItemThe production of meaningful route directions using landmark extraction( 2006-11)In order for automated navigation systems to operate effectively, the route instructions they produce must be clear, concise and easily understood by users. Thequality and coherence of route instructions may be improved via landmark chunking, whereby a turning instruction is given with reference to a nearby landmark. In order to incorporate a landmark within a coherent sentence, it is necessary to first understand how that landmark is conceptualised by travellers — whether it is perceived as point-like, line-like or area-like. This conceptualisation determines which prepositions and verbs are appropriate when referring to the landmark. This thesis investigates the viability of automatically classifying the conceptualisation of landmarks relative to a given city context. First, we construct a web-based annotation interface to solicit gold-standard judgements from expert annotators over a set of landmarks for three major cities (Melbourne, Hamburg and Tokyo). We then experiment with the use of web data to learn the default conceptualisation of those landmarks, analysing their occurrence in a fixed set of lexico-syntactic patterns. Based on this, we develop two automated landmark classifiers and evaluate them against the gold standard annotations,investigating patterns of convergence or divergence in landmark categorisation.
-
ItemA declarative debugger for Haskell( 2006-12)This thesis considers the design and implementation of a Declarative Debugger for Haskell. At its core is a tree which captures the logical dependencies between function calls in a given execution of the program being debugged (the debuggee). The debuggee is transformed into a new Haskell program which produces the tree in addition to its normal value. A bug is identified in the tree when a call returns the wrong result but all the calls it depends upon are correct.
-
ItemOn designing a mobile robot for RoboCup( 2006-03)The Roobots are a robot soccer team which participated in the RoboCup small-sized robot league competition in the years 2000, 2001 and 2002, when they finished in fourth place. This thesis describes the design of the robots in the 2002 team. Design issues for mobile robots in the RoboCup small-sized robot league are reviewed. The design decisions are presented. Finally, some lessons learnt for system design and project management from the three years of competition are presented.
-
ItemShadowboard: an agent architecture for enacting a sophisticated digital self( 2001-09)In recent years many people have built Personal Assistant Agents, Information Agents and the like, and have simply added them to the operating system as auxiliary applications, without regard to architecture. This thesis argues that an agent architecture, one designed as a sophisticated representation of an individual user, should be embedded deep in the device system software, with at least equal status to the GUI – the graphical user interface. A sophisticated model of the user is then built, drawing upon contemporary Analytical Psychology – the Psychology of Subselves. The Shadowboard Agent architecture is then built upon that user model, drawing both structural and computational implications from the underlying psychology. An XML DTD file named Shadowboard.dtd is declared as a practical manifestation of the semantics of Shadowboard. An implementation of the Shadowboard system is mapped out, via a planned conversion of two existing integrated systems: SlimWinX, an event-driven GUI system; and XSpaces, an object-oriented tuplespace system with Blackboard-like features. The decision making mechanism passes logic terms and contraints between the various sub-agent components (some of which take on the role of Constraint Solvers), giving this agent system some characteristics of a Generalised Constraint Solver. A Shadowboard agent (built using the system) consists of a central controlling autonomous agent named the Aware Ego Agent, and any number of sub-agents, which collectively form an integrated but singular whole agent modelled on the user called the Digital Self. One such whole-agent is defined in a file named DigitalSelf.xml – which conforms to the schema in Shadowboard.dtd - which offers a comprehensive and generic representation of a user’s stance in a 24x7 network, in particular - the Internet. Numerous types of Shadowboard sub-agents are declared.
-
ItemScheduling distributed data-intensive applications on global grids( 2006-07)The next generation of scientific experiments and studies are being carried out by large collaborations of researchers distributed around the world engaged in analysis of huge collections of data generated by scientific instruments. Grid computing has emerged as an enabler for such collaborations as it aids communities in sharing resources to achieve common objectives. Data Grids provide services for accessing, replicating and managing data collections in these collaborations. Applications used in such Grids are distributed data-intensive, that is, they access and process distributed datasets to generate results. These applications need to transparently and efficiently access distributed data and computational resources. This thesis investigates properties of data-intensive computing environments and presents a software framework and algorithms for mapping distributed data-oriented applications to Grid resources. (For complete abstract open document)
- 1 (current)
- 2
- 3
- 4
- 5