Condensation of all-cis-tetraphenylcyclotetrasiloxanetetraol in ammonia: new method for preparation of ladder-like polyphenylsilsesquioxanes

1. Download : Download high-res image (68KB)
2. Download : Download full-size image

     

Advantages of NIR radiation use for optical determination of skin horny layer thickness with embedded TiO2 nanoparticles during tape stripping procedure

The tape stripping technique is an experimental method frequently used for reconstruction of the in-depth distribution of various topically administered substances within the horny layer of human skin, e.g., compounds contained in sunscreens. Titanium dioxide (TiO₂) nanoparticles (25–200 nm in diameter) are one such compound. Optical techniques which apply blue light are found to be suitable for reconstruction. However, the presence of particles affects the light propagation within the skin and therefore causes incorrect determination of strip thickness, leading to an improper reconstructed distribution of nanoparticle concentration revealed from the experimental data. This study evaluates the errors emerging from the use of blue (400 nm) and NIR (800 nm) radiation and finds the use of longer wavelength light more advantageous. Particles of different diameters are considered, and it is revealed that the application of small particles (25–60 nm) results in the lowest rate of error.     

Microlocal Analysis of an FBP Algorithm for Truncated Spiral Cone Beam Data

In this article we propose an FBP-type algorithm for inversion of spiral cone beam data, study its theoretical properties, and illustrate performance of the algorithm by numerical examples. In particular, it is shown that the algorithm does not reconstruct f exactly, but computes the result of applying a pseudo-differential operator (PDO) with singular symbol to f. Away from critical directions the amplitude of this PDO is homogeneous of order zero in the dual variable, bounded, and approaches one as the pitch of the spiral goes to zero. Numerical experiments presented in the article show that even when the pitch is relatively large, the accuracy of reconstruction is quite high. On the other hand, under certain circumstances, the algorithm produces artifacts typical of all FBP-type algorithms.     

When random proportional subspaces are also random quotients

We discuss when a generic subspace of some fixed proportional dimension of a finite-dimensional normed space can be isomorphic to a generic quotient of some proportional dimension of another space. We show (in Theorem 4.1) that if this happens (for some natural random structures) then for any proportion arbitrarily close to 1, the first space has a lot of Euclidean subspaces and the second space has a lot of Euclidean quotients.     

Linear Independence of q-Analogues of Certain Classical Constants

Let K be ? or an imaginary quadratic number field, and q ∈ K an integer with ¦q¦ > 1. We give a quantitative version of Σ_n≥1 a_n/(qⁿ ? 1) ? K for non-zero periodic sequences (a_n) in K of period length ≤ 2. As a corollary, we get a quantitative version of the linear independence over K of 1, the q-harmonic series, and a q-analogue of log 2. A similar result on 1, the q-harmonic series, and a q-analogue of ζ(2) is also proved. Mathematics Subject Classification (2000): 11J72, 11J82     

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.     

Stability and slightly supercritical oscillatory regimes of natural convection in a 8:1 cavity: solution of the benchmark problem by a global Galerkin method

The global Galerkin method is applied to the benchmark problem that considers an oscillatory regime of convection of air in a tall two‐dimensional rectangular cavity. The three most unstable modes of the linearized system of the Boussinesq equations are studied. The converged values of the critical Rayleigh numbers together with the corresponding oscillation frequencies are calculated for each mode. The oscillatory flow regimes corresponding to each of the three modes are approximated asymptotically. No direct time integration is applied. Good agreement with the previously published results obtained by solution of the time‐dependent Boussinesq equations is reported. Copyright © 2004 John Wiley & Sons, Ltd.