Computer Sciences Commons^™

Optimisation Of John The Ripper In A Clustered Linux Environment, Christian Frichot

Theses : Honours

To aid system administrators in enforcing strict password policies, the use of password cracking tools such as Cisilia (C.I.S.I.ar, 2003) and John the Ripper (Solar Designer, 2002), have been employed as software utilities to look for "weak" passwords. John the Ripper (JtR) attempts to crack the passwords by using a dictionary, brute-force or "other" mode of attack. The computational intensity of cracking passwords has led to the utilisation of parallel-processing environments to increase the speed of the password-cracking task. Parallel-processing environments can consist of either single systems with multiple processors, or a collection of separate computers working together as a …

Evaluation Of An Esperanto-Based Interlingua Multilingual Survey Form Machine Translation Mechanism Incorporating A Sublanguage Translation Methodolgy, Richard Boddington

Theses : Honours

Translation costs restrict the preparation of medical survey and other questionnaires for migrant communities in Western Australia. This restriction is compounded by a lack of affordable and accurate machine translation mechanisms. This research investigated and evaluated combined strategies intended to provide an efficacious and affordable machine translator by: • using an interlingua or pivot-language that requires less resources for its construction than contemporary systems and has the additional benefit of significant error reduction; and • defining smaller lexical environments to restrict data, thereby reducing the complexity of translation rules and enhancing correct semantic transfer between natural languages. This research focussed …

Developing Software For Wound Measurement, Savo Kordic

Theses : Honours

Chronic wounds such as leg ulcers, pressure ulcers and diabetic ulcers affect many thousands of people in Australia. In addition to the costs of these wounds in terms of human suffering, loss of income and resources, there are costs related to the treatment of ulcers. Thus, there is a genuine need to develop an accurate and a fully objective application for wound measurement. The aim of this project was to create software for the measurement of wounds. In achieving this goal, several issues were addressed: an accurate measurement method capable of detecting small changes in an open wound surface area, …

Exploring The Possibilities Of Three Dimensional Image Manipulations On Mobile Devices, Thanuja Nuwan Hettiarachchi

Theses : Honours

With the introduction of more powerful mobile microprocessors and colour screen technology, complex image manipulations on various mobile devices such as mobile phones and handheld devices have become a reality. As a consequence of these improvements, there has been an increasing demand by users for interactive computer games which produce complex graphics by utilizing these advanced hardware technologies. Three dimensional (3D) graphics have been used to produce realistic interactive imaging for computer games during recent years. Java, through its mobile device programming platform, provides the framework for such complex image manipulations in computer games deployed on Java compatible mobile devices. …

The Mutamathil Type Style: Towards Free, Technology-Friendly, Arabetic Types, Saad D. Abulhab

Publications and Research

Efforts to adapt various Arabetic scripts to the machine are as old as the field of typography. But most of these efforts concentrated primarily on forcing the machine to duplicate the Arabetic handwritten forms. Others have practically advocated divorce from the calligraphic tradition rather than enrichment and reform. One reason why the few modern attempts to typographically solve the technology-induced Arabetic script problems had failed is that many typeforms (or many times just theoretical calligraphy style) was presented as replacement for the traditional ones rather than as optional working types. New “controversial” types should be made widely available for users …

Optimal Design Of Engineering Systems Using Mpi-Enabled Genetic Algorithm, S. D. Rajan, D. T. Nguyen, M. D. Deshpande, L. Harrell

Civil & Environmental Engineering Faculty Publications

The focus of this paper is on the development and implementation of a genetic algorithm (GA)-based software system using message passing interface (MPI) protocol and library. A customized form of simple GA used in previous research [1-4] is parallelized. This MPI-enabled version is used to find the solution to finite element based design optimization problems. Results show that an almost linear speedup is obtained on homogenous hardware cluster and, with proper reworking of the software, on heterogeneous hardware cluster.

Gamma-Set Domination Graphs. I: Complete Biorientations Of Q-Extended Stars And Wounded Spider Graphs, Kim A. S. Factor

Mathematics, Statistics and Computer Science Faculty Research and Publications

The domination number of a graph G, γ(G), and the domination graph of a digraph D, dom(D) are integrated in this paper. The γ-set domination graph of the complete biorientation of a graph G, dom_γ(G) is created. All γ-sets of specific trees T are found, and dom-_γ(T) is characterized for those classes.

Reading Over The Shoulder Of The Future At The Library Of Congress, Samuel Gerald Collins

Reconstruction: Studies in Contemporary Culture

[First paragraph]

It is 2003 and I am doing some research at the Library of Congress, the de facto national library for the United States and the largest library in the world. Next to me sit some articles I've printed off of online journals on the Defense Advanced Research Project Agency's Total Information Awareness Project, a plan, still in its formative stage, to throw a panopticon net of surveillance across the United States through a combination of language translation technologies, data search and pattern recognition technologies, and advanced collaborative and decision support tools (DARPA). But I am also doing research …

Degree Of Scaffolding: Learning Objective Metadata: A Prototype Leaning System Design For Integrating Gis Into A Civil Engineering Curriculum, Richard H. Hall, Ronaldo Luna, Michael Gene Hilgers, Aaron Joseph Taylor, John Mckenna Sullivan, Matt Buechler

Business and Information Technology Faculty Research & Creative Works

Digital media and networking offer great potential as tools for enhancing classroom learning environments, both local and distant. One concept and related technological tool that can facilitate the effective application and distribution of digital educational resources is learning objects in combination with the SCORM (sharable content objects reference model) compliance framework. Progressive scaffolding is a learning design approach for educational systems that provides flexible guidance to students. We are in the process of utilizing this approach within a SCORM framework in the form of a multi-level instructional design. The associated metadata required by SCORM will describe the degree of scaffolding. …

Digital Library Services For Three-Dimensional Models, Hesham Anan

Computer Science Theses & Dissertations

With the growth in computing, storage and networking infrastructure, it is becoming increasingly feasible for multimedia professionals—such as graphic designers in commercial, manufacturing, scientific and entertainment areas—to work with 3D digital models of the objects with which they deal in their domain. Unfortunately most of these models exist in individual repositories, and are not accessible to geographically distributed professionals who are in need of them.

Building an efficient digital library system presents a number of challenges. In particular, the following issues need to be addressed: (1) What is the best way of representing 3D models in a digital library, so …

Np-Hardness Of Cache Mapping, Zhiyuan Li, Rong Xu

Department of Computer Science Technical Reports

No abstract provided.

Q-Pod: Deployable And Scalable End System Support For Enabling Qos In Legacy Enterprise Systems, Asad Khan Awan, Kihong Park

Department of Computer Science Technical Reports

No abstract provided.

Fast Algorithms For Fragment Based Completion In Images Of Natural Scenes, Siddharth Rajkumar Borikar

Electronic Theses and Dissertations

Textures are used widely in computer graphics to represent fine visual details and produce realistic looking images. Often it is necessary to remove some foreground object from the scene. Removal of the portion creates one or more holes in the texture image. These holes need to be filled to complete the image. Various methods like clone brush strokes and compositing processes are used to carry out this completion. User skill is required in such methods. Texture synthesis can also be used to complete regions where the texture is stationary or structured. Reconstructing methods can be used to fill in large-scale …

An Agent-Based Approach To Adaptive Navigational Support Within 3d-Environments, Bianca Schoen-Phelan, Gregory O'Hare, Brian Duffy, Alan Martin

Conference papers

his paper investigates mechanisms and approaches to assisting user navigation and exploration within 3-dimensional worlds. Specifically it advocates the deployment of an agentbased approach to dynamic system assistance and intervention. A performance equation is presented in a basic and an extended version, which is used to activate system interventions and to evaluate user performances online and offline. The measure is derived via a light-weight computationally inexpensive masking approach. We describe some navigation experiments and the results of navigational intervention via the damping of the sensitivity of the navigational keys. Interestingly the navigational assistance does not yield improvements in the subjects’ …

Openmvc: A Non-Proprietary Component-Based Framework For Web Applications, Ronan Barrett, Sarah Jane Delany

Conference papers

No abstract provided.

Parametric Classification In Domains Of Characters, Numerals, Punctuation, Typefaces And Image Qualities, Osama Ahmed Khan

Theses and Dissertations - UTB/UTPA

This thesis contributes to the Optical Font Recognition problem (OFR), by developing a classifier system to differentiate ten typefaces using a single English character ‘e’. First, features which need to be used in the classifier system are carefully selected after a thorough typographical study of global font features and previous related experiments. These features have been modeled by multivariate normal laws in order to use parameter estimation in learning. Then, the classifier system is built up on six independent schemes, each performing typeface classification using a different method. The results have shown a remarkable performance in the field of font …

Anomaly-Free Component Adaptation With Class Overriding, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Software components can be implemented and distributed as collections of classes, then adapted to the needs of specific applications by means of subclassing. Unfortunately, subclassing in collections of related classes may require re-implementation of otherwise valid classes just because they utilize outdated parent classes, a phenomenon that is referred to as the subclassing anomaly. The subclassing anomaly is a serious problem since it can void the benefits of component-based programming altogether. We propose a code adaptation language mechanism called class overriding that is intended to overcome the subclassing anomaly. Class overriding does not create new and isolated derived classes as …

Evaluating The Usability Of A Group Support System Using Co-Discovery, Keng Siau

Research Collection School Of Computing and Information Systems

Group Support Systems (GSSs) have emerged as a new type of information system to aid group decision-making. With the proliferation of such systems in organizations, evaluation of GSSs is becoming increasingly important. This paper reports the evaluation of an existing GSS. Our usability framework consists of nine dimensions: visual clarity, consistency, compatibility, informative feedback, explicitness, flexibility and control, error prevention and correction, ease of learning, and ease of use. We make use of the co-discovery method where teams of two participants perform tasks together while being observed. The study involves questionnaires and interview sessions. The strengths and weaknesses of the …

Web Usage Mining: Algorithms And Results, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

No abstract provided.

A Study In Modeling Low-Conservation Protein Superfamilies, Chang Wang, Stephen Scott, Jun Zhang, Qingping Tao, Dmitri E. Fomenko, Vadim N. Gladyshev

School of Computing: Technical Reports

We present several algorithms for identification of new proteins in superfamilies with low primary sequence conservation. The low conservation of primary sequence in protein superfamilies such as Thioredoxin-fold (Trx-fold) makes conventional methods such as hidden Markov models (HMMs) difficult to use. Therefore, we use structural properties to build our classifiers. These structural properties include secondary structure patterns as well as various properties of the residues in the protein sequences. We use this information to model proteins via hidden Markov models, support vector machines and algorithms in the multiple-instance learning model. In 20-fold jack-knife tests, some of our models performed well, …

Variable Rate Execution, Steve Goddard, Xin Liu

School of Computing: Technical Reports

We present a task model for adaptive real-time tasks in which a task’s execution rate requirements are allowed to change at any time. The model, variable rate execution (VRE), is an extension of the rate-based execution (RBE) model. We relax the constant execution rate assumption of canonical realtime task models by allowing both the worst case execution time (WCET) and the period to be variable. The VRE model also supports tasks joining and leaving the system at any time. Another advantage of the new task model is that the exact execution rate need not be known for soft real-time or …

A Load-Balancing Spare Capacity Reallocation Approach In Service-Rich Sonet Metro Mesh Networks, Lu Shen, Xi Yang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by Generic Framing Procedure (GFP) and Virtual Concatenation (VC). The core of the network tends to be a meshed architecture equipped with Multi-Service Switches (MSSs). In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider …

A Dynamic Real-Time Scheduling Algorithm For Reduced Energy Consumption, Rohini Krishnapura, Steve Goddard, Ala' Adel Qadi

School of Computing: Technical Reports

In embedded real-time systems, Dynamic Power Management (DPM) techniques have traditionally focused on reducing the dynamic power dissipation that occurs when a CMOS gate switches in a processor. Less attention has been given to processor leakage power or power consumed by I/O devices and other subsystems. I/O-based DPM techniques, however, have been extensively researched in non-real-time systems. These techniques focus on switching I/O devices to low power states based on various policies and are not applicable to real-time environments because of the non-deterministic nature of the policies. The challenge in conserving energy in embedded real-time systems is thus to reduce …

Survivable Virtual Topology Routing Under Shared Risk Link Groups In Wdm Networks, Ajay Todimala, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Network survivability is one of the most important issues in the design of optical WDM networks. In this work we study the problem of survivable routing of a virtual topology on a physical topology with Shared Risk Link Groups (SRLG). The survivable virtual topology routing problem against single-link failures in the physical topology is proved to be NP-complete in [1]. We prove that survivable virtual topology routing problem against SRLG/node failures is also NP-complete. We present an improved integer linear programming (ILP) formulation (in comparison to [1]) for computing the survivable routing under SRLG/node failures. Using an ILP solver, we …

Rerouting Schemes For Dynamic Traffic Grooming In Optical Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Traffic grooming in optical WDM mesh networks is a two-layer routing problem to effectively pack low-rate connections onto high-rate lightpaths, which, in turn, are established on wavelength links. In this work, we employ the rerouting approach to improve the network throughput under the dynamic traffic model. We propose two rerouting schemes, rerouting at lightpath level (RRAL) and rerouting at connection level (RRAC). A qualitative comparison is made between RRAL and RRAC. We also propose the critical-wavelength-avoiding one-lightpath-limited (CWA-1L) and critical-lightpath-avoiding one-connection-limited (CLA-1C) rerouting heuristics, which are based on the two rerouting schemes respectively. Simulation results show that rerouting reduces the …

Special Section On The Algorithmics Of Software Model Checking — Introductory Paper, Matthew Dwyer, Stefan Leue

School of Computing: Faculty Publications

The term “software model checking” has recently been coined to refer to a flourishing area of research in software verification – the formal, automated analysis of program source code. Software model checking is considered an important application of classical model checking, where the model of a software system is analyzed in an automated fashion for compliance with a property specification. While classical model checking assumes the existence of an abstract model of the software system to be analyzed, in software model checking the emphasis is on directly analyzing program code given in a standard programming language, such as Java or …

An Analysis Of Mcmc Sampling Methods For Estimating Weighted Sums In Winnow, Qingping Tao, Stephen Scott

School of Computing: Technical Reports

Chawla et al. introduced a way to use the Markov chain Monte Carlo method to estimate weighted sums in multiplicative weight update algorithms when the number of inputs is exponential. But their algorithm still required extensive simulation of the Markov chain in order to get accurate estimates of the weighted sums. We propose an optimized version of Chawla et al.’s algorithm, which produces exactly the same classifications while often using fewer Markov chain simulations. We also apply three other sampling techniques and empirically compare them with Chawla et al.’sMetropolis sampler to determine how effective each is in drawing good samples …

Using Source-Code Analysis To Help End-User Programmers Create Dependable Software, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Not long ago, most software was written by professional programmers, who could be presumed to have an interest in software engineering methodologies and in tools and techniques for improving software dependability. Today, however, a great deal of software is written not by professionals but by end-users, who create applications such as multimedia simulations, dynamic web pages, and spreadsheets. Applications such as these are often used to guide important decisions or aid in important tasks, and it is important that they be sufficiently dependable, but evidence shows that they frequently are not. For example, studies have shown that a large percentage …

Empirical Studies Of Test Case Prioritization In A Junit Testing Environment, Hyunsook Do, Gregg Rothermel, Alex Kinneer

School of Computing: Conference and Workshop Papers

Test case prioritization provides a way to run test cases with the highest priority earliest. Numerous empirical studies have shown that prioritization can improve a test suite’s rate of fault detection, but the extent to which these results generalize is an open question because the studies have all focused on a single procedural language, C, and a few specific types of test suites. In particular, Java and the JUnit testing framework are being used extensively in practice, and the effectiveness of prioritization techniques on Java systems tested under JUnit has not been investigated. We have therefore designed and performed a …

Evaluating Consistency Algorithms For Temporal Metric Constraints, Yang Shi, Anagh Lal, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

We study the performance of some known algorithms for solving the Simple Temporal Problem (STP) and the Temporal Constraint Satisfaction Problem (TCSP). In particular, we empirically compare the Bellman-Ford (BF) algorithm and its incremental version (incBF) by (Cesta & Oddi 1996) to the ΔSTP of (Xu & Choueiry 2003a). Among the tested algorithms, we show that ΔSTP is the most efficient for determining the consistency of an STP, and that incBF combined with the heuristics of (Xu & Choueiry 2003b) is the most efficient for solving the TCSP. We plan to improve ΔSTP by exploiting incrementality as in incBF and …