In Vitro and In Vivo Antiplasmodial Activities of Risedronate and Its Interference with Protein Prenylation in Plasmodium falciparum

The increasing resistance of malarial parasites to almost all available drugs calls for the identification of new compounds and the detection of novel targets. Here, we establish the antimalarial activities of risedronate, one of the most potent bisphosphonates clinically used to treat bone resorption diseases, against blood stages of Plasmodium falciparum (50% inhibitory concentration [IC(50)] of 20.3 +/- 1.0 mu M). We also suggest a mechanism of action for risedronate against the intraerythrocytic stage of P. falciparum and show that protein prenylation seems to be modulated directly by this drug. Risedronate inhibits the transfer of the farnesyl pyrophosphate group to parasite proteins, an effect not observed for the transfer of geranylgeranyl pyrophosphate. Our in vivo experiments further demonstrate that risedronate leads to an 88.9% inhibition of the rodent parasite Plasmodium berghei in mice on the seventh day of treatment; however, risedronate treatment did not result in a general increase of survival rates.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Efficient bulk-loading on dynamic metric access methods

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.

Benders, metric and cutset inequalities for multicommodity capacitated network design

Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme rays are metric inequalities. We also show how to strengthen Benders inequalities associated to non-extreme rays to obtain metric inequalities. We show that cutset inequalities are Benders inequalities, but not necessarily metric inequalities. We give a necessary and sufficient condition for a cutset inequality to be a metric inequality. Computational experiments show the effectiveness of strengthening Benders and cutset inequalities to obtain metric inequalities.

The C(K, X) spaces for compact metric spaces K and X with a uniformly convex maximal factor

In this paper, we prove that if a Banach space X contains some uniformly convex subspace in certain geometric position, then the C(K, X) spaces of all X-valued continuous functions defined on the compact metric spaces K have exactly the same isomorphism classes that the C(K) spaces. This provides a vector-valued extension of classical results of Bessaga and Pelczynski (1960) [2] and Milutin (1966) [13] on the isomorphic classification of the separable C(K) spaces. As a consequence, we show that if 1 < p < q < infinity then for every infinite countable compact metric spaces K(1), K(2), K(3) and K(4) are equivalent: (a) C(K(1), l(p)) circle plus C(K(2), l(q)) is isomorphic to C(K(3), l(p)) circle plus (K(4), l(q)). (b) C(K(1)) is isomorphic to C(K(3)) and C(K(2)) is isomorphic to C(K(4)). (C) 2011 Elsevier Inc. All rights reserved.

On the semi-Riemannian bumpy metric theorem

We prove the semi-Riemannian bumpy metric theorem using equivariant variational genericity. The theorem states that, on a given compact manifold M, the set of semi-Riemannian metrics that admit only nondegenerate closed geodesics is generic relatively to the C(k)-topology, k=2, ..., infinity, in the set of metrics of a given index on M. A higher-order genericity Riemannian result of Klingenberg and Takens is extended to semi-Riemannian geometry.

The Wijsman hyperspace of a metric hereditarily Baire space is Baire

In this paper, we show that the Wijsman hyperspace of a metric hereditarily Baire space is Baire. This solves a recent question posed by Zsilinszky. (C) 2009 Elsevier B.V. All rights reserved.

Quantified Interference: Information Theory and Information Flow

The paper investigates which of Shannon’s measures (entropy, conditional entropy, mutual information) is the right one for the task of quantifying information flow in a programming language. We examine earlier relevant contributions from Denning, McLean and Gray and we propose and motivate a specific quantitative definition of information flow. We prove results relating equivalence relations, interference of program variables, independence of random variables and the flow of confidential information. Finally, we show how, in our setting, Shannon’s Perfect Secrecy theorem provides a sufficient condition to determine whether a program leaks confidential information.

Weed interference on maize (Zea mays) under no tillage system

A field trial was carried out in Brazil in March 2002 with the aim to evaluate the effects of different timing and extension of weedy period on maize productivity. The hybrid Pioneer 30K75 was sowed under 7 t ha(-1) mulching promoted by glyphosate spraying. The treatments were divided in two groups: In the first group, weeds were maintained since the maize sowing until different periods in the crop cycle: 0, 14, 28, 42, 56, 70, and 150 days (harvesting time). In the second group, the maize crop was kept weed free for the same periods of the first group. Weed control was done through hand hoeing. A complete randomized blocks experimental design with five replications was used for plots distribution in the field. Nonlinear regression model was used to study the effects of weedy or weedfree periods on maize productivity. Weed community included 13 families and 31 species. Asteraceae, Poaceae, and Euphorbiaceae were the most abundant families. Results showed that under no tillage condition with 7 t ha-1 mulching at sowing time, the maize crop could cohabit with weed community for 54 days without any yield lost. on the other hand, if the crop was kept weed free for 27 days, the weed interference was not enable to reduce maize production. According to these results one weed control measure between 27 and 54 days after crop emergence could be enough to avoid any reduction in maize productivity.