Exploiting information extraction techniques for automatic semantic video indexing with an application to Turkish news videos

This paper targets at the problem of automatic semantic indexing of news videos by presenting a video annotation and retrieval system which is able to perform automatic semantic annotation of news video archives and provide access to the archives via these annotations. The presented system relies on the video texts as the information source and exploits several information extraction techniques on these texts to arrive at representative semantic information regarding the underlying videos. These techniques include named entity recognition, person entity extraction, coreference resolution, and semantic event extraction. Apart from the information extraction components, the proposed system also encompasses modules for news story segmentation, text extraction, and video retrieval along with a news video database to make it a full-fledged system to be employed in practical settings. The proposed system is a generic one employing a wide range of techniques to automate the semantic video indexing process and to bridge the semantic gap between what can be automatically extracted from videos and what people perceive as the video semantics. Based on the proposed system, a novel automatic semantic annotation and retrieval system is built for Turkish and evaluated on a broadcast news video collection, providing evidence for its feasibility and convenience for news videos with a satisfactory overall performance.     

Single machine scheduling with unequal release date using neuro-dominance rule

A neuro-dominance rule (NDR) for single machine total weighted tardiness problem with unequal release date is presented by the author. To obtain the NDR, backpropagation artificial neural network (BPANN) has been trained using 10,000 data and also tested using 10,000 another data. Inputs of the trained BPANN are starting date of the first job (t), processing times (p_i and p_j), due dates (d_i and d_j), weights of the jobs (w_i and w_j) and r_i and r_j release dates of the jobs. Output of the BPANN is a decision of which job should precede. Training set and test set have been obtained using Adjusted Pairwise Interchange method. The proposed NDR provides a sufficient condition for local optimality. It has been proved that if any sequence violates the NDR then violating jobs are switched according to the total weighted tardiness criterion. The proposed NDR is compared to a number of competing heuristics (ATC, COVERT, EDD, SPT, LPT, WDD, WSPT, WPD, CR, FCFS) and meta heuristics (simulated annealing and genetic algorithms) for a set of randomly generated problems. The problem sizes have been taken as 50, 70, 100. NDR is applied 270,000 randomly generated problems. Computational results indicate that the NDR dominates the heuristics and meta heuristics in all runs. Therefore, the NDR can improve the upper and lower bounding schemes.     

An expert system for automated recognition of patients with obstructive sleep apnea using electrocardiogram recordings

Obstructive sleep apnea (OSA) is a highly prevalent sleep disorder. The traditional diagnosis methods of the disorder are cumbersome and expensive. The ability to automatically identify OSA from electrocardiogram (ECG) recordings is important for clinical diagnosis and treatment. In this study, we proposed an expert system based on discrete wavelet transform (DWT), fast-Fourier transform (FFT) and least squares support vector machine (LS-SVM) for the automatic recognition of patients with OSA from nocturnal ECG recordings. Thirty ECG recordings collected from normal subjects and subjects with sleep apnea, each of approximately 8 h in duration, were used throughout the study. The proposed OSA recognition system comprises three stages. In the first stage, an algorithm based on DWT was used to analyze ECG recordings for the detection of heart rate variability (HRV) and ECG-derived respiration (EDR) changes. In the second stage, an FFT based power spectral density (PSD) method was used for feature extraction from HRV and EDR changes. Then, a hill-climbing feature selection algorithm was used to identify the best features that improve classification performance. In the third stage, the obtained features were used as input patterns of the LS-SVM classifier. Using the cross-validation method, the accuracy of the developed system was found to be 100% for using a subset of selected combination of HRV and EDR features. The results confirmed that the proposed expert system has potential for recognition of patients with suspected OSA by using ECG recordings.     

A tabu-search based heuristic for the hub covering problem over incomplete hub networks

Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin–destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network.     

Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems

In recent years, one of the most important and promising research fields has been metaheuristics to find optimal or near-optimal solutions for NP-hard combinatorial optimization problems. Improving the quality of the solution or the solution time is basic research area on metaheuristics. Modifications of the existing ones or creation of hybrid approaches are the focus of these efforts. Another area of improving the solution quality of metaheuristics is finding the optimal combination of algorithm control parameters. This is usually done by design of experiments or one-at-a-time approach in genetic algorithms, simulated annealing and similar metaheuristics. We observe that, in studies which use Ant Colonies Optimization (ACO) as an optimization technique; the levels of control parameters are determined by some non-systematic initial experiments and the interactions of the parameters are not studied yet.In this study, the parameters of Ant System have been investigated on different sized and randomly generated job-shop scheduling problems by using design of experiments. The effects and interactions of the parameters have been interpreted with the outputs of the experiments. Referring to the statistical analysis it is observed that none of the interactions between the Ant System parameters has a significant effect on makespan value. A specific fractional experimental design is suggested instead of the full factorial design. Depending on the findings from the benchmark problems it will be a reliable approach to use the suggested design for saving time and effort in experiments without sacrificing the solution quality.     

A novel hybrid immune algorithm for global optimization in design and manufacturing

This paper presents a new hybrid optimization approach based on immune algorithm and hill climbing local search algorithm. The purpose of the present research is to develop a new optimization approach for solving design and manufacturing optimization problems. This research is the first application of immune algorithm to the optimization of machining parameters in the literature. In order to evaluate the proposed optimization approach, single objective test problem, multi-objective I-beam and machine-tool optimization problems taken from the literature are solved. Finally, the hybrid approach is applied to a case study for milling operations to show its effectiveness in machining operations. The results of the hybrid approach for the case study are compared with those of genetic algorithm, the feasible direction method and handbook recommendation.     

Adapting application execution in CMPs using helper threads

In parallel to the changes in both the architecture domain–the move toward chip multiprocessors (CMPs)–and the application domain–the move toward increasingly data-intensive workloads–issues such as performance, energy efficiency and CPU availability are becoming increasingly critical. The CPU availability can change dynamically due to several reasons such as thermal overload, increase in transient errors, or operating system scheduling. An important question in this context is how to adapt, in a CMP, the execution of a given application to CPU availability change at runtime. Our paper studies this problem, targeting the energy-delay product (EDP) as the main metric to optimize. We first discuss that, in adapting the application execution to the varying CPU availability, one needs to consider the number of CPUs to use, the number of application threads to accommodate and the voltage/frequency levels to employ (if the CMP has this capability). We then propose to use helper threads to adapt the application execution to CPU availability change in general with the goal of minimizing the EDP. The helper thread runs parallel to the application execution threads and tries to determine the ideal number of CPUs, threads and voltage/frequency levels to employ at any given point in execution. We illustrate this idea using four applications (Fast Fourier Transform, MultiGrid, LU decomposition and Conjugate Gradient) under different execution scenarios. The results collected through our experiments are very promising and indicate that significant EDP reductions are possible using helper threads. For example, we achieved up to 66.3%, 83.3%, 91.2%, and 94.2% savings in EDP when adjusting all the parameters properly in applications FFT, MG, LU, and CG, respectively. We also discuss how our approach can be extended to address multi-programmed workloads.     

Generalized Regression Neural Networks and Feed Forward Neural Networks for prediction of scour depth around bridge piers

In this study, Generalized Regression Neural Networks (GRNN) and Feed Forward Neural Networks (FFNN) approaches are used to predict the scour depth around circular bridge piers. Hundred and sixty five data collected from various experimental studies, are used to predict equilibrium scour depth. The model consisting of the combination of dimensional data involving the input variables is constructed. The performance of the models in training and testing sets are compared with observations. Then, the model is also tested by Multiple Linear Regression (MLR) and empirical formula. The results of all approaches are compared in order to get more reliable comparison. The results indicated that GRNN can be applied successfully for prediction of scour depth around circular bridge piers.