A volatolomic approach using cerumen as biofluid to diagnose bovine intoxication by Stryphnodendron rotundifolium

An innovative volatolomic approach employs the detection of biomarkers present in cerumen (earwax) to identify cattle intoxication by Stryphnodendron rotundifolium Mart., Fabaceae (popularly known as barbatimão). S. rotundifolium is a poisonous plant with the toxic compound undefined and widely distributed throughout the Brazilian territory. Cerumen samples from cattle of two local Brazilian breeds (‘Curraleiro Pé-Duro’ and ‘Pantaneiro’) were collected during an experimental intoxication protocol and analyzed using headspace (HS)/GC–MS followed by multivariate analysis (genetic algorithm for a partial least squares, cluster analysis, and classification and regression trees). A total of 106 volatile organic metabolites were identified in the cerumen samples of bovines. The intoxication by S. rotundifolium influenced the cerumen volatolomic profile of the bovines throughout the intoxication protocol. In this way, it was possible to detect biomarkers for cattle intoxication. Among the biomarkers, 2-octyldecanol and 9-tetradecen-1-ol were able to discriminate all samples between intoxicated and nonintoxicated bovines. The cattle intoxication diagnosis by S. rotundifolium was accomplished by applying the cerumen analysis using HS/GC–MS, in an easy, accurate, and noninvasive way. Thus, the proposed bioanalytical chromatography protocol is a useful tool in veterinary applications to determine this kind of intoxication.     

Synthesis of lupeol derivatives and their antileishmanial and antitrypanosomal activities

The natural product lupeol 1 was isolated from aerial parts of Vernonia scorpioides with satisfactory yield, which made it viable to be used as starting material in semisynthetic approach. Ten lupeol derivatives 2–11 were prepared by classical procedures. Including, five new esters derivatives 7–11, which were obtained by structural modifications in the isopropylidene fragment. All semisynthetic compounds and lupeol 1–11 were confirmed by ¹H NMR, ¹³C NMR and HRMS. Their antiprotozoal activity was evaluated in vitro against L. amazonensis and T. cruzi. Derivative 6 showed the best antitrypanosomal activity (IC₅₀ = 12.48 μg/mL) and the lowest cytotoxic derivative (CC₅₀ = 161.50 μg/mL). The mechanism of action of the most active derivatives (4, 6 and 11) is not dependent from the enzyme trypanothione reductase.     

Fast and efficient preparation of Baylis-Hillman-derived (E)-allylic azides and related compounds in aqueous medium

A practical access to alkyl- and aryl-substituted (E)-2-(azidomethyl)alkenoates and related azido compounds from the corresponding allylic bromides in aqueous acetone is described. An alternative method to obtain the starting bromides based on heterogeneous catalysis under mild conditions was also investigated.     

Analysis of Antennas with PBG Substrate

The use of photonic materials has been used in the theory of optical waves. The PBG (Photonic Band Gap) theory and material, was developed recently for optical frequencies and can be easily applied to millimeter waves, microwaves and planar antenna frequencies. The presence of photonic materials as substrate in antennas has some good characteristics such as, supression of light spontaneous emission and suppression of surface waves, allowing the application in planar antenna array. In this work an elaborate analysis using the full wave Transverse Transmission Line - TTL method, that provides efficient and concise results is applied to the planar antennas array with PBG substrate.     

On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle

We consider the general problem of determining the maximum possible multiplicity of an eigenvalue in a Hermitian matrix whose graph contains exactly one cycle. For some cases we express that maximum multiplicity in terms of certain parameters associated with the graph.     

Development of a so-called hour method for analysis of plutonium in soil samples

A short overview of HPLC column packings is presented. The properties of chromatographic carriers and the possibilities to combine the solid matrices with organic polymeric stationary phases are elucidated in detail. The latest achievements and anticipated future developments in the area are outlined.     

Thermal stability of poly(mono-n-alkylitaconates) and mono-n-alkylitaconate-co-vinylpyrrolidone copolymers I

Poly(monoitaconates) containing octyl, decyl and dodecyl groups and random monoalkylitaconate-co-vinylpyrrolidone copolymers were studied by thermogravimetric analysis. Copolymers of mono-n-octylitaconate (MOI), mono-n-decylitaconate (MDI), and mono-n-dodecylitaconate (MDoI), respectively, with N-vinyl-2-pyrrolidone (VP) of different compositions were studied by dynamic thermogravimetric analysis. The thermal stability of the copolymers depends on the structure of the monoitaconate comonomer and on the composition of the copolymer The kinetic analysis of the degradation data shows that the thermal decomposition of these copolymers can be described by several kinetic orders depending on the copolymer and on the composition. The relative thermal stability of the copolymers increases as the VP content increases and as the length of the side chain of the itaconate increases, following the same trend as the flexibility of the copolymers in solution.     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.