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

Theory and Algorithms Commons

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

2,140 Full-Text Articles 4,014 Authors 1,238,488 Downloads 167 Institutions

All Articles in Theory and Algorithms

Faceted Search

2,140 full-text articles. Page 86 of 88.

In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov 2011 University of Dayton

In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov

Computer Science Faculty Publications

This paper builds a complete modeling framework for understanding user churn and in-degree dynamics in unstructured P2P systems in which each user can be viewed as a stationary alternating renewal process. While the classical Poisson result on the superposition of n stationary renewal processes for n→∞ requires that each point process become sparser as n increases, it is often difficult to rigorously show this condition in practice. In this paper, we first prove that despite user heterogeneity and non-Poisson arrival dynamics, a superposition of edge-arrival processes to a live user under uniform selection converges to a Poisson process when …


Enhancing Bag-Of-Words Models By Efficient Semantics-Preserving Metric Learning, Lei WU, Steven C. H. HOI 2011 Michigan State University

Enhancing Bag-Of-Words Models By Efficient Semantics-Preserving Metric Learning, Lei Wu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The authors present an online semantics preserving, metric learning technique for improving the bag-of-words model and addressing the semantic-gap issue. This article investigates the challenge of reducing the semantic gap for building BoW models for image representation; propose a novel OSPML algorithm for enhancing BoW by minimizing the semantic loss, which is efficient and scalable for enhancing BoW models for large-scale applications; apply the proposed technique for large-scale image annotation and object recognition; and compare it to the state of the art.


Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy GUNAWAN, Hoong Chuin LAU, Linda Lindawati 2011 Singapore Management University

Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati

Research Collection School Of Computing and Information Systems

Optimizing parameter settings is an important task in algorithm design. Several automated parameter tuning procedures/configurators have been proposed in the literature, most of which work effectively when given a good initial range for the parameter values. In the Design of Experiments (DOE), a good initial range is known to lead to an optimum parameter setting. In this paper, we present a framework based on DOE to find a good initial range of parameter values for automated tuning. We use a factorial experiment design to first screen and rank all the parameters thereby allowing us to then focus on the parameter …


2d Face Database Diversification Based On 3d Face Modeling, Qun Wang, Jiang Li, Vijayan K. Asari, Mohammad A. Karim, Manuel Filipe Costa (Ed.) 2011 Old Dominion University

2d Face Database Diversification Based On 3d Face Modeling, Qun Wang, Jiang Li, Vijayan K. Asari, Mohammad A. Karim, Manuel Filipe Costa (Ed.)

Electrical & Computer Engineering Faculty Publications

Pose and illumination are identified as major problems in 2D face recognition (FR). It has been theoretically proven that the more diversified instances in the training phase, the more accurate and adaptable the FR system appears to be. Based on this common awareness, researchers have developed a large number of photographic face databases to meet the demand for data training purposes. In this paper, we propose a novel scheme for 2D face database diversification based on 3D face modeling and computer graphics techniques, which supplies augmented variances of pose and illumination. Based on the existing samples from identical individuals of …


High-Dimensional Objective-Based Data Farming, Zeng Fanchao, James Decraene, Malcolm Low, Wentong Cai, Suiping Zhou, Philip F. Hingston 2011 Edith Cowan University

High-Dimensional Objective-Based Data Farming, Zeng Fanchao, James Decraene, Malcolm Low, Wentong Cai, Suiping Zhou, Philip F. Hingston

Research outputs 2011

In objective-based data farming, decision variables of the Red Team are evolved using evolutionary algorithms such that a series of rigorous Red Team strategies can be generated to assess the Blue Team's operational tactics. Typically, less than 10 decision variables (out of 1000+) are selected by subject matter experts (SMEs) based on their past experience and intuition. While this approach can significantly improve the computing efficiency of the data farming process, it limits the chance of discovering “surprises” and moreover, data farming may be used only to verify SMEs' assumptions. A straightforward solution is simply to evolve all Red Team …


Automatic Detection Of Aircraft Emergency Landing Sites, Yu-Fei Shen, Zia-ur Rahman, Dean Krusienski, Jiang Li, Zia-ur Rahman (Ed.), Stephen E. Reichenbach (Ed.), Mark Allen Neifeld (Ed.) 2011 Old Dominion University

Automatic Detection Of Aircraft Emergency Landing Sites, Yu-Fei Shen, Zia-Ur Rahman, Dean Krusienski, Jiang Li, Zia-Ur Rahman (Ed.), Stephen E. Reichenbach (Ed.), Mark Allen Neifeld (Ed.)

Electrical & Computer Engineering Faculty Publications

An automatic landing site detection algorithm is proposed for aircraft emergency landing. Emergency landing is an unplanned event in response to emergency situations. If, as is unfortunately usually the case, there is no airstrip or airfield that can be reached by the un-powered aircraft, a crash landing or ditching has to be carried out. Identifying a safe landing site is critical to the survival of passengers and crew. Conventionally, the pilot chooses the landing site visually by looking at the terrain through the cockpit. The success of this vital decision greatly depends on the external environmental factors that can impair …


Bcc Skin Cancer Diagnosis Based On Texture Analysis Techniques, Shao-Hui Chuang, Xiaoyan Sun, Wen-Yu Chang, Gwo-Shing Chen, Adam Huang, Jiang Li, Frederic D. McKenzie 2011 Old Dominion University

Bcc Skin Cancer Diagnosis Based On Texture Analysis Techniques, Shao-Hui Chuang, Xiaoyan Sun, Wen-Yu Chang, Gwo-Shing Chen, Adam Huang, Jiang Li, Frederic D. Mckenzie

Electrical & Computer Engineering Faculty Publications

In this paper, we present a texture analysis based method for diagnosing the Basal Cell Carcinoma (BCC) skin cancer using optical images taken from the suspicious skin regions. We first extracted the Run Length Matrix and Haralick texture features from the images and used a feature selection algorithm to identify the most effective feature set for the diagnosis. We then utilized a Multi-Layer Perceptron (MLP) classifier to classify the images to BCC or normal cases. Experiments showed that detecting BCC cancer based on optical images is feasible. The best sensitivity and specificity we achieved on our data set were 94% …


Histogram Analysis Of Adc In Brain Tumor Patients, Debrup Banerjee, Jihong Wang, Jiang Li, Norbert J. Pelc (Ed.), Ehsan Samei (Ed.), Robert M. Nishikawa (Ed.) 2011 Old Dominion University

Histogram Analysis Of Adc In Brain Tumor Patients, Debrup Banerjee, Jihong Wang, Jiang Li, Norbert J. Pelc (Ed.), Ehsan Samei (Ed.), Robert M. Nishikawa (Ed.)

Electrical & Computer Engineering Faculty Publications

At various stage of progression, most brain tumors are not homogenous. In this presentation, we retrospectively studied the distribution of ADC values inside tumor volume during the course of tumor treatment and progression for a selective group of patients who underwent an anti-VEGF trial. Complete MRI studies were obtained for this selected group of patients including pre- and multiple follow-up, post-treatment imaging studies. In each MRI imaging study, multiple scan series were obtained as a standard protocol which includes T1, T2, T1-post contrast, FLAIR and DTI derived images (ADC, FA etc.) for each visit. All scan series (T1, T2, FLAIR, …


3d Face Reconstruction From Limited Images Based On Differential Evolution, Qun Wang, Jiang Li, Vijayan K. Asari, Mohammad A. Karim, Andrew G. Tescher (Ed.) 2011 Old Dominion University

3d Face Reconstruction From Limited Images Based On Differential Evolution, Qun Wang, Jiang Li, Vijayan K. Asari, Mohammad A. Karim, Andrew G. Tescher (Ed.)

Electrical & Computer Engineering Faculty Publications

3D face modeling has been one of the greatest challenges for researchers in computer graphics for many years. Various methods have been used to model the shape and texture of faces under varying illumination and pose conditions from a single given image. In this paper, we propose a novel method for the 3D face synthesis and reconstruction by using a simple and efficient global optimizer. A 3D-2D matching algorithm which employs the integration of the 3D morphable model (3DMM) and the differential evolution (DE) algorithm is addressed. In 3DMM, the estimation process of fitting shape and texture information into 2D …


Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy GUNAWAN, Kien Ming NG 2011 Singapore Management University

Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng

Research Collection School Of Computing and Information Systems

The timetabling problem arising from a university in Indonesia is addressed in this paper.It involves the assignment of teachers to the courses and course sections. We formulate theproblem as a mathematical programming model. Two different algorithms, mainly basedon simulated annealing (SA) and tabu search (TS) algorithms, are proposed for solving theproblem. The proposed algorithms consist of two phases. The first phase involves allocatingthe teachers to the courses and determining the number of courses to be assigned to eachteacher. The second phase involves assigning the teachers to the course sections in order tobalance the teachers’ load. The performance of the proposed …


Eeg Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen, John Musson, Jiang Li, Frederick McKenzie, Guangfan Zhang, Roger Xu, Carl Richey, Tom Schnell, Thomas E. Pinelli (Ed.) 2011 Old Dominion University

Eeg Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen, John Musson, Jiang Li, Frederick Mckenzie, Guangfan Zhang, Roger Xu, Carl Richey, Tom Schnell, Thomas E. Pinelli (Ed.)

Electrical & Computer Engineering Faculty Publications

In this paper we developed a wavelet neural network. (WNN) algorithm for Electroencephalogram (EEG) artifact removal without electrooculographic (EOG) recordings. The algorithm combines the universal approximation characteristics of neural network and the time/frequency property of wavelet. We compared the WNN algorithm with the ICA technique and a wavelet thresholding method, which was realized by using the Stein's unbiased risk estimate (SURE) with an adaptive gradient-based optimal threshold. Experimental results on a driving test data set show that WNN can remove EEG artifacts effectively without diminishing useful EEG information even for very noisy data.


Prediction Of Brain Tumor Progression Using Multiple Histogram Matched Mri Scans, Debrup Banerjee, Loc Tran, Jiang Li, Yuzhong Shen, Frederic McKenzie, Jihong Wang, Ronald M. Summers (Ed.), Bram van Ginneken (Ed.) 2011 Old Dominion University

Prediction Of Brain Tumor Progression Using Multiple Histogram Matched Mri Scans, Debrup Banerjee, Loc Tran, Jiang Li, Yuzhong Shen, Frederic Mckenzie, Jihong Wang, Ronald M. Summers (Ed.), Bram Van Ginneken (Ed.)

Electrical & Computer Engineering Faculty Publications

In a recent study [1], we investigated the feasibility of predicting brain tumor progression based on multiple MRI series and we tested our methods on seven patients' MRI images scanned at three consecutive visits A, B and C. Experimental results showed that it is feasible to predict tumor progression from visit A to visit C using a model trained by the information from visit A to visit B. However, the trained model failed when we tried to predict tumor progression from visit B to visit C, though it is clinically more important. Upon a closer look at the MRI scans …


Marine Buoy Detection Using Circular Hough Transform, Loc Tran, Justin Selfridge, Gene Hou, Jiang Li 2011 Old Dominion University

Marine Buoy Detection Using Circular Hough Transform, Loc Tran, Justin Selfridge, Gene Hou, Jiang Li

Electrical & Computer Engineering Faculty Publications

A low cost method for buoy detection in maritime settings is presented using inexpensive digital cameras. In this method, the circular Hough transform is applied to an edge image to circular objects in the image. The center of these circles will signify the locations of each buoy. The known color information of the buoys is also used to enhance the performance by removing false detections. The algorithm is compared to an approach that locates buoys purely on color information. In order to validate the method, we test the approach synthetically and also with real images captured from a small surface …


Enhancement Technique For Aerial Images, Sertan Erkanli, Ahmet Gungor Pakfiliz, Jiang Li 2011 Old Dominion University

Enhancement Technique For Aerial Images, Sertan Erkanli, Ahmet Gungor Pakfiliz, Jiang Li

Electrical & Computer Engineering Faculty Publications

Recently, we proposed an enhancement technique for uniformly and non-uniformly illuminated dark images that provides high color accuracy and better balance between the luminance and the contrast in images to improve the visual representations of digital images. In this paper we define an improved version of the proposed algorithm to enhance aerial images in order to reduce the gap between direct observation of a scene and its recorded image.


Random Automata Networks: Why Playing Dice Is Not A Vice, Christof Teuscher 2010 Portland State University

Random Automata Networks: Why Playing Dice Is Not A Vice, Christof Teuscher

Systems Science Friday Noon Seminar Series

Random automata networks consist of a set of simple compute nodes interacting with each other. In this generic model, one or multiple model parameters, such as the the node interactions and/or the compute functions, are chosen at random. Random Boolean Networks (RBNs) are a particular case of discrete dynamical automata networks where both time and states are discrete. While traditional RBNs are generally credited to Stuart Kauffman (1969), who introduced them as simplified models of gene regulation, Alan Turing proposed unorganized machines as early as 1948. In this talk I will start with Alan Turing's early work on unorganized machines, …


Topical Summarization Of Web Videos By Visual-Text Time-Dependent Alignment, Song TAN, Hung-Khoon TAN, Chong-wah NGO 2010 Singapore Management University

Topical Summarization Of Web Videos By Visual-Text Time-Dependent Alignment, Song Tan, Hung-Khoon Tan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Search engines are used to return a long list of hundreds or even thousands of videos in response to a query topic. Efficient navigation of videos becomes difficult and users often need to painstakingly explore the search list for a gist of the search result. This paper addresses the challenge of topical summarization by providing a timeline-based visualization of videos through matching of heterogeneous sources. To overcome the so called sparse-text problem of web videos, auxiliary information from Google context is exploited. Google Trends is used to predict the milestone events of a topic. Meanwhile, the typical scenes of web …


Optimized Algorithms For Predictive Range And Knn Queries On Moving Objects, Rui ZHANG, H.V. JAGADISH, Bing Tian DAI, Kotagiri RAMAMOHANARAO 2010 Singapore Management University

Optimized Algorithms For Predictive Range And Knn Queries On Moving Objects, Rui Zhang, H.V. Jagadish, Bing Tian Dai, Kotagiri Ramamohanarao

Research Collection School Of Computing and Information Systems

There have been many studies on management of moving objects recently. Most of them try to optimize the performance of predictive window queries. However, not much attention is paid to two other important query types: the predictive range query and the predictive k nearest neighbor query. In this article, we focus on these two types of queries. The novelty of our work mainly lies in the introduction of the Transformed Minkowski Sum, which can be used to determine whether a moving bounding rectangle intersects a moving circular query region. This enables us to use the traditional tree traversal algorithms to …


Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan 2010 University of Dayton

Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical …


Economic Optimization Of Offshore Wind Farms Using The Geometric Algorithm, Mahidhar Nandigam 2010 Old Dominion University

Economic Optimization Of Offshore Wind Farms Using The Geometric Algorithm, Mahidhar Nandigam

Electrical & Computer Engineering Theses & Dissertations

The research project related to this thesis focuses on the optimization of electrical systems for offshore wind farms for a given capacity. The optimal design and planning is a critical issue for developing cost effectively Offshore Wind Farms in energy systems. The Geometric Optimization Algorithms approach has been adopted to develop an optimization program, where the main components of the electrical system of an offshore wind farm and key technical specifications are used as parameters to be optimized for a minimum cost with necessary constraints. The effectiveness of the optimization program can be evaluated with real-time comparison between offshore wind …


Electroencephalogram Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen 2010 Old Dominion University

Electroencephalogram Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen

Electrical & Computer Engineering Theses & Dissertations

A wavelet neural network (WNN) technique rs developed for electroencephalogram (EEG) artifact removal without electrooculographic (EOG) recordings. The algorithm combines the universal approximation characteristics of neural networks and the time/frequency property of wavelet, where the neural network was trained on a simulated dataset with known ground truths. The contribution of this thesis is two-fold. First, many EEG artifact removal algorithms, including regression based methods, require reference EOG signals, which are not always available. To remove EEG ai1ifacts, a WNN tries to learn the characteristics of the artifacts first and does not need reference EOG signals once trained. Second, WNNs are …


Digital Commons powered by bepress