Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

2010

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1441 - 1470 of 1584

Full-Text Articles in Computer Sciences

A Multidimensional Strategy To Detect Polypharmacological Targets In The Absence Of Structural And Sequence Homology, Jacob D. Durrant, Rommie E. Amaro, Lei Xie, Michael D. Urbaniak, Michael A. J. Ferguson, Antti Haapalainen, Zhijun Chen, Anne Marie Di Guilmi, Frank Wunder, Philip E. Bourne, J. Andrew Mccammon Jan 2010

A Multidimensional Strategy To Detect Polypharmacological Targets In The Absence Of Structural And Sequence Homology, Jacob D. Durrant, Rommie E. Amaro, Lei Xie, Michael D. Urbaniak, Michael A. J. Ferguson, Antti Haapalainen, Zhijun Chen, Anne Marie Di Guilmi, Frank Wunder, Philip E. Bourne, J. Andrew Mccammon

Publications and Research

Conventional drug design embraces the ‘‘one gene, one drug, one disease’’ philosophy. Polypharmacology, which focuses on multi-target drugs, has emerged as a new paradigm in drug discovery. The rational design of drugs that act via polypharmacological mechanisms can produce compounds that exhibit increased therapeutic potency and against which resistance is less likely to develop. Additionally, identifying multiple protein targets is also critical for side-effect prediction. One third of potential therapeutic compounds fail in clinical trials or are later removed from the market due to unacceptable side effects often caused by off-target binding. In the current work, we introduce a multidimensional …


A New Class Of Attacks On Time Series Data Mining, Ye Zhu, Yongjian Fu, Huirong Fu Jan 2010

A New Class Of Attacks On Time Series Data Mining, Ye Zhu, Yongjian Fu, Huirong Fu

Electrical and Computer Engineering Faculty Publications

Traditional research on preserving privacy in data mining focuses on time-invariant privacy issues. With the emergence of time series data mining, traditional snapshot-based privacy issues need to be extended to be multi-dimensional with the addition of time dimension. We find current techniques to preserve privacy in data mining are not effective in preserving time-domain privacy. We present the data flow separation attack on privacy in time series data mining, which is based on blind source separation techniques from statistical signal processing. Our experiments with real data show that this attack is effective. By combining the data flow separation method and …


A Fpga-Based Architecture For Led Backlight Driving, Zhaoshi Zheng Jan 2010

A Fpga-Based Architecture For Led Backlight Driving, Zhaoshi Zheng

Electronic Theses and Dissertations

In recent years, Light-emitting Diodes (LEDs) have become a promising candidate for backlighting Liquid Crystal Displays [1] (LCDs). Compared with traditional Cold Cathode Fluorescent Lamps (CCFLs) technology, LEDs offer not only better visual quality, but also improved power efficiency. However, to fully utilized LEDs' capability requires dynamic independent control of individual LEDs, which remains as a challenging topic. A FPGA-based hardware system for LED backlight control is proposed in this work. We successfully achieve dynamic adjustment of any individual LED's intensity in each of the three color channels (Red, Green and Blue), in response to a real time incoming video …


On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan Jan 2010

On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan

Engineering Faculty Articles and Research

We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.


Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz Jan 2010

Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz

Engineering Faculty Articles and Research

We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …


Food Phone Application, Shengyu Li Jan 2010

Food Phone Application, Shengyu Li

Master's Projects

This project is about implementing a food menu application for users to search and upload food information by using a mobile phone. People sometimes may just know what food they wish to eat instead of the restaurants' name. Without knowing any restaurants' names, our food application's search only requires the name of the dish (e.g., hamburger, spaghetti, etc) in order to get the list of restaurants that serve these items and their corresponding information (e.g., location, hours, phone number, item's price, etc.). An advantage of using my food application is the system not only includes Google Map, but any information …


Open Source Analysis Of Biomedical Figures, David Shao Jan 2010

Open Source Analysis Of Biomedical Figures, David Shao

Master's Projects

With a selection of biomedical literature available for open access, a natural pairing seems to be the use of open source software to automatically analyze content, in particular, the content of gures. Considering the large number of possible tools and approaches, we choose to focus on the recognition of printed characters. As the problem of optical character recognition (OCR) under rea- sonable conditions is considered to be solved, and as open source software is fully capable of isolating the location of characters and identifying most of them accurately, we instead use OCR as an application area for the relatively recent …


Exhaustive Statistical Analysis For Detection Of Metamorphic Malware, Aditya Govindaraju Jan 2010

Exhaustive Statistical Analysis For Detection Of Metamorphic Malware, Aditya Govindaraju

Master's Projects

Malware is a serious threat to the security of the system. With the widespread use of the World Wide Web, there has been a tremendous increase in virus attacks, making computer security an essential for every personal computer. The rat-race between virus writers and detectors has led to improved viruses and detection techniques. In recent years, metamorphic malwares have posed serious challenge to anti-virus writers. Current signature based detection techniques, heuristic based techniques are not comprehensive solutions. A formidable solution to detection of metamorphic malware is void. This paper investigates the problem of malware detection, specifically metamorphic malwares. The paper …


Approximate Disassembly, Dhivyakrishnan Radhakrishnan Jan 2010

Approximate Disassembly, Dhivyakrishnan Radhakrishnan

Master's Projects

For the past two decades, computer viruses have been a constant security threat. A computer virus is a type of malware that may damage computer systems by destroying data, crashing the system, or through other malicious activity. Among the different types of viruses, metamorphic viruses are one of the most difficult to detect since such viruses change their internal structures with each mutation, making signature-based detection infeasible. Many construction kits are available that can be used to easily generate metamorphic strains of any given virus. Previous work has shown that metamorphic viruses are detectable using Hidden Markov Models (HMM). In …


Structure And Content Semantic Similarity Detection Of Extensible Markup Language Documents Using Keys, Waraporn Viyanon Jan 2010

Structure And Content Semantic Similarity Detection Of Extensible Markup Language Documents Using Keys, Waraporn Viyanon

Doctoral Dissertations

"XML (eXtensible Mark-up Language) has become the fundamental standard for efficient data management and exchange. Due to the widespread use of XML for describing and exchanging data on the web, XML-based comparison is central issues in database management and information retrieval. In fact, although many heterogeneous XML sources have similar content, they may be described using different tag names and structures. This work proposes a series of algorithms for detection of structural and content changes among XML data. The first is an algorithm called XDoI (XML Data Integration Based on Content and Structure Similarity Using Keys) that clusters XML documents …


Computational Methods For The Discovery And Analysis Of Genes And Other Functional Dna Sequences, Cyriac Kandoth Jan 2010

Computational Methods For The Discovery And Analysis Of Genes And Other Functional Dna Sequences, Cyriac Kandoth

Doctoral Dissertations

"The need for automating genome analysis is a result of the tremendous amount of genomic data. As of today, a high-throughput DNA sequencing machine can run millions of sequencing reactions in parallel, and it is becoming faster and cheaper to sequence the entire genome of an organism. Public databases containing genomic data are growing exponentially, and hence the rise in demand for intuitive automated methods of DNA analysis and subsequent gene identification. However, the complexity of gene organization makes automation a challenging task, and smart algorithm design and parallelization are necessary to perform accurate analyses in reasonable amounts of time. …


Protein Secondary Structure Prediction Using Blast And Relaxed Threshold Rule Induction From Coverings, Leong Lee Jan 2010

Protein Secondary Structure Prediction Using Blast And Relaxed Threshold Rule Induction From Coverings, Leong Lee

Doctoral Dissertations

"Protein structure prediction has always been an important research area in bioinformatics and biochemistry. Despite the recent breakthrough of combining multiple sequence alignment information and artificial intelligence algorithms to predict protein secondary structure, the Q₃ accuracy of various computational prediction methods rarely has exceeded 75%; this status has changed little since 2003 when Rost stated that "the currently best methods reach a level around 77% three-state per-residue accuracy." The application of artificial neural network methods to this problem is revolutionary in the sense that those techniques employ the homologues of proteins for training and prediction. In this dissertation, a different …


Official/ Unofficial: Information Management And Social Association, Kay Hearn Jan 2010

Official/ Unofficial: Information Management And Social Association, Kay Hearn

Research outputs pre 2011

This paper explores the debates around civil society and corporatism as ways of understanding changes in social association, including non-governmental organisations and protest groups, and information management in relation to the development of the Internet. Both concepts have been used to examine the changes that have taken place since the implementation of the Open Door Policy and more recently the development of the Internet, and have shed light on the way in which new forms of social association operate, and on their relationship to the government. However, both concepts tend to be deterministic and eductionist positions. Instead, I use a …


Redtnet: A Network Model For Strategy Games, Philip Hingston, Mike Preuss, Daniel Spierling Jan 2010

Redtnet: A Network Model For Strategy Games, Philip Hingston, Mike Preuss, Daniel Spierling

Research outputs pre 2011

In this work, we develop a simple, graph-based framework, RedTNet, for computational modeling of strategy games and simulations. The framework applies the concept of red teaming as a means by which to explore alternative strategies. We show how the model supports computer-based red teaming in several applications: realtime strategy games and critical infrastructure protection, using an evolutionary algorithm to automatically detect good and often surprising strategies.


The Significance Of Learning Style With Respect To Achievement In First Year Programming Students, Vivian Campbell, Michael Johnstone Jan 2010

The Significance Of Learning Style With Respect To Achievement In First Year Programming Students, Vivian Campbell, Michael Johnstone

Research outputs pre 2011

Study investigates the relationship between the Kolb learning style of first-year programming students and their level of achievement. The method of data collection is described and the process of hypothesis testing is explained. The students in this study were predominately converger and accommodator learning styles. Statistical tests indicated no overall difference between the results of students with different learning styles but a difference was found along Kolb's concrete-abstract axis. A number of possible impacts on teaching are discussed and suggestions made for future research.


Android Forensics: Simplifying Cell Phone Examinations, Jeff Lessard, Gary Kessler Jan 2010

Android Forensics: Simplifying Cell Phone Examinations, Jeff Lessard, Gary Kessler

Research outputs pre 2011

It is hardly appropriate to call the devices many use to receive the occasional phone call a telephone any more. The capability of these devices is growing, as is the number of people utilizing them. By the end of 2009, 46.3% of mobile phones in use in the United States were reported to be smart phones (AdMob, 2010). With the increased availability of these powerful devices, there is also a potential increase for criminals to use this technology as well. Criminals could use smart phones for a number of activities such as committing fraud over e-mail, harassment through text messages, …


The Adsl Router Forensics Process, Patryk Szewczyk Jan 2010

The Adsl Router Forensics Process, Patryk Szewczyk

Research outputs pre 2011

In 2010 the number of threats targeting ADSL routers is continually increasing. New and emergent threats have been developed to bypass authentication processes and obtain admin privileges directly to the device. As a result many malicious attempts are being made to alter the configuration data and make the device subsequently vulnerable. This paper discusses the non-invasive digital forensics approach into extracting evidence from ADSL routers. Specifically it validates an identified digital forensic process of acquisition. The paper then discusses how the approach may be utilised to extract configuration data ever after a device has been compromised to the point where …


How Do You Make Information Security User Friendly?, Andrew Jones Jan 2010

How Do You Make Information Security User Friendly?, Andrew Jones

Research outputs pre 2011

This article explores the past and the present situation, outlines a new approach, and presents conclusions.


Digital Forensics And The Issues Of Identity, Andrew Jones, Thomas Martin Jan 2010

Digital Forensics And The Issues Of Identity, Andrew Jones, Thomas Martin

Research outputs pre 2011

The issue of what we consider to be the identity of a person has become increasingly complex as we have made ever greater use of the facilities and services that have been made available by developing technologies and the Internet. In the past people normally had one identity, while in the current environment it is acceptable to maintain separate ‘identities’ for different aspects of our on-line interactions. Proving beyond a reasonable doubt that an individual that is suspected of a crime that is based on the technologies that we increasingly rely on was the actual perpetrator has always been problematic. …


A New Design For A Turing Test For Bots, Philip Hingston Jan 2010

A New Design For A Turing Test For Bots, Philip Hingston

Research outputs pre 2011

Interesting, human-like opponents add to the entertainment value of a video game, and creating such opponents is a difficult challenge for programmers. Can artificial intelligence and computational intelligence provide the means to convincingly simulate a human opponent? Or are simple programming tricks and deceptions more effective? To answer these questions, the author designed and organised a game bot programming competition, the BotPrize, in which competitors submit bots that try to pass a “Turing Test for Bots”. In this paper, we describe a new design for the competition, which will make it simpler to run, and, we hope, open up new …


Evolving Group Strategies For Ipd, Philip Hingston Jan 2010

Evolving Group Strategies For Ipd, Philip Hingston

Research outputs pre 2011

The Iterated Prisoners Dilemma (IPD) is often used to model cooperation between self-interested agents. In an earlier study, we introduced a framework using IPD to study the effects of species-level competition on the evolution of cooperative behaviour. In this paper, we extend the previous work, using co-evolutionary simulations of interactions between species of IPD-playing agents to investigate how group strategies may evolve. We find that the ability to cooperate more with agents of the same species greatly increases the ferocity of competition between species.


A Novel Subspace Outlier Detection Approach In High Dimensional Data Sets, Jinsong Leng Jan 2010

A Novel Subspace Outlier Detection Approach In High Dimensional Data Sets, Jinsong Leng

Research outputs pre 2011

Many real applications are required to detect outliers in high dimensional data sets. The major difficulty of mining outliers lies on the fact that outliers are often embedded in subspaces. No efficient methods are available in general for subspace-based outlier detection. Most existing subspacebased outlier detection methods identify outliers by searching for abnormal sparse density units in subspaces. In this paper, we present a novel approach for finding outliers in the ‘interesting’ subspaces. The interesting subspaces are strongly correlated with `good' clusters. This approach aims to group the meaningful subspaces and then identify outliers in the projected subspaces. In doing …


Autonomous Bee Colony Optimization For Multi-Objective Function, F Zeng, James Decraene, Malcolm Low, Philip Hingston, C Wentong, Z Suiping, M Chandramohan Jan 2010

Autonomous Bee Colony Optimization For Multi-Objective Function, F Zeng, James Decraene, Malcolm Low, Philip Hingston, C Wentong, Z Suiping, M Chandramohan

Research outputs pre 2011

An Autonomous Bee Colony Optimization (A-BCO) algorithm for solving multi-objective numerical problems is proposed. In contrast with previous Bee Colony algorithms, A-BCO utilizes a diversity-based performance metric to dynamically assess the archive set. This assessment is employed to adapt the bee colony structures and flying patterns. This self-adaptation feature is introduced to optimize the balance between exploration and exploitation during the search process. Moreover, the total number of search iterations is also determined/optimized by A-BCO, according to user pre-specified conditions, during the search process. We evaluate A-BCO upon numerical benchmark problems and the experimental results demonstrate the effectiveness and robustness …


A Wrapper-Based Feature Selection For Analysis Of Large Data Sets, Jinsong Leng, Craig Valli, Leisa Armstrong Jan 2010

A Wrapper-Based Feature Selection For Analysis Of Large Data Sets, Jinsong Leng, Craig Valli, Leisa Armstrong

Research outputs pre 2011

Knowledge discovery from large data sets using classic data mining techniques has been proved to be difficult due to large size in both dimension and samples. In real applications, data sets often consist of many noisy, redundant, and irrelevant features, resulting in degrading the classification accuracy and increasing the complexity exponentially. Due to the inherent nature, the analysis of the quality of data sets is difficult and very limited approaches about this issue can be found in the literature. This paper presents a novel method to investigate the quality and structure of data sets, i.e., how to analyze whether there …


Behaviour Profiling On Mobile Devices, Fudong Li, Nathan Clarke, Maria Papadaki, Paul Dowland Jan 2010

Behaviour Profiling On Mobile Devices, Fudong Li, Nathan Clarke, Maria Papadaki, Paul Dowland

Research outputs pre 2011

Over the last decade, the mobile device has become a ubiquitous tool within everyday life. Unfortunately, whilst the popularity of mobile devices has increased, a corresponding increase can also be identified in the threats being targeted towards these devices. Security countermeasures such as AV and firewalls are being deployed, however, the increasing sophistication of the attacks requires additional measures to be taken. This paper proposes a novel behaviour-based profiling technique that is able to build upon the weaknesses of current systems by developing a comprehensive multilevel approach to profiling. In support of this model, a series of experiments have been …


A Distributed And Cooperative User Authentication Framework, C.G. Hocking, Steven Furnell, Nathan Clarke, P L Reynolds Jan 2010

A Distributed And Cooperative User Authentication Framework, C.G. Hocking, Steven Furnell, Nathan Clarke, P L Reynolds

Research outputs pre 2011

As the requirement for companies and individuals to protect information and personal details comes more into focus, the implementation of security that goes beyond the ubiquitous password or Personal Identification Number (PIN) is paramount. With the ever growing number of us utilizing more than one device simultaneously, the problem and need is compounded. This paper proposes a novel approach to security that leverages the collective confidence of user identity held by the multiplicity of devices present at any given time. User identity confidence is reinforced by sharing established credentials between devices, enabling them to make informed judgments on their own …


A Novel Binarization Algorithm For Ballistics Imaging Systems, Zhihu Huang, Jinsong Leng Jan 2010

A Novel Binarization Algorithm For Ballistics Imaging Systems, Zhihu Huang, Jinsong Leng

Research outputs pre 2011

The identification of ballistics specimens from imaging systems is of paramount importance in criminal investigation. Binarization plays a key role in preprocess of recognizing cartridges in the ballistic imaging systems. Unfortunately, it is very difficult to get the satisfactory binary image using existing binary algorithms. In this paper, we utilize the global and local thresholds to enhance the image binarization. Importantly, we present a novel criterion for effectively detecting edges in the images. Comprehensive experiments have been conducted over sample ballistic images. The empirical results demonstrate the proposed method can provide a better solution than existing binary algorithms.


Ignorant Experts: Computer And Network Security Support From Internet Service Providers, Patryk Szewczyk, Craig Valli Jan 2010

Ignorant Experts: Computer And Network Security Support From Internet Service Providers, Patryk Szewczyk, Craig Valli

Research outputs pre 2011

The paper examines the advice and support provided by seven major Internet Service Providers in Australia through late 2009 and early 2010 in relation to computer and network security. Previous research has indicated that many end-users will attempt to utilise the support provided by Internet Service Providers as a simple and effective method by which to obtain key information in regards to computer security. This paper demonstrates that in many cases the individuals working at the help desk are either reluctant to provide IT security support or have insufficient skill to provide the correct information.


Analysis Of Hu's Moment Invariants On Image Scaling And Rotation, Zhihu Huang, Jinsong Leng Jan 2010

Analysis Of Hu's Moment Invariants On Image Scaling And Rotation, Zhihu Huang, Jinsong Leng

Research outputs pre 2011

Moment invariants have been widely applied to image pattern recognition in a variety of applications due to its invariant features on image translation, scaling and rotation. The moments are strictly invariant for the continuous function. However, in practical applications images are discrete. Consequently, the moment invariants may change over image geometric transformation. To address this research problem, an analysis with respect to the variation of moment invariants on image geometric transformation is presented, so as to analyze the effect of image's scaling and rotation. Finally, the guidance is also provided for minimizing the fluctuation of moment invariants.


An Analysis Of Information Security Awareness Within Home And Work Environments, Shuhaili Talib, Nathan Clarke, Steven Furnell Jan 2010

An Analysis Of Information Security Awareness Within Home And Work Environments, Shuhaili Talib, Nathan Clarke, Steven Furnell

Research outputs pre 2011

As technology such as the Internet, computers and mobile devices become ubiquitous throughout society, the need to ensure our information remains secure is imperative. Unfortunately, it has long been understood that good security cannot be achieved through technical means alone and a solid understanding of the issues and how to protect yourself is required from users. Whilst many initiatives, programs and strategies have been proposed to improve the level of information security awareness, most have been directed at organizations, with a few national programs focused upon home users. Given people's use of technology is primarily focused upon those two areas: …