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.     

Excavations in molecular crystals

Single crystals built from porous molecular networks can react with agents that penetrate the crystals, cleave fragments from the network, and thereby increase the volume available for guests, all without loss of crystallinity.     

Initial Measurements of Plasma Potential in the Core of the MST Reversed Field Pinch with a Heavy Ion Beam Probe

Measurement of the plasma potential in the core of MST marks both the first interior potential measurements in an RFP, as well as the first measurements by a Heavy Ion Beam Probe (HIBP) in an RFP. The HIBP has operated with (20-110) keV sodium beams in plasmas with toroidal currents of (200-480) kA over a wide range of densities and magnetic equilibrium conditions. A positive plasma potential is measured in the core, consistent with the expectation of rapid electron transport by magnetic fluctuations and the formation of an outwardly directed ambipolar radial electric field. Comparison between the radial electric field and plasma flow is underway to determine the extent to which equilibrium flow is governed by E×B. Measurements of potential and density fluctuations are also in progress.Unlike HIBP applications in tokamak plasmas, the beam trajectories in MST (RFP) are both three-dimensional and temporally dynamic with magnetic equilibrium changes associated with sawteeth. This complication offers new opportunity for magnetic measurements via the Heavy Ion Beam Probe (HIBP). The ion orbit trajectories are included in a Grad-Shafranov toroidal equilibrium reconstruction, helping to measure the internal magnetic field and current profiles. Such reconstructions are essential to identifying the beam sample volume locations, and they are vital in MST's mission to suppress MHD tearing modes using current profile control techniques. Measurement of the electric field may be accomplished by combining single point measurements from multiple discharges, or by varying the injection angle of the beam during single discharges.The application of an HIBP on MST has posed challenges resulting in additional diagnostic advances. The requirement to keep ports small to avoid introducing magnetic field perturbations has led to the design and successful implementation of cross-over sweep systems. High levels of ultraviolet radiation are driving alternative methods of sweep plate operation. While, substantial levels of plasma flux into the HIBP diagnostic chambers has led to the use of magnetic plasma suppression.     

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.