Isolation and On‐Line LC/CD Analysis of 3,8″‐Linked Biflavonoids from Gnidia involucrata

Investigation of the methanol extract of the roots of Gnidia involucrata (Thymelaeaceae) led to the isolation and characterization of two new 3,8″‐biflavonoid diastereoisomers, named GB‐4 ( 6a ) and GB‐4a ( 6b ). Their absolute configurations were determined in mixture by on‐line LC/CD measurements, which also allowed the revision of absolute configurations of the biflavanoids GB‐1 and GB‐2, and the configurational assignment of GB‐3.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

Facile modifications of a polyimide via chloromethylation. I. Novel synthesis of a new photosensitive polyimide

A soluble aromatic polyimide was chloromethylated via a reaction with chloromethyl methyl ether in the presence of tin(IV) chloride to produce a new starting material for the modification of aromatic polyimides. The chemical structure of the resulting polymer was confirmed by ¹H NMR and Fourier transform infrared spectroscopy. The maximum number of chloromethyl groups per repeat unit was 1.81. The chloromethylated polyimide was stable up to 250 °C and soluble in both chloroform and tetrahydrofuran. So that its utilization for further modification could be demonstrated, cinnamic acid was reacted with the formed polyimide, and it produced a new photosensitive polyimide with a cinnamoyl side chain. The photosensitivity of the resulting polyimide was investigated with ultraviolet spectroscopic methods. © 2002 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 22–29, 2003     

Cauchy problems for linear thermoelastic systems of type III in one space variable

The goal of the paper is to analyse properties of solutions for linear thermoelastic systems of type III in one space variable. Our approach does not use energy methods, it bases on a special diagonalization procedure which is different in different parts of the phase space. This procedure allows to derive explicit representations of solutions. These representations help to prove results for well‐posedness of the Cauchy problem, L^P–L^q decay estimates on the conjugate line and results for propagation of singularities. Copyright © 2005 John Wiley & Sons, Ltd.     

D. Liu and X. Zhu,Erratum to: “Fractional chromatic number and circular chromatic number for distance graphs with large clique size”. Journal of Graph Theory47(2) 2004, 129–146

The original article to which this Erratum refers was published in Journal of Graph Theory 47:129–146,2004 .     

Computations of two passing‐by high‐speed trains by a relaxation overset‐grid algorithm

This paper presents a relaxation algorithm, which is based on the overset grid technology, an unsteady three‐dimensional Navier–Stokes flow solver, and an inner‐ and outer‐relaxation method, for simulation of the unsteady flows of moving high‐speed trains. The flow solutions on the overlapped grids can be accurately updated by introducing a grid tracking technique and the inner‐ and outer‐relaxation method. To evaluate the capability and solution accuracy of the present algorithm, the computational static pressure distribution of a single stationary TGV high‐speed train inside a long tunnel is investigated numerically, and is compared with the experimental data from low‐speed wind tunnel test. Further, the unsteady flows of two TGV high‐speed trains passing by each other inside a long tunnel and at the tunnel entrance are simulated. A series of time histories of pressure distributions and aerodynamic loads acting on the train and tunnel surfaces are depicted for detailed discussions. Copyright © 2004 John Wiley & Sons, Ltd.     

Least‐squares meshfree method for incompressible Navier–Stokes problems

A least‐squares meshfree method based on the first‐order velocity–pressure–vorticity formulation for two‐dimensional incompressible Navier–Stokes problem is presented. The convective term is linearized by successive substitution or Newton's method. The discretization of all governing equations is implemented by the least‐squares method. Equal‐order moving least‐squares approximation is employed with Gauss quadrature in the background cells. The boundary conditions are enforced by the penalty method. The matrix‐free element‐by‐element Jacobi preconditioned conjugate method is applied to solve the discretized linear systems. Cavity flow for steady Navier–Stokes problem and the flow over a square obstacle for time‐dependent Navier–Stokes problem are investigated for the presented least‐squares meshfree method. The effects of inaccurate integration on the accuracy of the solution are investigated. Copyright © 2004 John Wiley & Sons, Ltd.