Theory and Algorithms Commons^™

Calibration Of Traffic Flow Models, Victor Molano

College of Engineering: Graduate Celebration Programs

This study proposes a methodology to calibrate microscopic traffic flow simulation models. A Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm searches for the set of model parameters that minimizes the difference between actual and simulated values

Fast Sobel Edge Detection Using Parallel Pipeline-Based Architecture On Fpga, Mohammad Shokrolah Shirazi, Brendan Morris

College of Engineering: Graduate Celebration Programs

Implementing image processing algorithms on FPGA has recently become more popular since it provides high speed in comparison with software-based approaches. In this paper, we have presented fast pipeline-based architecture for one of the most popular edge detection algorithms called Sobel edge detection. The objective of our work is to present two fast pipeline-based architectures for Sobel edge detection on FPGA benefiting one and two way parallelism. We used Verilog language to implement our designs and we synthesized each one for Cyclone IV FPGA. Experimental results show that our pipeline-based architectures perform edge detection process more than 379 and 751 …

On High-Performance Parallel Decimal Fixed-Point Multiplier Designs, Ming Zhu

College of Engineering: Graduate Celebration Programs

Decimal computations are required in finance, and etc.

• Precise representation for decimals (E.g. 0.2, 0.7… )
• Performance Requirements (Software simulations are very slow)

Image Processing Algorithms For Improving Planetary Exploration And Understanding, Ali Pouryazdanpanah

College of Engineering: Graduate Celebration Programs

• To design a fully automated tool-set that allows to detect and extract the sky region in planetary images.

• To develop the new method for rock segmentation in planetary stereo images.
• To develop the new method for shadow detection in planetary images

Mono-Sized Sphere Packing Algorithm Development Using Optimized Monte Carlo Technique, Karn Soontrapa, Yitung Chen

College of Engineering: Graduate Celebration Programs

In this research, fuel cell catalyst layer was developed using the optimized sphere packing algorithm. An optimization technique named adaptive random search technique (ARSET) was employed in this packing algorithm. The ARSET algorithm will generate the initial location of spheres and allow them to move in the random direction with the variable moving distance, randomly selected from the sampling range (a), based on the Lennard–Jones potential and Morse potential of the current and new configuration. The solid fraction values obtained from this developed algorithm are in the range of 0.610–0.624 while the actual processing time can significantly be reduced by …

Operating System Scheduling: Linux Preemptive Scheduling Algorithms, Andrew Brand

Honors Capstones

Capstone submitted as a graduation requirement for the BSU Honors Program.

Impact Of Primary User Activity On The Performance Of Energy-Based Spectrum Sensing In Cognitive Radio Systems, Sara L. Macdonald

Electrical & Computer Engineering Theses & Dissertations

Increasing numbers of wireless devices and mobile data requirements have led to a spectrum shortage. However spectrum utilization percentages are often low due to the current static spectrum allocation process where primary users (PUs) are given exclusive use to spectrum. Several mechanisms to increase spectrum utilization have been proposed including opportunistic spectrum access (OSA). Cognitive Radio (CR) is an emerging concept in wireless communication systems that aims to enable OSA in licensed frequencies by secondary users (SUs). CR systems are expected to sense the spectrum in order to determine if the PU is transmitting. Therefore OSA performance relies on the …

Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange

Dissertations

The general adversarial agents problem is an abstract problem description touching on the fields of Artificial Intelligence, machine learning, decision theory, and game theory. The goal of the problem is, given one or more mobile agents, each identified as either “friendly" or “enemy", along with a specified environment state, to choose an action or series of actions from all possible valid choices for the next “timestep" or series thereof, in order to lead toward a specified outcome or set of outcomes. This dissertation explores approaches to this problem utilizing Artificial Immune Systems, Particle Swarm Optimization, and hybrid approaches, along with …

Modeling Social Information Learning Among Taxi Drivers, Siyuan Liu, Ramayya Krishnan, Emma Brunskill, Lionel Ni

Research Collection School Of Computing and Information Systems

When a taxi driver of an unoccupied taxi is seeking passengers on a road unknown to him or her in a large city, what should the driver do? Alternatives include cruising around the road or waiting for a time period at the roadside in the hopes of finding a passenger or just leaving for another road enroute to a destination he knows (e.g., hotel taxi rank)? This is an interesting problem that arises everyday in many cities worldwide. There could be different answers to the question poised above, but one fundamental problem is how the driver learns about the likelihood …

Confidence Weighted Mean Reversion Strategy For Online Portfolio Selection, Bin Li, Steven C. H. Hoi, Peilin Zhao, Vivekanand Gopalkrishnan

Research Collection School Of Computing and Information Systems

Online portfolio selection has been attracting increasing attention from the data mining and machine learning communities. All existing online portfolio selection strategies focus on the first order information of a portfolio vector, though the second order information may also be beneficial to a strategy. Moreover, empirical evidence shows that relative stock prices may follow the mean reversion property, which has not been fully exploited by existing strategies. This article proposes a novel online portfolio selection strategy named Confidence Weighted Mean Reversion (CWMR). Inspired by the mean reversion principle in finance and confidence weighted online learning technique in machine learning, CWMR …

Fault-Tolerant Coverage In Dense Wireless Sensor Networks, Akshaye Dhawan, Magdalena Parks

Mathematics, Computer Science & Statistics Faculty Publications

In this paper, we present methods to detect and recover from sensor failure in dense wireless sensor networks. In order to extend the lifetime of a sensor network while maintaining coverage, a minimal subset of the deployed sensors are kept active while the other sensors can enter a low power sleep state. Several distributed algorithms for coverage have been proposed in the literature. Faults are of particular concern in coverage algorithms since sensors go into a sleep state in order to conserve battery until woken up by active sensors. If these active sensors were to fail, this could lead to …

Interpreting Individual Classifications Of Hierarchical Networks, Will Landecker, Michael David Thomure, Luis M.A. Bettencourt, Melanie Mitchell, Garrett T. Kenyon, Steven P. Brumby

Computer Science Faculty Publications and Presentations

Hierarchical networks are known to achieve high classification accuracy on difficult machine-learning tasks. For many applications, a clear explanation of why the data was classified a certain way is just as important as the classification itself. However, the complexity of hierarchical networks makes them ill-suited for existing explanation methods. We propose a new method, contribution propagation, that gives per-instance explanations of a trained network's classifications. We give theoretical foundations for the proposed method, and evaluate its correctness empirically. Finally, we use the resulting explanations to reveal unexpected behavior of networks that achieve high accuracy on visual object-recognition tasks using well-known …

Using Mapreduce Streaming For Distributed Life Simulation On The Cloud, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable …

Gpu-Optimized Code For Long-Term Simulations Of Beam-Beam Effects In Colliders, Y. Roblin, V. Morozov, B. Terzić, M. Aturban, D. Ranjan, M. Zubair

Computer Science Faculty Publications

We report 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 symplectic particle tracking for beam transport and the 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, a previously computationally prohibitive long-term simulations become tractable. We use the new code to model the proposed medium-energy electron-ion collider (MEIC) at Jefferson Lab.

Accelerated Data Delivery Architecture, Michael L. Grecol

College of Graduate Studies: Theses & Dissertations

This paper introduces the Accelerated Data Delivery Architecture (ADDA). ADDA establishes a framework to distribute transactional data and control consistency to achieve fast access to data, distributed scalability and non-blocking concurrency control by using a clean declarative interface. It is designed to be used with web-based business applications. This framework uses a combination of traditional Relational Database Management System (RDBMS) combined with a distributed Not Only SQL (NoSQL) database and a browser-based database. It uses a single physical and conceptual database schema designed for a standard RDBMS driven application. The design allows the architect to assign consistency levels to entities …

A Parallel Template For Implementing Filters For Biological Correlation Networks, Kathryn Dempsey Cooper, Vladimir Ufimtsev, Sanjukta Bhowmick, Hesham Ali

Interdisciplinary Informatics Faculty Publications

High throughput biological experiments are critical for their role in systems biology – the ability to survey the state of cellular mechanisms on the broad scale opens possibilities for the scientific researcher to understand how multiple components come together, and what goes wrong in disease states. However, the data returned from these experiments is massive and heterogeneous, and requires intuitive and clever computational algorithms for analysis. The correlation network model has been proposed as a tool for modeling and analysis of this high throughput data; structures within the model identified by graph theory have been found to represent key players …

Automatic Detection Of Abnormal Behavior In Computing Systems, James Frank Roberts

Theses and Dissertations--Computer Science

I present RAACD, a software suite that detects misbehaving computers in large computing systems and presents information about those machines to the system administrator. I build this system using preexisting anomaly detection techniques. I evaluate my methods using simple synthesized data, real data containing coerced abnormal behavior, and real data containing naturally occurring abnormal behavior. I find that the system adequately detects abnormal behavior and significantly reduces the amount of uninteresting computer health data presented to a system administrator.

Hyperspectral Image Classification Using A Spectral-Spatial Sparse Coding Model, Ender Oguslu, Guoqing Zhou, Jiang Li, Lorenzo Bruzzone (Ed.)

Electrical & Computer Engineering Faculty Publications

We present a sparse coding based spectral-spatial classification model for hyperspectral image (HSI) datasets. The proposed method consists of an efficient sparse coding method in which the l₁/l_q regularized multi-class logistic regression technique was utilized to achieve a compact representation of hyperspectral image pixels for land cover classification. We applied the proposed algorithm to a HSI dataset collected at the Kennedy Space Center and compared our algorithm to a recently proposed method, Gaussian process maximum likelihood (GP-ML) classifier. Experimental results show that the proposed method can achieve significantly better performances than the GP-ML classifier when training data …

Usefulness Of Infeasible Solutions In Evolutionary Search: An Empirical And Mathematical Study, Lyndon While, Philip Hingston

Research outputs 2013

When evolutionary algorithms are used to solve constrained optimization problems, the question arises how best to deal with infeasible solutions in the search space. A recent theoretical analysis of two simple test problems argued that allowing infeasible solutions to persist in the population can either help or hinder the search process, depending on the structure of the fitness landscape. We report new empirical and mathematical analyses that provide a different interpretation of the previous theoretical predictions: that the important effect is on the probability of finding the global optimum, rather than on the time complexity of the algorithm. We also …

Analyzing The Impact Of Cloud Services Brokers On Cloud Computing Markets, Richard D. Shang, Jianhui Huang, Yinping Yang, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

This research offers a theoretical model of brokered services and provides an analysis of their impact on the cloud computing market with risk preference-based stratification of client segments. The model structures the decision problem that clients face when they choose among spot, reserved and brokered services. Although all the three types of services do not indemnify the cloud services client against other kinds of service outages, due to changes in market demand, service interruptions occur most frequently in the spot market, and are lower when brokered services are offered, and no risk of inter-ruption is involved in reserved services. Based …