The bus vehicle scheduling problem addresses the task of assigning vehicles to cover the trips in a timetable. In this paper, a clonal selection algorithm based vehicle scheduling approach is proposed to quickly generate satisfactory solutions for large-scale bus scheduling problems. Firstly, a set of vehicle blocks (consecutive trips by one bus) is generated based on the maximal wait time betw...

Paravalvular leak (PVL) is a seldomly covered aspect of structural heart disease. However, this is a condition that frequently presents after valvular replacement. This article will cover the diagnosising and treating PVL (i.e. imaging, access, and device selection). In addition, specific aspects of aortic and mitral PVL closure will be covered in this review.

We discuss the text-independent data supplied for the 2001: A Speaker Odyssey evaluation track. We cover the data creation and selection process, and we present results restricted to the Odyssey test set for participating systems in the 2000 NIST Speaker Recognition Evaluation.

This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and open problems. It does not cover holants, which are the subject of a separate chapter. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorith...

Hyperspectral data usually consists of hundreds narrow spectral bands and provides more detailed characteristics compared to commonly used multispectral in remote sensing applications. However, highly correlated hyperspectral lead computational complexity, which limits many applications or traditional methods when applied data. The dimensionality reduction becomes one the most important pre-pro...

This paper gives an overview of three case studies in developing pure mathematical theory using ProofPower-HOL. The case studies, which currently cover a selection of basic material from the theories of real analysis, group theory and topology, expose some interesting issues for formalising mathematics.

We show that the two-stage adaptive Lasso procedure (Zou, 2006) is consistent for high-dimensional model selection in linear and Gaussian graphical models. Our conditions for consistency cover more general situations than those accomplished in previous work: we prove that restricted eigenvalue conditions (Bickel et al., 2008) are also sufficient for sparse structure estimation.