Computer Sciences Commons^™

An Investigation Of Microenterprise Capability-Building Via Access And Use Of Technology, Travis Godwin Good

Student Work

Micro-enterprises (businesses with one to five employees) lie at the heart of the American economy but are not well-researched. It is believed that technology adoption has the potential to spark strong growth among micro-enterprises, but current technology adoption models are tailored for large businesses and do not consider the human, social, and economic inputs peculiar to micro-enterprises. This research investigates how access to, and use of technology may lead micro enterprises to build capabilities that will help them increase their net income and hire more employees. Framed as a specification of Amartya Sen’s capability perspective, this research seeks, through a …

Multi-Robot Coalition Formation For Distributed Area Coverage, Ke Cheng

Student Work

The problem of distributed area coverage using multiple mobile robots is an important problem in distributed multi-robot sytems. Multi-robot coverage is encountered in many real world applications, including unmanned search & rescue, aerial reconnaissance, robotic demining, inspection of engineering structures, and automatic lawn mowing. To achieve optimal coverage, robots should move in an efficient manner and reduce repeated coverage of the same region that optimizes a certain performance metric such as the amount of time or energy expended by the robots. This dissertation especially focuses on using mini-robots with limited capabilities, such as low speed of the CPU and limited …

Wopr In Search Of Better Strategies For Board Games, Ben Horner

Student Work

Board games have been challenging intellects and capturing imaginations for more than five thousand years. Researchers have been producing artificially intelligent players for more than fifty. Common artificial intelligence techniques applied to board games use alpha-beta pruning tree search techniques. This paper supplies a frame- work that accommodates many of the diverse aspects of board games, as well as exploring several alternatives for searching out ever better strategies. Techniques examined include optimizing artificial neural networks using genetic algorithms and backpropagation.

Applications Of Hidden Markov Models In Microarray Gene Expression Data, Huimin Geng, Xutao Deng, Hesham Ali

Computer Science Faculty Publications

Hidden Markov models (HMMs) are well developed statistical models to capture hidden information from observable sequential symbols. They were first used in speech recognition in 1970s and have been successfully applied to the analysis of biological sequences since late 1980s as in finding protein secondary structure, CpG islands and families of related DNA or protein sequences [1]. In a HMM, the system being modeled is assumed to be a Markov process with unknown parameters, and the challenge is to determine the hidden parameters from the observable parameters. In this chapter, we described two applications using HMMs to predict gene functions …

An Architecture For Global Ubiquitous Sensing, Alfredo J. Perez

Computer Science Faculty Publications

A new class of wireless sensor networks has recently appeared due to the pervasiness of cellular phones with embedded sensors, mobile Internet connectivity, and location technologies. This mobile wireless sensor network has the potential to address large-scale societal problems and improve the people’s quality of life in a better, faster and less expensive fashion than current solutions based on static wireless sensor networks. Ubiquitous Sensing is the umbrella term used in this dissertation that encompasses location-based services, human-centric, and participatory sensing applications. At the same time, ubiquitous sensing applications are bringing a new series of challenging problems. This dissertation proposes …

Semantic Relevance Analysis Of Subject-Predicate-Object (Spo) Triples, Ranjana Kumar

Student Work

The goal of this thesis is to explore and integrate several existing measurements for ranking the relevance of a set of subject-predicate-object (SPO) triples to a given concept. As we are inundated with information from multiple sources on the World-Wide-Web, SPO similarity measures play a progressively important role in information extraction, information retrieval, document clustering and ontology learning. This thesis is applied in the Cyber Security Domain for identifying and understanding the factors and elements of sociopolitical events relevant to cyberattacks. Our efforts are towards developing an algorithm that begins with an analysis of news articles by taking into account …

Dynamic Reconfiguration In Modular Self-Reconfigurable Robots Using Multi-Agent Coalition Games, Zachary Ramaekers

Student Work

In this thesis, we consider the problem of autonomous self-reconfiguration by modular self-reconfigurable robots (MSRs). MSRs are composed of small units or modules that can be dynamically configured to form different structures, such as a lattice or a chain. The main problem in maneuvering MSRs is to enable them to autonomously reconfigure their structure depending on the operational conditions in the environment. We first discuss limitations of previous approaches to solve the MSR self-reconfiguration problem. We will then present a novel framework that uses a layered architecture comprising a conventional gait table-based maneuver to move the robot in a fixed …

Abstract Answer Set Solvers With Backjumping And Learning, Yuliya Lierler

Computer Science Faculty Publications

Nieuwenhuis et al. (2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937977 showed how to describe enhancements of the Davis–Putnam–Logemann–Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for several algorithms that generate answer sets for logic programs: SMODELS, SMODELS_cc, asp-sat with Learning (CMODELS), and a newly designed and implemented algorithm sup. This approach to describe answer set solvers makes it easier to prove their correctness, to compare them, and to design new systems.

An Empirical Investigation Of Virtual World Projects And Metaverse Technology Capabilities, Dawn Owens, Alanah Davis, Deepak Khazanchi, Ilze Zigurs

Information Systems and Quantitative Analysis Faculty Publications

Metaverses are immersive three-dimensional virtual worlds (VWs) where people interact with each other and their environment, using the metaphor of the real world but without its physical limitations. Unique technology capabilities of metaverses have the potential to enhance the conduct of virtual projects, but little is known about virtual worlds in this context. Virtual project teams struggle in meeting stated project outcomes due to challenges related to communication, shared understanding, and coordination. One way to address these challenges is to consider the use of emerging technologies, such as metaverses, to minimize the impact on virtual project teams. Applying a theoretical …

Asp-Based Problem Solving With Cutting-Edge Tools, Marcello Balduccini, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

In the development of practical applications of answer set programming (ASP), encodings that use well-established solvers such as CLASP and DLV are sometimes affected by scalability issues. In those situations, one can resort to more sophisticated ASP tools exploiting, for instance, incremental and constraint ASP. However, today there is no specific methodology for the selection or use of such tools. In this paper we describe how we used such cutting-edge ASP tools on challenging problems from the Third Answer Set Programming Competition, and outline the methodology we followed. We view this paper as a first step in the development of …

Parsing Combinatory Categorial Grammar With Answer Set Programming: Preliminary Report, Yuliya Lierler, Peter Schüller

Computer Science Faculty Proceedings & Presentations

Combinatory categorial grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories to parse a sentence. In this work we propose and implement a new approach to CCG parsing that relies on a prominent knowledge representation formalism, answer set programming (ASP) — a declarative programming paradigm. We formulate the task of CCG parsing as a planning problem and use an ASP computational tool to compute solutions that correspond to valid parses. Compared to other approaches, there is no need to …

A Parallel Graph Sampling Algorithm For Analyzing Gene Correlation Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Publications

Effcient analysis of complex networks is often a challenging task due to its large size and the noise inherent in the system. One popular method of overcoming this problem is through graph sampling, that is extracting a representative subgraph from the larger network. The accuracy of the sample is validated by comparing the combinatorial properties of the subgraph and the original network. However, there has been little study in comparing networks based on the applications that they represent. Furthermore, sampling methods are generally applied agnostically, without mapping to the requirements of the underlying analysis. In this paper,we introduce a parallel …

Termination Of Grounding Is Not Preserved By Strongly Equivalent Transformations, Yuliya Lierler, Vladimir Lifschitz

Computer Science Faculty Proceedings & Presentations

The operation of a typical answer set solver begins with grounding—replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the process of grounding may not terminate. In this note we give an example of a pair of consistent, strongly equivalent programs such that one of them can be grounded by LPARSE, DLV, and gringo, and the other cannot.

Weighted-Sequence Problem: Asp Vs Casp And Declarative Vs Problem-Oriented Solving, Yuliya Lierler, Shaden Smith, Miroslaw Truszczyński, Alex Westlund

Computer Science Faculty Proceedings & Presentations

Search problems with large variable domains pose a challenge to current answer-set programming (ASP) systems as large variable domains make grounding take a long time, and lead to large ground theories that may make solving infeasible. To circumvent the “grounding bottleneck” researchers proposed to integrate constraint solving techniques with ASP in an approach called constraint ASP (CASP). In the paper, we evaluate an ASP system CLINGO and a CASP system CLINGCON on a handcrafted problem involving large integer domains that is patterned after the database task of determining the optimal join order. We find that search methods used by CLINGO …

A Transition System For Ac Language Algorithms, Yuliya Lierler, Yaunlin Zhang

Computer Science Faculty Proceedings & Presentations

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. In a similar vein, Gebser et al. (2009) proposed a CLINGCON language integrating ASP and finite domain constraints. A distinguishing feature of these languages is their capacity to allow new efficient inference algorithms that combine traditional ASP procedures and other efficient methods in constraint programming. In this paper we show that a transition system introduced by Nieuwenhuis et al. (2006) can be extended to model the “hybrid” ACSOLVER algorithm, by Mellarkod et al., designed for processing a …

Evaluation Of Essential Genes In Correlation Networks Using Measures Of Centrality, Kathryn Dempsey Cooper, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Correlation networks are emerging as powerful tools for modeling relationships in high-throughput data such as gene expression. Other types of biological networks, such as protein-protein interaction networks, are popular targets of study in network theory, and previous analysis has revealed that network structures identified using graph theoretic techniques often relate to certain biological functions. Structures such as highly connected nodes and groups of nodes have been found to correspond to essential genes and protein complexes, respectively. The correlation network, which measures the level of co-variation of gene expression levels, shares some structural properties with other types of biological networks. We …

A Novel Correlation Networks Approach For The Identification Of Gene Targets, Kathryn Dempsey Cooper, Stephen Bonasera, Dhundy Raj Bastola, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Correlation networks are emerging as a powerful tool for modeling temporal mechanisms within the cell. Particularly useful in examining coexpression within microarray data, studies have determined that correlation networks follow a power law degree distribution and thus manifest properties such as the existence of “hub” nodes and semicliques that potentially correspond to critical cellular structures. Difficulty lies in filtering coincidental relationships from causative structures in these large, noise-heavy networks. As such, computational expenses and algorithm availability limit accurate comparison, making it difficult to identify changes between networks. In this vein, we present our work identifying temporal relationships from microarray data …

A Noise Reducing Sampling Approach For Uncovering Critical Properties In Large Scale Biological Networks, Karthik Duraisamy, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Proceedings & Presentations

A correlation network is a graph-based representation of relationships among genes or gene products, such as proteins. The advent of high-throughput bioinformatics has resulted in the generation of volumes of data that require sophisticated in silico models, such as the correlation network, for in-depth analysis. Each element in our network represents expression levels of multiple samples of one gene and an edge connecting two nodes reflects the correlation level between the two corresponding genes in the network according to the Pearson correlation coefficient. Biological networks made in this manner are generally found to adhere to a scale-free structural nature, that …

An Evaluation Of The Usability Of A Computerized Decision Support System For Nursing Homes, M. Fossum, M. Ehnfors, Ann L. Fruhling, A. Ehrenberg

Interdisciplinary Informatics Faculty Publications

Background: Computerized decision support systems (CDSSs) have the potential to significantly improve the quality of nursing care of older people by enhancing the decision making of nursing personnel. Despite this potential, health care organizations have been slow to incorporate CDSSs into nursing home practices.

Objective: This study describes facilitators and barriers that impact the ability of nursing personnel to effectively use a clinical CDSS for planning and treating pressure ulcers (PUs) and malnutrition and for following the suggested risk assessment guidelines for the care of nursing home residents.

Methods: We employed a qualitative descriptive design using varied …

A Comparison Of Forensic Evidence Recovery: Techniques For A Windows Mobile Smart Phone, George Grispos, Tim Storer, William Bradley Glisson

Interdisciplinary Informatics Faculty Publications

Acquisition, decoding and presentation of information from mobile devices is complex and challenging. Device memory is usually integrated into the device, making isolation prior to recovery difficult. In addition, manufacturers have adopted a variety of file systems and formats complicating decoding and presentation.

A variety of tools and methods have been developed (both commercially and in the open source community) to assist mobile forensics investigators. However, it is unclear to what extent these tools can present a complete view of the information held on a mobile device, or the extent the results produced by different tools are consistent.

This paper …

Trends In Phishing Attacks: Suggestions For Future Research, Ryan M. Schuetzler

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

Deception in computer-mediated communication is a widespread phenomenon. Cyber criminals are exploiting technological mediums to communicate with potential targets as these channels reduce both the deception cues and the risk of detection itself. A prevalent deception-based attack in computer-mediated communication is phishing. Prior phishing research has addressed the “bait” and “hook” components of phishing attacks, the human-computer interaction that takes place as users judge the veracity of phishing emails and websites, and the development of technologies that can aid users in identifying and rejecting these attacks. Despite the extant research on this topic, phishing attacks continue to be successful as …

Role Of Cloud Computing Interventions For Micro-Enterprise Growth: Implications For Global Development, Sajda Qureshi, Mehruz Kamal

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

While the majority of businesses around the world are micro-enterprises, they are the most vulnerable and are often run by people with limited resources, and skills to be able to avail the benefits of Information and Communication Technologies (ICTs). These are a form of small business which employs between 1-5 people and face challenges of limited resources, skills and ability to grow. When they do adopt IT their potential to survive and grow increases as they are then able to participate in the global economy. The challenge for global development lies in enabling these micro-enterprises to adopt the appropriate IT …

Overview And Guidance On Agile Development In Large Organizations, Jordan B. Barlow, Justin Scott Giboney, Mark Jeffrey Keith, David W. Wilson, Ryan Schuetzler, Paul Benjamin Lowry, Anthony Vance

Information Systems and Quantitative Analysis Faculty Publications

A continual debate surrounds the effectiveness of agile software development practices. Some organizations adopt agile practices to become more competitive, improve processes, and reduce costs. Other organizations are skeptical about whether agile development is beneficial. Large organizations face an additional challenge in integrating agile practices with existing standards and business processes. To examine the effects of agile development practices in large organizations, we review and integrate scientific literature and theory on agile software development. We further organize our theory and observations into a framework with guidelines for large organizations considering agile methodologies. Based on this framework, we present recommendations that …

Rigorous Assessment And Integration Of The Sequence And Structure Based Features To Predict Hot Spots, Ruoying Chen, Wenjing Chen, Sixiao Yang, Di Wu, Yong Wang, Yingjie Tian, Yong Shi

Information Systems and Quantitative Analysis Faculty Publications

Background

Systematic mutagenesis studies have shown that only a few interface residues termed hot spots contribute significantly to the binding free energy of protein-protein interactions. Therefore, hot spots prediction becomes increasingly important for well understanding the essence of proteins interactions and helping narrow down the search space for drug design. Currently many computational methods have been developed by proposing different features. However comparative assessment of these features and furthermore effective and accurate methods are still in pressing need.

Results

In this study, we first comprehensively collect the features to discriminate hot spots and non-hot spots and analyze their distributions. We …

A Genetic Algorithm For Multiobjective Hard Scheduling Optimization, Elías Niño, Carlos Ardila, Alfredo J. Perez, Yexid Donoso

Computer Science Faculty Publications

This paper proposes a genetic algorithm for multiobjective scheduling optimization based in the object oriented design with constrains on delivery times, process precedence and resource availability. Initially, the programming algorithm (PA) was designed and implemented, taking into account all constraints mentioned. This algorithm’s main objective is, given a sequence of production orders, products and processes, calculate its total programming cost and time.
Once the programming algorithm was defined, the genetic algorithm (GA) was developed for minimizing two objectives: delivery times and total programming cost. The stages defined for this algorithm were: selection, crossover and mutation. During the first stage, the …

A Type Analysis Of Rewrite Strategies, Azamat Mametjanov

Student Work

Rewrite strategies provide an algorithmic rewriting of terms using strategic compositions of rewrite rules. Due to the programmability of rewrites, errors are often made due to incorrect compositions of rewrites or incorrect application of rewrites to a term within a strategic rewriting program. In practical applications of strategic rewriting, testing and debugging becomes substantially time-intensive for large programs applied to large inputs derived from large term grammars. In essence, determining which rewrite in what position in a term did or did not re comes down to logging, tracing and/or di -like comparison of inputs to outputs. In this thesis, we …

Constructive Ontology Engineering, William L. Sousan

Student Work

The proliferation of the Semantic Web depends on ontologies for knowledge sharing, semantic annotation, data fusion, and descriptions of data for machine interpretation. However, ontologies are difficult to create and maintain. In addition, their structure and content may vary depending on the application and domain. Several methods described in literature have been used in creating ontologies from various data sources such as structured data in databases or unstructured text found in text documents or HTML documents. Various data mining techniques, natural language processing methods, syntactical analysis, machine learning methods, and other techniques have been used in building ontologies with automated …

Developing A Conceptual Model Of Virtual Organizations For Citizen Science, Andrea Wiggins, Kevin Crowston

Information Systems and Quantitative Analysis Faculty Publications

This paper develops an organisation design-oriented conceptual model of scientific knowledge production through citizen science virtual organisations. Citizen science is a form of organisation design for collaborative scientific research involving scientists and volunteers, for which internet-based modes of participation enable massive virtual collaboration by thousands of members of the public. The conceptual model provides an example of a theory development process and discusses its application to an exploratory study. The paper contributes a multi-level process model for organising investigation into the impact of design on this form of scientific knowledge production.

Investigating Capabilities Associated With Ict Access And Use In Latino Micro-Enterprises, Travis Good, Luis Flores Morales, Sajda Qureshi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

While the process by which Information Technology enables growth in medium and large enterprises has been wellresearched, the corresponding processes in micro-enterprises are poorly understood. In fact, such micro-enterprises lie at the heart of many economies. This insight is important as information technology enables businesses to connect with each other through knowledge networking to carry out their basic business operations. There is thus a need to build our understanding of how micro-enterprises access and use technology in order to be able to assess the benefits they derive from ICT adoption. Following an analysis of two case studies of Latino micro-enterprises …

A Design Science Based Evaluation Framework For Patterns, Stacie Clarke Petter, Deepak Khazanchi, John D. Murphy

Information Systems and Quantitative Analysis Faculty Publications

Patterns were originally developed in the field of architecture as a mechanism for communicating good solutions to recurring classes of problems. Since then, many researchers and practitioners have created patterns to describe effective solutions to problems associated with disparate areas such as virtual project management, human-computer interaction, software development and engineering, and design science research. We believe that the development of patterns is a design science activity in which an artifact (i.e., a pattern) is created to communicate about and improve upon the current state-of-practice. Design science research has two critical components, creation and evaluation of an artifact. While many …