Localization and quantification of radical production in cavitating flows with luminol chemiluminescent reactions

Hydrodynamic cavitation experiments in microfluidic systems have been performed with an aqueous solution of luminol as the working fluid. In order to identify where and how much reactive radical species are formed by the violent bubble collapse, the resulting chemiluminescent oxidation reaction of luminol was scrutinized downstream of a constriction in the microchannel. An original method was developed in order to map the intensity of chemiluminescence emitted from the micro-flow, allowing us to localize the region where radicals are produced. Time averaged void fraction measurements performed by laser induced fluorescence experiments were also used to determine the cavitation cloud position. The combination void fraction and chemiluminescence two-dimensional mapping demonstrated that the maximum chemiluminescent intensity area was found just downstream of the cavitation clouds. Furthermore, the radical yield can be obtained with our single photon counting technique. The maximum radical production rates of 1.2*10⁷ OH/s and radical production per processed liquid volume of 2.15*10¹⁰ HO/l were observed. The proposed technique allows for two-dimensional characterisation of radical production in the microfluidic flow and could be a quick, non-intrusive way to optimise hydrodynamic cavitation reactor design and operating parameters, leading to enhancements in wastewater treatments and other process intensifications.     

Self‐Assembly and Gelation of Poly(aryl ether) Dendrons Containing Hydrazide Units: Factors Controlling the Formation of Helical Structures

Self‐assembly of AB₂ and AB₃ type low molecular weight poly(aryl ether) dendrons that contain hydrazide units were used to investigate mechanistic aspects of helical structure formation during self‐assembly. The results suggest that there are three important aspects that control helical structure formation in such systems with acyl hydrazide/hydrazone linkage: i) J‐type aggregation, ii) the hydrogen‐bond donor/acceptor ability of the solvent, and iii) the dielectric constant of the solvent. The monomer units self‐assemble to form dimer structures through hydrogen‐bonding and further assembly of the hydrogen‐bonded dimers leads to macroscopic chirality in the present case. Dimer formation was confirmed by NMR spectroscopy and by mass spectrometry. The self‐assembly in the system was driven by hydrogen‐bonding and π–π stacking interactions. The morphology of the aggregates formed was examined by scanning electron microscopy, and the analysis suggests that aprotic solvent systems facilitate helical fibre formation, whereas introduction of protic solvents results in the formation of flat ribbons. This detailed mechanistic study suggests that the self‐assembly follows a nucleation–elongation model to form helical structures, rather than the isodesmic model.     

Recyclable and reusable Pd(OAc)2/PPh3/PEG‐2000 system for homocoupling reaction of arylboronic acids under air without base

A stable and efficient Pd(OAc)₂/PPh₃/PEG‐2000 catalytic system for homocoupling of arylboronic acids has been developed. In the presence of Pd(OAc)₂ and PPh₃, the homocoupling reaction of arylboronic acids was carried out smoothly in PEG‐2000 at 70 °C under air without base to afford a variety of symmetric biaryls in good to excellent yields. The isolation of the products was readily performed by extraction with diethyl ether, and the Pd(OAc)₂/PPh₃/PEG‐2000 system could be easily recycled and reused six times without significant loss of catalytic activity. Copyright © 2014 John Wiley & Sons, Ltd.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

WEAK CONVERGENCE FOR NON-UNIFORM φ-MIXING RANDOM FIELDS

Let $\{\xi_{\bold t}, {\bold t} \in {\bold Z}^d\}$ be a nonuniform $\varphi$-mixing strictly stationary real random field with $E\xi_{\bold 0}=0, E|\xi_{\bold 0}|^{2+\delta}<\infty$ for some $0<\delta<1$. A sufficient condition is given for the sequence of partial sum set-indexed process $\{Z_n(A),\ A\in \Cal A\}$ to converge to Brownian motion. By a direct calculation, the author shows that the result holds for a more general class of set index ${\Cal A}$, where ${\Cal A}$ is assumed only to have the metric entropy exponent $r, 0相似文献   

Analysis of G/D/1 Queueing Systems with Inputs Satisfying Large Deviation Principle under Weak* Topology

The large deviation principle (LDP) which has been effectively used in queueing analysis is the sample path LDP, the LDP in a function space endowed with the uniform topology. Chang [5] has shown that in the discrete-time G/D/1 queueing system under the FIFO discipline, the departure process satisfies the sample path LDP if so does the arrival process. In this paper, we consider arrival processes satisfying the LDP in a space of measures endowed with the weak^* topology (Lynch and Sethuraman [12]) which holds under a weaker condition. It is shown that in the queueing system mentioned above, the departure processes still satisfies the sample path LDP. Our result thus covers arrival processes which can be ruled out in the work of Chang [5]. The result is then applied to obtain the exponential decay rate of the queue length probability in an intree network as was obtained by Chang [5], who considered the arrival process satisfying the sample path LDP.     

Minimal Submanifolds in a Locally Symmetric and Conformally Flat Space

We study minimal submanifolds in the locally symmetric and conformally flat Riemannian manifold and generalize Yau's result obtained in J. Amer. Math. 97 (1975), 76–100.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Weak convergence of the U-statistic and weak invariance of the one-sample rank order statistic for Markov processes and ARMA models

Harel and Puri (1989, J. Multivariate Anal. 29) studied the asymptotic behavior of the U-statistic and the one-sample rank order statistic for nonstationary absolutely regular processes. In this note, we present some applications of these results for Markov processes as well as ARMA processes.