Novel 6-methanesulfonamide-3,4-methylenedioxyphenyl-N-acylhydrazones: Orally effective anti-inflammatory drug candidates

We described herein the molecular design of novel in vivo anti-inflammatory 6-methanesulfonamide-3,4-methylenedioxyphenyl-N-acylhydrazone derivatives (1) planned by applying the molecular hybridization approach. This work also points out to the discovery of LASSBio-930 (1c) as a novel anti-inflammatory and anti-hyperalgesic prototype, which was able to reduce carrageenan-induced rat paw edema with an ED(50) of 97.8 mu mol/kg, acting mainly as a non-selective COX inhibitor. (C) 2009 Elsevier Ltd. All rights reserved.

The fluorescence detector of the Pierre Auger Observatory

The Pierre Auger Observatory is a hybrid detector for ultra-high energy cosmic rays. It combines a surface array to measure secondary particles at ground level together with a fluorescence detector to measure the development of air showers in the atmosphere above the array. The fluorescence detector comprises 24 large telescopes specialized for measuring the nitrogen fluorescence caused by charged particles of cosmic ray air showers. In this paper we describe the components of the fluorescence detector including its optical system, the design of the camera, the electronics, and the systems for relative and absolute calibration. We also discuss the operation and the monitoring of the detector. Finally, we evaluate the detector performance and precision of shower reconstructions. (C) 2010 Elsevier B.V All rights reserved.

Exact penalties for variational inequalities with applications to nonlinear complementarity problems

In this paper, we present a new reformulation of the KKT system associated to a variational inequality as a semismooth equation. The reformulation is derived from the concept of differentiable exact penalties for nonlinear programming. The best theoretical results are presented for nonlinear complementarity problems, where simple, verifiable, conditions ensure that the penalty is exact. We close the paper with some preliminary computational tests on the use of a semismooth Newton method to solve the equation derived from the new reformulation. We also compare its performance with the Newton method applied to classical reformulations based on the Fischer-Burmeister function and on the minimum. The new reformulation combines the best features of the classical ones, being as easy to solve as the reformulation that uses the Fischer-Burmeister function while requiring as few Newton steps as the one that is based on the minimum.

Global minimization using an Augmented Lagrangian method with variable lower-level constraints

A novel global optimization method based on an Augmented Lagrangian framework is introduced for continuous constrained nonlinear optimization problems. At each outer iteration k the method requires the epsilon(k)-global minimization of the Augmented Lagrangian with simple constraints, where epsilon(k) -> epsilon. Global convergence to an epsilon-global minimizer of the original problem is proved. The subproblems are solved using the alpha BB method. Numerical experiments are presented.

New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.

Second-order negative-curvature methods for box-constrained and general constrained optimization

A Nonlinear Programming algorithm that converges to second-order stationary points is introduced in this paper. The main tool is a second-order negative-curvature method for box-constrained minimization of a certain class of functions that do not possess continuous second derivatives. This method is used to define an Augmented Lagrangian algorithm of PHR (Powell-Hestenes-Rockafellar) type. Convergence proofs under weak constraint qualifications are given. Numerical examples showing that the new method converges to second-order stationary points in situations in which first-order methods fail are exhibited.

Efficient solutions to factored MDPs with imprecise transition probabilities

When modeling real-world decision-theoretic planning problems in the Markov Decision Process (MDP) framework, it is often impossible to obtain a completely accurate estimate of transition probabilities. For example, natural uncertainty arises in the transition specification due to elicitation of MOP transition models from an expert or estimation from data, or non-stationary transition distributions arising from insufficient state knowledge. In the interest of obtaining the most robust policy under transition uncertainty, the Markov Decision Process with Imprecise Transition Probabilities (MDP-IPs) has been introduced to model such scenarios. Unfortunately, while various solution algorithms exist for MDP-IPs, they often require external calls to optimization routines and thus can be extremely time-consuming in practice. To address this deficiency, we introduce the factored MDP-IP and propose efficient dynamic programming methods to exploit its structure. Noting that the key computational bottleneck in the solution of factored MDP-IPs is the need to repeatedly solve nonlinear constrained optimization problems, we show how to target approximation techniques to drastically reduce the computational overhead of the nonlinear solver while producing bounded, approximately optimal solutions. Our results show up to two orders of magnitude speedup in comparison to traditional ""flat"" dynamic programming approaches and up to an order of magnitude speedup over the extension of factored MDP approximate value iteration techniques to MDP-IPs while producing the lowest error of any approximation algorithm evaluated. (C) 2011 Elsevier B.V. All rights reserved.

Improving ultimate convergence of an augmented Lagrangian method

Optimization methods that employ the classical Powell-Hestenes-Rockafellar augmented Lagrangian are useful tools for solving nonlinear programming problems. Their reputation decreased in the last 10 years due to the comparative success of interior-point Newtonian algorithms, which are asymptotically faster. In this research, a combination of both approaches is evaluated. The idea is to produce a competitive method, being more robust and efficient than its `pure` counterparts for critical problems. Moreover, an additional hybrid algorithm is defined, in which the interior-point method is replaced by the Newtonian resolution of a Karush-Kuhn-Tucker (KKT) system identified by the augmented Lagrangian algorithm. The software used in this work is freely available through the Tango Project web page:http://www.ime.usp.br/similar to egbirgin/tango/.

Paper surfaces and dynamical limits

It is very common in mathematics to construct surfaces by identifying the sides of a polygon together in pairs: For example, identifying opposite sides of a square yields a torus. In this article the construction is considered in the case where infinitely many pairs of segments around the boundary of the polygon are identified. The topological, metric, and complex structures of the resulting surfaces are discussed: In particular, a condition is given under which the surface has a global complex structure (i.e., is a Riemann surface). In this case, a modulus of continuity for a uniformizing map is given. The motivation for considering this construction comes from dynamical systems theory: If the modulus of continuity is uniform across a family of such constructions, each with an iteration defined on it, then it is possible to take limits in the family and hence to complete it. Such an application is briefly discussed.

On a product formula for the Conley-Zelmder index of symplectic paths and its applications

Using invariance by fixed-endpoints homotopies and a generalized notion of symplectic Cayley transform, we prove a product formula for the Conley-Zehnder index of continuous paths with arbitrary endpoints in the symplectic group. We discuss two applications of the formula, to the metaplectic group and to periodic solutions of Hamiltonian systems.

On a Gromoll-Meyer type theorem in globally hyperbolic stationary spacetimes

Following the lines of the celebrated Riemannian result of Gromoll and Meyer, we use infinite dimensional equivariant Morse theory to establish the existence of infinitely many geometrically distinct closed geodesics in a class of globally hyperbolic stationary Lorentzian manifolds.

A novel nanostructured composite formed by interaction of copper octa(3-aminopropyl)octasilsesquioxane with azide ligands: Preparation, characterization and a voltammetric application

This study presents the preparation, characterization and application of copper octa(3-aminopropyl)octasilsesquioxane following its subsequent reaction with azide ions (ASCA). The precursor (AC) and the novel compound (ASCA) were characterized by Fourier transform infrared spectra (FTIR), nuclear magnetic resonance (NMR), electron paramagnetic resonance (EPR), scanning electronic microscopy (SEM), X-ray diffraction (XRD), Thermogravimetric analyses and voltammetric technique. The cyclic voltammogram of the modified graphite paste electrode with ASCA (GPE-ASCA), showed one redox couple with formal potential (E(1/2)(ox)) = 0.30 V and an irreversible process at 1.1 V (vs. Ag/AgCl; NaCl 1.0 M; v = 20 mV s(-1)). The material is very sensitive to nitrite concentrations. The modified graphite paste electrode (GPE-ASCA) gives a linear range from 1.0 x 10(-4) to 4.0 x 10(-3) mol L(-1) for the determination of nitrite, with a detection limit of 2.1 x 10(-4) mol L(-1) and the amperometric sensitivity of 8.04 mA/mol L(-1). (C) 2010 Elsevier Ltd. All rights reserved.