Evaluation of cacao (Theobroma cacao L.) clones against seven Colombian isolates of Moniliophthora roreri (Cif.) Evans et al., representing four major genetic groupings of the pathogen in cacao

Artificial pod inoculation was used to compare the relative aggressiveness of seven Colombian isolates of Moniliophthora roreri (the causal agent of moniliasis or frosty pod disease), representing four major genetic groupings of the pathogen in cacao (cocoa), when applied to five diverse cacao genotypes (ICS-1, ICS-95, TSH-565, SCC-61 and CAP-34) at La Suiza Experimental Farm, Santander Department, Colombia. The following variables were evaluated 9 weeks after inoculation of 2- to 3-month-old pods with spore suspensions (1.2 x 10(5) spores mL(-1)): (i) disease incidence (DI); (ii) external severity (ES); and (iii) internal severity (IS). IS was found to be of greatest value in classifying the reaction of the host genotype against M. roreri. Genetic variation reported between isolates and cacao genotypes was not matched by similar diversity in their aggressiveness. All isolates were generally highly aggressive against most cacao genotypes, with only two isolates showing reduced IS and ES reactions. There was considerable variation between clones in the IS and ES scores, but one cultivated clone (ICS-95) displayed a significant level of resistance against all seven isolates. This clone may be useful in cacao breeding initiatives for resistance to moniliasis of cacao.

Mono- and binuclear bipyridyl derivatives of the Mo(eta(3)-C3H5)(CO)(2) fragment: structural studies and fluxionality in solution

New mono- and binuclear complexes of the Mo(eta(3)-C3H5)(CO)(2) fragment, containing bipyridyl ligands (2,2'-bpy, 4,4'-Me-2-2,2'-bpy) as chelates, and mono- (4-CNpy, 4-Mepy, NCMe, Br) or bidentate nitrogen ligands (4,4'-bpy, bipyridylethylene, pyrazine) as terminal or bridging ligands, respectively, were prepared. The binuclear complex [{Mo(eta(3)-C3H5)(CO)(2)(2,2'-bpy)}(2)(mu-4,4'-bpy)][PF6](2) (2) was shown by X-ray diffraction to assemble in the crystal forming large channels with a rectangular section. A longer bridge, such as bipyridylethylene, led to a different structure (3). 4-CNpy behaved as monodentate ligand (4), coordinating through the pyridine nitrogen as a terminal ligand. NMR spectroscopy studies showed that the complexes exhibited a fluxional behavior in solution, the endo and exo forms of the more symmetrical equatorial isomers being usually present and interconverting in solution. The solid state structures of the complexes revealed a preference for the more symmetrical equatorial isomer, with the two chelate ligands in trans positions in the binuclear species. The rings tended to become parallel in the organized crystal. (C) 2003 Elsevier B.V. All rights reserved.

On a stochastic Trotter formula with application to spontaneous localization models

We consider the relation between so called continuous localization models—i.e. non-linear stochastic Schrödinger evolutions—and the discrete GRW-model of wave function collapse. The former can be understood as scaling limit of the GRW process. The proof relies on a stochastic Trotter formula, which is of interest in its own right. Our Trotter formula also allows to complement results on existence theory of stochastic Schrödinger evolutions by Holevo and Mora/Rebolledo.

Modeling bidding competitiveness and position performance in multi-attribute construction auctions

Currently, multi-attribute auctions are becoming widespread awarding mechanisms for contracts in construction, and in these auctions, criteria other than price are taken into account for ranking bidder proposals. Therefore, being the lowest-price bidder is no longer a guarantee of being awarded, thus increasing the importance of measuring any bidder’s performance when not only the first position (lowest price) matters. Modeling position performance allows a tender manager to calculate the probability curves related to the more likely positions to be occupied by any bidder who enters a competitive auction irrespective of the actual number of future participating bidders. This paper details a practical methodology based on simple statistical calculations for modeling the performance of a single bidder or a group of bidders, constituting a useful resource for analyzing one’s own success while benchmarking potential bidding competitors.

Efficiency of evolutionary algorithms in water network pipe sizing

The pipe sizing of water networks via evolutionary algorithms is of great interest because it allows the selection of alternative economical solutions that meet a set of design requirements. However, available evolutionary methods are numerous, and methodologies to compare the performance of these methods beyond obtaining a minimal solution for a given problem are currently lacking. A methodology to compare algorithms based on an efficiency rate (E) is presented here and applied to the pipe-sizing problem of four medium-sized benchmark networks (Hanoi, New York Tunnel, GoYang and R-9 Joao Pessoa). E numerically determines the performance of a given algorithm while also considering the quality of the obtained solution and the required computational effort. From the wide range of available evolutionary algorithms, four algorithms were selected to implement the methodology: a PseudoGenetic Algorithm (PGA), Particle Swarm Optimization (PSO), a Harmony Search and a modified Shuffled Frog Leaping Algorithm (SFLA). After more than 500,000 simulations, a statistical analysis was performed based on the specific parameters each algorithm requires to operate, and finally, E was analyzed for each network and algorithm. The efficiency measure indicated that PGA is the most efficient algorithm for problems of greater complexity and that HS is the most efficient algorithm for less complex problems. However, the main contribution of this work is that the proposed efficiency ratio provides a neutral strategy to compare optimization algorithms and may be useful in the future to select the most appropriate algorithm for different types of optimization problems.

The multiple team formation problem using sociometry

The Team Formation problem (TFP) has become a well-known problem in the OR literature over the last few years. In this problem, the allocation of multiple individuals that match a required set of skills as a group must be chosen to maximise one or several social positive attributes. Speci�cally, the aim of the current research is two-fold. First, two new dimensions of the TFP are added by considering multiple projects and fractions of people's dedication. This new problem is named the Multiple Team Formation Problem (MTFP). Second, an optimization model consisting in a quadratic objective function, linear constraints and integer variables is proposed for the problem. The optimization model is solved by three algorithms: a Constraint Programming approach provided by a commercial solver, a Local Search heuristic and a Variable Neighbourhood Search metaheuristic. These three algorithms constitute the first attempt to solve the MTFP, being a variable neighbourhood local search metaheuristic the most effi�cient in almost all cases. Applications of this problem commonly appear in real-life situations, particularly with the current and ongoing development of social network analysis. Therefore, this work opens multiple paths for future research.