Master chemotherapy planning and clinicians rostering in a hospital outpatient cancer centre

Central European Journal of Operations Research - In the past years, the number of patients in need of chemotherapy treatments has been constantly increasing. Chemotherapy treatments must be...     

Sensitivity-enhanced IPAP experiments for measuring one-bond C–C and C–H residual dipolar couplings in proteins

Sensitivity-enhanced 2D IPAP experiments using the accordion principle for measuring one-bond 13C'-13Calpha and 1Halpha-13Calpha dipolar couplings in proteins are presented. The resolution of the resulting spectra is identical to that of the decoupled HSQC spectra and the sensitivity of the corresponding 1D acquisitions are only slightly lower than those obtained with 3D HNCO and 3D HN(COCA)HA pulse sequences due to an additional delay 2Delta. For cases of limited resolution in the 2D 15N-1HN HSQC spectrum the current pulse sequences can easily be modified into 3D versions by introducing a poorly digitized third dimension, if so desired. The experiments described here are a valuable addition to the suites available for determination of residual dipolar couplings in biological systems.     

Structure of norbornene-fused 3,1-oxazine double cycloadducts

Pentacyclic isoxazolines were obtained by the cycloaddition of benzonitrile oxide to norbornene-azetidinone-fused 3,1-oxazines. The constitutions of two of the isomers obtained, and the configurations and conformations of all products, were determined by means of ¹H and ¹³C NMR spectroscopy and DNOE experiments.     

Exact Max-SAT solvers for over-constrained problems

We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities. Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia. The second author is supported by a grant Ramón y Cajal.     

Semi-implicit complementary volume scheme for solving level set like equations in image processing and curve evolution

Summary. We introduce linear semi-implicit complementary volume numerical scheme for solving level set like nonlinear degenerate diffusion equations arising in image processing and curve evolution problems. We study discretization of image selective smoothing equation of mean curvature flow type given by Alvarez, Lions and Morel ([3]). Solution of the level set equation of Osher and Sethian ([26], \[30]) is also included in the study. We prove and estimates for the proposed scheme and give existence of its (generalized) solution in every discrete time-scale step. Efficiency of the scheme is given by its linearity and stability. Preconditioned iterative solvers are used for computing arising linear systems. We present computational results related to image processing and plane curve evolution. Received April 25, 2000 / Revised version received June 11, 2001 / Published online November 15, 2001