Computer Sciences Commons^™

Using Non-Additive Measure For Optimization-Based Nonlinear Classification, Nian Yan, Zhengxin Chen, Yong Shi, Zhenyuan Wang, Guimin Huang

Computer Science Faculty Publications

Over the past few decades, numerous optimization-based methods have been proposed for solving the classification problem in data mining. Classic optimization-based methods do not consider attribute interactions toward classification. Thus, a novel learning machine is needed to provide a better understanding on the nature of classification when the interaction among contributions from various attributes cannot be ignored. The interactions can be described by a non-additive measure while the Choquet integral can serve as the mathematical tool to aggregate the values of attributes and the corresponding values of a non-additive measure. As a main part of this research, a new nonlinear …

A Tarskian Informal Semantics For Answer Set Programming, Marc Denecker, Yuliya Lierler, Miroslaw Truszczyński, Joost Vennekens

Computer Science Faculty Proceedings & Presentations

In their seminal papers on stable model semantics, Gelfond and Lifschitz introduced ASP by casting programs as epistemic theories, in which rules represent statements about the knowledge of a rational agent. To the best of our knowledge, theirs is still the only published systematic account of the intuitive meaning of rules and programs under the stable semantics. In current ASP practice, however, we find numerous applications in which rational agents no longer seem to play any role. Therefore, we propose here an alternative explanation of the intuitive meaning of ASP programs, in which they are not viewed as statements about …

On The Relation Of Constraint Answer Set Programming Languages And Algorithms, Yuliya Lierler

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. Similarly, Gebser et al. (2009) proposed a CLINGCON language integrating ASP and finite domain constraints. These languages allow new efficient inference algorithms that combine traditional ASP procedures and other methods in constraint programming. In this paper we show that a transition system introduced by Nieuwenhuis et al. (2006) to model SAT solvers can be extended to model the “hybrid” ACSOLVER algorithm by Mellarkod et al. developed for simple AC programs and the CLINGCON algorithm by Gebser et …

Surviving Solver Sensitivity: An Asp Practitioner’S Guide, Bryan Silverthorn, Yuliya Lierler, Marius Schneider

Computer Science Faculty Proceedings & Presentations

Answer set programming (ASP) is a declarative programming formalism that allows a practitioner to specify a problem without describing an algorithm for solving it. In ASP, the tools for processing problem specifications are called answer set solvers. Because specified problems are often NP complete, these systems often require significant computational effort to succeed. Furthermore, they offer different heuristics, expose numerous parameters, and their running time is sensitive to the configuration used. Portfolio solvers and automatic algorithm configuration systems are recent attempts to automate the problem of manual parameter tuning, and to mitigate the burden of identifying the right solver configuration. …

The Development Of Parallel Adaptive Sampling Algorithms For Analyzing Biological Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Sanjukta Bhowmick, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

The availability of biological data in massive scales continues to represent unlimited opportunities as well as great challenges in bioinformatics research. Developing innovative data mining techniques and efficient parallel computational methods to implement them will be crucial in extracting useful knowledge from this raw unprocessed data, such as in discovering significant cellular subsystems from gene correlation networks. In this paper, we present a scalable combinatorial sampling technique, based on identifying maximum chordal subgraphs, that reduces noise from biological correlation networks, thereby making it possible to find biologically relevant clusters from the filtered network. We show how selecting the appropriate filter …

A Novel Multithreaded Algorithm For Extracting Maximal Chordal Subgraphs, Mahantesh Halappanavar, John Feo, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Proceedings & Presentations

Chordal graphs are triangulated graphs where any cycle larger than three is bisected by a chord. Many combinatorial optimization problems such as computing the size of the maximum clique and the chromatic number are NP-hard on general graphs but have polynomial time solutions on chordal graphs. In this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph. We develop an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it per iteration and implement our algorithm on two different multithreaded architectures - Cray …

Calm Before The Storm: The Challenges Of Cloud Computing In Digital Forensics, George Grispos, Tim Storer, William Bradley Glisson

Interdisciplinary Informatics Faculty Publications

Cloud computing is a rapidly evolving information technology (IT) phenomenon. Rather than procure, deploy and manage a physical IT infrastructure to host their software applications, organizations are increasingly deploying their infrastructure into remote, virtualized environments, often hosted and managed by third parties. This development has significant implications for digital forensic investigators, equipment vendors, law enforcement, as well as corporate compliance and audit departments (among others). Much of digital forensic practice assumes careful control and management of IT assets (particularly data storage) during the conduct of an investigation. This paper summarises the key aspects of cloud computing and analyses how established …

Can Information And Communication Technologies Lead To Community Capital? An Analysis Of Development, Dave Kocsis, Sajda Qureshi, Jie Xiong

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

While it is widely accepted that the increasing interconnectedness of the world economy has been fueled by the innovative uses of Information and Communication Technologies (ICTs), little attention has been paid to the increasing inequalities within developed and developing countries. These inequalities manifest themselves in the form of communities in which incomes are considerably below the rest of the country and there is a rise in poverty. This paper investigates this trend by taking a community capital perspective to investigate how ICTs may or may not enable businesses to grow. As micro-enterprises are seen to contribute to the growth of …

Public Participation In Scientific Research: A Framework For Deliberate Design, Jennifer L. Shirk, Heidi L. Ballard, Candie C. Wilderman, Tina Phillips, Andrea Wiggins, Rebecca Jordan, Ellen Mccallie, Matthew Minarchek, Bruce V. Lewenstein, Marianne E. Krasny, Rick Bonney

Information Systems and Quantitative Analysis Faculty Publications

Members of the public participate in scientific research in many different contexts, stemming from traditions as varied as participatory action research and citizen science. Particularly in conservation and natural resource management contexts, where research often addresses complex social–ecological questions, the emphasis on and nature of this participation can significantly affect both the way that projects are designed and the outcomes that projects achieve. We review and integrate recent work in these and other fields, which has converged such that we propose the term public participation in scientific research (PPSR) to discuss initiatives from diverse fields and traditions. We describe three …

Towards Evolving More Brain-Like Artificial Neural Networks, Sebastian Risi

Electronic Theses and Dissertations

An ambitious long-term goal for neuroevolution, which studies how artificial evolutionary processes can be driven to produce brain-like structures, is to evolve neurocontrollers with a high density of neurons and connections that can adapt and learn from past experience. Yet while neuroevolution has produced successful results in a variety of domains, the scale of natural brains remains far beyond reach. In this dissertation two extensions to the recently introduced Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach are presented that are a step towards more brain-like artificial neural networks (ANNs). First, HyperNEAT is extended to evolve plastic ANNs that can learn …

Setpad: A Sketch-Based Tool For Exploring Discrete Math Set Problems, Travis Cossairt

Electronic Theses and Dissertations

We present SetPad, a new application prototype that lets computer science students explore discrete math problems by sketching set expressions using pen-based input. Students can manipulate the expressions interactively with the tool via pen or multi-touch interface. Likewise, discrete mathematics instructors can use SetPad to display and work through set problems via a projector to better demonstrate the solutions to the students. We discuss the implementation and feature set of the application, as well as results from both an informal perceived usefulness evaluation for students taking a computer science foundation exam in addition to a formal user study measuring the …

Networking And Security Solutions For Vanet Initial Deployment Stage, Baber Aslam

Electronic Theses and Dissertations

Vehicular ad hoc network (VANET) is a special case of mobile networks, where vehicles equipped with computing/communicating devices (called "smart vehicles") are the mobile wireless nodes. However, the movement pattern of these mobile wireless nodes is no more random, as in case of mobile networks, rather it is restricted to roads and streets. Vehicular networks have hybrid architecture; it is a combination of both infrastructure and infrastructure-less architectures. The direct vehicle to vehicle (V2V) communication is infrastructure-less or ad hoc in nature. Here the vehicles traveling within communication range of each other form an ad hoc network. On the other …

Algorithms For Rendering Optimization, Jared Johnson

Electronic Theses and Dissertations

This dissertation explores algorithms for rendering optimization realizable within a modern, complex rendering engine. The first part contains optimized rendering algorithms for ray tracing. Ray tracing algorithms typically provide properties of simplicity and robustness that are highly desirable in computer graphics. We offer several novel contributions to the problem of interactive ray tracing of complex lighting environments. We focus on the problem of maintaining interactivity as both geometric and lighting complexity grows without effecting the simplicity or robustness of ray tracing. First, we present a new algorithm called occlusion caching for accelerating the calculation of direct lighting from many light …

Computational Methods For Analyzing Rna Folding Landscapes And Its Applications, Yuan Li

Electronic Theses and Dissertations

Non-protein-coding RNAs play critical regulatory roles in cellular life. Many ncRNAs fold into specific structures in order to perform their biological functions. Some of the RNAs, such as riboswitches, can even fold into alternative structural conformations in order to participate in different biological processes. In addition, these RNAs can transit dynamically between different functional structures along folding pathways on their energy landscapes. These alternative functional structures are usually energetically favored and are stable in their local energy landscapes. Moreover, conformational transitions between any pair of alternate structures usually involve high energy barriers, such that RNAs can become kinetically trapped by …

Detecting, Tracking, And Recognizing Activities In Aerial Video, Vladimir Reilly

Electronic Theses and Dissertations

In this dissertation, we address the problem of detecting humans and vehicles, tracking them in crowded scenes, and finally determining their activities in aerial video. Even though this is a well explored problem in the field of computer vision, many challenges still remain when one is presented with realistic data. These challenges include large camera motion, strong scene parallax, fast object motion, large object density, strong shadows, and insufficiently large action datasets. Therefore, we propose a number of novel methods based on exploiting scene constraints from the imagery itself to aid in the detection and tracking of objects. We show, …

Multihierarchical Documents And Fine-Grained Access Control, Neil Moore

Theses and Dissertations--Computer Science

This work presents new models and algorithms for creating, modifying, and controlling access to complex text. The digitization of texts opens new opportunities for preservation, access, and analysis, but at the same time raises questions regarding how to represent and collaboratively edit such texts. Two issues of particular interest are modelling the relationships of markup (annotations) in complex texts, and controlling the creation and modification of those texts. This work addresses and connects these issues, with emphasis on data modelling, algorithms, and computational complexity; and contributes new results in these areas of research.

Although hierarchical models of text and markup …

Racial And Ethnic Proportions Of Early In-Person Voters In Cuyahoga County, General Election 2008, And Implications For 2012, Norman Robbins, Mark Salling

All Maxine Goodman Levin School of Urban Affairs Publications

No abstract provided.

Demographic And Socioeconomic Conditions And A Patron Borrowing Analysis Of Cleveland Public Library Branch And Main Libraries, Mark Salling

All Maxine Goodman Levin School of Urban Affairs Publications

We provide here an analysis of the demographic and socioeconomic characteristics of the Cleveland Public Library’s (CPL) service area and that of the neighborhoods in which the library’s patrons live. We also describe the borrowing patterns for the branch and downtown, Main Library, locations. The census-based demographic and socioeconomic data used for the analysis include income, number of children, race, Hispanic ethnicity, language spoken at home, ability to speak English, public-versus-private school attendance by grade level, housing tenure (owner/renter), educational attainment, employment status, and place of employment (Cleveland versus other). Data from the 2010 census and the Census Bureau’s 2005-2009 …

Features For Non-Targeted Cross-Sample Analysis With Comprehensive Two-Dimensional Chromatography, Stephen E. Reichenbach, Xue Tian, Chiara Cordero, Qingping Tao

School of Computing: Faculty Publications

This review surveys different approaches for generating features from comprehensive two-dimensional chromatography for non-targeted cross-sample analysis. The goal of non-targeted cross-sample analysis is to discover relevant chemical characteristics (such as compositional similarities or differences) from multiple samples. In non-targeted analysis, the relevant characteristics are unknown, so individual features for all chemical constituents should be analyzed, not just those for targeted or selected analytes. Cross-sample analysis requires matching the corresponding features that characterize each constituent across multiple samples so that relevant characteristics or patterns can be recognized. Non-targeted, cross-sample analysis requires generating and matching all features across all samples. Applications of …

Exploring The Design Space Of Multichannel Peer-To-Peer Live Video Streaming Systems, Miao Wang, Lisong Xu, Byrav Ramamurthy

School of Computing: Faculty Publications

Most of the commercial peer-to-peer (P2P) video streaming deployments support hundreds of channels and are referred to as multichannel systems. Recent research studies have proposed specific protocols to improve the streaming quality for all channels by enabling cross-channel cooperation among multiple channels. In this paper, we focus on the following fundamental problems in designing cooperating multichannel systems: 1) what are the general characteristics of existing and potential designs? and 2) under what circumstances should a particular design be used to achieve the desired streaming quality with the lowest implementation complexity? To answer the first question, we propose simple models based …

An Overview Of Static Pipelining, Ian Finlayson, Gang-Ryung Uh, David Whalley, Gary Tyson

Computer Science Faculty Publications and Presentations

A new generation of mobile applications requires reduced energy consumption without sacrificing execution performance. In this paper, we propose to respond to these conflicting demands with an innovative statically pipelined processor supported by an optimizing compiler. The central idea of the approach is that the control during each cycle for each portion of the processor is explicitly represented in each instruction. Thus the pipelining is in effect statically determined by the compiler. The benefits of this approach include simpler hardware and that it allows the compiler to perform optimizations that are not possible on traditional architectures. The initial results indicate …

Artificial Agents, Cloud Computing, And Quantum Computing: Applying Floridi’S Method Of Levels Of Abstraction, Marty J. Wolf, Frances Grodzinsky, Keith W. Miller

School of Computer Science & Engineering Faculty Publications

In his paper “On the Intrinsic Value of Information Objects and the Infosphere,” Luciano Floridi asserts that the goal of Information Ethics (IE) “is to fill an ‘ethical vacuum’ brought to light by the ICT revolution, to paraphrase Moor” (1985). He claims “IE will prove its value only if its applications bear fruit. This is the work that needs to be done in the near future” (Floridi 2002). Our chapter proposes to do part of that work. Initially we focus on Floridi’s Method of Levels of Abstraction (LoA). We begin by examining his methodology as it was first developed with …

From Lundberg To Sim-Icp: Computational Physiology And Modeling Intracranial Pressure, Brahm Goldstein, Robert Tasker, Wayne Wakeland

Complex Systems Faculty Publications and Presentations

A simplified dynamic model generates patient-specific estimates of intracranial pressure (Kashif et al., this issue) and suggests a path forward for bringing simulated physiologic models to the patient’s bedside.

Efficient Greedy-Face-Greedy Geographic Routing Protocols In Mobile Ad Hoc And Sensor Networks, Yan Sun

Theses and Dissertations--Computer Science

This thesis describes and develops two planarization algorithms for geographic routing and a geographic routing protocol for mobile ad hoc and sensor networks. As all nodes are mobile and there is no fixed infrastructure, the design of routing protocols is one of the most challenging issues in mobile ad hoc and sensor networks. In recent years, greedyface- greedy (GFG) geographic routing protocols have been widely used, which need nodes to construct planar graphs as the underlying graphs for face routing.

Two kinds of planarization algorithms have been developed, idealized and realistic planarization algorithms, respectively. The idealized planarization algorithms make the …

Improving Traceability Recovery Techniques Through The Study Of Tracing Methods And Analyst Behavior, Wei-Keat Kong

Theses and Dissertations--Computer Science

Developing complex software systems often involves multiple stakeholder interactions, coupled with frequent requirements changes while operating under time constraints and budget pressures. Such conditions can lead to hidden problems, manifesting when software modifications lead to unexpected software component interactions that can cause catastrophic or fatal situations. A critical step in ensuring the success of software systems is to verify that all requirements can be traced to the design, source code, test cases, and any other software artifacts generated during the software development process. The focus of this research is to improve on the trace matrix generation process and study how …

Novel Dense Stereo Algorithms For High-Quality Depth Estimation From Images, Liang Wang

Theses and Dissertations--Computer Science

This dissertation addresses the problem of inferring scene depth information from a collection of calibrated images taken from different viewpoints via stereo matching. Although it has been heavily investigated for decades, depth from stereo remains a long-standing challenge and popular research topic for several reasons. First of all, in order to be of practical use for many real-time applications such as autonomous driving, accurate depth estimation in real-time is of great importance and one of the core challenges in stereo. Second, for applications such as 3D reconstruction and view synthesis, high-quality depth estimation is crucial to achieve photo realistic results. …

Computer Methods For Pre-Microrna Secondary Structure Prediction, Dianwei Han

Theses and Dissertations--Computer Science

This thesis presents a new algorithm to predict the pre-microRNA secondary structure. An accurate prediction of the pre-microRNA secondary structure is important in miRNA informatics. Based on a recently proposed model, nucleotide cyclic motifs (NCM), to predict RNA secondary structure, we propose and implement a Modified NCM (MNCM) model with a physics-based scoring strategy to tackle the problem of pre-microRNA folding. Our microRNAfold is implemented using a global optimal algorithm based on the bottom-up local optimal solutions.

It has been shown that studying the functions of multiple genes and predicting the secondary structure of multiple related microRNA is more important …

Basal Graph Structures For Geometry Based Organization Of Wide-Baseline Image Collections, Aveek Shankar Brahmachari

USF Tampa Graduate Theses and Dissertations

We propose algorithms for organization of images in wide-area sparse-view datasets. In such datasets, if the images overlap in scene content, they are related by wide-baseline geometric transformations. The challenge is to identify these relations even if the images sparingly overlap in their content. The images in a dataset are then grouped into sets of related images with the relations captured in each set as a basal (minimal and foundational) graph structures. Images form the vertices in the graph structure and the edges define the geometric relations between the images. We use these basal graphs for geometric walkthroughs and detection …

Object Protocols As A Tool For Debugging Method Call Sequencing Constraints, Ronald William Gilkey

LSU Master's Theses

Clearly conveying and enforcing the proper ordering of method calls on objects has become a common problem among developers and interface designers. Without the ability of the compilation environment to enforce these constraints, programmers must rely on clear documentation being provided and diligence in programming to ensure that a proper sequence of operations is performed. Commonly, though, type-checking becomes the only tool to help support the correctness of operation sequences as API documentation rarely describes inter-object communications. Thus, the likeliness of producing erroneous and buggy software increases. Object protocols provide a simple and straight-forward approach to solving this problem. They …

Ensemble Methods For Malware Diagnosis Based On One-Class Svms, Xing An

LSU Master's Theses

Malware diagnosis is one of today’s most popular topics of machine learning. Instead of simply applying all the classical classification algorithms to the problem and claim the highest accuracy as the result of prediction, which is the typical approach adopted by studies of this kind, we stick to the Support Vector Machine (SVM) classifier and based on our observation of some principles of learning, characteristics of statistics and the behavior of SVM, we employed a number of the potential preprocessing or ensemble methods including rescaling, bagging and clustering that may enhance the performance to the classical algorithm. We implemented the …