In this paper, we design a Branch and Bound algorithm based on interval arithmetic to address nonconvex robust optimization problems. This algorithm provides the exact global solution of such difficult problems arising in many real life applications. A code was developed in MatLab and was used to solve some robust nonconvex problems with few variables. This first numerical study shows the interest of this approach providing the global solution of such difficult robust nonconvex optimization problems.
The diffusive behavior of nanoparticles inside porous materials is attracting a lot of interest in the context of understanding, modeling, and optimization of many technical processes. A very powerful technique for characterizing the diffusive behavior of particles in free media is dynamic light scattering (DLS). The applicability of the method in porous media is considered, however, to be rather difficult due to the presence of multiple sources of scattering. In contrast to most of the previous approaches, the DLS method was applied without ensuring matching refractive indices of solvent and porous matrix in the present study. To test the capabilities of the method, the diffusion of spherical gold nanoparticles within the interconnected, periodic nanopores of inverse opals was analyzed. Despite the complexity of this system, which involves many interfaces and different refractive indices, a clear signal related to the motion of particles inside the porous media was obtained. As expected, the diffusive process inside the porous sample slowed down compared to the particle diffusion in free media. The obtained effective diffusion coefficients were found to be wave vector-dependent. They increased linearly with increasing spatial extension of the probed particle concentration fluctuations. On average, the slowing-down factor measured in this work agrees within combined uncertainties with literature data.
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004 相似文献
Sodium trichloromethanesulfonate monohydrate, Na+·CCl3SO3−·H2O, crystallizes in P21/a with all the atoms located in general positions. The trichloromethanesulfonate (trichlate) anion consists of pyramidal SO3 and CCl3 groups connected via an S—C bond in a staggered conformation with approximate C3v symmetry. The water molecule is hydrogen bonded to the sulfonate O atoms, with one water H atom forming weak bifurcated O—H⋯O hydrogen bonds to two different trichlate ions. Two water O atoms and three O atoms from different SO3 groups form a square‐pyramidal arrangement around the sodium ion. 相似文献