Computer Sciences Commons^™

Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max) have been studied extensively in the literature. However, the more realistic RCPSP/max problems — ones where durations of activities are not known with certainty – have received scant interest and hence are the main focus of the paper. Towards addressing the significant computational complexity involved in tackling RCPSP/max with durational uncertainty, we employ a local search mechanism to generate robust schedules. In this regard, we make two key contributions: (a) Introducing and studying the key properties of a new decision rule to specify start times of activities with …

Innovative Entrepreneurs Workbook, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

The workbook provides a step by step approach to identifying innovation opportunities and the key aspects of Innovation development

A Scalable And Energy-Efficient Context Monitoring Framework For Mobile Personal Sensor Networks, Seungwoo Kang, Jinwon Lee, Hyukjae Jang, Youngki Lee, Souneil Park, Junehwa Song

Research Collection School Of Computing and Information Systems

The key feature of many emerging pervasive computing applications is to proactively provide services to mobile individuals. One major challenge in providing users with proactive services lies in continuously monitoring users’ context based on numerous sensors in their PAN/BAN environments. The context monitoring in such environments imposes heavy workloads on mobile devices and sensor nodes with limited computing and battery power. We present SeeMon, a scalable and energy-efficient context monitoring framework for sensor-rich, resource-limited mobile environments. Running on a personal mobile device, SeeMon effectively performs context monitoring involving numerous sensors and applications. On top of SeeMon, multiple applications on the …

Open Innovation In Platform Competition, Mei Lin

Research Collection School Of Computing and Information Systems

We examine the competition between a proprietary platform and an open platform,where each platform holds a two-sided market consisted of app developers and users.The open platform cultivates an innovative environment by inviting public efforts todevelop the platform itself and permitting distribution of apps outside of its own appmarket; the proprietary platform restricts apps sales solely within its app market. Weuse a game theoretic model to capture this competitive phenomenon and analyze theimpact of growth of the open source community on the platform competition. We foundthat growth of the open community mitigates the platform rivalry, and balances the developernetwork sizes on …

Parameterized Algorithm For 3-Sat, Yi Gao

Theses and Dissertations - UTB/UTPA

The SAT problem is the classical NP-complete problem. In the past, many methods have been proposed for solving this problem. We investigated a new method for 3-SAT problem, which is a fixed parameterized algorithm proposed in this paper first. This method uses a fixed parameter k, where k is the number of true values in an assignment for checking whether the formula is satisfied or not. The complexity of our algorithm is O(3k ), which is exponentially independent of the number of variables. Theoretical analysis shows that when k is small, this method has smaller search space and higher speed.

Dna Staged Self-Assembly At Temperature 1, Nicholas H. Guiterrez

Theses and Dissertations - UTB/UTPA

We introduce alternate temperature 1 self-assembly constructions of an n x n square by efficiently utilizing bins and stages to achieve desirable results. These bins are able to contain a variety of tiles or supertiles, which are then mixed together in a pre-determined sequence of distinct stages. The basic 2D tile assembly model at temperature 1 uses 2n-1 tile types to construct a square. The model only utilizes one bin and occurs all in one stage. We will demonstrate how the use of bins and stages will allow for the construction of these squares more efficiently.

Handling Concept Drift In Text Data Stream Constrained By High Labelling Cost, Patrick Lindstrom, Sarah Jane Delany, Brian Mac Namee

Conference papers

In many real-world classification problems the concept being modelled is not static but rather changes over time - a situation known as concept drift. Most techniques for handling concept drift rely on the true classifications of test instances being available shortly after classification so that classifiers can be retrained to handle the drift. However, in applications where labelling instances with their true class has a high cost this is not reasonable. In this paper we present an approach for keeping a classifier up-to-date in a concept drift domain which is constrained by a high cost of labelling. We use …

Virtual Organization Clusters: Self-Provisioned Clouds On The Grid, Michael Murphy

All Dissertations

Virtual Organization Clusters (VOCs) provide a novel architecture for overlaying dedicated cluster systems on existing grid infrastructures. VOCs provide customized, homogeneous execution environments on a per-Virtual Organization basis, without the cost of physical cluster construction or the overhead of per-job containers. Administrative access and overlay network capabilities are granted to Virtual Organizations (VOs) that choose to implement VOC technology, while the system remains completely transparent to end users and non-participating VOs. Unlike alternative systems that require explicit leases, VOCs are autonomically self-provisioned according to configurable usage policies. As a grid computing architecture, VOCs are designed to be technology agnostic and …

Architecture Optimization, Training Convergence And Network Estimation Robustness Of A Fully Connected Recurrent Neural Network, Xiaoyu Wang

All Dissertations

Recurrent neural networks (RNN) have been rapidly developed in recent years. Applications of RNN can be found in system identification, optimization, image processing, pattern reorganization, classification, clustering, memory association, etc.
In this study, an optimized RNN is proposed to model nonlinear dynamical systems. A fully connected RNN is developed first which is modified from a fully forward connected neural network (FFCNN) by accommodating recurrent connections among its hidden neurons. In addition, a destructive structure optimization algorithm is applied and the extended Kalman filter (EKF) is adopted as a network's training algorithm. These two algorithms can seamlessly work together to generate …

Creating A Biomedical Ontology Indexed Search Engine To Improve The Semantic Relevance Of Retreived Medical Text, William Taylor Ii

All Dissertations

Medical Subject Headings (MeSH) is a controlled vocabulary used by the National Library of Medicine to index medical articles, abstracts, and journals contained within the MEDLINE database. Although MeSH imposes uniformity and consistency in the indexing process, it has been proven that using MeSH indices only result in a small increase in precision over free-text indexing. Moreover, studies have shown that the use of controlled vocabularies in the indexing process is not an effective method to increase semantic relevance in information retrieval.
To address the need for semantic relevance, we present an ontology-based information retrieval system for the MEDLINE collection …

Examining The Behavioral Intentions Of Older Adults As Virtual Tourists In The Context Of A Second Life Destination, Dorinda Christian

All Dissertations

ABSTRACT
Tourism opportunities are being promoted heavily on the web, yet one of the largest and most lucrative markets, older adults are least likely to use the internet. In an effort to explore barriers to and potential acceptance of technology for tourism experiences, this study followed closely ten older adults through a learning process with technology. Qualitative methodology was used to explore in-depth the experience of these older adults being exposed to online virtual world technology for the first time and exploring the process by which technology acceptance takes place. The findings indicate that online virtual world such as Second …

Naked Object File System (Nofs): A Framework To Expose An Object-Oriented Domain Model As A File System, Joseph P. Kaylor, Konstantin Läufer, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

We present Naked Objects File System (NOFS), a novel framework that allows a developer to expose a domain model as a file system by leveraging the Naked Objects design principle. NOFS allows a developer to construct a file system without having to understand or implement all details related to normal file systems development. In this paper we explore file systems frameworks and object-oriented frameworks in a historical context and present an example domain model using the framework. This paper is based on a fully-functional implementation that is distributed as free/open source software, including virtual machine images to demonstrate and study …

Global Project Management: Pedagogy For Distributed Teams, Benjamin Kok Siew Gan, Randy Weinberg, Selma Limam Mansar

Research Collection School Of Computing and Information Systems

This paper reflects on pedagogy for teaching collaborative global projects across universities in different countries. Over a period of four years, students at three universities - one in the United States, one in Singapore and one in the Middle East - enrolled in a course called "Global Project Management". In this course, coordinated across locations, students experience a global project with distant team members. We describe the course experience and student perceptions of the requisite skills, collaboration tools and challenges bearing on effective global project work.

Exploiting Query Logs For Cross-Lingual Query Suggestions., Wei Gao, Cheng Niu, Jian-Yun Nie, Ming Zhou, Kam-Fai Wong, Hsiao-Wuen Hon

Research Collection School Of Computing and Information Systems

Query suggestion aims to suggest relevant queries for a given query, which helps users better specify their information needs. Previous work on query suggestion has been limited to the same language. In this article, we extend it to cross-lingual query suggestion (CLQS): for a query in one language, we suggest similar or relevant queries in other languages. This is very important to the scenarios of cross-language information retrieval (CLIR) and other related cross-lingual applications. Instead of relying on existing query translation technologies for CLQS, we present an effective means to map the input query of one language to queries of …

A Discriminative Model Approach For Accurate Duplicate Bug Report Retrieval, Chengnian Sun, David Lo, Xiaoyin Wang, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Bug repositories are usually maintained in software projects. Testers or users submit bug reports to identify various issues with systems. Sometimes two or more bug reports correspond to the same defect. To address the problem with duplicate bug reports, a person called a triager needs to manually label these bug reports as duplicates, and link them to their "master" reports for subsequent maintenance work. However, in practice there are considerable duplicate bug reports sent daily; requesting triagers to manually label these bugs could be highly time consuming. To address this issue, recently, several techniques have be proposed using various similarity …

Exclusive Lasso For Multi-Task Feature Selection, Yang Zhou, Rong Jin, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes co-varying variables in groups, the proposed exclusive lasso regularizer models the scenario when variables in the same group compete with each other. Analysis is presented to illustrate the properties of the proposed regularizer. We present a framework of kernel-based multi-task feature selection algorithm based on the proposed exclusive lasso regularizer. An efficient algorithm is derived to solve the related optimization problem. Experiments with document categorization show that our approach outperforms state-of-the-art algorithms for multi-task feature selection.

An Exploration Of Optimization Algorithms And Heuristics For The Creation Of Encoding And Decoding Schedules In Erasure Coding, Catherine D. Schuman

Chancellor’s Honors Program Projects

No abstract provided.

A Visualization Approach For Message Passing In Parallel Computing Systems, Arunkumar Sadasivan

UNLV Theses, Dissertations, Professional Papers, and Capstones

Information Visualization has been used as an effective method in transforming textual information into a visual form that enables users to effectively communicate and understand the information. MPI (Message Passing Interface) usually involves a large amount of data, which necessitates exploring innovative ideas to visualize such data effectively.

In this thesis, we implement a graph visualization tool called MPROV to effectively visualize communication patterns of message passing using log files from MPI applications. The tool provides several interaction techniques to effectively reduce the amount of data displayed on the screen. We have also developed protocol conformance checking, which verifies the …

A Comparative Exploration Of Freebsd Bug Lifetimes, Gargi Bougie, Christoph Treude, Daniel M. Germán, Margaret-Anne Storey

Research Collection School Of Computing and Information Systems

In this paper, we explore the viability of mining the basic data provided in bug repositories to predict bug lifetimes. We follow the method of Lucas D. Panjer as described in his paper, Predicting Eclipse Bug Lifetimes. However, in place of Eclipse data, the FreeBSD bug repository is used. We compare the predictive accuracy of five different classification algorithms applied to the two data sets. In addition, we propose future work on whether there is a more informative way of classifying bugs than is considered by current bug tracking systems.

Hidra: Hierarchical Inter-Domain Routing Architecture, Bryan Clevenger

Master's Theses

As the Internet continues to expand, the global default-free zone (DFZ) forwarding table has begun to grow faster than hardware can economically keep pace with. Various policies are in place to mitigate this growth rate, but current projections indicate policy alone is inadequate. As such, a number of technical solutions have been proposed. This work builds on many of these proposed solutions, and furthers the debate surrounding the resolution to this problem. It discusses several design decisions necessary to any proposed solution, and based on these tradeoffs it proposes a Hierarchical Inter-Domain Routing Architecture - HIDRA, a comprehensive architecture with …