On the Number of Type Change Loci of a Generalized Complex Structure

In this note, we describe a procedure to construct generalized complex structures whose type change locus has arbitrarily many path components on products of the circle with a connected sum of closed 3-manifolds. As an application, we use the procedure to exhibit such geometric structures on a myriad of simply connected 4-manifolds among many others.     

Symmetric periodic solutions in the Sitnikov problem

An elementary method to prove the existence of odd periodic solutions with a prescribed number of zeros is presented. In some cases it is also possible to prove the uniqueness of this solution. The method combines shooting arguments with Sturm comparison theory and can be applied to a large class of nonlinear oscillators. In particular, this class includes the Sitnikov problem, a well-known restricted three body problem.     

A Simple Strategy to Improve the Accuracy of the Injection Step in Batch Injection Analysis Systems with Amperometric Detection

In this study, we describe for the first time the application of an internal standard method to compensate for random errors associated with the injection procedure in batch injection analysis (BIA) systems with multiple pulse amperometric detection. A sequence of potential pulses was selected in such a way that the internal standard (IS) compound was detected individually at one potential pulse and both the IS and analyte, were detected at another potential pulse. The current ratio (I_IS+analyte/I_IS) was used in the construction of the calibration curve and then to compensate for random errors. The use of disposable syringes or manual pipettes in BIA systems increases the robustness of the method and dispenses with skilled operators.     

Integer programming techniques for the nurse rostering problem

This work presents integer programming techniques to tackle the problem of the International Nurse Rostering Competition. Starting from a compact and monolithic formulation in which the current generation of solvers performs poorly, improved cut generation strategies and primal heuristics are proposed and evaluated. A large number of computational experiments with these techniques produced the following results: the optimality of the vast majority of instances was proved, the best known solutions were improved by up to 15 % and strong dual bounds were obtained. In the spirit of reproducible science, all code was implemented using the Computational Infrastructure for Operations Research.     

Acid-Basic and Complexing Properties of Compounds with a C(X)NHP(Y) Fragments

Abstract

N-(thio)carbonyl(thio)amidophosphates, their open-chain and crown-containing analogues with a C (X) NHP (Y) fragments are NH acids with pKa 8–11 and the effective complexing agents for “soft” ion metals.