Multiple Sclerosis Detection in Multispectral Magnetic Resonance Images with Principal Components Analysis

This paper presents a local feature vector based method for automated Multiple Sclerosis (MS) lesion segmentation of multi spectral MRI data. Twenty datasets from MS patients with FLAIR, T1,T2, MD and FA data with expert annotations are available as training set from the MICCAI 2008 challenge on MS, and 24 test datasets. Our local feature vector method contains neighbourhood voxel intensities, histogram and MS probability atlas information. Principal Component Analysis(PCA) with log-likelihood ratio is used to classify each voxel. MRI suffers from intensity inhomogenities. We try to correct this 'bias field' with 3 methods: a genetic algorithm, edge preserving filtering and atlas based correction. A large observer variability exist between expert classifications, but the similarity scores between model and expert classifications are often lower. Our model gives the best classification results with raw data, because bias correction gives artifacts at the edges and flatten large MS lesions

Optimising halting station of passenger railway lines

In many real life passenger railway networks, the types of stations and lines characterisethe halting stations of the train lines. Common types are Regional, Interregional or Intercity.This paper considers the problem of altering the halts of lines by both upgrading and downgrading stations, such that this results in less total travel time. We propose a combination of reduction methods, Lagrangian relaxation, and a problem-specific multiplier adjustment algorithm to solve the presented mixed integer linear programming formulation. A computational study of several real-life instances based on problem data of the Dutch passenger railway operator NS Reizigers is included.mathematical economics and econometrics ;

Identifying industry defined best practices within educational YouTube content, an exploratory study

Master's Project (M.A.) University of Alaska Fairbanks, 201

Climbing the African energy ladder::internal and external factors influencing household demand for improved cookstoves and modern fuels in sub-Saharan Africa

Brouwer, R. [Promotor]Beukering, P.J.H. van [Copromotor

Conceptual Modeling Applied to Genomics: Challenges Faced in Data Loading

Todays genomic domain evolves around insecurity: too many imprecise concepts, too much information to be properly managed. Considering that conceptualization is the most exclusive human characteristic, it makes full sense to try to conceptualize the principles that guide the essence of why humans are as we are. This question can of course be generalized to any species, but we are especially interested in this work in showing how conceptual modeling is strictly required to understand the ''execution model'' that human beings ''implement''. The main issue is to defend the idea that only by having an in-depth knowledge of the Conceptual Model that is associated to the Human Genome, can this Human Genome properly be understood. This kind of Model-Driven perspective of the Human Genome opens challenging possibilities, by looking at the individuals as implementation of that Conceptual Model, where different values associated to different modeling primitives will explain the diversity among individuals and the potential, unexpected variations together with their unwanted effects in terms of illnesses. This work focuses on the challenges faced in loading data from conventional resources into Information Systems created according to the above mentioned conceptual modeling approach. The work reports on various loading efforts, problems encountered and the solutions to these problems. Also, a strong argument is made about why conventional methods to solve the so called `data chaos¿ problems associated to the genomics domain so often fail to meet the demands.Van Der Kroon ., M. (2011). Conceptual Modeling Applied to Genomics: Challenges Faced in Data Loading. http://hdl.handle.net/10251/16993Archivo delegad

Allocation of Railway Rolling Stock for Passenger Trains

For a commercially operating railway company, providing a high level of service for the passengers is of utmost importance. The latter requires a high punctuality of the trains and an adequate rolling stock capacity. Unfortunately, the latter is currently (2002) one of the bottlenecks in the service provision by the main Dutch railway operator NS Reizigers. Especially during the morning rush hours, many passengers cannot be transported according to the usual service standards due to a shortage of the rolling stock capacity. On the other hand, a more effective allocation of the available rolling stock capacity seems to be feasible, since there are also several trains with some slack capacity. The effectiveness of the rolling stock capacity is determined mainly by the allocation of the train types and subtypes to the lines. Therefore, we describe in this paper a model that can be used to find an optimal allocation of train types and subtypes to train series. This optimal allocation is more effective than the manually planned one, which is accomplished by minimizing the shortages of capacity during the rush hours. The model is implemented in the modeling language OPL Studio 3.1, solved by CPLEX 7.0, and tested on several scenarios based on the 2001-2002 timetable of NS Reizigers. The results of the model were received positively, both by the planners and by the management in practice, since these results showed that a significant service improvement over the manually planned allocation can be achieved within a shorter throughput time of the involved part of the planning process.operations research;transportation;railways;capacity allocation;rolling stock

Applying Operations Research techniques to planning of train shunting

In this paper, we discuss a model-based algorithmic approach for supporting planners in the creation of shunt plans for passenger trains. The approach provides an example of a mathematical model and a corresponding solution approach for model based support. We introduce a four-step solution approach and we discuss how the planners are supported by this approach. Finally, we present computational results for these steps and give some suggestions for further research.A* search;railway optimization;real world application;routing