Computer Sciences Commons^™

Slimsvm : A Simple Implementation Of Support Vector Machine For Analysis Of Microarray Data, Avik Karmaker

Theses

Support Vector Machine (SVM) is a supervised machine learning technique being widely used in multiple areas of biological analysis including microarray data analysis. SlimSVM has been developed with the intention of replacing OSU SVM as the classification component of GenoIterSVM in order to make it independent of other SVM packages. GenolterSVM, developed by Dr. Marc Ma, is a SVM implementation with an iterative refinement algorithm for improved accuracy of classification of genotype microarray data. SlimSVM is an object-oriented, modular, and easy-to-use implementation written in C++. It supports dot (linear) and polynomial (non-linear) kernels. The program has been tested with artificial …

An Ecological Display For Robot Teleoperation, Robert W. Ricks

Theses and Dissertations

This thesis presents an interface for effectively teleoperating robots that combines an ecological display of range and video information with quickening based on dead-reckoning prediction. This display is built by viewing range and video information from a virtual camera trailing the robot. This is rendered in 3-D by using standard hardware acceleration and 3-D graphics software. Our studies demonstrate that this interface improves performance for most people, including those that do not have much previous experience with robotics. These studies involved 32 test subjects in a simulated environment and 8 in the real world. Subjects were required to drive the …

Sb9: The Ninth Catalogue Of Spectroscopic Binary Orbits, Dimitri Pourbaix, Andrei A. Tokovinin, Alan H. Batten, Francis C. Fekel, William I. Hartkopf, Hugo Levato, Nidia I. Morrell, Guillermo Torres, Stephane Udry

Information Systems and Engineering Management Research Publications

The Ninth Catalogue of Spectroscopic Binary Orbits (http://sb9.astro.ulb.ac.be) continues the series of compilations of spectroscopic orbits carried out over the past 35 years by Batten and collaborators. As of 2004 May 1st, the new Catalogue holds orbits for 2386 systems. Some essential differences between this catalogue and its predecessors are outlined and three straightforward applications are presented: (1) completeness assessment: period distribution of SB1s and SB2s; (2) shortest periods across the H-R diagram; (3) period-eccentricity relation.

A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin

Theses and Dissertations

Computing devices are commonly equipped with multiple transport technologies such as IrDA, Bluetooth and WiFi. Transport switching technologies, such as Quality of Transport (QoT), take advantage of this heterogeneity to keep network sessions active as users move in and out of range of various transports or as the networking environment changes. During an active session, the goal is to keep the device connected over the best transport currently available. To accomplish that, this thesis introduces a two-phase decision making protocol. In phase one, intra-device prioritization, users indicate the relative importance of criteria such as speed, power, service charge, or signal …

Direct Least-Squares Ellipse Fitting, Jane Courtney, Annraoi Depaor

Conference Papers

Many biological and astronomical forms can be best represented by ellipses. While some more complex curves might represent the shape more accurately, ellipses have the advantage that they are easily parameterised and define the location, orientation and dimensions of the data more clearly. In this paper, we present a method of direct least-squares ellipse fitting by solving a generalised eigensystem. This is more efficient and more accurate than many alternative approaches to the ellipse-fitting problem such as fuzzy c-shells clustering and Hough transforms. This method was developed for human body modelling as part of a larger project to design a …

Scheduling Algorithms For Cioq Switches, Prashanth Pappu, Jonathan S. Turner

All Computer Science and Engineering Research

Most scalable switches are required to buffer packets at both their inputs and outputs to overcome the slow memory speeds of packet queues. This thesis deals with the design of scheduling algorithms for such Combined Input and Output Queued (CIOQ) switches. For crossbar based CIOQ switches, we demonstrate the underperformance of commercially used scheduling algorithms under overload traffic conditions using targeted stress tests and present ideas to develop robust, stress resistant versions of these algorithms that are still simple enough to be implemented in high speed switches. To regulate the flow of traffic in buffered, multi-stage switches, we introduce a …

The Tirac™ Development Toolkit: Purpose And Overview, Jens G. Pohl, Kym Jason Pohl, Russell Leighton, Michael Zang, Steven Gollery, Mark Porczak

Collaborative Agent Design (CAD) Research Center

This report provides an overview description of the Toolkit for Information Representation and Agent Collaboration (TIRAC™) software framework for the development of intelligent decision-support applications. More technical descriptions of TIRAC™ are contained in a companion CDM Technical Report (CDM-19-03) entitled: ‘The TIRAC™ Development Toolkit: Technical Description’.

TIRAC™ is an application development framework and toolkit for decision-support systems incorporating software agents that collaborate with each other and human users to monitor changes (i.e., events) in the state of problem situations, generate and evaluate alternative plans, and alert human users to immediate and developing resource shortages, failures, threats, and similar adverse conditions. …

Gesture Tracking And Recognition For Lecture Video Editing, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong

Research Collection School Of Computing and Information Systems

This paper presents a gesture based driven approach for video editing. Given a lecture video, we adopt novel approaches to automatically detect and synchronize its content with electronic slides. The gestures in each synchronized topic (or shot) are then tracked and recognized continuously. By registering shots and slides and recovering their transformation, the regions where the gestures take place can be known. Based on the recognized gestures and their registered positions, the information in slides can be seamlessly extracted, not only to assist video editing, but also to enhance the quality of original lecture video.

Rating Information Security Maturity, Arcot Desai Narasimhalu, Nagarajan Dayasindhu

Research Collection School Of Computing and Information Systems

Most CEOs have difficulty relating to the information security investments in their companies. This article presents a summary of a the information security maturity model that the CEOs could use to determine the desired level of investments into information security infrastructure, tools and applications.

Feedback Linearization Based Power System Stabilizer Design With Control Limits, Wenxin Liu, Ganesh K. Venayagamoorthy, Donald C. Wunsch, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In power system controls, simplified analytical models are used to represent the dynamics of power system and controller designs are not rigorous with no stability analysis. One reason is because the power systems are complex nonlinear systems which pose difficulty for analysis. This paper presents a feedback linearization based power system stabilizer design for a single machine infinite bus power system. Since practical operating conditions require the magnitude of control signal to be within certain limits, the stability of the control system under control limits is also analyzed. Simulation results under different kinds of operating conditions show that the controller …

Exposing Digital Forgeries By Detecting Duplicated Image Regions, Alin C. Popescu, Hany Farid

Computer Science Technical Reports

We describe an efficient technique that automatically detects duplicated regions in a digital image. This technique works by first applying a principal component analysis to small fixed-size image blocks to yield a reduced dimension representation. This representation is robust to minor variations in the image due to additive noise or lossy compression. Duplicated regions are then detected by lexicographically sorting all of the image blocks. We show the efficacy of this technique on credible forgeries, and quantify its robustness and sensitivity to additive noise and lossy JPEG compression.

Applications Of Mobile Computing For Fish Species At Risk Management, James Carswell, Keith Gardiner, Michela Bertolotto, Nick Mandrak

Conference papers

This paper describes the on-going development of a web-based and Mobile Environmental Management System (MEMS) prototype specifically tailored to perform context-aware queries and updating of spatial datasets. Spatially enabled computing can provide situation aware assistance to both web-based and mobile users by presenting the right information at the right time, place, and situation using context-associated knowledge. Contextassociated knowledge is assembled by combining knowledge gained about information accessed in the past with the activities planned by the user, together with other situation dependencies (e.g. location) of these activities. The MEMS datasets are provided by the Canadian Department of Fisheries and Oceans …

Enhancements To Crisp Possibilistic Reconstructability Analysis, Anas Al-Rabadi, Martin Zwick

Complex Systems Faculty Publications and Presentations

Modified Reconstructibility Analysis (MRA), a novel decomposition within the framework of set-theoretic (crisp possibilistic) Reconstructibility Analysis, is presented. It is shown that in some cases while 3-variable NPN-classified Boolean functions are not decomposable using Conventional Reconstructibility Analysis (CRA), they are decomposable using Modified Reconstructibility Analysis (MRA). Also, it is shown that whenever a decomposition of 3-variable NPN-classified Boolean functions exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. A comparison of the corresponding complexities for Ashenhurst-Curtis decompositions, and Modified Reconstructibility Analysis (MRA) is also presented. While both AC and MRA decompose some but …

Improving Throughput By Link Distance Control In A Multi-Rate Ad Hoc Network, Xiaoxin Wu, Gang Ding, Bharat Bhargava, Shan Lei

Department of Computer Science Technical Reports

No abstract provided.

Solar: Building A Context Fusion Network For Pervasive Computing, Guanling Chen

Dartmouth College Ph.D Dissertations

The complexity of developing context-aware pervasive-computing applications calls for distributed software infrastructures that assist applications to collect, aggregate, and disseminate contextual data. In this dissertation, we present a Context Fusion Network (CFN), called Solar, which is built with a scalable and self-organized service overlay. Solar is flexible and allows applications to select distributed data sources and compose them with customized data-fusion operators into a directed acyclic information flow graph. Such a graph represents how an application computes high-level understandings of its execution context from low-level sensory data. To manage application-specified operators on a set of overlay nodes called Planets, Solar …

Investigating Deception In Cyberspace, Holtjona Galanxhi, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

The use of anthropomorphic avatars provides Internet users the opportunity and freedom to present their desired identity. As cyberspace becomes a heaven for deceptive behavior, human-computer interaction research will need to be carried out to study and understand these deceptive behaviors. The objective of this research is to investigate the behavior of deceivers and truthtellers in the cyberspace environment and to examine how their intention to deceive may influence the choice of their avatars. The effect of using avatars to support communication will also be studied. This research provides insights on communication and trust issues in avatar environments.

Novel Seed Selection For Multiple Objects Detection And Tracking, Zailiang Pan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a unified approach for initializing, detecting and tracking of multiple moving objects. Object initialization is achieved through novel seed selection which is adaptively activated, depending on the quality of tracking, to select the best possible frames along the temporal direction for object detection. EM algorithm is then employed to robustly segment and detect multiple objects in a selected frame. Each detected object is represented by an appearance-based model and mean shift tracking procedure is adopted to rapidly and effectively track the target objects.

T-Spline Simplification And Local Refinement, David L. Cardon, G. Thomas Finnigan, Nicholas S. North, Thomas W. Sederberg, Jianmin Zheng, Tom Lyche

Faculty Publications

A typical NURBS surface model has a large percentage of superfluous control points that significantly interfere with the design process. This paper presents an algorithm for eliminating such superfluous control points, producing a T-spline. The algorithm can remove substantially more control points than competing methods such as B-spline wavelet decomposition. The paper also presents a new T-spline local refinement algorithm and answers two fundamental open questions on T-spline theory.

Kerf: Machine Learning To Aid Intrusion Analysts, Javed Aslam, Sergey Bratus, David Kotz, Ron Peterson, Daniela Rus

Dartmouth Scholarship

Kerf is a toolkit for post-hoc intrusion analysis of available system logs and some types of network logs. It takes the view that this process is inherently interactive and iterative: the human analyst browses the log data for apparent anomalies, and tests and revises his hypothesis of what happened. The hypothesis is alternately refined, as information that partially confirms the hypothesis is discovered, and expanded, as the analyst tries new avenues that broaden the investigation.

Design And Implementation Of A Large-Scale Context Fusion Network, Guanling Chen, Ming Li, David Kotz

Dartmouth Scholarship

In this paper we motivate a Context Fusion Network (CFN), an infrastructure model that allows context-aware applications to select distributed data sources and compose them with customized data-fusion operators into a directed acyclic information fusion graph. Such a graph represents how an application computes high-level understandings of its execution context from low-level sensory data. Multiple graphs by different applications inter-connect with each other to form a global graph. A key advantage of a CFN is re-usability, both at code-level and instance-level, facilitated by operator composition. We designed and implemented a distributed CFN system, Solar, which maps the logical operator graph …

Ica-Fx Features For Classification Of Singing Voice And Instrumental Sound, Tat-Wan Leung, Chong-Wah Ngo, Rynson W. H Lau

Research Collection School Of Computing and Information Systems

This paper describes a new approach in locating the segments of singing voice in pop musical songs. Initially, GLR distance measure is employed to temporally detect the boundaries of singing voices and instrumental sounds. ICAFX is then adopted to extract the independent components of acoustic features for SVM classification. Experimental results indicate that ICA-FX can improve the classification performance by significantly reducing the independent components that are not related to class label information.

Graph Based Image Matching, Hui Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern discovery. These problems have different levels of purpose and difficulties, as a result, often associate with different solutions. In this paper, we propose a novel approach to solve these problems under a unified framework based on graph matching. We first split the images into small blocks and represent each block as a node in a bipartite graph. A maximum weighted bipartite graph matching algorithm is then employed in an iterative way to find the …

Sa&D And Database: Should We Be Researching What We Are Teaching?, Jeffrey B. Parson, Akhilesh. Bajaj, Dinesh Batra, Alan Hevner, Keng Siau

Research Collection School Of Computing and Information Systems

The panel will examine the reasons for the mismatch between SA&D and database teaching and research. The implication of this mismatch on the MIS academic and practitioner communities will also be discussed and debated.

Theoretical And Practical Complexity Of Uml, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

Systems have become increasingly complex, and as a result development methods have become more complex as well. The unified modeling language (UML) has been criticized for the often cited and sometimes over-whelming complexity it presents to its users, and those seeking to learn to use it. Using Rossi and Brinkkemper’s (1996) complexity metrics, Siau and Cao (2001) completed a complexity analysis of UML and 36 other modeling techniques, finding that UML is indeed more complex than other techniques. Siau, Erickson and Lee (2002) proposed that Rossi and Brinkkemper’s metrics present the theoretical maximum complexity, known as theoretical complexity. This is …

Ltam: A Location-Temporal Authorization Model, Hai Yu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

This paper describes an authorization model for specifying access privileges of users who make requests to access a set of locations in a building or more generally a physical or virtual infrastructure. In the model, primitive locations can be grouped into composite locations and the connectivities among locations are represented in a multilevel location graph. Authorizations are defined with temporal constraints on the time to enter and leave a location and constraints on the number of times users can access a location. Access control enforcement is conducted by monitoring user movement and checking access requests against an authorization database. The …

Group-Based Relevance Feedback With Support Vector Machine Ensembles, Steven C. H. Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Support vector machines (SVMs) have become one of the most promising techniques for relevance feedback in content-based image retrieval (CBIR). Typical SVM-based relevance feedback techniquessimply apply the strict binary classifications: positive (relevant) class and negative (irrelevant) class. However, in a real-world relevance feedback task, it is more reasonable and practical to assume the data come from multiple positive classes and one negative class. In order to formulate an effective relevance feedback algorithm, we propose a novel group-based relevance feedback scheme constructed with the SVM ensembles technique. Experiments are conducted to evaluate the performance of our proposed scheme and the traditional …

Deformable Geometry Model Matching By Topological And Geometric Signatures, Kwok-Leung Tam, Rynson W.H. Law, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

In this paper, we present a novel method for efficient 3D model comparison. The method matches highly deformed models by comparing topological and geometric features. First, we propose “Bi-directional LSD analysis” to locate reliable topological points and rings. Second, based on these points and rings, a set of bounded regions are extracted as topological features. Third, for each bounded region, we capture additional spatial location, curvature and area distribution as geometric data. Fourth, to model the topological importance of each bounded region, we capture its effective area as weight. By using “Earth Mover Distance” as a distance measure between two …

Values Of Mobile Technology In Education, Fiona Fui-Hoon Nah, Keng Siau, H. Sheng

Research Collection School Of Computing and Information Systems

Mobile technology shows promise in supporting and improving education and its delivery. Coupled with the use of mobile devices and software/hardware solutions that make it possible to access educational content, students can be exposed to new educational experience. Applications of mobile technology in education can provide many benefits including greater flexibility, more available education resources, as well as greater convenience, accessibility and responsiveness. As a new phenomenon that will be widely used and adopted in the years to come, the values of mobile technology in education should be better understood and researched. This research outlines our empirical study to examine …

Exploiting Information Theory For Adaptive Mobility And Resource Management In Future Cellular Networks, Abhishek Roy, Sajal K. Das, Archan Misra

Research Collection School Of Computing and Information Systems

We utilize tools from information theory to develop adaptive algorithms for two key problems in cellular networks: location tracking and resource management. The use of information theory is motivated by the fundamental observation that overheads in many aspects of mobile computing can be traced to the randomness or uncertainty in an individual user's movement behavior. We present a model-independent information-theoretic approach for estimating and managing this uncertainty, and relate it to the entropy or information content of the user's movement process. Information-theoretic mobility management algorithms are very simple, yet reduce overhead by ∼80 percent in simulated scenarios by optimally adapting …

Packet-Loss Resilient Coding Scheme With Only Xor Operations, Gui Liang Feng, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Application of forward error correction to recover lost packets in higher layers of communication networks is receiving increasing attention. Most of the previous proposals for packet loss recovery use symbol-oriented Reed-Solomon codes operating in symbol erasure-correction mode. A Reed-Solomon code is optimal in the sense that it is maximal distance separable; however, the decoding speed of a Reed-Solomon code is slow since it involves operations over GF(2m) using lookup tables. A packet-oriented (n, k)/(m, l) packet-loss resilient code based on an (n, k) Reed-Solomon code over GF(2m) is given. The code accepts k-packet information sequences and encodes them into n-packet …