Synthesis of Coumarins and Derivatives. Part 1. Biomimetic synthesis of esculetin and halogenated derivatives

Esculetin ( 1 ) and the novel compounds 5-chloroesculetin ( 5 ) and 5-bromoesculetin ( 6 ) were obtained from a light-induced cyclization of trans-caffeic acid ( 3 ) catalyzed by [FeNa(edta)] and/or H₂SO₄, HCI, or HBr (Scheme 1). The experimental conditions for trans-cis-isomerization of the cinnamic-acid derivative 3 and subsequent non-enzymatic cyclization were described. The photoperiod and the presence of air and iron-chelate catalyst are shown to be important parameters that markedly affect yields. The reactions probably occur by a free-radical mechanism involving a photo-initiated one-electron redox process (Scheme 2).     

Development and validation of a glass-silicon microdroplet-based system to measure sulfite concentrations in beverages

Sulfite is often added to beverages as an antioxidant and antimicrobial agent. In fermented beverages, sulfite is also naturally produced by yeast cells. However, sulfite causes adverse health effects in asthmatic patients and accurate measurement of the sulfite concentration is therefore very important. Current sulfite analysis methods are time- and reagent-consuming and often require costly equipment. Here, we present a system allowing sensitive, ultralow-volume sulfite measurements based on a reusable glass-silicon microdroplet platform on which microdroplet generation, addition of enzymes through chemical-induced emulsion destabilization and pillar-induced droplet merging, emulsion restabilization, droplet incubation, and fluorescence measurements are integrated. In a first step, we developed and verified a fluorescence-based enzymatic assay for sulfite by measuring its analytical performance (LOD, LOQ, the dynamic working range, and the influence of salts, colorant, and sugars) and comparing fluorescent microplate readouts of fermentation samples with standard colorimetric measurements using the 5,5′-dithiobis-(2-nitrobenzoic acid) assay of the standard Gallery Plus Beermaster analysis platform. Next, samples were analyzed on the microdroplet platform, which also showed good correlation with the standard colorimetric analysis. Although the presented platform does not allow stable reinjection of droplets due to the presence of a tight array of micropillars at the fluidics entrances to prevent channel clogging by dust, removing the pillars, and integrating miniaturized pumps and optics in a future design would allow to use this platform for high-throughput, automated, and portable screening of microbes, plant, or mammalian cells.

ᅟ

     

Interaction of sodium cholate with dioctadecyldimethylammonium chloride vesicles in aqueous dispersion

Mixtures of dioctadecyldimethylammonium chloride (DODAC) cationic vesicle dispersions with aqueous micelle solutions of the anionic sodium cholate (NaC) were investigated by differential scanning calorimetry, DSC, turbidity and light scattering. Within the concentration range investigated (constant 1.0 mM DODAC and varying NaC concentration up to 4 mM), vesicle → micelle → aggregate transitions were observed. The turbidity of DODAC/NaC/water depends on time and NaC/DODAB molar concentration ratio R. At equilibrium, turbidity initially decreases smoothly with R to a low value (owing to the vesicle–micelle transition) when R = 0.5–0.8 and then increases steeply to a high value (owing to the micelle–aggregate transition) when R = 0.9–1.0. DSC thermograms exhibit a single and sharp endothermic peak at T_m ≈ 49 °C, characteristic of the melting temperature of neat DODAC vesicles in water. Upon addition of NaC, T_m initially decreases to vanish around R = 0.5, and the main transition peak broadens as R increases. For R > 1.0 two new (endo- and exothermic) peaks appear at lower temperatures indicating the formation of large aggregates since the dispersion is turbid. All samples are non-birefringent. Dynamic light scattering (DLS) data indicate that both DODAC and DODAC/NaC dispersions are highly polydisperse, and that the mean size of the aggregates tends to decrease as R increases.     

A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires

In this paper, we introduce a new proximal algorithm for equilibrium problems on a genuine Hadamard manifold, using a new regularization term. We first extend recent existence results by considering pseudomonotone bifunctions and a weaker sufficient condition than the coercivity assumption. Then, we consider the convergence of this proximal-like algorithm which can be applied to genuinely Hadamard manifolds and not only to specific ones, as in the recent literature. A striking point is that our new regularization term have a clear interpretation in a recent “variational rationality” approach of human behavior. It represents the resistance to change aspects of such human dynamics driven by motivation to change aspects. This allows us to give an application to the theories of desires, showing how an agent must escape to a succession of temporary traps to be able to reach, at the end, his desires.

     

A dominance-based rough set approach applied to evaluate the credit risk of sovereign bonds

4OR - Even though sovereign bonds represent low-risk alternatives that give investors a healthy income, the risk assessment process for these bonds is still considered subjective because of the...     

A class of completek-caps inPG(3,q) forq an odd prime

The main problem on caps, posed originally by Segre in the fifties, is to determine the values of k for which there exists a complete k-cap. Very few results on this problem are known. The cardinality of the largest cap(s) and the smallest complete cap(s) are crucial. In this paper it is shown that there exist complete k-caps in PG(3, q), q an odd prime 5 or q = 9, such that k = (q² + q + 6)/3 or k = (q² + 2q + 6)/3. These complete caps are smaller than those currently known for q odd.In memoriam Giuseppe Tallini     

On sparse spanners of weighted graphs

Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.The work of G. Das and D. Joseph was supported by NSF PYI Grant DCR-8402375. The work of D. Dobkin was supported by NSF Grant CCR-8700917. The work of J. Soares was supported by CNPq proc 203039/87.4 (Brazil) and NSF Grant CCR-9014562. This research was accomplished while G. Das was a student at the University of Wisconsin-Madison. A preliminary version was presented at the Second Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 1990, under the title Generating Sparse Spanners for Weighted Graphs, and proceedings appear in the series Lecture Notes in Computer Science, Springer-Verlag. The preliminary version also appears as Princeton University Technical Report CS-TR-261-90, and as University of Wisconsin-Madison Computer Sciences Technical Report 882.