Enzymatically-triggered, isothermally responsive polymers: re-programming poly(oligoethylene glycols) to respond to phosphatase

Polymers which can respond to externally applied stimuli have found much application in the biomedical field due to their (reversible) coil–globule transitions. Polymers displaying a lower critical solution temperature are the most commonly used, but for blood-borne (i.e., soluble) biomedical applications the application of heat is not always possible, nor practical. Here we report the design and synthesis of poly(oligoethylene glycol methacrylate)-based polymers whose cloud points are easily varied by alkaline phosphatase-mediated dephosphorylation. By fine-tuning the density of phosphate groups on the backbone, it was possible to induce an isothermal transition: A change in solubility triggered by removal of a small number of phosphate esters from the side chains activating the LCST-type response. As there was no temperature change involved, this serves as a model of a cell-instructed polymer response. Finally, it was found that both polymers were non cytotoxic against MCF-7 cells (at 1 mg·mL–1), which confirms promise for biomedical applications.

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

Bloom filters are a data structure for storing data in a compressed form. They offer excellent space and time efficiency at the cost of some loss of accuracy (so-called lossy compression). This work presents a yes-no Bloom filter, which as a data structure consisting of two parts: the yes-filter which is a standard Bloom filter and the no-filter which is another Bloom filter whose purpose is to represent those objects that were recognised incorrectly by the yes-filter (that is, to recognise the false positives of the yes-filter). By querying the no-filter after an object has been recognised by the yes-filter, we get a chance of rejecting it, which improves the accuracy of data recognition in comparison with the standard Bloom filter of the same total length. A further increase in accuracy is possible if one chooses objects to include in the no-filter so that the no-filter recognises as many as possible false positives but no true positives, thus producing the most accurate yes-no Bloom filter among all yes-no Bloom filters. This paper studies how optimization techniques can be used to maximize the number of false positives recognised by the no-filter, with the constraint being that it should recognise no true positives. To achieve this aim, an Integer Linear Program (ILP) is proposed for the optimal selection of false positives. In practice the problem size is normally large leading to intractable optimal solution. Considering the similarity of the ILP with the Multidimensional Knapsack Problem, an Approximate Dynamic Programming (ADP) model is developed making use of a reduced ILP for the value function approximation. Numerical results show the ADP model works best comparing with a number of heuristics as well as the CPLEX built-in solver (B&B), and this is what can be recommended for use in yes-no Bloom filters. In a wider context of the study of lossy compression algorithms, our researchis an example showing how the arsenal of optimization methods can be applied to improving the accuracy of compressed data.

Reappraisal of the effective elastic thickness for the sub-Andes using 3-D finite element flexural modelling, gravity and geological constraints

P>Estimates of effective elastic thickness (T(e)) for the western portion of the South American Plate using, independently, forward flexural modelling and coherence analysis, suggest different thermomechanical properties for the same continental lithosphere. We present a review of these T(e) estimates and carry out a critical reappraisal using a common methodology of 3-D finite element method to solve a differential equation for the bending of a thin elastic plate. The finite element flexural model incorporates lateral variations of T(e) and the Andes topography as the load. Three T(e) maps for the entire Andes were analysed: Stewart & Watts (1997), Tassara et al. (2007) and Perez-Gussinye et al. (2007). The predicted flexural deformation obtained for each T(e) map was compared with the depth to the base of the foreland basin sequence. Likewise, the gravity effect of flexurally induced crust-mantle deformation was compared with the observed Bouguer gravity. T(e) estimates using forward flexural modelling by Stewart & Watts (1997) better predict the geological and gravity data for most of the Andean system, particularly in the Central Andes, where T(e) ranges from greater than 70 km in the sub-Andes to less than 15 km under the Andes Cordillera. The misfit between the calculated and observed foreland basin subsidence and the gravity anomaly for the Maranon basin in Peru and the Bermejo basin in Argentina, regardless of the assumed T(e) map, may be due to a dynamic topography component associated with the shallow subduction of the Nazca Plate beneath the Andes at these latitudes.

Perinatal salt restriction: A new pathway to programming adiposity indices in adult female Wistar rats

Low birth weight has been associated with increased obesity in adulthood. It has been shown that dietary salt restriction during intrauterine life induces low birth weight and insulin resistance in adult Wistar rats. The present study had a two-fold objective: to evaluate the effects that low salt intake during pregnancy and lactation has on the amount and distribution of adipose tissue; and to determine whether the phenotypic changes in fat mass in this model are associated with alterations in the activity of the renin-angiotensin system. Maternal salt restriction was found to reduce birth weight in male and female offspring. In adulthood, the female offspring of dams fed the low-salt diet presented higher adiposity indices than those seen in the offspring of dams fed a normal-salt diet. This was attributed to the fact that adipose tissue mass (retroperitoneal but not gonadal, mesenteric or inguinal) was greater in those rats than in the offspring of dams fed a normal diet. The adult offspring of dams fed the low-salt diet, compared to those dams fed a normal-salt diet, presented the following: plasma leptin levels higher in males and lower in females; plasma renin activity higher in males but not in females; and no differences in body weight, mean arterial blood pressure or serum angiotensin-converting enzyme activity. Therefore, low salt intake during pregnancy might lead to the programming of obesity in adult female offspring. (c) 2009 Elsevier Inc. All rights reserved.

The competing roles of extensional viscosity and normal stress differences in complex flows of elastic liquids

In various attempts to relate the behaviour of highly-elastic liquids in complex flows to their rheometrical behaviour, obvious candidates for study have been the variation of shear viscosity with shear rate, the two normal stress differences N(1) and N(2) especially N(1), and the extensional viscosity eta(E). In this paper, we shall be mainly interested in `constant-viscosity` Boger fluids, and, accordingly, we shall limit attention to N(1) and eta(E). We shall concentrate on two important flows - axisymmetric contraction flow and ""splashing"" (particularly that which arises when a liquid drop falls onto the free Surface of the same liquid). Modem numerical techniques are employed to provide the theoretical predictions. It is shown that the two obvious manifestations of viscoelastic rheometrical behaviour can sometimes be opposing influences in determining flow characteristics. Specifically, in an axisymmetric contraction flow, high eta(E) , can retard the flow, whereas high N(1) can have the opposite effect. In the splashing experiment, high eta(E) can certainly reduce the height of the so-called Worthington jet, thus confirming some early suggestions, but, again, other rheometrical influences can also have a role to play and the overall picture may not be as clear as it was once envisaged.

An integer linear programming approach for approximate string comparison

We introduce a problem called maximum common characters in blocks (MCCB), which arises in applications of approximate string comparison, particularly in the unification of possibly erroneous textual data coming from different sources. We show that this problem is NP-complete, but can nevertheless be solved satisfactorily using integer linear programming for instances of practical interest. Two integer linear formulations are proposed and compared in terms of their linear relaxations. We also compare the results of the approximate matching with other known measures such as the Levenshtein (edit) distance. (C) 2008 Elsevier B.V. All rights reserved.

Influence of the halo upon angular distributions for elastic scattering and breakup

The angular distributions for elastic scattering and breakup of halo nuclei are analysed using a near-side/far-side decomposition within the framework of the dynamical eikonal approximation. This analysis is performed for (11)Be impinging on Pb at 69 MeV/nucleon. These distributions exhibit very similar features. In particular they are both near-side dominated, as expected from Coulomb-dominated reactions. The general shape of these distributions is sensitive mostly to the projectile-target interactions, but is also affected by the extension of the halo. This suggests the elastic scattering not to be affected by a loss of flux towards the breakup channel. (C) 2010 Elsevier B.V. All rights reserved.

Challenging measurement of the (16)O+(27)Al elastic and inelastic angular distributions up to large angles

The (16)O+(27)Al elastic and inelastic angular distributions have been measured in a broad angular range (13 degrees < theta(lab) < 52 degrees) at about 100 MeV incident energy. The use of the MAGNEX large acceptance magnetic spectrometer and of the ray-reconstruction analysis technique has been crucial in order to provide, in the same experiment, high-resolution energy spectra and cross-section measurements distributed over more than seven orders of magnitude down to hundreds of nb/sr. (C) 2011 Elsevier B.V. All rights reserved.

Effect on the heavy-ion fusion and elastic scattering cross sections of common approximations assumed in coupled-channel calculations

We study the effects of several approximations commonly used in coupled-channel analyses of fusion and elastic scattering cross sections. Our calculations are performed considering couplings to inelastic states in the context of the frozen approximation, which is equivalent to the coupled-channel formalism when dealing with small excitation energies. Our findings indicate that, in some cases, the effect of the approximations on the theoretical cross sections can be larger than the precision of the experimental data.

Study of (9)Be+(12)C elastic scattering at energies near the Coulomb barrier

In this work, angular distribution measurements for the elastic channel were performed for the (9)Be + (12)C reaction at the energies E(Lab) = 13.0, 14.5, 17.3, 19.0 and 21.0 MeV, near the Coulomb barrier. The data have been analyzed in the framework of the double folding Sao Paulo potential. The experimental elastic scattering angular distributions were well described by the optical potential at forward angles for all measured energies. However, for the three highest energies, an enhancement was observed for intermediate and backward angles. This can be explained by the elastic transfer mechanism. (C) 2011 Elsevier B.V. All rights reserved.

Elastic scattering of a proton-halo nucleus: (8)B+(58)Ni

The elastic channel of the (8)B + (58)Ni system has been measured at energies around the Coulomb barrier. An optical potential fi to the experimental angular distributions is obtained. The total reaction cross section consistent with the obtained potential is reported and possible deviations from normal behaviour are discussed.

Proximal methods for nonlinear programming: double regularization and inexact subproblems

This paper describes the first phase of a project attempting to construct an efficient general-purpose nonlinear optimizer using an augmented Lagrangian outer loop with a relative error criterion, and an inner loop employing a state-of-the art conjugate gradient solver. The outer loop can also employ double regularized proximal kernels, a fairly recent theoretical development that leads to fully smooth subproblems. We first enhance the existing theory to show that our approach is globally convergent in both the primal and dual spaces when applied to convex problems. We then present an extensive computational evaluation using the CUTE test set, showing that some aspects of our approach are promising, but some are not. These conclusions in turn lead to additional computational experiments suggesting where to next focus our theoretical and computational efforts.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.