A general route for the stereoselective synthesis of (E)-(1-propenyl)phenyl esters by catalytic CC bond isomerization

A general and efficient procedure for the stereoselective synthesis of (E)-(1-propenyl)phenyl esters from readily accessible allylphenols has been developed. The process involves a two-step sequence consisting of the initial acylation of the allylphenols with an acid chloride, followed by catalytic CC bond isomerization in the resulting allylphenyl esters. The latter step was performed in methanol at 80 °C using catalytic amounts (0.5 mol %) of the commercially available bis(allyl)-ruthenium(IV) dimer [{RuCl(μ-Cl)(η³:η³-C₁₀H₁₆)}₂] (C₁₀H₁₆=2,7-dimethylocta-2,6-diene-1,8-diyl). Reactions proceeded in high yields (68–93%) and short times (4–9 h) with complete E-selectivity.     

The newsvendor’s optimal incentive contracts for multiple advertisers

We consider a newsvendor who earns a revenue from the sales of her product to end users as well as from multiple advertisers paying to obtain access to those end users. We study the optimal decisions of a price-taking and a price-setting newsvendor when the advertisers have private information about their willingness to pay. We focus on the impact of the number of advertisers on the newsvendor’s optimal decisions. We find that regardless of the number of advertisers, the newsvendor may exclude advertisers with a low willingness to pay and distort the price and inventory from their system-efficient levels to screen the advertisers. Moreover, the newsvendor’s decision to exclude an advertiser is based exclusively on that advertiser’s characteristics, and the newsvendor’s optimal decision thus reveals independence among the advertisers. Nonetheless, the profits of the newsvendor and the advertisers also display network effects as both increase in the number of advertisers. Finally, our numerical results show that the newsvendor prefers an equivalent single advertiser to multiple advertisers due to the pooling effect.     

Chiral conducting salts of nickel dithiolene complexes

Conducting and chiral [Ni(dmit)(2)] dithiolene salts were obtained by electrocrystallization of the radical [n-Bu(4)N][Ni(dmit)(2)] salt in the presence of chiral, enantiopure trimethylammonium cations. Three different cations were investigated, namely, (R)-Ph(Me)HC*-NMe(3)(+), (S)-((t)Bu)(Me)HC*-NMe(3)(+), and (S)-(1-Napht)MeHC*-NMe(3)(+), noted (R)-1, (S)-2, and (S)-3. Salts of 1:3 stoichiometry were obtained with (R)-1 and (S)-2, formulated as [(R)-1][Ni(dmit)(2)](3) and [(S)-2][Ni(dmit)(2)](3)·(CH(3)CN)(2). They both crystallize in the P2(1)2(1)2(1) chiral space group, with three crystallographically independent complexes exhibiting different oxidation degrees. Another salt with 2:5 stoichiometry was isolated with (S)-3. The semiconducting character of the three salts (σ(RT) = 20-30 × 10(-3) S cm(-1)) finds its origin in a strong electron localization, favored by the large number of crystallographically independent [Ni(dmit)(2)] complexes in these chiral structures and their association into weakly interacting dimeric or trimeric motifs. Racemic salts with the same cations, obtained only with difficulties with the tert-butyl-containing (rac)-2 cation, afforded similar trimerized structures. The observed unusual stoichiometry and strong charge localization is tentatively assigned to the size and anisotropic charge distribution of the cations.     

Locating the vertices of a steiner tree in an arbitrary metric space

Given a tree each of whose terminal vertices is associated with a given point in a compact metric space, the problem is to optimally associate a point in this space to each nonterminal vertex of the tree. The optimality criterion is the minimization of the sum of the lengths, in the metric space, over all edges of the tree. This note shows how a dynamic programming solution to this problem generalizes a number of previously published algorithms in diverse metric spaces, each of which has direct and significant applications to biological systematics or evolutionary theory.     

On the Newton-Kantorovich method inK-normed spaces

Nondifferentiable operator equations in spaces equipped with aK-norm — map taking values in the cone of an ordered Banach space — are studied. The majorant method is used to derive the convergence of a modified sequence of Newton-Kantorovich approximations.     

Embedding of Biological Regulatory Networks and Property Preservation

In the course of understanding biological regulatory networks (BRN), scientists usually start by studying small BRNs that they believe to be of particular importance to represent a biological function, and then, embed them in a larger network. Such a reduction can lead to neglect relevant regulations and to study a network whose properties can be very different from the properties of this network viewed as a part of the whole. In this paper we study, from a logical point of view, on which conditions concerning both networks, properties can be inherited by BRNs from sub-BRNs. We give some conditions on the nature of the network embeddings ensuring that dynamic properties on the embedded sub-BRNs are preserved at the level of the whole BRN.     

Using self-similar properties of turbulent premixed flames to downsize chemical tables in high-performance numerical simulations

Detailed chemical mechanisms have to be incorporated in turbulent combustion modelling to predict flame propagation, ignition, extinction or pollutant formation. Unfortunately, hundreds of species and thousands of elementary reactions are involved in hydrocarbon chemical schemes and cannot be handled in practical simulations, because of the related computational costs and the need to model the complexity of their interaction with turbulent motions. Detailed chemistry may be handled using look-up tables, where chemical parameters such as reaction rates and/or species mass fractions are determined from a reduced set of coordinates, progress variables or mixture fractions, as proposed in ILDM, FPI or FGM methods. Nevertheless, these tables may require large computer memory spaces and non-negligible access times. This issue becomes of crucial importance when running on massively parallel computers: to implement these databases in shared memories would induce a large number of data exchanges, reducing the overall code performance; on the other hand duplicating databases in every local processor memory may become impossible either for large databases or small local memories. This work proposes to take advantage of the self-similar behaviour of turbulent premixed flames to reduce the size of these chemical databases, specifically when running on massively parallel machines, under the FPI (Flame Prolongation of ILDM) framework. Several approaches to reduce the database are investigated and discussed both in terms of memory requirements and access times. A very good compromise is obtained for methane–air turbulent premixed flames, where the size of the database is decreased by a factor of 1000, while the access time is reduced by about 60%.