Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 31831 - 31860 of 55356

Full-Text Articles in Physical Sciences and Mathematics

Search Queries In An Information Retrieval System For Arabic-Language Texts, Zainab Majeed Albujasim Jan 2014

Search Queries In An Information Retrieval System For Arabic-Language Texts, Zainab Majeed Albujasim

Theses and Dissertations--Computer Science

Information retrieval aims to extract from a large collection of data a subset of information that is relevant to user’s needs. In this study, we are interested in information retrieval in Arabic-Language text documents. We focus on the Arabic language, its morphological features that potentially impact the implementation and performance of an information retrieval system and its unique characters that are absent in the Latin alphabet and require specialized approaches. Specifically, we report on the design, implementation and evaluation of the search functionality using the Vector Space Model with several weighting schemes. Our implementation uses the ISRI stemming algorithms as …


An Adaptive Hybrid Method For Link Prediction In Multi-Modal Directed Complex Networks Using The Graph Traversal Pattern, William Lyon Jan 2014

An Adaptive Hybrid Method For Link Prediction In Multi-Modal Directed Complex Networks Using The Graph Traversal Pattern, William Lyon

Graduate Student Theses, Dissertations, & Professional Papers

The paper examines the link prediction problem for directed multi-modal complex networks. Specically, a hybrid method combining collaborative filtering and Triadic Closeness methods is developed. The methods are applied to a sample of the GitHub network. Implementation details are discussed, with a focus on design of a scalable system for handilng large data sets. Finally, results of this new method are discussed with no significant improvement over current methods.


Introduction To Parallel Computation, Clinton Mckay Jan 2014

Introduction To Parallel Computation, Clinton Mckay

Graduate Student Theses, Dissertations, & Professional Papers

Introduction to Parallel Computing is a course designed to educate students on how to use the parallel libraries and tools provided by modern operating systems and massively parallel computer graphics hardware.

Using a series of lectures and hands-on exercises. Students will learn about parallel algorithms and concepts that will aid them in analyzing a problem and constructing a parallel solution, if possible, using the tools available to their disposal.

The course consists of lectures, projects, quizzes, and homework. The combination of these components will deliver the necessary domain knowledge to students, test them, and in the process train them to …


Development Of A Multi-Mode Self-Adaptive Algorithm To Create An Efficient Wireless Network On A University Campus, Melanie L. Abbas Jan 2014

Development Of A Multi-Mode Self-Adaptive Algorithm To Create An Efficient Wireless Network On A University Campus, Melanie L. Abbas

Dissertations and Theses @ UNI

The expanding use of ubiquitous computing has created a significant demand on existing network infrastructures. The demands of voice, video, and data on the same medium require a quality of service (QoS) at a level acceptable to users. Many network providers simply scale their networks to increase bandwidth and hardware to deal with the increasing demands. However, a network may still reach its design limits with peak traffic or malicious overuse of resources. In addition, with technology changing at a rapid pace, it is difficult to provide sufficient staffing to monitor and adjust the network settings to avoid issues during …


Essays On The Digital Divide, Belal Abdelfattah Jan 2014

Essays On The Digital Divide, Belal Abdelfattah

Open Access Theses & Dissertations

The digital divide is a phenomenon that is globally persistent, despite rapidly decreasing costs in technology. While much of the variance in the adoption and use of information communication technology (ICT) that defines the digital divide can be explained by socioeconomic and demographic variables, there is still significant unaccounted variance that needs to be explained if the world's population is expected to be brought more fully into the digital age. The present research addresses this need with three cross-country studies. Study 1 primarily investigates the time individuals spend with traditional media sources as a likely explanation for their frequency of …


A Visualization And Simulation Tool That Will Generate Effective Patrolling Strategies To Protect The U.S. Borders From Illegal Intrusion Using Game Theoretic Methods And Models, Eric Gutierrez Jan 2014

A Visualization And Simulation Tool That Will Generate Effective Patrolling Strategies To Protect The U.S. Borders From Illegal Intrusion Using Game Theoretic Methods And Models, Eric Gutierrez

Open Access Theses & Dissertations

In the recent decade, the United States Border Patrol has increased the presence of border security officers at points of entry along the U.S.- Mexico border. In response to this increased presence of border security officials at ports of entries, illegal intruders have rerouted their intrusions in between ports of entry, in harsher terrain areas of the U.S. (e.g., the Arizona desert). The U.S. Border Patrol could benefit from a tool that plans effective border patrolling routes, and helps border security officials to make risk-based decisions for resource allocation. We are currently developing a tool called Genetic Algorithm for a …


Bifurcation And Non-Convergence In The Hansen-Patrick Root-Finding Method, Preston Hardy Jan 2014

Bifurcation And Non-Convergence In The Hansen-Patrick Root-Finding Method, Preston Hardy

Honors Theses, 1963-2015

The Hansen-Patrick Root-Finding Method is a one-parameter family of cubically convergent root-finding methods. The parameter is called alpha and can be any complex number. With a few different values of alpha, Hansen-Patrick becomes equivalent to other, more well-known root-finding methods. For example, when alpha equals -1, Hansen-Patrick becomes equivalent to Halley’s Method. There has been previous research into the dynamical systems that arise when varying the initial starting point or varying a family of functions. This paper deals with what happens when the initial point and function are fixed but the root-finding method varies. We are interested in spurious cycles …


Achieving Numerical Reproducibility In The Parallelized Floating Point Dot Product, Alyssa Anderson Jan 2014

Achieving Numerical Reproducibility In The Parallelized Floating Point Dot Product, Alyssa Anderson

Honors Theses, 1963-2015

The world depends on computers every day to do accurate real-world mathematics. Computers must store real numbers in a finite representation that approximates real numbers, called floating point representation. However, simply by changing the order in which we add a list of floating point numbers can provide a different result that may even be less accurate than another ordering. This is because floating point addition is not associative. That is, (a + b) + c is not necessarily equal to a + (b + c). Parallel computing techniques introduce the ability to reorder computations, thus producing a difference in results …


Exploiting Behavioral Biometrics For User Security Enhancements, Nan Zheng Jan 2014

Exploiting Behavioral Biometrics For User Security Enhancements, Nan Zheng

Dissertations, Theses, and Masters Projects

As online business has been very popular in the past decade, the tasks of providing user authentication and verification have become more important than before to protect user sensitive information from malicious hands. The most common approach to user authentication and verification is the use of password. However, the dilemma users facing in traditional passwords becomes more and more evident: users tend to choose easy-to-remember passwords, which are often weak passwords that are easy to crack. Meanwhile, behavioral biometrics have promising potentials in meeting both security and usability demands, since they authenticate users by "who you are", instead of "what …


Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva Jan 2014

Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva

Electronic Theses and Dissertations

Epistasis is the interaction between two or more genes to control a single phenotype. We model epistasis of the prey in a two-locus two-allele problem in a basic predator- prey relationship. The resulting model allows us to examine both population sizes as well as genotypic and phenotypic frequencies. In the context of several numerical examples, we show that if epistasis results in an undesirable or desirable phenotype in the prey by making the particular genotype more or less susceptible to the predator or dangerous to the predator, elimination of undesirable phenotypes and then genotypes occurs.


Template-Based C8-Scorpion: A Protein 8 State Secondary Structure Prediction Method Using Structural Information And Context-Based Features, Ashraf Yaseen, Yaohang Li Jan 2014

Template-Based C8-Scorpion: A Protein 8 State Secondary Structure Prediction Method Using Structural Information And Context-Based Features, Ashraf Yaseen, Yaohang Li

Computer Science Faculty Publications

Background: Secondary structures prediction of proteins is important to many protein structure modeling applications. Correct prediction of secondary structures can significantly reduce the degrees of freedom in protein tertiary structure modeling and therefore reduces the difficulty of obtaining high resolution 3D models.

Methods: In this work, we investigate a template-based approach to enhance 8-state secondary structure prediction accuracy. We construct structural templates from known protein structures with certain sequence similarity. The structural templates are then incorporated as features with sequence and evolutionary information to train two-stage neural networks. In case of structural templates absence, heuristic structural information is incorporated instead. …


Automated Identification Of Cell Type Specific Genes In The Mouse Brain By Image Computing Of Expression Patterns, Rongjian Li, Wenlu Zhang, Shuiwang Ji Jan 2014

Automated Identification Of Cell Type Specific Genes In The Mouse Brain By Image Computing Of Expression Patterns, Rongjian Li, Wenlu Zhang, Shuiwang Ji

Computer Science Faculty Publications

Background: Differential gene expression patterns in cells of the mammalian brain result in the morphological, connectional, and functional diversity of cells. A wide variety of studies have shown that certain genes are expressed only in specific cell-types. Analysis of cell-type-specific gene expression patterns can provide insights into the relationship between genes, connectivity, brain regions, and cell-types. However, automated methods for identifying cell-type-specific genes are lacking to date.

Results: Here, we describe a set of computational methods for identifying cell-type-specific genes in the mouse brain by automated image computing of in situ hybridization (ISH) expression patterns. We applied invariant image feature …


Automatic Curvilinear Quality Mesh Generation Driven By Smooth Boundary And Guaranteed Fidelity, Jing Xu, Andrey N. Chernikov Jan 2014

Automatic Curvilinear Quality Mesh Generation Driven By Smooth Boundary And Guaranteed Fidelity, Jing Xu, Andrey N. Chernikov

Computer Science Faculty Publications

The development of robust high-order finite element methods requires the construction of valid high-order meshes for complex geometries without user intervention. This paper presents a novel approach for automatically generating a high-order mesh with two main features: first, the boundary of the mesh is globally smooth; second, the mesh boundary satisfies a required fidelity tolerance. Invalid elements are eliminated. Example meshes demonstrate the features of the algorithm.


A Nonrigid Registration Method For Correcting Brain Deformation Induced By Tumor Resection, Yixun Liu, Chengjun Yao, Fotis Drakopoulos, Jinsong Wu, Liangfu Zhou, Nikos Chrisochoides Jan 2014

A Nonrigid Registration Method For Correcting Brain Deformation Induced By Tumor Resection, Yixun Liu, Chengjun Yao, Fotis Drakopoulos, Jinsong Wu, Liangfu Zhou, Nikos Chrisochoides

Computer Science Faculty Publications

Purpose: This paper presents a nonrigid registration method to align preoperative MRI with intraoperative MRI to compensate for brain deformation during tumor resection. This method extends traditional point-based nonrigid registration in two aspects: (1) allow the input data to be incomplete and (2) simulate the underlying deformation with a heterogeneous biomechanical model.

Methods: The method formulates the registration as a three-variable (point correspondence, deformation field, and resection region) functional minimization problem, in which point correspondence is represented by a fuzzy assign matrix; Deformation field is represented by a piecewise linear function regularized by the strain energy of a heterogeneous biomechanical …


Moved But Not Gone: An Evaluation Of Real-Time Methods For Discovering Replacement Web Pages, Martin Klein, Michael L. Nelson Jan 2014

Moved But Not Gone: An Evaluation Of Real-Time Methods For Discovering Replacement Web Pages, Martin Klein, Michael L. Nelson

Computer Science Faculty Publications

Inaccessible Web pages and 404 “Page Not Found” responses are a common Web phenomenon and a detriment to the user’s browsing experience. The rediscovery of missing Web pages is, therefore, a relevant research topic in the digital preservation as well as in the Information Retrieval realm. In this article, we bring these two areas together by analyzing four content- and link-based methods to rediscover missing Web pages. We investigate the retrieval performance of the methods individually as well as their combinations and give an insight into how effective these methods are over time. As the main result of this work, …


How Well Does Multiple Ocr Error Correction Generalize?, William B. Lund, Eric K. Ringger, Daniel D. Walker Jan 2014

How Well Does Multiple Ocr Error Correction Generalize?, William B. Lund, Eric K. Ringger, Daniel D. Walker

Faculty Publications

As the digitization of historical documents, such as newspapers, becomes more common, the need of the archive patron for accurate digital text from those documents increases. Building on our earlier work, the contributions of this paper are: 1. in demonstrating the applicability of novel methods for correcting optical character recognition (OCR) on disparate data sets, including a new synthetic training set, 2. enhancing the correction algorithm with novel features, and 3. assessing the data requirements of the correction learning method. First, we correct errors using conditional random fields (CRF) trained on synthetic training data sets in order to demonstrate the …


Selection Of Step Size For Total Variation Minimization In Ct, Anna N. Yeboah Jan 2014

Selection Of Step Size For Total Variation Minimization In Ct, Anna N. Yeboah

Electronic Theses and Dissertations

Medical image reconstruction by total variation minimization is a newly developed area in computed tomography (CT). In compressed sensing literature, it hasbeen shown that signals with sparse representations in an orthonormal basis may be reconstructed via l1-minimization. Furthermore, if an image can be approximately modeled to be piecewise constant, then its gradient is sparse. The application of l1-minimization to a sparse gradient, known as total variation minimization, may then be used to recover the image. In this paper, the steepest descent method is employed to update the approximation of the image. We propose a way to estimate an optimal step …


On The Security Of Auditing Mechanisms For Secure Cloud Storage, Yong Yu, Lei Niu, Guomin Yang, Yi Mu, Willy Susilo Jan 2014

On The Security Of Auditing Mechanisms For Secure Cloud Storage, Yong Yu, Lei Niu, Guomin Yang, Yi Mu, Willy Susilo

Research Collection School Of Computing and Information Systems

Cloud computing is a novel computing model that enables convenient and on-demand access to a shared pool of configurable computing resources. Auditing services are highly essential to make sure that the data is correctly hosted in the cloud. In this paper, we investigate the active adversary attacks in three auditing mechanisms for shared data in the cloud, including two identity privacy-preserving auditing mechanisms called Oruta and Knox, and a distributed storage integrity auditing mechanism.We show that these schemes become insecure when active adversaries are involved in the cloud storage. Specifically, an active adversary can arbitrarily alter the cloud data without …


Mining Weakly Labeled Web Facial Images For Search-Based Face Annotation, Dayong Wang, Steven C. H. Hoi, Ying He, Jianke Zhu Jan 2014

Mining Weakly Labeled Web Facial Images For Search-Based Face Annotation, Dayong Wang, Steven C. H. Hoi, Ying He, Jianke Zhu

Research Collection School Of Computing and Information Systems

This paper investigates a framework of search-based face annotation (SBFA) by mining weakly labeled facial images that are freely available on the World Wide Web (WWW). One challenging problem for search-based face annotation scheme is how to effectively perform annotation by exploiting the list of most similar facial images and their weak labels that are often noisy and incomplete. To tackle this problem, we propose an effective unsupervised label refinement (ULR) approach for refining the labels of web facial images using machine learning techniques. We formulate the learning problem as a convex optimization and develop effective optimization algorithms to solve …


Toward A Real Time Multi-Tissue Adaptive Physics Based Non-Rigid Registration Framework For Brain Tumor Resection, Fotis Drakopoulos, Panagiotis Foteinos, Yixun Liu, Nikos Chrisochoides Jan 2014

Toward A Real Time Multi-Tissue Adaptive Physics Based Non-Rigid Registration Framework For Brain Tumor Resection, Fotis Drakopoulos, Panagiotis Foteinos, Yixun Liu, Nikos Chrisochoides

Computer Science Faculty Publications

This paper presents an adaptive non-rigid registration method for aligning pre-operative MRI with intra-operative MRI (iMRI) to compensate for brain deformation during brain tumor resection. This method extends a successful existing Physics-Based Non-Rigid Registration (PBNRR) technique implemented in ITKv4.5. The new method relies on a parallel adaptive heterogeneous biomechanical Finite Element (FE) model for tissue/tumor removal depicted in the iMRI. In contrast the existing PBNRR in ITK relies on homogeneous static FE model designed for brain shift only (i.e., it is not designed to handle brain tumor resection). As a result, the new method (1) accurately captures the intra-operative deformations …


A Scalable Backward Chaining-Based Reasoner For A Semantic Web, Hui Shi, Kurt Maly, Steven Zeil Jan 2014

A Scalable Backward Chaining-Based Reasoner For A Semantic Web, Hui Shi, Kurt Maly, Steven Zeil

Computer Science Faculty Publications

In this paper we consider knowledge bases that organize information using ontologies. Specifically, we investigate reasoning over a semantic web where the underlying knowledge base covers linked data about science research that are being harvested from the Web and are supplemented and edited by community members. In the semantic web over which we want to reason, frequent changes occur in the underlying knowledge base, and less frequent changes occur in the underlying ontology or the rule set that governs the reasoning. Interposing a backward chaining reasoner between a knowledge base and a query manager yields an architecture that can support …


Gpu Accelerated Long-Term Simulations Of Beam-Beam Effects In Colliders, B. Terzić, V. Morozov, Y. Roblin, F. Lin, H. Zhang, M. Aturban, D. Ranjan, M. Zubair Jan 2014

Gpu Accelerated Long-Term Simulations Of Beam-Beam Effects In Colliders, B. Terzić, V. Morozov, Y. Roblin, F. Lin, H. Zhang, M. Aturban, D. Ranjan, M. Zubair

Computer Science Faculty Publications

We present an update on the development of the new code for long-term simulation of beam-beam effects in particle colliders. The underlying physical model relies on a matrix-based arbitrary-order particle tracking (including a symplectic option) for beam transport and the generalized Bassetti-Erskine approximation for beam-beam interaction. The computations are accelerated through a parallel implementation on a hybrid GPU/CPU platform. With the new code, previously computationally prohibitive long-term simulations become tractable. The new code will be used to model the proposed Medium-energy Electron-Ion Collider (MEIC) at Jefferson Lab.


Tracing Beta Strands Using Strandtwister From Cryo-Em Density Maps At Medium Resolutions, Dong Si, Jing He Jan 2014

Tracing Beta Strands Using Strandtwister From Cryo-Em Density Maps At Medium Resolutions, Dong Si, Jing He

Computer Science Faculty Publications

Major secondary structure elements such as α helices and β sheets can be computationally detected from cryoelectron microscopy (cryo-EM) density maps with medium resolutions of 5–10 A˚ . However, a critical piece of information for modeling atomic structures is missing, because there are no tools to detect β strands from cryo-EM maps at medium resolutions. We propose a method, StrandTwister, to detect the traces of β strands through the analysis of twist, an intrinsic nature of a β sheet. StrandTwister has been tested using 100 β sheets simulated at 10 A˚ resolution and 39 β sheets computationally detected from cryo-EM …


The User Attribution Problem And The Challenge Of Persistent Surveillance Of User Activity In Complex Networks, Claudio Taglienti Jan 2014

The User Attribution Problem And The Challenge Of Persistent Surveillance Of User Activity In Complex Networks, Claudio Taglienti

CCE Theses and Dissertations

In the context of telecommunication networks, the user attribution problem refers to the challenge faced in recognizing communication traffic as belonging to a given user when information needed to identify the user is missing. This is analogous to trying to recognize a nameless face in a crowd. This problem worsens as users move across many mobile networks (complex networks) owned and operated by different providers. The traditional approach of using the source IP address, which indicates where a packet comes from, does not work when used to identify mobile users.

Recent efforts to address this problem by exclusively relying on …


Application Of Cellular Automata To Detection Of Malicious Network Packets, Robert L. Brown Jan 2014

Application Of Cellular Automata To Detection Of Malicious Network Packets, Robert L. Brown

CCE Theses and Dissertations

A problem in computer security is identification of attack signatures in network packets. An attack signature is a pattern of bits that characterizes a particular attack. Because there are many kinds of attacks, there are potentially many attack signatures. Furthermore, attackers may seek to avoid detection by altering the attack mechanism so that the bit pattern presented differs from the known signature. Thus, recognizing attack signatures is a problem in approximate string matching. The time to perform an approximate string match depends upon the length of the string and the number of patterns. For constant string length, the time to …


The Impact Of Enterprise Resource Planning Systems On Small And Medium Enterprises, Miguel Buleje Jan 2014

The Impact Of Enterprise Resource Planning Systems On Small And Medium Enterprises, Miguel Buleje

CCE Theses and Dissertations

Enterprise resource planning (ERP) systems are considered the price of entry in today's business environment, and the number of small and medium-sized enterprises (SME) retiring legacy systems in favor of ERP systems is increasing exponentially.

However, there is a lack of knowledge and awareness of ERP systems and their potential benefit and effect on performance, and overall value to SMEs. While ERP adoption costs and potential benefits are high, it is not apparent whether the end result will translate into higher productivity for SMEs.

The goal of this study is to evaluate the benefits that accrue to a firm on …


Evaluating Heuristics And Crowding On Center Selection In K-Means Genetic Algorithms, William Mcgarvey Jan 2014

Evaluating Heuristics And Crowding On Center Selection In K-Means Genetic Algorithms, William Mcgarvey

CCE Theses and Dissertations

Data clustering involves partitioning data points into clusters where data points within the same cluster have high similarity, but are dissimilar to the data points in other clusters. The k-means algorithm is among the most extensively used clustering techniques. Genetic algorithms (GA) have been successfully used to evolve successive generations of cluster centers. The primary goal of this research was to develop improved GA-based methods for center selection in k-means by using heuristic methods to improve the overall fitness of the initial population of chromosomes along with crowding techniques to avoid premature convergence. Prior to this research, no rigorous systematic …


Validating The Octave Allegro Information Systems Risk Assessment Methodology: A Case Study, Corland Gordon Keating Jan 2014

Validating The Octave Allegro Information Systems Risk Assessment Methodology: A Case Study, Corland Gordon Keating

CCE Theses and Dissertations

An information system (IS) risk assessment is an important part of any successful security management strategy. Risk assessments help organizations to identify mission-critical IS assets and prioritize risk mitigation efforts. Many risk assessment methodologies, however, are complex and can only be completed successfully by highly qualified and experienced security experts. Small-sized organizations, including small-sized colleges and universities, due to their financial constraints and lack of IS security expertise, are challenged to conduct a risk assessment. Therefore, most small-sized colleges and universities do not perform IS risk assessments, which leaves the institution's data vulnerable to security incursions. The negative consequences of …


Polymorphic Data Modeling, Steven R. Benson Jan 2014

Polymorphic Data Modeling, Steven R. Benson

Electronic Theses and Dissertations

There are currently no data modeling standards for modeling NoSQL document store databases. This work proposes a standard to fill the void. The proposed standard is based on our new data modeling pattern named The Polymorphic Table Pattern. The pattern embraces the “schemaless” nature of document store NoSQL while allowing the data modeler to use his or her existing skillsets. The concepts of our proposed modeling have been demonstrated against MongoDB.


An Example Derivation For =R, Paul Stansifer, Mitchell Wand Dec 2013

An Example Derivation For =R, Paul Stansifer, Mitchell Wand

Paul Stansifer

This is intended to accompany Romeo: a system for more flexible binding-safe programming.