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\}$.     

Looking ahead: Joint small group detection and tracking in crowd scenes

Small group detection and tracking in crowd scenes are basis for high level crowd analysis tasks. However, it suffers from the ambiguities in generating proper groups and in handling dynamic changes of group configurations. In this paper, we propose a novel delay decision-making based method for addressing the above problems, motivated by the idea that these ambiguities can be solved using rich temporal context. Specifically, given individual detections, small group hypotheses are generated. Then candidate group hypotheses across consecutive frames and their potential associations are built in a tree. By seeking for the best non-conflicting subset from the hypothesis tree, small groups are determined and simultaneously their trajectories are got. So this framework is called joint detection and tracking. This joint framework reduces the ambiguities in small group decision and tracking by looking ahead for several frames. However, it results in the unmanageable solution space because the number of track hypotheses grows exponentially over time. To solve this problem, effective pruning strategies are developed, which can keep the solution space manageable and also improve the credibility of small groups. Experiments on public datasets demonstrate the effectiveness of our method. The method achieves the state-of-the-art performance even in noisy crowd scenes.     

SDN中基于KMOBPSO的高可靠性控制器部署算法

针对SDN中控制器系统的单节点故障问题,兼顾系统成本和系统时延,应用N+1冗余备份模型来提高SDN控制器部署的可靠性,并将其抽象为多目标优化问题.同时,提出了一种融合K-means聚类算法和遗传算子的多目标二进制粒子群算法——KMOBPSO算法,以求解SDN控制器高可靠性部署问题的解.仿真结果表明,所提算法具有求解精度高、分布均匀、沿Pareto前沿面覆盖广的特点,能够显著提高SDN中控制器部署的可靠性.     

On the performance of improved quadrature spatial modulation

Quadrature spatial modulation (QSM) utilizes the in‐phase and quadrature spatial dimensions to transmit the real and imaginary parts of a single signal symbol, respectively. The improved QSM (IQSM) transmits two signal symbols per channel use through a combination of two antennas for each of the real and imaginary parts. The main contributions of this study can be summarized as follows. First, we derive an upper bound for the error performance of the IQSM. We then design constellation sets that minimize the error performance of the IQSM for several system configurations. Second, we propose a double QSM (DQSM) that transmits the real and imaginary parts of two signal symbols through any available transmit antennas. Finally, we propose a parallel IQSM (PIQSM) that splits the antenna set into equal subsets and performs IQSM within each subset using the same two signal symbols. Simulation results demonstrate that the proposed constellations significantly outperform conventional constellations. Additionally, DQSM and PIQSM provide a performance similar to that of IQSM while requiring a smaller number of transmit antennas and outperform IQSM with the same number of transmit antennas.     

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.     

优化军工科研项目管理的具体策略

我国的军工科研所成立于上世纪，它以军工项目的科研、预研为主，为我国的国防军工提供研发产品。伴随着我国经济实力的增强和科技军事力量的增长，军工科研院所也转变了原有的工业专属性质，走上了军民两用、寓军于民的道路，并在时代的进步中成为了我国先进装备制造业的重要科研力量和科技创新支柱。凸现军事工业“高、精、尖”的特点，以项目管理的优化为具体策略进行军工科研开发工作。     

智能动态网络资源分配系统

通过对解决GSM移动通信网络热点区域话务拥塞问题的研究，提出了利用可控功分器实现智能动态网络资源的分配，解决不同种类的话务拥塞问题，并着重讨论了该系统目前的成功运用及前景。     

双层有机电致发光器件有机层厚度优化的数值研究

在陷阱电荷限制电流传导理论的基础上,提出了双层有机电致发光器件的数值模型,研究了结构为"阳极/空穴输运层(HTL)/发光层(EML)/阴极"的器件中电流密度和量子效率随有机层的特征陷阱能量、陷阱密度和载流子迁移率的依赖关系. 研究发现,对于给定的HTL和EML的特征陷阱能量、陷阱密度和载流子迁移率,存在一个最优的HTL和EML之间的厚度比率,在此最优厚度比下,器件的电流密度和量子效率达到最大.通过有机层厚度的优化,器件的电流密度和量子效率可提高多达两个数量级.另外,还研究了最优厚度比随有机层特征陷阱能量、总陷阱密度和载流子迁移率之间的定量关系.     

宽带无线移动通信网络优化及相关发展策略思考

在介绍宽带无线移动发展趋势所采用的新技术的基础上，论述了宽带无线移动通信网络优化及相关发展策略的一些问题。