Computer Sciences Commons^™

Categorizing Blog Spam, Brandon Bevans

Master's Theses

The internet has matured into the focal point of our era. Its ecosystem is vast, complex, and in many regards unaccounted for. One of the most prevalent aspects of the internet is spam. Similar to the rest of the internet, spam has evolved from simply meaning ‘unwanted emails’ to a blanket term that encompasses any unsolicited or illegitimate content that appears in the wide range of media that exists on the internet.

Many forms of spam permeate the internet, and spam architects continue to develop tools and methods to avoid detection. On the other side, cyber security engineers continue to …

Movie Script Shot Lister, David Robert Smith

Master's Projects

The making of a motion picture almost always starts with the script, the written version of a story envisioned within the mind of its creator. The script is then broken down into shots. Each individual shot is filmed and then they are edited together to create the motion picture. The goal of the Movie Script Shot Lister thesis project is to be able to read in a script for a movie or television show, and automatically generate a shot list. While a script is text, a shot list is the blue print for how to visualize that script, so the …

Multiple Sequence Alignment With Pro Le Hidden Markov Models, Shubhangi Rakhonde

Master's Projects

The human genome consists of various patterns and sequences that are of biolog- ical signi cance. Capturing these patterns can help us in resolving various mysteries related to the genome, like how genomes evolve, how diseases occur due to genetic mutation, how viruses mutate to cause new disease and what is the cure for these diseases. All these applications are covered in the study of bioinformatics.

One of the very common tasks in bioinformatics involves simultaneous alignment of a number of biological sequences. In bioinformatics, this is widely known as Mul- tiple Sequence Alignment. Multiple sequence alignments help in grouping …

Hive - An Agent Based Modeling Framework, Roohi Bharti

Master's Projects

This thesis begins by defining agent based modeling. Agent based models are used to model the emergent behavior of complex systems with many interacting components, known as agents. Several model examples are given using NetLogo, which is a popular agent-based modeling platform. A model of concurrent computation is described that uses message passing as the only form of communication between the model’s components, which are called actors. The model is called an actor model. Actors are primitive objects of concurrency in an actor model. In particular, we describe the actor model implemented by Akka, which is Scala’s new actor library. …

Automatic Classification Of Perceived Gender From Face Images, Joseph Lemley, Sami Abdul-Wahid, Dipayan Banik

Symposium Of University Research and Creative Expression (SOURCE)

Building software that can visually and accurately perceive gender from face images is an important step in making more intelligent machines. Several approaches to this problem have been suggested in the literature. We evaluate Histogram of Oriented Gradients, Dual Tree Complex Wavelet Transform (DTCWT) Principal Component Analysis (PCA) with Support Vector Machines (SVM) and compare them to Convolutional Neural Networks for this task. We train and test our classifiers with two benchmarks containing thousands of facial images. As expected, convolutional neural networks had the best performance while the performance of DTCWT varied most depending on the dataset used

Applying Machine Learning To Predict Stock Value, Joseph Lemley, Yishui Liu, Dipayan Banik, Sadia Afroze

Symposium Of University Research and Creative Expression (SOURCE)

The purpose of this study was to compare machine learning techniques for short term stock prediction and evaluate their effectiveness. Stock value analysis is an important element of modern economies. The ability to predict future stock prices from historical price values is of tremendous interest to investors. The prediction of stock performance is still an unsolved problem with a variety of techniques being proposed. Real stock values are affected by many elements, some of which cannot be measured. In this study, we limit our analysis to stock closing prices. We use these prices to predict the future stock value using …

Detection Of Locations Of Key Points On Facial Images, Manoj Gyanani

Master's Projects

In field of computer vision research, One of the most important branch is Face recognition. It targets at finding size and location of human face on digital image, by identifying and separating faces from the surrounding objects like building, plants etc. For the purpose of developing an advanced face recognition algorithm, Detection of facial key points is the basic and very important task, basically it is about finding out the location of specific key points on facial images. This key points can be mouths, noses, left eyes, right eyes and so on.

For implementation of solution, I have used amazon …

Automatically Characterizing Product And Process Incentives In Collective Intelligence, Allen Brockhurst Lavoie

McKelvey School of Engineering Graduate Student Theses & Dissertations

Social media facilitate interaction and information dissemination among an unprecedented number of participants. Why do users contribute, and why do they contribute to a specific venue? Does the information they receive cover all relevant points of view, or is it biased? The substantial and increasing importance of online communication makes these questions more pressing, but also puts answers within reach of automated methods. I investigate scalable algorithms for understanding two classes of incentives which arise in collective intelligence processes. Product incentives exist when contributors have a stake in the information delivered to other users. I investigate product-relevant user behavior changes, …

Texture Modelling Using Convolutional Neural Networks, Leon A. Gatys, Alexander S. Ecker, Matthias Bethge

MODVIS Workshop

We introduce a new model of natural textures based on the feature spaces of convolutional neural networks optimised for object recognition. Samples from the model are of high perceptual quality demonstrating the generative power of neural networks trained in a purely discriminative fashion. Within the model, textures are represented by the correlations between feature maps in several layers of the network. We show that across layers the texture representations increasingly capture the statistical properties of natural images while making object information more and more explicit. Extending this framework to texture transfer, we introduce A Neural Algorithm of Artistic Style that …

Focusing On Selection For Fixation, John K. Tsotsos, Calden Wloka, Yulia Kotseruba

MODVIS Workshop

Building on our presentation at MODVIS 2015, we continue in our quest to discover a functional, computational, explanation of the relationship among visual attention, interpretation of visual stimuli, and eye movements, and how these produce visual behavior. Here, we focus on one component, how selection is accomplished for the next fixation. The popularity of saliency map models drives the inference that this is solved; we suggested otherwise at MODVIS 2015. Here, we provide additional empirical and theoretical arguments. We then develop arguments that a cluster of complementary, conspicuity representations drive selection, modulated by task goals and history, leading to a …

Collecting Image Cropping Dataset: A Hybrid System Of Machine And Human Intelligence, Uyen T. Mai, Feng Liu

Student Research Symposium

Image cropping is a common tool that exists in almost any image editor, yet automatic cropping is still a difficult problem in Computer Vision. Since images nowadays can be easily collected through the web, machine learning is a promising approach to solve this problem. However, an image cropping dataset is not yet available and gathering such a large-scale dataset is a non-trivial task. Although a crowdsourcing website such as Mechanical Turk seems to be a solution to this task, image cropping is a sophisticated task that is vulnerable to unreliable annotation; furthermore, collecting a large-scale high-quality dataset through crowdsourcing is …

Ant Colony Optimization For Continuous Spaces, Rachel Findley

Computer Science and Computer Engineering Undergraduate Honors Theses

Ant Colony Optimization (ACO) is an optimization algorithm designed to find semi-optimal solutions to Combinatorial Optimization Problems. The challenge of modifying this algorithm to effectively optimize over a continuous domain is one that has been tackled by several researchers. In this paper, ACO has been modified to use several variations of the algorithm for continuous spaces. An aspect of ACO which is crucial to its success when optimizing over a continuous space is choosing the appropriate object (solution component) out of an infinite set to add to the ant's path. This step is highly important in shaping good solutions. Important …

Improving Electroencephalography-Based Imagined Speech Recognition With A Simultaneous Video Data Stream, Sarah J. Stolze

Computer Science and Computer Engineering Undergraduate Honors Theses

Electroencephalography (EEG) devices offer a non-invasive mechanism for implementing imagined speech recognition, the process of estimating words or commands that a person expresses only in thought. However, existing methods can only achieve limited predictive accuracy with very small vocabularies; and therefore are not yet sufficient to enable fluid communication between humans and machines. This project proposes a new method for improving the ability of a classifying algorithm to recognize imagined speech recognition, by collecting and analyzing a large dataset of simultaneous EEG and video data streams. The results from this project suggest confirmation that complementing high-dimensional EEG data with similarly …

Inferring Intrinsic Beliefs Of Digital Images Using A Deep Autoencoder, Seok H. Lee

Computer Science and Computer Engineering Undergraduate Honors Theses

Training a system of artificial neural networks on digital images is a big challenge. Often times digital images contain a large amount of information and values for artificial neural networks to understand. In this work, the inference model is proposed in order to absolve this problem. The inference model is composed of a parameterized autoencoder that endures the loss of information caused by the rescaling of images and transition model that predicts the effect of an action on the observation. To test the inference model, the images of a moving robotic arm were given as the data set. The inference …

Two-Player Game Ai, Hunter Noble, Ashraf Aly

Celebration of Student Scholarship Poster Sessions Archive

No abstract provided.

Robust Influence Maximization, Meghna Lowalekar, Pradeep Varakantham, Akshat Kumar

Research Collection School Of Computing and Information Systems

Influence Maximization is the problem of finding a fixed size set of nodes, which will maximize the expected number of influenced nodes in a social network. The number of influenced nodes is dependent on the influence strength of edges that can be very noisy. The noise in the influence strengths can be modeled using a random noise or adversarial noise model. It has been shown that all random processes that independently affect edges of the graph can be absorbed into the activation probabilities themselves and hence random noise can be captured within the independent cascade model. On the other hand, …

Reinforcement Learning Framework For Modeling Spatial Sequential Decisions Under Uncertainty: (Extended Abstract), Truc Viet Le, Siyuan Liu, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the problem of trajectory prediction, where a trajectory is an ordered sequence of location visits and corresponding timestamps. The problem arises when an agent makes sequential decisions to visit a set of spatial locations of interest. Each location bears a stochastic utility and the agent has a limited budget to spend. Given the agent's observed partial trajectory, our goal is to predict the remaining trajectory. We propose a solution framework to the problem considering both the uncertainty of utility and the budget constraint. We use reinforcement learning (RL) to model the underlying decision processes and inverse RL to …

Simultaneous Optimization And Sampling Of Agent Trajectories Over A Network, Hala Mostafa, Akshat Kumar, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We study the problem of optimizing the trajectories of agents moving over a network given their preferences over which nodes to visit subject to operational constraints on the network. In our running example, a theme park manager optimizes which attractions to include in a day-pass to maximize the pass’s appeal to visitors while keeping operational costs within budget. The first challenge in this combinatorial optimization problem is that it involves quantities (expected visit frequencies of each attraction) that cannot be expressed analytically, for which we use the Sample Average Approximation. The second challenge is that while sampling is typically done …

Approximate Inference Using Dc Programming For Collective Graphical Models, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau, Daniel Sheldon

Research Collection School Of Computing and Information Systems

Collective graphical models (CGMs) provide a framework for reasoning about a population of independent and identically distributed individuals when only noisy and aggregate observations are given. Previous approaches for inference in CGMs work on a junction-tree representation, thereby highly limiting their scalability. To remedy this, we show how the Bethe entropy approximation naturally arises for the inference problem in CGMs. We reformulate the resulting optimization problem as a difference-of-convex functions program that can capture different types of CGM noise models. Using the concave-convex procedure, we then develop a scalable message-passing algorithm. Empirically, our approach is highly scalable and accurate for …

An Autonomous Agent For Learning Spatiotemporal Models Of Human Daily Activities, Shan Gao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Activities of Daily Living (ADLs) refer to activities performed by individuals on a daily basis. As ADLs are indicatives of a person’s habits, lifestyle, and well being, learning the knowledge of people’s ADL routine has great values in the healthcare and consumer domains. In this paper, we propose an autonomous agent, named Agent for Spatia-Temporal Activity Pattern Modeling (ASTAPM), being able to learn spatial and temporal patterns of human ADLs. ASTAPM utilises a self-organizing neural network model named Spatiotemporal - Adaptive Resonance Theory (ST-ART). ST-ART is capable of integrating multimodal contextual information, involving the time and space, wherein the ADL …

Approximating The Performance Of A "Last Mile" Transportation System, Hai Wang, Amedeo Odoni

Research Collection School Of Computing and Information Systems

The Last Mile Problem (LMP) refers to the provision of travel service from the nearest public transportation node to a home or office. We study the supply side of this problem in a stochastic setting, with batch demands resulting from the arrival of groups of passengers who request last-mile service at urban rail stations or bus stops. Closedform approximations are derived for the performance of Last Mile Transportations Systems as a function of the fundamental design parameters of such systems. An initial set of results is obtained for the case in which a fleet of vehicles of unit capacity provides …

Efficient 3d Dental Identification Via Signed Feature Histogram And Learning Keypoint Detection, Zhiyuan Zhang, Sim Heng Ong, Xin Zhong, Kelvin W. C. Foong

Research Collection School Of Computing and Information Systems

Current methods of dental identification are mainly based on 2D dental radiographs which suffer from speed and accuracy limitations. In this paper, we present an efficient dental identification approach based on 3D dental models. We propose a novel shape descriptor, the Signed Feature Histogram (SFH), which is highly discriminative and can be easily computed to describe the local surface. Based on the SFH, a learning keypoint detection method is adopted to accurately detect the desired keypoints on both antemortem (AM) and postmortem (PM) models. For a given PM model, the optimal initial alignment to the AM model to be matched …

Modeling Autobiographical Memory In Human-Like Autonomous Agents, Di Wang, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

Although autobiographical memory is an important part of the human mind, there has been little effort on modeling autobiographical memory in autonomous agents. With the motivation of developing human-like intelligence, in this paper, we delineate our approach to enable an agent to maintain memories of its own and to wander in mind. Our model, named Autobiographical Memory-Adaptive Resonance Theory network (AM-ART), is designed to capture autobiographical memories, comprising pictorial snapshots of one’s life experiences together with the associated context, namely time, location, people, activity, and emotion. In terms of both network structure and dynamics, AM-ART coincides with the autobiographical memory …

Evaluation Of Topic Models For Content-Based Popularity Prediction On Social Microblogs, Axel Magnuson

Boise State University Theses and Dissertations

Online social networks are an increasingly central medium of communication in the 21st century. We have seen a proliferation of competing social networks which differentiate themselves by serving different niches of communication. Among these, Twitter has risen to prominence as a leader among microblogging communities, characterized by publicly visible 140-character messages called tweets. The wide visibility of Twitter messages has enabled some users to curate large followings, and has facilitated content creators who wish to reach as many viewers as possible. Researchers have since investigated many methods for predicting which messages will become popular or even go viral on Twitter. …

Efficient Algorithms For Clustering Polygonal Obstacles, Sabbir Kumar Manandhar

UNLV Theses, Dissertations, Professional Papers, and Capstones

Clustering a set of points in Euclidean space is a well-known problem having applications in pattern recognition, document image analysis, big-data analytics, and robotics. While there are a lot of research publications for clustering point objects, only a few articles have been reported for clustering a given distribution of obstacles. In this thesis we examine the development of efficient algorithms for clustering a given set of convex obstacles in the 2D plane. One of the methods presented in this work uses a Voronoi diagram to extract obstacle clusters. We also consider the implementation issues of point/obstacle clustering algorithms.

A Study Of Android Malware Detection Techniques And Machine Learning, Balaji Baskaran, Anca Ralescu

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

Android OS is one of the widely used mobile Operating Systems. The number of malicious applications and adwares are increasing constantly on par with the number of mobile devices. A great number of commercial signature based tools are available on the market which prevent to an extent the penetration and distribution of malicious applications. Numerous researches have been conducted which claims that traditional signature based detection system work well up to certain level and malware authors use numerous techniques to evade these tools. So given this state of affairs, there is an increasing need for an alternative, really tough malware …

Extended Pixel Representation For Image Segmentation, Deeptha Girish, Vineeta Singh, Anca Ralescu

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

We explore the use of extended pixel representation for color based image segmentation using the K-means clustering algorithm. Various extended pixel representations have been implemented in this paper and their results have been compared. By extending the representation of pixels an image is mapped to a higher dimensional space. Unlike other approaches, where data is mapped into an implicit features space of higher dimension (kernel methods), in the approach considered here, the higher dimensions are defined explicitly. Preliminary experimental results which illustrate the proposed approach are promising.

An Autonomic Computing System Based On A Rule-Based Policy Engine And Artificial Immune Systems, Rahmira Rufus, William Nick, Joseph Shelton, Albert Esterline

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

Autonomic computing systems arose from the notion that complex computing systems should have properties like those of the autonomic nervous system, which coordinates bodily functions and allows attention to be directed to more pressing needs. An autonomic system allows the system administrator to specify high-level policies, which the system maintains without administrator assistance. Policy enforcement can be done with a rule based system such as Jess (a java expert system shell). An autonomic system must be able to monitor itself, and this is often a limiting factor. We are developing an automatic system that has a policy engine and uses …

Towards The Development Of A Cyber Analysis & Advisement Tool (Caat) For Mitigating De-Anonymization Attacks, Siobahn Day, Henry Williams, Joseph Shelton, Gerry Dozier

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

We are seeing a rise in the number of Anonymous Social Networks (ASN) that claim to provide a sense of user anonymity. However, what many users of ASNs do not know that a person can be identified by their writing style.

In this paper, we provide an overview of a number of author concealment techniques, their impact on the semantic meaning of an author's original text, and introduce AuthorCAAT, an application for mitigating de-anonymization attacks. Our results show that iterative paraphrasing performs the best in terms of author concealment and performs well with respect to Latent Semantic Analysis.

Situations And Evidence For Identity Using Dempster-Shafer Theory, William Nick, Yenny Dominguez, Albert Esterline

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

We present a computational framework for identity based on Barwise and Devlin’s situation theory. We present an example with constellations of situations identifying an individual to create what we call id-situations, where id-actions are performed, along with supporting situations. We use Semantic Web standards to represent and reason about the situations in our example. We show how to represent the strength of the evidence, within the situations, as a measure of the support for judgments reached in the id-situation. To measure evidence of an identity from the supporting situations, we use the Dempster-Shafer theory of evidence. We enhance Dempster- Shafer …