New tri- and tetracyclic diterpenes from Euphorbia villosa

Three new tetracyclic diterpenes were isolated from the chloroform-soluble extract of Euphorbia villosa, together with one new and one known lathyrane diterpene. The structures were elucidated by means of various spectroscopic methods, including HREI-MS, HRFAB-MS, UV, and 1D and 2D NMR techniques. Spectral analyses revealed that two of the tetracyclic compounds contain the rare 5-6-6-4 fused ring system, while the third has a 5-6-7-3 fused diterpene core. Such diterpene skeletons have previously been found only in euphoractines A-E isolated from Euphorbia micractina. As a new structural feature, the diterpene framework described here has a C-2 epimer configuration. The new lathyrane diterpene is a diester of a hitherto unknown polyfunctional parent alcohol.     

Integer linear programming models for 2-staged two-dimensional Knapsack problems

 We are given a unique rectangular piece of stock material S, with height H and width W, and a list of m rectangular shapes to be cut from S. Each shape's type i (i = 1, ..., m) is characterized by a height , a width , a profit , and an upper bound ub _i indicating the maximum number of items of type i which can be cut. We refer to the Two-Dimensional Knapsack (TDK) as the problem of determining a cutting pattern of S maximizing the sum of the profits of the cut items. In particular, we consider the classical variant of TDK in which the maximum number of cuts allowed to obtain each item is fixed to 2, and we refer to this problem as 2-staged TDK (2TDK). For the 2TDK problem we present two new Integer Linear Programming models, we discuss their properties, and we compare them with other formulations in terms of the LP bound they provide. Finally, both models are computationally tested within a standard branch-and-bound framework on a large set of instances from the literature by reinforcing them with the addition of linear inequalities to eliminate symmetries. Received: October 17, 2000 / Accepted: December 19, 2001 Published online: September 27, 2002 Key words. packing – cutting – integer linear programming     

Concise asymmetric synthesis of (−)-halosaline and (2R,9aR)-(+)-2-hydroxy-quinolizidine by ruthenium-catalyzed ring-rearrangement metathesis

A ruthenium-catalyzed ring opening-ring closing metathesis reaction serves as the key step in the stereoselective synthesis of a new enantiopure 2-substituted-4,5-dehydropiperidine skeleton, a valuable intermediate for the synthesis of piperidine alkaloids (such as (−)-halosaline) and of hydroxylated quinolizidines (such as (2R,9aR)-(+)-2-hydroxy-quinolizidine).     

Structural characterization of nanopatterned surfaces

In this work, chemically and topographically nanopatterned surfaces were produced by a top-down processing approach for biosensing devices. The nanopatterning was the result of the combination of plasma polymerisation (pp) of biofunctional materials and colloidal lithography techniques. The morphological and chemical properties induced by the plasma deposition-etching treatment were characterised by optical method combining ellipsometry and Fourier Transform Infrared spectroscopy studies. This method supported by atomic force microscopy measurements, allowed the full optical characterization of each step of the top-down process. The optical characterization of the end-up nanopatterned samples demonstrated that the chosen process is able to produce well-defined nanostructured surfaces with controlled chemical and morphological properties.     

The location of median paths on grid graphs

In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.     

Compactness properties of the integration map for Volterra measures in non-normable spaces

We make a detailed study of the compactness properties of the integration map associated with the classical Volterra (vector valued) measure inX=L ^p([0, 1]), forp in [1, ∞], and inX=C([0, 1]), whereX is equipped with its relevant weak or weak-star topology. The spaceX (a Frechet space) of all complex valued sequences, equipped with the pointwise convergence topology, is also considered.     

The Hard Lefschetz Theorem and the topology of semismall maps

A line bundle on a complex projective manifold is said to be lef if one of its powers is globally generated and defines a semismall map in the sense of Goresky-MacPherson. As in the case of ample bundles the first Chern class of lef line bundles satisfies the Hard Lefschetz Theorem and the Hodge-Riemann Bilinear Relations. As a consequence, we prove a generalization of the Grauert contractibility criterion: the Hodge Index Theorem for semismall maps, Theorem 2.4.1. For these maps the Decomposition Theorem of Beilinson, Bernstein and Deligne is equivalent to the non-degeneracy of certain intersection forms associated with a stratification. This observation, joint with the Hodge Index Theorem for semismall maps gives a new proof of the Decomposition Theorem for the direct image of the constant sheaf. A new feature uncovered by our proof is that the intersection forms involved are definite.     

Solvent-dependent host–guest complexation of two homologous merocyanines by a water-soluble calix[8]arene: Spectroscopic analysis and structural calculations

The sulfonated calixarene I₈C₁₂ acts as a host for homologous merocyanines Mc1 and Mc2 in organic solvents, exhibiting neither selectivity towards the guest dyes nor solvent dependence of the complexation equilibria. In water, on the contrary, only the lower homologue, Mc1, is solubilized in the presence of the calixarene. A combination of UV–visible and fluorescence spectroscopic and photophysical analysis and MD structural simulation of the calixarene-dye complexes was employed to account for the observations, and suggests that a radical change in the complexation mode occurs upon moving from an organic to an aqueous environment.     

Modification of surface properties of electrospun polyamide nanofibers by means of a perfluorinated acridine

Polyamide 6 (PA6) nanofibers were prepared from formic acid solutions by using electrospinning technique. The fibers were smooth, defects free and with diameters smaller than 200 nm. Small amounts of a perfluorinated acridine were added as dopant to the feed solution to modify the wettability of the fibers. The effect of doping on the contact angle values is well apparent. The contact angle values go from 50° of pure PA6 to 120° when 6% of acridine is added. A comparison between fibers and films of pure and doped polyamide 6 was carried out in order to determine the effect of morphology on wettability. Thermal annealing near the T_g of the polymer promoted the segregation of the molecules to the surface, reaching contact angles of 131° with smaller amounts (4%) of acridine. The surface segregation was also promoted by time aging.