Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Cybersecurity (4)
- Machine learning (4)
- Malware (4)
- Data mining (3)
- Memory Forensics (3)
-
- Security (3)
- Simulation (3)
- Visualization (3)
- Volatility (3)
- Association rule mining (2)
- Deep Learning (2)
- Distributed computing (2)
- Memory forensics (2)
- Neural networks (2)
- Reliable message delivery (2)
- Robotics (2)
- Routing (2)
- Scalability (2)
- Sensor network (2)
- Sensor networks (2)
- Virtual testbed (2)
- 3g (1)
- API hooks (1)
- ARM (1)
- Ad hoc cell phone revocation (1)
- Ad hoc cell phones (1)
- Ad-hoc networks (1)
- Adaptive architecture (1)
- Adaptive mixtures (1)
- Adaptive scheduling (1)
Articles 31 - 60 of 84
Full-Text Articles in Entire DC Network
Social Media Network Data Mining And Optimization, Neha Clare Jose
Social Media Network Data Mining And Optimization, Neha Clare Jose
LSU Master's Theses
Many small social aid organizations could benefit from collaborating with other organizations on common causes, but may not have the necessary social relationships. We present a framework for a recommender system for the Louisiana Poverty Initiative that identifies member organizations with common causes and aims to forge connections between these organizations. Our framework employs a combination of graph and text analyses of the organizations' Facebook pages. We use NodeXL, a plugin to Microsoft Excel, to download the Facebook graph and to interface with SNAP, the Stanford Network Analysis Platform, for calculating network measurements. Our framework extends NodeXL with algorithms that …
Applying Deep Learning Techniques To The Analysis Of Android Apks, Robin Andrew Nix
Applying Deep Learning Techniques To The Analysis Of Android Apks, Robin Andrew Nix
LSU Master's Theses
Malware targeting mobile devices is a pervasive problem in modern life and as such tools to detect and classify malware are of great value. This paper seeks to demonstrate the effectiveness of Deep Learning Techniques, specifically Convolutional Neural Networks, in detecting and classifying malware targeting the Android operating system. Unlike many current detection techniques, which require the use of relatively rigid features to aid in detection, deep neural networks are capable of automatically learning flexible features which may be more resilient to obfuscation. We present a parsing for extracting sequences of API calls which can be used to describe a …
Constructing Desirable Scalar Fields For Morse Analysis On Meshes, Mustafa Hajij
Constructing Desirable Scalar Fields For Morse Analysis On Meshes, Mustafa Hajij
LSU Master's Theses
Morse theory is a powerful mathematical tool that uses the local differential properties of a manifold to make conclusions about global topological aspects of the manifold. Morse theory has been proven to be a very useful tool in computer graphics, geometric data processing and understanding. This work is divided into two parts. The first part is concerned with constructing geometry and symmetry aware scalar functions on a triangulated $2$-manifold. To effectively apply Morse theory to discrete manifolds, one needs to design scalar functions on them with certain properties such as respecting the symmetry and the geometry of the surface and …
Caspar: Congestion Avoidance Shortest Path Routing For Delay Tolerant Networks, Michael F. Stewart
Caspar: Congestion Avoidance Shortest Path Routing For Delay Tolerant Networks, Michael F. Stewart
LSU Master's Theses
Unlike traditional TCP/IP-based networks, Delay and Disruption Tolerant Networks (DTNs) may experience connectivity disruptions and guarantee no end-to-end connectivity between source and destination. As the popularity of DTNs continues to rise, so does the need for a robust and low latency routing protocol capable of connecting not only DTNs but also densely populated, dynamic hybrid DTN-MANET. Here we describe a novel DTN routing algorithm referred to as Congestion Avoidance Shortest Path Routing (CASPaR), which seeks to maximize packet delivery probability while minimizing latency. CASPaR attempts this without any direct knowledge of node connectivity outside of its own neighborhood. Our simulation …
Phylogenetic Tree Construction For Starfish And Primate Genomes Via Alignment Free Methods, Ambujam Krishnan
Phylogenetic Tree Construction For Starfish And Primate Genomes Via Alignment Free Methods, Ambujam Krishnan
LSU Master's Theses
A phylogenetic tree is a tree like diagram showing the evolutionary relationship among various species based on their differences or similarity in their physical or genetic makeup.The similarity in their genetic makeup is traditionally measured based on pairwise distance between their gene sequences using sequence alignment methods. Due to the advancement in next generation sequencing technologies there is a huge amount of datasets available for partially or completely sequenced genomes. These massive datasets requires a faster comparison methods other than the traditional alignment-based approaches. Therefore, alignment free approaches are gaining popularity in recent years. In this thesis, we compare alignment-based …
Pytracks: A Tool For Visualizing Fish Movement Tracks On Different Scales, Ross Fossum
Pytracks: A Tool For Visualizing Fish Movement Tracks On Different Scales, Ross Fossum
LSU Master's Theses
A fundamental problem in conservation biology and fisheries management is the ability to make educated decisions based on the data collected. Fish populations and their spatial distributions need to be represented accurately for conversation efforts and management decisions. Methods such as modeling, surveying, and tracking can all be used to collect data on a particular fishery. To include the movement patterns in conservation and management, one needs to work with and process fish tracking data or data exported from fish movement simulation models. This data can often be difficult to process. This topic is becoming increasingly popular as technology to …
A Toolkit For Tracking And Mediating Parametric Objects Upon Commodity Mobile Devices, Shantanu Thatte
A Toolkit For Tracking And Mediating Parametric Objects Upon Commodity Mobile Devices, Shantanu Thatte
LSU Master's Theses
The large number of mobile devices introduced in the market in recent years provide numerous interaction opportunities. We used commercially available products to create an interface for interaction with diverse datasets. We extended this scenario to include multiple physical instances, realizing a real-time multi-party interaction session. Tangibles act as tools and containers, in a fashion that requires their physical location and orientation to be evaluated continuously during a session. We present a technique to detect an object using only the touchscreen of a mobile device as an input, by means of touch patterns created on the screen. This helps avoid …
Multi-Threaded Implementation Of Association Rule Mining With Visualization Of The Pattern Tree, Eera Gupta
Multi-Threaded Implementation Of Association Rule Mining With Visualization Of The Pattern Tree, Eera Gupta
LSU Master's Theses
Motor Vehicle fatalities per 100,000 population in the United States has been reported to be 10.69% in the year 2012 as per NHTSA (National Highway Traffic Safety Administration). The fatality rate has increased by 0.27% in 2012 compared to the rate in the year 2011. As per the reports, there are many factors involved in increasing the fatality rate drastically such as driving under influence, testing while driving, and various other weather phenomena. Decision makers need to analyze the factors attributing to the increase in an accident rate to take implied measures. Current methods used to perform the data analysis …
Adopting Star Plot For Visualization Of High Dimensional Multivariate Data, Shabana Sangli
Adopting Star Plot For Visualization Of High Dimensional Multivariate Data, Shabana Sangli
LSU Master's Theses
The Star Plot is one of popular methods for visualization of multivariate data. This method displays each data record as a star-shaped icon by mapping all variables (dimensions) on radiating rays (axes) originated from a single point. The number of such icons is equal to the number of data items (records). As the number of dimensions and the size of data set increase, Star Plot visualization soon becomes too cluttered because many rays have to be accommodated within small circular area and individual icons also become too small. To overcome these problems associated with visualization of high-dimensional multivariate data, we …
Detection Of Interesting Traffic Accident Patterns By Association Rule Mining, Harisha Donepudi
Detection Of Interesting Traffic Accident Patterns By Association Rule Mining, Harisha Donepudi
LSU Master's Theses
In recent years, the accident rate related to traffic is high. Analyzing the crash data and extracting useful information from it can help in taking respective measures to decrease this rate or prevent the crash from happening. Related research has been done in the past which involved proposing various measures and algorithms to obtain interesting crash patterns from the crash records. The main problem is that large numbers of patterns were produced and vast number of these patterns would be obvious or not interesting. A deeper analysis of the data is required in order to get the interesting patterns. In …
Approximate Sequence Alignment, Xuanting Cai
Approximate Sequence Alignment, Xuanting Cai
LSU Master's Theses
Given a collection of strings and a query string, the goal of the approximate string matching is to efficiently find the strings in the collection, which are similar to the query string. In this paper, we focus on edit distance as a measure to quantify the similarity between two strings. Existing q-gram based methods use inverted lists to index the q-grams of the given string collection. These methods begin with generating the q-grams of the query string, disjoint or overlapping, and then merge the inverted lists of these q-grams. Several filtering techniques have been proposed to segment inverted lists in …
Parallel Suffix Tree Construction For Genome Sequence Using Hadoop, Umesh Chandra Satish
Parallel Suffix Tree Construction For Genome Sequence Using Hadoop, Umesh Chandra Satish
LSU Master's Theses
Indexing the genome is the basis for many of the bioinformatics applications. Read mapping (sequence alignment) is one such application to align millions of short reads against reference genome. Several tools like BLAST, SOAP, BOWTIE, Cloudburst, and Rapid Parallel Genome Indexing with MapReduce use indexing technique for aligning short reads. Many of the contemporary alignment techniques are time consuming, memory intensive and cannot be easily scaled to larger genomes. Suffix tree is a popular data structure which can be used to overcome the demerits of other alignment techniques. However, constructing the suffix tree is highly memory intensive and time consuming. …
Bayesian Inference Application To Burglary Detection, Ishan Singh Bhale
Bayesian Inference Application To Burglary Detection, Ishan Singh Bhale
LSU Master's Theses
Real time motion tracking is very important for video analytics. But very little research has been done in identifying the top-level plans behind the atomic activities evident in various surveillance footages [61]. Surveillance videos can contain high level plans in the form of complex activities [61]. These complex activities are usually a combination of various articulated activities like breaking windshield, digging, and non-articulated activities like walking, running. We have developed a Bayesian framework for recognizing complex activities like burglary. This framework (belief network) is based on an expectation propagation algorithm [8] for approximate Bayesian inference. We provide experimental results showing …
Ensemble Methods For Malware Diagnosis Based On One-Class Svms, Xing An
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 …
Opportunistic Lookahead Routing Procedure For Delay Tolerant Networks, Priyanka Rotti
Opportunistic Lookahead Routing Procedure For Delay Tolerant Networks, Priyanka Rotti
LSU Master's Theses
Delay Tolerant Networks are wireless networks that have sporadic network connectivity, thus rendering the existence of instantaneous end-to-end paths from a source to a destination difficult or impossible. Hence, in such networks, message delivery relies heavily on the store-and-forward paradigm to route messages. However, limited knowledge of the contact times between the nodes poses a big challenge to effective forwarding of messages. In this thesis, we discuss several aspects of routing in DTNs and present one algorithm and three variants for addressing the routing problem in DTNs: (i) the Look-ahead Protocol, in which the forwarding decision at each node to …
Design And Analysis Of Peer 2 Peer Operating System, Anudeep Meka
Design And Analysis Of Peer 2 Peer Operating System, Anudeep Meka
LSU Master's Theses
The peer to peer computing paradigm has become a popular paradigm for deploying distributed applications. Examples: Kadmelia, Chord, Skype, Kazaa, Big Table. Multiagent systems have become a dominant paradigm within AI for deploying reasoning and analytics applications. Such applications are compute-intensive. In disadvantaged networks the ad-hoc architecture is the most suitable one. Examples: military scenarios, disaster scenarios. We combine the paradigms of peer-to-peer computing, multiagent systems, cloud computing, and ad-hoc networks to create the new paradigm of ad-hoc peer-to-peer mobile agent cloud (APMA cloud) that can provide the computing power of a cloud in “disadvantaged” regions (e.g., through RF using …
Object Protocols As A Tool For Debugging Method Call Sequencing Constraints, Ronald William Gilkey
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 …
An Extensible And Scalable Pilot-Mapreduce Framework For Data Intensive Applications On Distributed Cyberinfrastructure, Pradeep Kumar Mantha
An Extensible And Scalable Pilot-Mapreduce Framework For Data Intensive Applications On Distributed Cyberinfrastructure, Pradeep Kumar Mantha
LSU Master's Theses
The volume and complexity of data that must be analyzed in scientific applications is increasing exponentially. Often, this data is distributed; thus, the ability to analyze data by localizing it will yield limited returns. Therefore, an efficient processing of large distributed datasets is required, whilst ideally not introducing fundamentally new programming models or methods. For example, extending MapReduce - a proven effective programming model for processing large datasets, to work more effectively on distributed data and on different infrastructure (such as non-Hadoop, general-purpose clusters) is desirable. We posit that this can be achieved with an effective and efficient runtime environment …
An Evaluation Of Synchronization Loss Rate Calculations On High Speed Networks, Aaron Tureau
An Evaluation Of Synchronization Loss Rate Calculations On High Speed Networks, Aaron Tureau
LSU Master's Theses
This paper is broken down into two parts:(1) discussion of current formulas that are used to calculate synchronized loss rates among concurrent TCP flows with the results of those equations on flows running through a bottleneck on a high speed emulated network and (2)steps to create revised forms of these equations that are more accurate and give a more reasonable estimation without having the shortcomings of the current equations. This paper brings to light three equations that were previously proposed and were used in published research projects along with their strengths and shortcomings. Through the study of these equations a …
The Design Of A Computer System To Determine The Causes Of Edema Using Magnetic Resonance Spectroscopy, Carl Allen Fink
The Design Of A Computer System To Determine The Causes Of Edema Using Magnetic Resonance Spectroscopy, Carl Allen Fink
LSU Master's Theses
Diabetes is a growing problem in the U.S.A., closely linked to the current obesity epidemic. Two common complications of diabetes, osteomyelitis of the foot, and Charcot's joint, are impossible to differentiate via traditional Magnetic Resonance Imaging. The background of Magnetic Resonance Spectroscopy, which transforms the time-domain MRI signal into the frequency domain spectrum, is explored, and its use to aid in this differentiation is proposed. Artificial Neural Networks can be employed to evaluate the MRS data and to automate the process.
Parallel Surrogate Detection In Large-Scale Simulations, Lei Jiang
Parallel Surrogate Detection In Large-Scale Simulations, Lei Jiang
LSU Master's Theses
Simulation has become a useful approach in scientific computing and engineering for its ability to model real natural or human systems. In particular, for complex systems such as hurricanes, wildfire disasters, and real-time road traffic, simulation methods are able to provide researchers, engineers and decision makers predicted values in order to help them to take appropriate actions. For large-scale problems, the simulations usually take a lot of time on supercomputers, thus making real-time predictions more difficult. Approximation models that mimic the behavior of simulation models but are computationally cheaper, namely "surrogate models", are desired in such scenarios. In the thesis, …
A Partial Order On Classical And Quantum States, Arka Bandyopadhyay
A Partial Order On Classical And Quantum States, Arka Bandyopadhyay
LSU Master's Theses
In this work we extend the work done by Bob Coecke and Keye Martin in their paper “Partial Order on Classical States and Quantum States (2003)”. We review basic notions involving elementary domain theory, the set of probability measures on a finite set {a1, a2, ..., an}, which we identify with the standard (n-1)-simplex ∆n and Shannon Entropy. We consider partial orders on ∆n, which have the Entropy Reversal Property (ERP) : elements lower in the order have higher (Shannon) entropy or equivalently less information . The ERP property is important because of its applications in quantum information theory. We …
An Intelligent Othello Player Combining Machine Learning And Game Specific Heuristics, Kevin Anthony Cherry
An Intelligent Othello Player Combining Machine Learning And Game Specific Heuristics, Kevin Anthony Cherry
LSU Master's Theses
Artificial intelligence applications in board games have been around as early as the 1950's, and computer programs have been developed for games including Checkers, Chess, and Go with varying results. Although general game-tree search algorithms have been designed to work on games meeting certain requirements (e.g. zero-sum, two-player, perfect or imperfect information, etc.), the best results, however, come from combining these with specific knowledge of game strategies. In this MS thesis, we present an intelligent Othello game player that combines game-specific heuristics with machine learning techniques in move selection. Five game specific heuristics, namely corner detection, killer move detection, blocking, …
Efficient Replica-Exchange Across Distributed Production Infrastructure, Abhinav S. Thota
Efficient Replica-Exchange Across Distributed Production Infrastructure, Abhinav S. Thota
LSU Master's Theses
Replica-Exchange (RE) methods represent a class of algorithms that involve a large number of loosely-coupled ensembles and are used to understand physical phenomena -- ranging from protein folding dynamics to binding affinity calculations. We develop a framework for RE that supports different replica pairing and coordination mechanisms, that can use a wide range of production cyberinfrastructure concurrently. Additionally, our framework uses a flexible pilot-job implementation, which enables effective resource allocation for multiple replicas. We characterize the performance of two different RE algorithms - synchronous and asynchronous - at unprecedented scales on production distributed infrastructure (Teragrid and LONI). The synchronous RE …
An Adaptable Group Communication System, Vikram Reddy Kayathi
An Adaptable Group Communication System, Vikram Reddy Kayathi
LSU Master's Theses
Existing group communication systems like ISIS, Spread, Jgroups etc., provide group communication in a synchronous environment. They are built on top of TCP/IP or UDP and guarantee virtual synchrony and consistency. However, wide area distributed systems are inherently asynchronous. Existing group communication systems are not suitable for wide area deployment. They do not provide persistent communication; i.e., if a node gets temporarily disconnected, all messages directed to that node during that period are lost. Hence such systems are not suitable for deployment in disadvantaged networks. While, according to Brewer’s CAP theorem, it is impossible for a distributed computer system to …
Implementation And Analysis Of A Top-K Retrieval System For Strings, Sabrina Chandrasekaran
Implementation And Analysis Of A Top-K Retrieval System For Strings, Sabrina Chandrasekaran
LSU Master's Theses
Given text which is a union of d documents of strings, D = d1, d2,...., dd, the emphasis of this thesis is to provide a practical framework to retrieve the K most relevant documents for a given pattern P, which comes as a query. This cannot be done directly, as going through every occurrence of the query pattern may prove to be expensive if the number of documents that the pattern occurs in is much more than the number of documents (K) that we require. Some advanced query functionality will be required, as compared to listing the documents that the …
Greedy Methods For Approximate Graph Matching With Applications For Social Network Analysis, Partha Basuchowdhuri
Greedy Methods For Approximate Graph Matching With Applications For Social Network Analysis, Partha Basuchowdhuri
LSU Master's Theses
In this thesis, we study greedy algorithms for approximate sub-graph matching with attributed graphs. Such algorithms find one or multiple copies of a sub-graph pattern from a bigger data graph through approximate matching. One intended application of sub-graph matching method is in Social Network Analysis for detecting potential terrorist groups from known terrorist activity patterns. We propose a new method for approximate sub-graph matching which utilizes degree information to reduce the search space within the incremental greedy search framework. In addition, we have introduced the notion of a “seed” in incremental greedy method that aims to find a good initial …
Model-Driven Search-Based Loop Fusion Optimization For Handwritten Code, Pamela Bhattacharya
Model-Driven Search-Based Loop Fusion Optimization For Handwritten Code, Pamela Bhattacharya
LSU Master's Theses
The Tensor Contraction Engine (TCE) is a compiler that translates high-level, mathematical tensor contraction expressions into efficient, parallel Fortran code. A pair of optimizations in the TCE, the fusion and tiling optimizations, have proven successful for minimizing disk-to-memory traffic for dense tensor computations. While other optimizations are specific to tensor contraction expressions, these two model-driven search-based optimization algorithms could also be useful for optimizing handwritten dense array computations to minimize disk to memory traffic. In this thesis, we show how to apply the loop fusion algorithm to handwritten code in a procedural language. While in the TCE the loop fusion …
Design Of A Fully Autonomous Mobile Pipeline Exploration Robot (Famper), Jong-Hoon Kim
Design Of A Fully Autonomous Mobile Pipeline Exploration Robot (Famper), Jong-Hoon Kim
LSU Master's Theses
Pipelines have been an integral part of our constructions for many centuries. However, need to be maintained, and the cost of maintenance continues to increase. Robots have been considered as an attractive alternative, and many different types of pipeline robots have been proposed in the past. Unfortunately many of them work under only very restricted environments such as customized pipelines, often have no vertical mobility, or can traverse through only a simple pipeline structure due to wired control. This thesis presents the design and implementation of a robot based on novel idea we call “caterpillar navigational mechanism”. A Fully Autonomous …
Data Exploration By Using The Monotonicity Property, Hongyi Chen
Data Exploration By Using The Monotonicity Property, Hongyi Chen
LSU Master's Theses
Dealing with different misclassification costs has been a big problem for classification. Some algorithms can predict quite accurately when assuming the misclassification costs for each class are the same, like most rule induction methods. However, when the misclassification costs change, which is a common phenomenon in reality, these algorithms are not capable of adjusting their results. Some other algorithms, like the Bayesian methods, have the ability to yield probabilities of a certain unclassified example belonging to given classes, which is helpful to make modification on the results according to different misclassification costs. The shortcoming of such algorithms is, when the …