Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Graphics and Human Computer Interfaces (135)
- Artificial Intelligence and Robotics (124)
- Other Computer Sciences (114)
- Engineering (107)
- Social and Behavioral Sciences (103)
-
- Databases and Information Systems (95)
- Medicine and Health Sciences (84)
- Theory and Algorithms (79)
- Life Sciences (59)
- OS and Networks (57)
- Computer Engineering (55)
- Library and Information Science (53)
- Numerical Analysis and Scientific Computing (52)
- Digital Communications and Networking (41)
- Information Security (40)
- Systems Architecture (40)
- Software Engineering (31)
- Genetics and Genomics (29)
- Data Science (26)
- Education (25)
- Arts and Humanities (22)
- Archival Science (21)
- Applied Mathematics (20)
- Computational Biology (20)
- Programming Languages and Compilers (20)
- Anatomy (19)
- Medical Specialties (19)
- Business (18)
- Institution
-
- Old Dominion University (391)
- University of Texas Rio Grande Valley (175)
- University of Dayton (108)
- University of Nebraska at Omaha (83)
- University of Kentucky (39)
-
- West Chester University (34)
- University of Montana (32)
- Gettysburg College (27)
- Connecticut College (12)
- Western Kentucky University (9)
- College of Saint Benedict and Saint John's University (5)
- Bowling Green State University (4)
- Bridgewater State University (3)
- Cleveland State University (2)
- Fort Hays State University (2)
- LSU New Orleans (1)
- University of North Dakota (1)
- Keyword
-
- Deep learning (40)
- Machine learning (31)
- Digital libraries (24)
- Artificial intelligence (23)
- Neural networks (20)
-
- Computer science (19)
- Algorithms (18)
- Blockchain (14)
- Web archives (14)
- Humans (13)
- Answer set programming (12)
- Security (12)
- Web archiving (12)
- Classification (11)
- Information retrieval (11)
- Privacy (11)
- Graph theory (10)
- Training (10)
- Mesh generation (9)
- Screen reader (9)
- Secondary structure (9)
- Semantics (9)
- Blind (8)
- Digital preservation (8)
- Eye tracking (8)
- Image (8)
- Information systems (8)
- Memento (8)
- Metadata (8)
- Natural language processing (8)
- Publication Year
- File Type
Articles 691 - 720 of 928
Full-Text Articles in Computer Sciences
Applications Of Hidden Markov Models In Microarray Gene Expression Data, Huimin Geng, Xutao Deng, Hesham Ali
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 …
Capability Information: A Cost-Effective Information Model For Multi-Hop Routing Of Wireless Ad Hoc Networks In The Real Environment, Zhen Jiang, Zhigang Li, Jie Wu, Nong Xiao
Capability Information: A Cost-Effective Information Model For Multi-Hop Routing Of Wireless Ad Hoc Networks In The Real Environment, Zhen Jiang, Zhigang Li, Jie Wu, Nong Xiao
Computer Science Faculty Publications
No abstract provided.
An Architecture For Global Ubiquitous Sensing, Alfredo J. Perez
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 …
Proof System Representations Of Degrees Of Disjoint Np-Pairs, Liyu Zhang
Proof System Representations Of Degrees Of Disjoint Np-Pairs, Liyu Zhang
Computer Science Faculty Publications
Let D be a set of many-one degrees of disjoint NP-pairs. We define a proof system representation of D to be a set of propositional proof systems P such that each degree in D contains the canonical NP-pair of a corresponding proof system in P and the degree structure of D is reflected by the simulation order among the corresponding proof systems in P. We also define a nesting representation of D to be a set of NP-pairs S such that each degree in D contains a representative NP-pair in S and the degree structure of D is reflected by …
Abstract Answer Set Solvers With Backjumping And Learning, Yuliya Lierler
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, SMODELScc, 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.
Temperature 1 Self-Assembly: Deterministic Assembly In 3d And Probabilistic Assembly In 2d, Matthew Cook, Yunhui Fu, Robert Schweller
Temperature 1 Self-Assembly: Deterministic Assembly In 3d And Probabilistic Assembly In 2d, Matthew Cook, Yunhui Fu, Robert Schweller
Computer Science Faculty Publications
We investigate the power of the Wang tile self-assembly model at temperature 1, a threshold value that permits attachment between any two tiles that share even a single bond. When restricted to deterministic assembly in the plane, no temperature 1 assembly system has been shown to build a shape with a tile complexity smaller than the diameter of the shape. In contrast, we show that temperature 1 self-assembly in 3 dimensions, even when growth is restricted to at most 1 step into the third dimension, is capable of simulating a large class of temperature 2 systems, in turn permitting the …
In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
Computer Science Faculty Publications
This paper builds a complete modeling framework for understanding user churn and in-degree dynamics in unstructured P2P systems in which each user can be viewed as a stationary alternating renewal process. While the classical Poisson result on the superposition of n stationary renewal processes for n→∞ requires that each point process become sparser as n increases, it is often difficult to rigorously show this condition in practice. In this paper, we first prove that despite user heterogeneity and non-Poisson arrival dynamics, a superposition of edge-arrival processes to a live user under uniform selection converges to a Poisson process when …
Tracking And Recognizing Multiple Faces Using Kalman Filter And Modularpca, Jacob Foytik, Praveen Sankaran, Vijayan Asari
Tracking And Recognizing Multiple Faces Using Kalman Filter And Modularpca, Jacob Foytik, Praveen Sankaran, Vijayan Asari
Computer Science Faculty Publications
Real-time tracking and recognizing multiple faces in complex environments has the ability to provide efficient security automation to large areas. Previous research has shown that Kalman filter techniques paired with the traditional face detection methods can be used to track one or more faces in a viewing region, but prove unreliable under variant conditions due to the inability to reliably distinguish between multiple trackers. A real-time face tracking and recognition system is presented that is capable of processing multiple faces simultaneously. The proposed system utilizes the Kalman filter for tracking and uses a low-level recognition system to properly distinguish between …
P2n: A Pedagogical Pattern For Teaching Computer Programming To Non-Cs Majors, Zhen Jiang, Eduardo B. Fernandez, Liang Cheng
P2n: A Pedagogical Pattern For Teaching Computer Programming To Non-Cs Majors, Zhen Jiang, Eduardo B. Fernandez, Liang Cheng
Computer Science Faculty Publications
No abstract provided.
Fast Mobility Control Protocols With Sink Location Protection In Wireless Sensor Networks, Xiao Chen, Qijun Gu, Zhen Jiang, Jie Wu
Fast Mobility Control Protocols With Sink Location Protection In Wireless Sensor Networks, Xiao Chen, Qijun Gu, Zhen Jiang, Jie Wu
Computer Science Faculty Publications
No abstract provided.
Separating Ne From Some Nonuniform Nondeterministic Complexity Classes, Bin Fu, Ansheng Li, Liyu Zhang
Separating Ne From Some Nonuniform Nondeterministic Complexity Classes, Bin Fu, Ansheng Li, Liyu Zhang
Computer Science Faculty Publications
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE 6 ⊆ RNP no(1) −T (TALLY); (2)NE 6 ⊆ RSN m (SPARSE); and (3) NE 6 ⊆ PNP nk −T /nk for all k ≥ 1. Result (3) extends a previous result by Mocas to nonuniform reductions. We also investigate how different an NE-hard set is from an NP-set. We show that for any NP subset A of a many-one-hard set H for NE, there exists another NP subset A′ of H such that A′ …
From Isotropic To Anisotropic Side Chain Representations: Comparison Of Three Models For Residue Contact Estimation, Weitao Sun, Jing He
From Isotropic To Anisotropic Side Chain Representations: Comparison Of Three Models For Residue Contact Estimation, Weitao Sun, Jing He
Computer Science Faculty Publications
The criterion to determine residue contact is a fundamental problem in deriving knowledge-based mean-force potential energy calculations for protein structures. A frequently used criterion is to require the side chain center-to-center distance or the C-alpha-to-C-alpha atom distance to be within a pre-determined cutoff distance. However, the spatially anisotropic nature of the side chain determines that it is challenging to identify the contact pairs. This study compares three side chain contact models: the Atom Distance criteria (ADC) model, the Isotropic Sphere Side chain (ISS) model and the Anisotropic Ellipsoid Side chain (AES) model using 424 high resolution protein structures in the …
Multitissue Tetrahedral Image-To-Mesh Conversion With Guaranteed Quality And Fidelity, Andrey N. Chernikov, Nikos P. Chrisochoides
Multitissue Tetrahedral Image-To-Mesh Conversion With Guaranteed Quality And Fidelity, Andrey N. Chernikov, Nikos P. Chrisochoides
Computer Science Faculty Publications
We present a novel algorithm for tetrahedral image-to-mesh conversion which allows for guaranteed bounds on the smallest dihedral angle and on the distance between the boundaries of the mesh and the boundaries of the tissues. The algorithm produces a small number of mesh elements that comply with these bounds. We also describe and evaluate our implementation of the proposed algorithm that is compatible in performance with a state-of-the art Delaunay code, but in addition solves the small dihedral angle problem. Read More: http://epubs.siam.org/doi/10.1137/100815256
User Experiments Of A Social, Faceted Multimedia Classification System, Liuliu Fu, Kurt Maly, Elizabeth Rasnick, Harris Wu, Mohammad Zubair
User Experiments Of A Social, Faceted Multimedia Classification System, Liuliu Fu, Kurt Maly, Elizabeth Rasnick, Harris Wu, Mohammad Zubair
Computer Science Faculty Publications
Internet document sharing systems such as Flickr store billions of user-contributed images. Many collections on the Web contain large numbers of multimedia objects such as images. While such systems are designed to encourage user contributions and sharing, they are not well-organized collections on any given subject and are not easy to browse for specific subject matters. We have built a system that systematically organizes a large multimedia collection into an evolving faceted classification. This paper discusses the evaluation of such a system through a number of usage studies in a university setting.
Computational Network Analysis Of The Anatomical And Genetic Organizations In The Mouse Brain, Shuiwang Ji
Computational Network Analysis Of The Anatomical And Genetic Organizations In The Mouse Brain, Shuiwang Ji
Computer Science Faculty Publications
Motivation: The mammalian central nervous system (CNS) generates high-level behavior and cognitive functions. Elucidating the anatomical and genetic organizations in the CNS is a key step toward understanding the functional brain circuitry. The CNS contains an enormous number of cell types, each with unique gene expression patterns. Therefore, it is of central importance to capture the spatial expression patterns in the brain. Currently, genome-wide atlas of spatial expression patterns in the mouse brain has been made available, and the data are in the form of aligned 3D data arrays. The sheer volume and complexity of these data pose significant challenges …
Vehicular Ad Hoc Networks, Syed R. Rizvi, Stephan Olariu, Christina M. Oinotti, Shaharuddin Salleh, Mona E. Rizvi, Zainab Zaidi
Vehicular Ad Hoc Networks, Syed R. Rizvi, Stephan Olariu, Christina M. Oinotti, Shaharuddin Salleh, Mona E. Rizvi, Zainab Zaidi
Computer Science Faculty Publications
(First paragraph) Vehicular ad hoc networks (VANETs) have recently been proposed as one of the promising ad hoc networking techniques that can provide both drivers and passengers with a safe and enjoyable driving experience. VANETs can be used for many applications with vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. In the United States, motor vehicle traffic crashes are the leading cause of death for all motorists between two and thirty-four years of age. In 2009, the National Highway Traffic Safety Administration (NHTSA) reported that 33,808 people were killed in motor vehicle traffic crashes. The US Department of Transportation (US-DOT) estimates that …
A Genetic Algorithm For Multiobjective Hard Scheduling Optimization, Elías Niño, Carlos Ardila, Alfredo J. Perez, Yexid Donoso
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 …
Mapsplice: Accurate Mapping Of Rna-Seq Reads For Splice Junction Discovery, Kai Wang, Darshan Singh, Zheng Zeng, Stephen J. Coleman, Yan Huang, Gleb L. Savich, Xiaping He, Piotr Mieczkowski, Sara A. Grimm, Charles M. Perou, James N. Macleod, Derek Y. Chiang, Jan F. Prins, Jinze Liu
Mapsplice: Accurate Mapping Of Rna-Seq Reads For Splice Junction Discovery, Kai Wang, Darshan Singh, Zheng Zeng, Stephen J. Coleman, Yan Huang, Gleb L. Savich, Xiaping He, Piotr Mieczkowski, Sara A. Grimm, Charles M. Perou, James N. Macleod, Derek Y. Chiang, Jan F. Prins, Jinze Liu
Computer Science Faculty Publications
The accurate mapping of reads that span splice junctions is a critical component of all analytic techniques that work with RNA-seq data. We introduce a second generation splice detection algorithm, MapSplice, whose focus is high sensitivity and specificity in the detection of splices as well as CPU and memory efficiency. MapSplice can be applied to both short (<75 bp) and long reads (≥75 bp). MapSplice is not dependent on splice site features or intron length, consequently it can detect novel canonical as well as non-canonical splices. MapSplice leverages the quality and diversity of read alignments of a given splice to increase accuracy. We demonstrate that MapSplice achieves higher sensitivity and specificity than TopHat and SpliceMap on a set of simulated RNA-seq data. Experimental studies also support the accuracy of the algorithm. Splice junctions derived from eight breast cancer RNA-seq datasets recapitulated the extensiveness of alternative splicing on a global level as well as the differences between molecular subtypes of breast cancer. These combined results indicate that MapSplice is a highly accurate algorithm for the alignment of RNA-seq reads to splice junctions. Software download URL: http://www.netlab.uky.edu/p/bioinfo/MapSplice.
Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan
Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical …
A Comparative Study Of Filter-Based Feature Ranking Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
A Comparative Study Of Filter-Based Feature Ranking Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Kehan Gao
Computer Science Faculty Publications
One factor that affects the success of machine learning is the presence of irrelevant or redundant information in the training data set. Filter-based feature ranking techniques (rankers) rank the features according to their relevance to the target attribute and we choose the most relevant features to build classification models subsequently. In order to evaluate the effectiveness of different feature ranking techniques, a commonly used method is to assess the classification performance of models built with the respective selected feature subsets in terms of a given performance metric (e.g., classification accuracy or misclassification rate). Since a given performance metric usually can …
A Comparative Study Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Jason Van Hulse
A Comparative Study Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi M. Khoshgoftaar, Jason Van Hulse
Computer Science Faculty Publications
Abstract Given high-dimensional software measurement data, researchers and practitioners often use feature (metric) selection techniques to improve the performance of software quality classification models. This paper presents our newly proposed threshold-based feature selection techniques, comparing the performance of these techniques by building classification models using five commonly used classifiers. In order to evaluate the effectiveness of different feature selection techniques, the models are evaluated using eight different performance metrics separately since a given performance metric usually captures only one aspect of the classification performance. All experiments are conducted on three Eclipse data sets with different levels of class imbalance. The …
G-Sense: A Scalable Architecture For Global Sensing And Monitoring, Alfredo J. Perez, Miguel A. Labrador, Sean J. Barbeau
G-Sense: A Scalable Architecture For Global Sensing And Monitoring, Alfredo J. Perez, Miguel A. Labrador, Sean J. Barbeau
Computer Science Faculty Publications
The pervasiveness of cellular phones combined with Internet connectivity, GPS embedded chips, location information, and integrated sensors provide an excellent platform to collect data about the individual and its surrounding environment. As a result, new applications have recently appeared to address large-scale societal problems as well as improve the quality of life of the individual. However, these new applications, recently called location-based services, participatory sensing, and human-centric sensing, bring many new challenges, one of them being the management of the huge amount of traffic (data) they generate. This article presents G-Sense, for Global-Sense, an architecture that integrates mobile and static …
A Location-Aware Framework For Intelligent Real-Time Mobile Applications, Sean J. Barbeau, Rafael A. Perez, Miguel A. Labrador, Alfredo J. Perez, Nevine Labib Georggi, Philip L. Winters
A Location-Aware Framework For Intelligent Real-Time Mobile Applications, Sean J. Barbeau, Rafael A. Perez, Miguel A. Labrador, Alfredo J. Perez, Nevine Labib Georggi, Philip L. Winters
Computer Science Faculty Publications
The Location-Aware Information Systems Client (LAISYC) supports intelligent, real-time, mobile applications for GPS-enabled mobile phones by dynamically adjusting platform parameters for application performance while conserving device resources such as battery life.
Personalization By Website Transformation: Theory And Practice, Saverio Perugini
Personalization By Website Transformation: Theory And Practice, Saverio Perugini
Computer Science Faculty Publications
We present an analysis of a progressive series of out-of-turn transformations on a hierarchical website to personalize a user’s interaction with the site. We formalize the transformation in graph-theoretic terms and describe a toolkit we built that enumerates all of the traversals enabled by every possible complete series of these transformations in any site and computes a variety of metrics while simulating each traversal therein to qualify the relationship between a site’s structure and the cumulative effect of support for the transformation in a site. We employed this toolkit in two websites. The results indicate that the transformation enables users …
Sat-Based Answer Set Programming, Yuliya Lierler
Sat-Based Answer Set Programming, Yuliya Lierler
Computer Science Faculty Publications
Answer set programming (ASP) is a declarative programming paradigm oriented towards difficult combinatorial search problems. Syntactically, ASP programs look like Prolog programs, but solutions are represented in ASP by sets of atoms, and not by substitutions, as in Prolog. Answer set systems, such as SMODELS, SMODELSCC, and DLV, compute answer sets of a given program in the sense of the answer set (stable model) semantics. This is different from the functionality of Prolog systems, which determine when a given query is true relative to a given logic program. ASP has been applied to many areas of science and technology, from …
A Peer-Tree Based Location Lookup Service In Mobile Wireless Networks, Jun Liu
A Peer-Tree Based Location Lookup Service In Mobile Wireless Networks, Jun Liu
Computer Science Faculty Publications
We present a location look-up service for aiding location-based routing in wireless networks with mobile hosts. This location look up service is constructed based on a peer-tree indexing structure which represents the friendship relations among mobile hosts. The friendship is derived from the relations of sharing various-length common suffixes of host identifiers. A friendship relation determines the cooperation relation among mobile hosts. The Peer-Tree indexing structure provides a guideline for propagating location updates and queries in an organized manner. Each host periodically propagates its up-to-date location to a small number of its friends. Location queries are forwarded to and serviced …
Admission Control Mechanisms For Continuous Queries In The Cloud, Christine Chung, Lory Al Moakar, Panos Chrysanthis, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis (Panickos) Neophytou, Kirk Pruhs
Admission Control Mechanisms For Continuous Queries In The Cloud, Christine Chung, Lory Al Moakar, Panos Chrysanthis, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis (Panickos) Neophytou, Kirk Pruhs
Computer Science Faculty Publications
No abstract provided.
Shape Replication Through Self-Assembly And Rnase Enzymes, Zachary Abel, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Scott D. Kominers, Robert Schweller
Shape Replication Through Self-Assembly And Rnase Enzymes, Zachary Abel, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Scott D. Kominers, Robert Schweller
Computer Science Faculty Publications
We introduce the problem of shape replication in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will replicate that shape into either a specific number of copies, or an unbounded number of copies. Motivated by practical DNA implementations of Wang tiles, we consider a model in which tiles consisting of DNA or RNA can be dynamically added in a sequence of stages. We further permit the addition of RNase enzymes capable of disintegrating RNA tiles. Under this model, we show that arbitrary genus-0 shapes can be replicated infinitely many …
Srpt Is 1.86-Competitive For Completion Time Scheduling, Christine Chung, Tim Nonner, Alexander Souza
Srpt Is 1.86-Competitive For Completion Time Scheduling, Christine Chung, Tim Nonner, Alexander Souza
Computer Science Faculty Publications
No abstract provided.
Practical Play Of The Dice Game Pig, Todd W. Neller, Clifton G.M. Presser
Practical Play Of The Dice Game Pig, Todd W. Neller, Clifton G.M. Presser
Computer Science Faculty Publications
The object of the jeopardy dice game Pig is to be the first player to reach 100 points. Each turn, a player repeatedly rolls a die until either a 1 is rolled or the player holds and scores the sum of the rolls (i.e., the turn total). At any time during a player’s turn, the player is faced with two choices: roll or hold. If the player rolls a 1, the player scores nothing and it becomes the opponent’s turn. If the player rolls a number other than 1, the number is added to the player’s turn total …