Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

Statistical Optimization of Flavonoid and Antioxidant Recovery from Macerated Chinese and Malaysian Lotus Root (Nelumbo nucifera) Using Response Surface Methodology

In this study, the combination of parameters required for optimal extraction of anti-oxidative components from the Chinese lotus (CLR) and Malaysian lotus (MLR) roots were carefully investigated. Box–Behnken design was employed to optimize the pH (X₁: 2–3), extraction time (X₂: 0.5–1.5 h) and solvent-to-sample ratio (X₃: 20–40 mL/g) to obtain a high flavonoid yield with high % DPPH_sc free radical scavenging and Ferric-reducing power assay (FRAP). The analysis of variance clearly showed the significant contribution of quadratic model for all responses. The optimal conditions for both Chinese lotus (CLR) and Malaysian lotus (MLR) roots were obtained as: CLR: X₁ = 2.5; X₂ = 0.5 h; X₃ = 40 mL/g; MLR: X₁ = 2.4; X₂ = 0.5 h; X₃ = 40 mL/g. These optimum conditions gave (a) Total flavonoid content (TFC) of 0.599 mg PCE/g sample and 0.549 mg PCE/g sample, respectively; (b) % DPPH_sc of 48.36% and 29.11%, respectively; (c) FRAP value of 2.07 mM FeSO₄ and 1.89 mM FeSO₄, respectively. A close agreement between predicted and experimental values was found. The result obtained succinctly revealed that the Chinese lotus exhibited higher antioxidant and total flavonoid content when compared with the Malaysia lotus root at optimum extraction condition.     

高雷诺数下非混相Rayleigh-Taylor不稳定性的格子Boltzmann方法模拟

本文采用相场格子Boltzmann方法研究了竖直微通道内中等Atwoods数流体的单模Rayleigh-Taylor不稳定性问题,系统分析了雷诺数对相界面动力学行为以及扰动在各发展阶段演化规律的影响.数值结果表明高雷诺数条件下,不稳定性界面扰动的增长经历了四个不同的发展阶段,包括线性增长阶段、饱和速度阶段、重加速阶段及混沌混合阶段.在线性增长阶段,我们计算获得的气泡与尖钉振幅符合线性稳定性理论,并且线性增长率随着雷诺数的增加而增大.在第二个阶段,我们观察到气泡与尖钉将以恒定的速度增长,获得的尖钉饱和速度略高于Goncharov经典势能模型的解析解[Phys.Rev.Lett.200288134502],这归因于系统中产生了多个尺度的旋涡,而涡之间的相互作用促进了尖钉的增长.随着横向速度和纵向速度的差异扩大,气泡和尖钉界面演化诱导产生的Kelvin–Helmholtz不稳定性逐渐增强,从而流体混合区域出现许多不同层次的涡结构,加速了气泡与尖钉振幅的演化速度,并在演化后期阶段,导致界面发生多层次卷起、剧烈变形、混沌破裂等行为,最终形成了非常复杂的拓扑结构.此外,我们还统计了演化后期气泡与尖钉的无量纲加速度,发现气泡和尖钉的振幅在后期呈现二次增长规律,其增长率系数分别为0.045与0.233.而在低雷诺条件下,重流体在不稳定性后期以尖钉的形式向下运动而轻流体以气泡的形式向上升起.在整个演化过程中,界面变得足够光滑,气泡与尖钉在后期的演化速度接近于常数,未观察到后期的重加速与混沌混合阶段.     

Existence of the uniformly minimum risk equivariant estimators of parameters in a class of normal linear models

In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)^α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively. Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there exist UMRE estimators of parameters in the variance components model are obtained for the first time.     

Equivalence of variational inequality problems to unconstrained minimization

In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit functions and give conditions under which the stationary points of these functions are the solutions of VI. This work was supported by the state key project “Scientific and Engineering Computing”.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management

This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.