Computer Sciences Commons^™

Learning And Inferencing In User Ontology For Personalized Semantic Web Search, Xing Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

User modeling is aimed at capturing the users’ interests in a working domain, which forms the basis of providing personalized information services. In this paper, we present an ontology based user model, called user ontology, for providing personalized information service in the Semantic Web. Different from the existing approaches that only use concepts and taxonomic relations for user modeling, the proposed user ontology model utilizes concepts, taxonomic relations, and non-taxonomic relations in a given domain ontology to capture the users’ interests. As a customized view of the domain ontology, a user ontology provides a richer and more precise representation of …

Active Learning For Causal Bayesian Network Structure With Non-Symmetrical Entropy, Li G., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Causal knowledge is crucial for facilitating comprehension, diagnosis, prediction, and control in automated reasoning. Active learning in causal Bayesian networks involves interventions by manipulating specific variables, and observing the patterns of change over other variables to derive causal knowledge. In this paper, we propose a new active learning approach that supports interventions with node selection. Our method admits a node selection criterion based on non-symmetrical entropy from the current data and a stop criterion based on structure entropy of the resulting networks. We examine the technical challenges and practical issues involved. Experimental results on a set of benchmark Bayesian networks …

Continuous Obstructed Nearest Neighbor Queries In Spatial Databases, Yunjun Gao, Baihua Zheng

Research Collection School Of Computing and Information Systems

In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers the impact of obstacles on the distance between objects, which is ignored by most of spatial queries. Given a data set P, an obstacle set O, and a query line segment q in a two-dimensional space, a CONN query retrieves the nearest neighbor of each point on q according to the obstructed distance, i.e., the shortest path between them without crossing any obstacle. We formulate CONN search, analyze its unique properties, and develop …

Automatic Steering Of Behavioral Model Inference, David Lo, Leonardo Mariani, Mauro Pezze

Research Collection School Of Computing and Information Systems

Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and time-consuming, researchers defined several techniques to extract finite state models from code and traces. Automatically generating models requires much less effort than designing them, and thus eases the verification and validation of large software systems. However, when models are inferred automatically, the precision of the mining process is critical. Behavioral models mined with imprecise processes can include many spurious behaviors, and can thus compromise the results of testing and analysis techniques that use …

Creating Human-Like Autonomous Players In Real-Time First Person Shooter Computer Games, Di Wang, Budhitama Subagdja, Ah-Hwee Tan, Gee-Wah Ng

Research Collection School Of Computing and Information Systems

This paper illustrates how we create a software agent by employing FALCON, a self-organizing neural network that performs reinforcement learning, to play a well-known first person shooter computer game known as Unreal Tournament 2004. Through interacting with the game environment and its opponents, our agent learns in real-time without any human intervention. Our agent bot participated in the 2K Bot Prize competition, similar to the Turing test for intelligent agents, wherein human judges were tasked to identify whether their opponents in the game were human players or virtual agents. To perform well in the competition, an agent must act like …

Efficient Non-Interactive Range Proof, Tsz Hon Yuen, Qiong Huang, Yi Mu, Willy Susilo, Duncan S. Wong, Guomin Yang

Research Collection School Of Computing and Information Systems

We propose the first constant size non-interactive range proof which is not based on the heuristic Fiat-Shamir transformation and whose security does not rely on the random oracle assumption. The proof consists of a constant number of group elements. Compared with the most efficient constant-size range proof available in the literature, our scheme has significantly reduced the proof size. We showed that our scheme achieves perfect completeness, perfect soundness and composable zero-knowledge under a conventional number-theoretic assumption, namely the Subgroup Decision Problem.

A Sophisticated Library Search Strategy Using Folksonomies And Similarity Matching, William Lund, Yiu-Kai D. Ng, Maria Soledad Pera

Faculty Publications

Libraries, private and public, offer valuable resources to library patrons. As of today the only way to locate information archived exclusively in libraries is through their catalogs. Library patrons, however, often find it difficult to formulate a proper query, which requires using specific keywords assigned to different fields of desired library catalog records, to obtain relevant results. These improperly formulated queries often yield irrelevant results or no results at all. This negative experience in dealing with existing library systems turn library patrons away from library catalogs; instead, they rely on Web search engines to perform their searches first and upon …

Leak-Free Mediated Group Signatures, Xuhua Ding, Gene Tsudik, Shouhuai Xu

Research Collection School Of Computing and Information Systems

Group signatures are a useful cryptographic construct for privacy-preserving non-repudiable authentication, and there have been many group signature schemes. In this paper, we introduce a variant of group signatures that offers two new security properties called leak-freedom and immediate-revocation. Intuitively, the former ensures that an insider (i.e., an authorized but malicious signer) be unable to convince an outsider (e.g., a signature receiver) that she indeed signed a certain message; whereas the latter ensures that the authorization for a user to issue group signatures can be immediately revoked whenever the need arises (temporarily or permanently). These properties are not offered in …

An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim

Research Collection School Of Computing and Information Systems

In this paper, an event-centric commodity trading simulation powered by the multiagent framework is presented. The purpose of this simulation platform is for training novice traders. The simulation is progressed by announcing news events that affect various aspects of the commodity supply chain. Upon receiving these events, market agents that play the roles of producers, consumers, and speculators would adjust their views on the market and act accordingly. Their actions would be based on their roles and also their private information, and collectively they shape the market dynamics. This simulation has been effectively deployed for several training sessions. We will …

Analysis Of Partial Discharge Pulse Height Distribution Parameters, Vinay N. Nimbole

Electrical & Computer Engineering Theses & Dissertations

Partial Discharges (PD) have been traditionally used to assess the state of any insulation system and its remnant life. In earlier work, Perspex (PMMA) samples with a needle plane gap have been aged with AC voltage. Their tree growth was monitored simultaneously by collecting PD at regular intervals of time and taking microphotographs in real time without interrupting the aging voltage. The obtained partial discharge pulse amplitude records were clustered together into groups of class intervals. The sequence of PD pulse height records was quantified as a time series of shape (η), and scale (σ) parameters of a Weibull distribution. …

Feeding Phishers, Nicholas J. Lynch

Master's Theses

Phishing campaigns continue to deceive users into revealing their credentials, despite advancing spam filters, browser and toolbar warnings, and educational efforts. Recently, researchers have begun investigating how fake credentials --- or honeytokens --- can be used to detect phishing sites and protect users. BogusBiter, one such work, creates sets of honeytokens based on users' real credentials and sends them alongside real user submissions to phishing sites. In this paper, we present Phish Feeder, an anti-phishing tool which extends the BogusBiter honeytoken generation algorithm in order to create more realistic and authentic-looking credentials. Phish Feeder also employs a ``honeytoken repository'' which …

Evolution Versus Revolution As A Strategy For Thin Client Acceptance: Case Study, Paul Doyle, Mark Deegan, Ciaran O'Driscoll

Conference papers

Thin Clients have evolved from simple text based CRT dumb terminal devices in the 1960s, into a sophisticated architecture encompassing hardware, software, networks and protocols. However despite this recent evolution the Thin Client model has yet to re-emerge as a relevant design in an IT industry where Fat Clients (desktops and laptops) thrive. This paper describes two case studies performed within the Technological University Dublin School of Computing, focused on the issue of student acceptance of this technology. The first case study provides a dedicated single service Thin Client implementation, while the second case study adopts a process of coexistence …

Radio Determination On Mini-Uav Platforms: Tracking And Locating Radio Transmitters, Braden Russell Huber

Theses and Dissertations

Aircraft in the US are equipped with Emergency Locator Transmitters (ELTs). In emergency situations these beacons are activated, providing a radio signal that can be used to locate the aircraft. Recent developments in UAV technologies have enabled mini-UAVs (5-foot wingspan) to possess a high level of autonomy. Due to the small size of these aircraft they are human-packable and can be easily transported and deployed in the field. Using a custom-built Radio Direction Finder, we gathered readings from a known transmitter and used them to compare various Bayesian reasoning-based filtering algorithms. Using a custom-developed simulator, we were able to test …

Back Matter

Journal of Digital Forensics, Security and Law

No abstract provided.

Masthead

Journal of Digital Forensics, Security and Law

No abstract provided.

Front Matter

Journal of Digital Forensics, Security and Law

No abstract provided.

Triangle Network Motifs Predict Complexes By Complementing High-Error Interactomes With Structural Information, Bill Andreopoulos, Christof Winter, Dirk Labudde, Michael Schroeder

Faculty Publications, Computer Science

BackgroundA lot of high-throughput studies produce protein-protein interaction networks (PPINs) with many errors and missing information. Even for genome-wide approaches, there is often a low overlap between PPINs produced by different studies. Second-level neighbors separated by two protein-protein interactions (PPIs) were previously used for predicting protein function and finding complexes in high-error PPINs. We retrieve second level neighbors in PPINs, and complement these with structural domain-domain interactions (SDDIs) representing binding evidence on proteins, forming PPI-SDDI-PPI triangles.ResultsWe find low overlap between PPINs, SDDIs and known complexes, all well below 10%. We evaluate the overlap of PPI-SDDI-PPI triangles with known complexes from …

Synchronicity: Just-In-Time Discovery Of Lost Web Pages, Martin Klein, Michael L. Nelson

Computer Science Presentations

PDF of a powerpoint presentation from the National Digital Information Infrastructure and Preservation Program (NDIIPP) Partners Meeting, Washington D.C., June 24-25, 2009. Also available on Slideshare.

Ontology Supported Knowledge Discovery In The Field Of Human Performance And Cognition, Christopher Thomas, Pablo N. Mendes, Delroy H. Cameron, Amit P. Sheth, Krishnaprasad Thirunarayan, Cartic Ramakrishnan

Kno.e.sis Publications

No abstract provided.

Implementing The Information Technology Information Library (Itil) Framework, Lawrence Wade Lowder

Regis University Student Publications (comprehensive collection)

This project proposes the implementation of the Information Technology Infrastructure Library (ITIL) framework for a mid-sized Real Estate Investment Trust (REIT) specializing in commercial warehouses. Due to rapid growth, lack of process and lack of business visibility, the Information Technology (IT) department struggles to provide highly reliable business systems that meet the requirements for the business. The gap in business relationships results in a negative image for the IT department and causes situations where individual business groups contract directly with outsourced IT providers. After developing the IT solution, the business group contacts the internal IT department for involvement with the …

Improving The Separability Of A Reservoir Facilitates Learning Transfer, David Norton, Dan A. Ventura

Faculty Publications

We use a type of reservoir computing called the liquid state machine (LSM) to explore learning transfer. The Liquid State Machine (LSM) is a neural network model that uses a reservoir of recurrent spiking neurons as a filter for a readout function. We develop a method of training the reservoir, or liquid, that is not driven by residual error. Instead, the liquid is evaluated based on its ability to separate different classes of input into different spatial patterns of neural activity. Using this method, we train liquids on two qualitatively different types of artificial problems. Resulting liquids are shown to …

Music Recommendation And Query-By-Content Using Self-Organizing Maps, Kyle B. Dickerson, Dan A. Ventura

Faculty Publications

The ever-increasing density of computer storage devices has allowed the average user to store enormous quantities of multimedia content, and a large amount of this content is usually music. Current search techniques for musical content rely on meta-data tags which describe artist, album, year, genre, etc. Query-by-content systems allow users to search based upon the acoustical content of the songs. Recent systems have mainly depended upon textual representations of the queries and targets in order to apply common string-matching algorithms. However, these methods lose much of the information content of the song and limit the ways in which a user …

Using Timed-Release Cryptography To Mitigate The Preservation Risk Of Embargo Periods, Rabia Haq, Michael L. Nelson

Computer Science Presentations

PDF of a powerpoint presentation from the 2009 ACM/IEEE Joint Conference on Digital Libraries, Austin, Texas, June 15-19, 2009. Also available on Slideshare.

Analysis And Monetization Of Social Data, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Extending Sparql To Support Spatially And Temporally Related Information, Prateek Jain, Amit P. Sheth, Peter Z. Yeh, Kunal Verma

Kno.e.sis Publications

No abstract provided.

A Functional Framework For Content Management, Robert Emer Broadbent

Theses and Dissertations

This thesis proposes a functional framework for content management. This framework provides concepts and vocabulary for analysis and description of content management systems. The framework is derived from an analysis of eight content management systems. It describes forty-five conceptual functions organized into five functional groups. The functionality derived from the analysis of the content management systems is described using the vocabulary provided by the functional framework. Coverage of the concepts in the existing systems is verified. The utility of the framework is validated through the creation of a prototype that implements sufficient functionality to support a set of specific use …

A Context-Aware Approach Based On Self-Organizing Maps To Study Web-Users' Tendencies From Their Behaviour, Luca Longo, Stephen Barrett

Conference papers

In the context of a highly volatile web of uneven quality, the identification of content deemed valuable by end users is of paramount importance. Where page content undergoes rapid change, this issue is particularly challenging. Web browsing activity represents a unique source of context by which the value of web pages can be determined via an assessment of individual user interactions, such as scrolling, clicking, saving and so forth. Over time, this data set forms a pattern of activity which can be mined for meaning. In this paper we present an approach to web content, based on Kohonen mapping, used …

Fair Model Checking With Process Counter Abstraction, Jun Sun, Yang Liu, Abhik Roychoudhury, Shanshan Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Parameterized systems are characterized by the presence of a large (or even unbounded) number of behaviorally similar processes, and they often appear in distributed/concurrent systems. A common state space abstraction for checking parameterized systems involves not keeping track of process identifiers by grouping behaviorally similar processes. Such an abstraction, while useful, conflicts with the notion of fairness. Because process identifiers are lost in the abstraction, it is difficult to ensure fairness (in terms of progress in executions) among the processes. In this work, we study the problem of fair model checking with process counter abstraction. Even without maintaining the process …

Model Checking Linearizability Via Refinement, Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun

Research Collection School Of Computing and Information Systems

Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires checking that 1) all executions of concurrent operations be serializable, and 2) the serialized executions be correct with respect to the sequential semantics. This paper describes a new method to automatically check linearizability based on refinement relations from abstract specifications to concrete implementations. Our method avoids the often difficult task of determining linearization points in implementations, but can also take advantage of linearization points if they are given. The method exploits model checking of finite state systems specified as concurrent …

Evolutionary Solutions And Internet Applications For Algorithmic Game Theory, Christine Chung

Computer Science Faculty Publications

The growing pervasiveness of the internet has created a new class of algorithmic problems: those in which the strategic interaction of autonomous, self-interested entities must be accounted for. So motivated, we seek to (1) use game theoretic models and techniques to study practical problems in load balancing, data streams and internet traffic congestion, and (2) demonstrate the usefulness of evolutionary game theory’s adaptive model as an analytical and evaluative tool.

First we consider the evolutionary game theory concept of stochastic stability, and propose the price of stochastic anarchy as an alternative to the price of anarchy for quantifying the cost …