Computer Sciences Commons^™

Logic Programs And Connectionist Networks, Pascal Hitzler, Steffen Holldobler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

Graphs of the single-step operator for first-order logic programs—displayed in the real plane—exhibit self-similar structures known from topological dynamics, i.e., they appear to be fractals, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide with attractors of suitably chosen iterated function systems, and conditions which allow the approximation of such graphs by iterated function systems or by fractal interpolation. Since iterated function systems can easily be encoded using recurrent radial basis function networks, we eventually obtain connectionist systems which …

Default Reasoning Over Domains And Concept Hierarchies, Pascal Hitzler

Computer Science and Engineering Faculty Publications

W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generalized to algebraic domains [1]. This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain. We extend this framework to include reasoning with default negation, giving rise to a new nonmonotonic reasoning framework on hierarchical knowledge which encompasses answer set programming with extended disjunctive logic programs. We also show that the hierarchically structured knowledge on which programming in this paradigm can be done, arises very naturally from formal concept analysis. Together, we obtain a default reasoning paradigm for conceptual …

Towards Personalised Web Intelligence, Ah-Hwee Tan, Hwee-Leng Ong, Hong Pan, Jamie Ng, Qiu-Xiang Li

Research Collection School Of Computing and Information Systems

The Flexible Organizer for Competitive Intelligence (FOCI) is a personalised web intelligence system that provides an integrated platform for gathering, organising, tracking, and disseminating competitive information on the web. FOCI builds personalised information portfolios through a novel method called User-Configurable Clustering, which allows a user to personalise his/her portfolios in terms of the content as well as the organisational structure. This paper outlines the key challenges we face in personalised information management and gives a detailed account of FOCI’s underlying personalisation mechanism. For a quantitative evaluation of the system’s performance, we propose a set of performance indices based on information …

Shared-Storage Auction Ensures Data Availability, Hady W. Lauw, Siu-Cheung Hui, Edmund M. K. Lai

Research Collection School Of Computing and Information Systems

Most current e-auction systems are based on the client-server architecture. Such centralized systems provide a single point of failure and control. In contrast, peer-to-peer systems permit distributed control and minimize individual node and link failures' impact on the system. The shared-storage-based auction model described decentralizes services among peers to share the required processing load and aggregates peers' resources for common use. The model is based on the principles of local computation at each peer, direct inter-peer communication, and a shared storage space.

Pattern Search Ranking And Selection Algorithms For Mixed-Variable Optimization Of Stochastic Systems, Todd A. Sriver

Theses and Dissertations

A new class of algorithms is introduced and analyzed for bound and linearly constrained optimization problems with stochastic objective functions and a mixture of design variable types. The generalized pattern search (GPS) class of algorithms is extended to a new problem setting in which objective function evaluations require sampling from a model of a stochastic system. The approach combines GPS with ranking and selection (R&S) statistical procedures to select new iterates. The derivative-free algorithms require only black-box simulation responses and are applicable over domains with mixed variables (continuous, discrete numeric, and discrete categorical) to include bound and linear constraints on …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 1, September 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Recommender Systems Research: A Connection-Centric Survey, Saverio Perugini, Marcos André Gonçalves, Edward A. Fox

Computer Science Faculty Publications

Recommender systems attempt to reduce information overload and retain customers by selecting a subset of items from a universal set based on user preferences. While research in recommender systems grew out of information retrieval and filtering, the topic has steadily advanced into a legitimate and challenging research area of its own. Recommender systems have traditionally been studied from a content-based filtering vs. collaborative design perspective. Recommendations, however, are not delivered within a vacuum, but rather cast within an informal community of users and social context. Therefore, ultimately all recommender systems make connections among people and thus should be surveyed from …

Pyro: A Python-Based Versatile Programming Environment For Teaching Robotics, Doug Blank, Deepak Kumar, Lisa Meeden, Holly Yanco

Computer Science Faculty Research and Scholarship

In this paper we describe a programming framework called Pyro which provides a set of abstractions that allows students to write platform­independent robot programs. This project is unique because of its focus on the pedagogical implications of teaching mobile robotics via a top­down approach. We describe the background of the project, novel abstractions created, its library of objects, and the many learning modules that have been created from which curricula for different types of courses can be drawn. Finally, we explore Pyro from the students' perspective in a case study.

Run-Time Modification Of The Class Hierarchy In A Live Java Development Environment, Joel R. Brandt, Kenneth J. Goldman

All Computer Science and Engineering Research

Class hierarchy design is central to object-oriented software development. However, it is sometimes difficult for developers to anticipate all the implications of a design until implementation is underway. To support experimentation with different designs, we extend prior work on live development environments to allow run-time modification of the class hierarchy. The result is a more fluid object-oriented development process, in which immediate feedback from the executing program can be used to guide hierarchy design. This paper presents a framework and developer support for run-time modification of class inheritance relations in JPie, a live visual programming environment for Java. Most notably, …

Creating And Detecting Doctored And Virtual Images: Implications To The Child Pornography Prevention Act, Hany Farid

Computer Science Technical Reports

The 1996 Child Pornography Prevention Act (CPPA) extended the existing federal criminal laws against child pornography to include certain types of "virtual porn". In 2002, the United States Supreme Court found that portions of the CPPA, being overly broad and restrictive, violated First Amendment rights. The Court ruled that images containing an actual minor or portions of a minor are not protected, while computer generated images depicting a fictitious "computer generated" minor are constitutionally protected. In this report I outline various forms of digital tampering, placing them in the context of this recent ruling. I also review computational techniques for …

Improving The Boosted Correlogram, Nicholas Howe, Amanda Ricketson

Computer Science: Faculty Publications

Introduced seven years ago, the correlogram is a simple statistical image descriptor that nevertheless performs strongly on image retrieval tasks. As a result it has found wide use as a component inside larger systems for content-based image and video retrieval. Yet few studies have examined potential variants of the correlogram or compared their performance to the original. This paper presents systematic experiments on the correlogram and several variants under different conditions, showing that the results may vary significantly depending on both the variant chosen and its mode of application. As expected, the experimental setup combining correlogram variants with boosting shows …

Ao2p: Ad-Hoc On-Demand Position-Based Private Routing Protocol, Xiaoxin Wu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

The Changing Usage Of A Mature Campus-Wide Wireless Network, Tristan Henderson, David Kotz, Ilya Abyzov

Dartmouth Scholarship

Wireless Local Area Networks (WLANs) are now commonplace on many academic and corporate campuses. As “Wi-Fi” technology becomes ubiquitous, it is increasingly important to understand trends in the usage of these networks. \par This paper analyzes an extensive network trace from a mature 802.11 WLAN, including more than 550 access points and 7000 users over seventeen weeks. We employ several measurement techniques, including syslogs, telephone records, SNMP polling and tcpdump packet sniffing. This is the largest WLAN study to date, and the first to look at a large, mature WLAN and consider geographic mobility. We compare this trace to a …

Heterogeneous Self-Reconfiguring Robotics, Robert Charles Fitch

Dartmouth College Ph.D Dissertations

Self-reconfiguring (SR) robots are modular systems that can autonomously change shape, or reconfigure, for increased versatility and adaptability in unknown environments. In this thesis, we investigate planning and control for systems of non-identical modules, known as heterogeneous SR robots. Although previous approaches rely on module homogeneity as a critical property, we show that the planning complexity of fundamental algorithmic problems in the heterogeneous case is equivalent to that of systems with identical modules. Primarily, we study the problem of how to plan shape changes while considering the placement of specific modules within the structure. We characterize this key challenge in …

Visual Unified Modeling Language For The Composition Of Scenarios In Modeling And Simulation Systems, Daniel E. Swayne

Theses and Dissertations

The Department of Defense uses modeling and simulation systems in many various roles, from research and training to modeling likely outcomes of command decisions. Simulation systems have been increasing in complexity with the increased capability of low-cost computer systems to support these DOD requirements. The demand for scenarios is also increasing, but the complexity of the simulation systems has caused a bottleneck in scenario development due to the limited number of individuals with knowledge of the arcane simulator languages in which these scenarios are written. This research combines the results of previous AFIT efforts in visual modeling languages to create …

Jumpstarting Phylogenetic Analysis, Mark J. Clement, Keith A. Crandall, Kevin Seppi, Quinn O. Snell

Faculty Publications

When a new epidemic strikes, it is often important to determine the relationship between the current organism and others that have been successfully treated previously. The phylogenetic analysis problem generates the most likely family tree for a group of organisms based on DNA sequence data. This process can take a prohibitively long period of time with current algorithms. If trees resulting from prior searches are used to seed the search, correct trees can be found much more quickly. This jumpstarting algorithm can generate superior phylogenetic solutions much more quickly than existing algorithms.

A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.

Gentoo Linux: The Next Generation Of Linux, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

One of the reasons scientific programmers love Linux is its less-is-more philosophy. We can configure it to be anything from a desktop replacement with USB port support to a blade in a large SMP compute engine to a powerful Web server. Although Linux's market penetration in these various sectors remains to be seen, plenty of people are pumping resources into the Linux world. In this article, I?ll explain why Gentoo Linux (www.gentoolinux.org) is a good choice for scientists, and how its structure gives us the flexibility and ease of management we need.

A Qualitative Investigation On Consumer Trust In Mobile Commerce, Keng Siau, Hong Sheng, Fiona Fui-Hoon Nah, Sidney A. Davis

Research Collection School Of Computing and Information Systems

Mobile commerce represents a significant development in e-commerce, offering accessibility, ubiquity, mobility, and localisation to users. Despite the potential of mobile commerce, trust is a major obstacle in its adoption and development. Many consumers feel uncomfortable with the idea of conducting commerce over wireless, hand-held devices. The focus of this research is to understand trust in mobile commerce and to identify factors that are important for trust development. The research builds on Siau and Shen's framework which depicts two key factors influencing trust in mobile commerce. This research not only validates and expands on the existing framework, but also provides …

A Spectroscopy Of Texts For Effective Clustering, Wenyuan Li, Wee-Keong Ng, Kok-Leong Ong, Ee Peng Lim

Research Collection School Of Computing and Information Systems

For many clustering algorithms, such as k-means, EM, and CLOPE, there is usually a requirement to set some parameters. Often, these parameters directly or indirectly control the number of clusters to return. In the presence of different data characteristics and analysis contexts, it is often difficult for the user to estimate the number of clusters in the data set. This is especially true in text collections such as Web documents, images or biological data. The fundamental question this paper addresses is: ldquoHow can we effectively estimate the natural number of clusters in a given text collection?rdquo. We propose to use …

Sclope: An Algorithm For Clustering Data Streams Of Categorical Attributes, Kok-Leong Ong, Wenyuan Li, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Clustering is a difficult problem especially when we consider the task in the context of a data stream of categorical attributes. In this paper, we propose SCLOPE, a novel algorithm based on CLOPE's intuitive observation about cluster histograms. Unlike CLOPE however, our algorithm is very fast and operates within the constraints of a data stream environment. In particular, we designed SCLOPE according to the recent CluStream framework. Our evaluation of SCLOPE shows very promising results. It consistently outperforms CLOPE in speed and scalability tests on our data sets while maintaining high cluster purity; it also supports cluster analysis that other …

A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim

Research Collection School Of Computing and Information Systems

While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to specific problems. For this reason, a software tool for rapid prototyping of algorithms would save considerable resources. This work presents a generic software framework that reduces development time through abstract classes and software reuse, and more importantly, aids design with support of user-defined strategies and hybridization of meta-heuristics. Most interestingly, we propose a novel way of redefining hybridization with the use of the "request and response" metaphor, which form an abstract concept for hybridization. Different hybridization schemes can now be formed …

Proxy Signature Scheme With Multiple Original Signers For Wireless E-Commerce Applications, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

In a proxy signature scheme, a user delegates his/her signing capability to another user in such a way that the latter can sign messages on behalf of the former. We propose an efficient and secure proxy signature scheme with multiple original signers. Our scheme is suitable for wireless electronic commerce applications, since the overheads of computation and communication are low. As an example, we present an electronic air ticket booking scheme for wireless customers.

On The Security Of The Lee-Hwang Group-Oriented Undeniable Signature Schemes, Guilin Wang, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

Undeniable signature is an intriguing concept introduced by Chaum and van Antwerpen at Crypto89. In 1999, Lee and Hwang presented two group-oriented undeniable signature schemes with a trusted center. Their schemes are natural generalizations of Chaums zero knowledge undeniable signature scheme proposed in 1990. However, we find that the Lee-Hwang schemes are insecure. In this paper, we demonstrate five effective attacks on their schemes: four of them are insider universal forgeries, in which one dishonest member (maybe colluding with a verifier) can get a valid signature on any chosen massage, and another attack allows a dishonest member to prevent honest …

Security Analysis Of Two Signcryption Schemes, Guilin Wang, Robert H. Deng, Dongjin Kwak, Sangjae Moon

Research Collection School Of Computing and Information Systems

Signcryption is a new cryptographic primitive that performs signing and encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. In this paper, we present a security analysis of two such schemes: the Huang-Chang convertible signcryption scheme, and the Kwak-Moon group signcryption scheme. Our results show that both schemes are insecure. Specifically, the Huang-Chang scheme fails to provide confidentiality, while the Kwak-Moon scheme does not satisfy the properties of unforgeability, coalition-resistance, and traceability.

A Visual Language For Animating Sketches, Richard C. Davis, James A. Landay

Research Collection School Of Computing and Information Systems

We present our research into visual languages for animating sketches. Animation is a rich mode of communication that is currently accessible to few. Simple animation systems exist, but severely restrict the types of motion that can be represented. Our field studies are demonstrating that would-be animators need to coordinate many objects moving in a variety of ways. The visual language described here allows a variety of motions to be defined with hand gestures, and gives visual feedback for coordination of events. This may open up computerized communication to users who think in dynamic visual images.

Robust Classification Of Event-Related Potential For Brain-Computer Interface, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report the implementation of a text input application (speller) based on the P300 event related potential. We obtain high accuracies by using an SVM classifier and a novel feature. These techniques enable us to maintain fast performance without sacrificing the accuracy, thus making the speller usable in an online mode. In order to further improve the usability, we perform various studies on the data with a view to minimizing the training time required. We present data collected from nine healthy subjects, along with the high accuracies (of the order of 95% or more) measured online. We show that the …

A Two-Level Framework For Coalition Formation Via Optimization And Agent Negotiation, Hoong Chuin Lau, Lei Zhang

Research Collection School Of Computing and Information Systems

We present a two-level coalition formation approach based on a centralized optimization model on the upper level, and a distributed agent-negotiation model on the lower level. This approach allows us to balance agent self-interests against a high joint utility. Experimental results show that the two-level coalition formation mechanism will increase not only the overall utility of the coalition, but also the individual utility of most participating agents. The results also suggest it is better for the agents to be partially cooperative rather than either fully cooperative or self-interested in our setting.

Modeling Usage Of An Online Research Community, Yi Zhang

Dissertations

Although online communities have been thought of as a new way for collaboration across geographic boundaries in the scientific world, they have a problem attracting people to keep visiting. The main purpose of this study is to understand how people behave in such communities, and to build and evaluate tools to stimulate engagement in a research community. These tools were designed based on a research framework of factors that influence online participation and relationship development.

There are two main objectives for people to join an online community, information sharing and interpersonal relationship development, such as friends or colleagues. The tools …

Singular Value Decomposition Of Analogs Of Gbr 12909, Anna Fiorentino

Theses

Analogs of GBR 12909 are drugs that could potentially be used to treat cocaine addiction. Singular Value Decomposition (SVD) is a multivariate analysis technique used to show relationships between the data and the variables associated with the data. The input data consists of the conformers of each analog (DM324, 728 conformers; TP250, 739 conformers) along with the eight torsional angles (Al, A2, B1-B6). A novel scaling technique was developed to address the problem of data circularity by subtracting the values of the torsional angles of the global energy minimum conformation from those of each conformer.

In SVD the original data …