Physical Sciences and Mathematics Commons^™

Pattern Discovery In Dna Using Stochastic Automata, Shweta Shweta

Master's Projects

We consider the problem of identifying similarities between different species of DNA. To do this we infer a stochastic finite automata from a given training data and compare it with a test data. The training and test data consist of DNA sequence of different species. Our method first identifies sentences in DNA. To identify sentences we read DNA sequence one character at a time, 3 characters form a codon and codons form proteins (also known as amino acid chains).Each amino acid in proteins belongs to a group. In total we have 5 groups’ polar, non-polar, acidic, basic and stop codons. …

An Open Source Advertisement Server, Pushkar Umaranikar

Master's Projects

This report describes a new online advertisement system and its implementation for the Yioop open source search engine. This system was implemented for my CS298 project. It supports both selling advertisements and displaying them within search results. The selling of advertisement is done using a novel auction system, which we describe in this paper. With this auction system, it is possible to create an advertisement, attach keywords to it, and add it to the advertisement inventory. An advertisement is displayed on a search results page if the search keyword matches the keywords attached to the advertisement. Display of advertisements is …

Driver Telematics Analysis, Karthik Vakati

Master's Projects

For automobile insurance firms, telemetric analysis represents a valuable and growing way to identify the risk associated with each driver. The pricing decisions of an insurer are best accounted for if they are made considering the driver’s behavior instead of just the vehicle characteristics and the best way to understand a driver’s behavior is to leverage the telemetric analysis. Decisions made on such factors can eventually lead to increased premium or reduced liability for unsafe or reckless drivers and can also help in transitioning the burden to the policies that lead to increased liability.

The dataset provided for this project …

Maximizing The Speed Of Influence In Social Networks, Yubo Wang

Master's Projects

Influence maximization in social networks is the problem of selecting a limited

size of influential users as seed nodes so that the influence from these seed nodes can propagate to the largest number of other nodes in the network. Previous studies in influence maximization focused on three areas, i.e., designing propagation models, improving algorithms of seed-node selection and exploiting the structure of social networks. However, most of these studies ignored the time constraint in influence propagation. In this paper, I studied how to maximize influence propagation in a given time, i.e., maximizing the speed of influence propagation in social networks. …