A Probabilistic Analysis Of Misparking In Reservation Based Parking Garages,
2011
Old Dominion University
A Probabilistic Analysis Of Misparking In Reservation Based Parking Garages, Vikas G. Ashok
Computer Science Theses & Dissertations
Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited availability of parking space. Modern parking garages provide parking reservation facility, thereby ensuring availability to prospective customers. Misparking in such reservation based parking garages creates confusion and aggravates driver frustration. The general conception about misparking is that it tends to completely cripple the normal functioning of the system leading to chaos and confusion. A single mispark tends to have a ripple effect and therefore spawns a chain of misparks. The chain terminates when the last mispark occurs at the parking slot reserved by the …
A Family Of Simple Non-Parametric Kernel Learning Algorithms From Pairwise Constraints,
2011
Nanyang Technological University
A Family Of Simple Non-Parametric Kernel Learning Algorithms From Pairwise Constraints, Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Previous studies of Non-Parametric Kernel Learning (NPKL) usually formulate the learning task as a Semi-Definite Programming (SDP) problem that is often solved by some general purpose SDP solvers. However, for N data examples, the time complexity of NPKL using a standard interior-point SDP solver could be as high as O(N6.5), which prohibits NPKL methods applicable to real applications, even for data sets of moderate size. In this paper, we present a family of efficient NPKL algorithms, termed "SimpleNPKL", which can learn non-parametric kernels from a large set of pairwise constraints efficiently. In particular, we propose two efficient SimpleNPKL algorithms. One …
Recognition Situations Using Extended Dempster-Shafer Theory,
2011
Technological University Dublin
Recognition Situations Using Extended Dempster-Shafer Theory, Susan Mckeever
Other resources
Weiser’s [111] vision of pervasive computing describes a world where technology seamlessly integrates into the environment, automatically responding to peoples’ needs. Underpinning this vision is the ability of systems to automatically track the situation of a person. The task of situation recognition is critical and complex: noisy and unreliable sensor data, dynamic situations, unpredictable human behaviour and changes in the environment all contribute to the complexity. No single recognition technique is suitable in all environments. Factors such as availability of training data, ability to deal with uncertain information and transparency to the user will determine which technique to use in …
Multi-Objective Zone Mapping In Large-Scale Distributed Virtual Environments,
2011
Singapore Management University
Multi-Objective Zone Mapping In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou, Wentong Cai, Xueyan Tang, Rassul Avani
Research Collection School Of Computing and Information Systems
In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed servers to improve overall interactivity. Previously, this problem has been formulated as a single-objective optimization problem, in which the objective is to minimize the total number of clients that are without QoS. This approach may cause considerable network traffic and processing overhead, as a large number of zones may need to be migrated across servers. In this paper, we introduce a multi-objective approach to the zone mapping problem, in which both the total number …
Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points,
2011
University of Denver
Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points, Yan B. Mayster
Electronic Theses and Dissertations
This thesis addresses several problems in the facility location sub-area of computational geometry. Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function curve of size k < n, i.e., by an x-monotone orthogonal polyline ℜ with k < n horizontal segments. We use the vertical distance to measure the quality of the approximation, i.e., the maximum distance from a point in S to the horizontal segment directly above or below it. We consider two types of problems: min-ε, where the goal is to minimize the error for a …
Flipping The Winner Of A Poset Game,
2011
Illinois Mathematics and Science Academy
Flipping The Winner Of A Poset Game, Adam O. Kalinich '12
Student Publications & Research
Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element and all elements greater than it, and whoever takes the last element wins. Examples of poset games include Nim and Chomp. We investigate the complexity of computing which player of a poset game has a winning strategy. We give an inductive procedure that modifies poset games to change the nim-value which informally captures the winning strategies in the game. For a generic …
On The Applications Of Deterministic Chaos For Encrypting Data On The Cloud,
2011
Technological University Dublin
On The Applications Of Deterministic Chaos For Encrypting Data On The Cloud, Jonathan Blackledge, Nikolai Ptitsyn
Conference papers
Cloud computing is expected to grow considerably in the future because it has so many advantages with regard to sale and cost, change management, next generation architectures, choice and agility. However, one of the principal concerns for users of the Cloud is lack of control and above all, data security. This paper considers an approach to encrypting information before it is ‘placed’ on the Cloud where each user has access to their own encryption algorithm, an algorithm that is based on a set of iterated function systems that outputs a chaotic number stream, designed to produce a cryptographically secure cipher. …
Shared Memory, Message Passing, And Hybrid Merge Sorts For Standalone And Clustered Smps,
2011
Chapman University
Shared Memory, Message Passing, And Hybrid Merge Sorts For Standalone And Clustered Smps, Atanas Radenski
Mathematics, Physics, and Computer Science Faculty Books and Book Chapters
While merge sort is well-understood in parallel algorithms theory, relatively little is known of how to implement parallel merge sort with mainstream parallel programming platforms, such as OpenMP and MPI, and run it on mainstream SMP-based systems, such as multi-core computers and multi-core clusters. This is misfortunate because merge sort is not only a fast and stable sort algorithm, but it is also an easy to understand and popular representative of the rich class of divide-and-conquer methods; hence better understanding of merge sort parallelization can contribute to better understanding of divide-and-conquer parallelization in general. In this paper, we investigate three …
In-Degree Dynamics Of Large-Scale P2p Systems,
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 …
High-Dimensional Objective-Based Data Farming,
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 …
Cryptography Using Steganography: New Algorithms And Applications,
2011
Technological University Dublin
Cryptography Using Steganography: New Algorithms And Applications, Jonathan Blackledge
Articles
Developing methods for ensuring the secure exchange of information is one of the oldest occupations in history. With the revolution in Information Technology, the need for securing information and the variety of methods that have been developed to do it has expanded rapidly. Much of the technology that forms the basis for many of the techniques used today was originally conceived for use in military communications and has since found a place in a wide range of industrial and commercial sectors. This has led to the development of certain industry standards that are compounded in specific data processing algorithms together …
Solving The Teacher Assignment Problem By Two Metaheuristics,
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,
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.
Bcc Skin Cancer Diagnosis Based On Texture Analysis Techniques,
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% …
Prediction Of Brain Tumor Progression Using Multiple Histogram Matched Mri Scans,
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 …
Histogram Analysis Of Adc In Brain Tumor Patients,
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, …
Automatic Detection Of Aircraft Emergency Landing Sites,
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 …
2d Face Database Diversification Based On 3d Face Modeling,
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 …
Marine Buoy Detection Using Circular Hough Transform,
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 …
3d Face Reconstruction From Limited Images Based On Differential Evolution,
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 …
