Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way the observations are generated. The predictor’s goal is to compete with a benchmark class of prediction rules, which is often a proper Banach function space. Metric entropy provides a unifying framework for competitiv...

Suboptimal search algorithms offer shorter solving times by sacrificing guaranteed solution optimality. While optimal search algorithms like A* and IDA* require admissible heuristics, suboptimal search algorithms need not constrain their guidance in this way. Previous work has explored using off-line training to transform admissible heuristics into more effective inadmissible ones. In this pape...

In this paper we investigate the classification of mental tasks based on electroencephalographic (EEG) data for Brain Computer Interfaces (BCI) in two scenarios: off line and on-line. In the off-line scenario we evaluate the performance of a number of classifiers using a benchmark dataset, the same pre-processing and feature selection and show that classifiers that haven’t been used before are ...

during the last two decades, financial institutions worldwide have witnessed a lot of stress in managing their margins in wake of the new risks, challenges and increase in the competition posed to them by the factors of liberalization and deregulation. the key to create value and achieve competitive edge lies in the better operational efficiency and productivity of these institutions under such...

BACKGROUND The main objective of this study is to establish a benchmark for referral rates in rural Niger so as to allow interpretation of routine referral data to assess the performance of the referral system in Niger. METHODS Strict and controlled application of existing clinical decision trees in a sample of rural health centres allowed the estimation of the corresponding need for and char...

The United States Geological Survey has been researching generalization approaches to enable multiple-scale display and delivery of geographic data. This paper presents automated methods to prune network and polygon features of the United States high-resolution National Hydrography Dataset (NHD) to lower resolutions. Feature-pruning rules, data enrichment, and partitioning are derived from know...

To develop an easy independent patient-specific quality assurance (QA) method using a benchmark plan for high-dose-rate intracavitary brachytherapy for cervix cancer, we conducted benchmark treatment planning with various sizes and combinations of tandem-ovoid and tandem-cylinder applications with 'ideal' geometry outside the patient. Two-dimensional-based treatment planning was conducted based...

This paper presents a new heuristic algorithm for the two-dimensional irregular stock cutting problem, which generates significantly better results than the previous state of the art on a wide range of established benchmark problems. The developed algorithm is able to pack shapes with a traditional line representation, and it can also pack shapes that incorporate circular arcs and holes. This i...

Benchmarks are valuable for comparing processor performance. However, porting and running processor benchmarks on new platforms can be di cult. Touchstone, a simple addition benchmark, is designed to overcome portability problems, while retaining performance measurement accuracy. In this paper, we present experimental results that show Touchstone correlates strongly with processor performance u...

an adaptive version of growing and pruning rbf neural network has been used to predict the system output and implement linear model-based predictive controller (lmpc) and non-linear model-based predictive controller (nmpc) strategies. a radial-basis neural network with growing and pruning capabilities is introduced to carry out on-line model identification.an unscented kalman filter (ukf) algor...