Azasugar inhibitors as pharmacological chaperones for Krabbe disease

Krabbe disease is a devastating neurodegenerative disorder characterized by rapid demyelination of nerve fibers. This disease is caused by defects in the lysosomal enzyme β-galactocerebrosidase (GALC), which hydrolyzes the terminal galactose from glycosphingolipids. These lipids are essential components of eukaryotic cell membranes: substrates of GALC include galactocerebroside, the primary lipid component of myelin, and psychosine, a cytotoxic metabolite. Mutations of GALC that cause misfolding of the protein may be responsive to pharmacological chaperone therapy (PCT), whereby small molecules are used to stabilize these mutant proteins, thus correcting trafficking defects and increasing residual catabolic activity in cells. Here we describe a new approach for the synthesis of galacto-configured azasugars and the characterization of their interaction with GALC using biophysical, biochemical and crystallographic methods. We identify that the global stabilization of GALC conferred by azasugar derivatives, measured by fluorescence-based thermal shift assays, is directly related to their binding affinity, measured by enzyme inhibition. X-ray crystal structures of these molecules bound in the GALC active site reveal which residues participate in stabilizing interactions, show how potency is achieved and illustrate the penalties of aza/iminosugar ring distortion. The structure–activity relationships described here identify the key physical properties required of pharmacological chaperones for Krabbe disease and highlight the potential of azasugars as stabilizing agents for future enzyme replacement therapies. This work lays the foundation for new drug-based treatments of Krabbe disease.     

Stereocontrolled spirocyclic bislactams derived from pyroglutamic acid

The synthesis of rigid spirocyclic bislactams derived from pyroglutamic acid has been established.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Dubrovin valuation rings and Henselization

Supported in part by the National Science Foundation     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.     

Singular terms of helicity amplitudes at one loop in QCD and the soft limit of the cross sections of multi-parton processes

We describe a general method that enables us to obtain all the singular terms of helicity amplitudes of n-parton processes at one loop. The algorithm uses helicity amplitudes at tree level and simple color algebra. We illustrate the method by calculating the singular part of the one-loop helicity amplitudes of all 2 → 3 parton subprocesses. The results are used to derive the soft gluon limit of the cross sections of all 2 → 4 parton scattering subprocesses which provide a useful initial condition for the angular ordering approximation to coherent multiple soft gluon emission, incorporated in existing Monte Carlo simulation programs.     

Maximin share and minimax envy in fair-division problems

For fair-division or cake-cutting problems with value functions which are normalized positive measures (i.e., the values are probability measures) maximin-share and minimax-envy inequalities are derived for both continuous and discrete measures. The tools used include classical and recent basic convexity results, as well as ad hoc constructions. Examples are given to show that the envy-minimizing criterion is not Pareto optimal, even if the values are mutually absolutely continuous. In the discrete measure case, sufficient conditions are obtained to guarantee the existence of envy-free partitions.     

Iterative regularization methods for atmospheric remote sensing

In this paper we present different inversion algorithms for nonlinear ill-posed problems arising in atmosphere remote sensing. The proposed methods are Landweber's method (LwM), the iteratively regularized Gauss-Newton method, and the conventional and regularizing Levenberg-Marquardt method. In addition, some accelerated LwMs and a technique for smoothing the Levenberg-Marquardt solution are proposed. The numerical performance of the methods is studied by means of simulations. Results are presented for an inverse problem in atmospheric remote sensing, i.e., temperature sounding with an airborne uplooking high-resolution far-infrared spectrometer.     

On two theorems for flat,affine group schemes over a discrete valuation ring

We include short and elementary proofs of two theorems that characterize reductive group schemes over a discrete valuation ring, in a slightly more general context.