Win X-ray: a new Monte Carlo program that computes X-ray spectra obtained with a scanning electron microscope.

A new Monte Carlo program, Win X-ray, is presented that predicts X-ray spectra measured with an energy dispersive spectrometer (EDS) attached to a scanning electron microscope (SEM) operating between 10 and 40 keV. All the underlying equations of the Monte Carlo simulation model are included. By simulating X-ray spectra, it is possible to establish the optimum conditions to perform a specific analysis as well as establish detection limits or explore possible peak overlaps. Examples of simulations are also presented to demonstrate the utility of this new program. Although this article concentrates on the simulation of spectra obtained from what are considered conventional thick samples routinely explored by conventional microanalysis techniques, its real power will be in future refinements to address the analysis of sample classifications that include rough surfaces, fine structures, thin films, and inclined surfaces because many of these can be best characterized by Monte Carlo methods. The first step, however, is to develop, refine, and validate a viable Monte Carlo program for simulating spectra from conventional samples.     

Synthesis of homoceramides, novel ceramide analogues, and their lack of effect on the growth of hippocampal neurons

The synthesis of a new series of D-erythro-homoceramide analogues is described. Several synthetic approaches were investigated. Homoceramides can be successfully synthesized from L-homoserine as chiral building block and a protected Weinreb-amide as a key intermediate. The synthesis of short-chain analogues with a heptyl side chain, as well as with a phenyl residue in the sphingoid part (instead of the naturally occurring tridecyl side chain), was effected. The homoceramides 15-17 and 24 were investigated for their potential to reverse the inhibitory effect of fumonisin B(1) on axonal growth. Unfortunately, none of the tested compounds showed any biological activity due to their lack of metabolism to glucosylhomoceramide.     

On the minimum volume simplex enclosure problem for estimating a linear mixing model

We describe the minimum volume simplex enclosure problem (MVSEP), which is known to be a global optimization problem, and further investigate its multimodality. The problem is a basis for several (unmixing) methods that estimate so-called endmembers and fractional values in a linear mixing model. We describe one of the estimation methods based on MVSEP. We show numerically that using nonlinear optimization local search leads to the estimation results aimed at. This is done using examples, designing instances and comparing the outcomes with a maximum volume enclosing simplex approach which is used frequently in unmixing data.     

On determining the cover of a simplex by spheres centered at its vertices

The aim of this work is to study the Simplex Cover (SC) problem, which is to determine whether a given simplex is covered by spheres centered at its vertices. We show that the SC problem is equivalent to a global optimization problem. We investigate its characteristics.     

On parallel Branch and Bound frameworks for Global Optimization

Branch and Bound (B&B) algorithms are known to exhibit an irregularity of the search tree. Therefore, developing a parallel approach for this kind of algorithms is a challenge. The efficiency of a B&B algorithm depends on the chosen Branching, Bounding, Selection, Rejection, and Termination rules. The question we investigate is how the chosen platform consisting of programming language, used libraries, or skeletons influences programming effort and algorithm performance. Selection rule and data management structures are usually hidden to programmers for frameworks with a high level of abstraction, as well as the load balancing strategy, when the algorithm is run in parallel. We investigate the question by implementing a multidimensional Global Optimization B&B algorithm with the help of three frameworks with a different level of abstraction (from more to less): Bobpp, Threading Building Blocks (TBB), and a customized Pthread implementation. The following has been found. The Bobpp implementation is easy to code, but exhibits the poorest scalability. On the contrast, the TBB and Pthread implementations scale almost linearly on the used platform. The TBB approach shows a slightly better productivity.     

Application of stochastic programming to reduce uncertainty in quality-based supply planning of slaughterhouses

To match products of different quality with end market preferences under supply uncertainty, it is crucial to integrate product quality information in logistics decision making. We present a case of this integration in a meat processing company that faces uncertainty in delivered livestock quality. We develop a stochastic programming model that exploits historical product quality delivery data to produce slaughterhouse allocation plans with reduced levels of uncertainty in received livestock quality. The allocation plans generated by this model fulfil demand for multiple quality features at separate slaughterhouses under prescribed service levels while minimizing transportation costs. We test the model on real world problem instances generated from a data set provided by an industrial partner. Results show that historical farmer delivery data can be used to reduce uncertainty in quality of animals to be delivered to slaughterhouses.