Cost minimizing planning of container inspection and repair in multiple facilities.

A problem of optimal mid-term or long-term planning of inspection and repair of freight containers in multiple facilities is introduced and investigated. The containers are of different types and quality levels, which define their repair costs and workforce requirements. The objective function includes the total holding, inspection, repair, transportation and rejection costs.

Simplified partial digest problem: enumerative and dynamic programming algorithms.

We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense.

A computationally efficient method for accurately solving the EEG forward problem in a finely discretized head model.

Objective: Solution of the forward problem using realistic head models is necessary for accurate EEG source analysis. Realistic models are usually derived from volumetric magnetic resonance images that provide a voxel resolution of about 1 mm3. Electrical models could, therefore contain, for a normal adult head, over 4 million elements.