Computer-generated designs in the cube are described which have the minimal (or larger) number of runs for a full quadratic response-surface design. Examples of 2-factor designs are included with 6 to 20 runs, 3-factor designs with 10 to 20 runs, 4-factor designs with 15 to 20 runs, 5-factor designs with 21 to 25 runs, 6-factor designs with 28 to 31 runs, and 7-factor designs with 36 and 39 run...

This paper describes the experiments carried out by the UC3M team for the TRECVID 2010 high-level feature extraction task. In our previous participations in TRECVID, we have developed a modular system to facilitate the testing of several functionalities. This year we have selected a simple system configuration and we have added some elements expected to provide an additional advantage. For inst...

This paper describes the participation of MRIM team in Task 3: Patient-Centered Information Retrieval-IRTask 1: Ad-hoc search of CLEF eHealth Evaluation lab 2016. The aim of this task is to evaluate the effectiveness of information retrieval systems when searching for health content on the web. Our submission investigates the effectiveness of word embedding for query expansion in the health dom...

In this paper we will describe Berkeley’s approach to the Domain Specific (DS) track for CLEF 2006. This year we are not using the tools for thesaurus-based query expansion and de-compounding for German that were developed over the past many years and used very successfully in earlier Berkeley entries in this track. Our intent has been to incorporate those tools into the Cheshire system, but we...

An automated technique has recently been proposed to transfer learning in the hierarchical Bayesian optimization algorithm (hBOA) based on distance-based statistics. The technique enables practitioners to improve hBOA efficiency by collecting statistics from probabilistic models obtained in previous hBOA runs and using the obtained statistics to bias future hBOA runs on similar problems. The pu...

We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of runs, and the number of levels, rises and drops as functions of the Fibonacci and Lucas numbers and also give their generating functions. Furthermore, we look at the decimal value of the sum of all binary strings of le...

Short description: cued motor imagery with online feedback (non-stationary classifier) with 2 classes, and 3-4 sessions from 3 subjects. Aim: Non-stationary (i.e. time-varying) BCI data should be classified. It can be expected that time-varying classifier performs better than a stationary (static) classifier. Moreover, the response time of each method will be evaluated. EEG-data from three diff...