Fundamental Groups of Graphs of Cyclic Subgroup Separable and Weakly Potent Groups

We give a characterization of the cyclic subgroup separability and weak potency of the fundamental group of a graph of polycyclic-by-finite groups and free-by-finite groups amalgamating edge subgroups of the form × D,where h has infinite order and D is finite.     

单面柱局域共振声子晶体低频带隙特性分析及结构改进研究

基于有限元法对单面柱局域共振声子晶体进行带隙特性分析,研究了结构参数对该类型声子晶体的影响。结果表明:随着散射体高度的增加,单面柱声子晶体的第一完全带隙的起始频率逐渐降低,带宽逐渐增大;随着基板厚度的增大,单面柱声子晶体的起始频率逐渐升高,截止频率先增大后减小。并且在经典单面柱声子晶体的基础上,组合了两种新型的三组元单面柱声子晶体结构:嵌入式单面柱声子晶体(以下简称结构Ⅰ)和粘接式单面柱声子晶体(以下简称结构Ⅱ)。通过对其带隙特性的分析得出:这两种新结构与经典的单面柱声子晶体相比,都具有更低频的带隙,这对于低频减振降噪是非常有利的。本文的结果将对实际的工程应用提供一定的理论指导。     

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

基于电子病历的乳腺癌群组与治疗方案可视分析

乳腺癌是当前最常见的恶性肿瘤之一，其电子病历数据可用于挖掘隐含规律，对治疗与预后分析有重要意义。通过与乳腺科医生合作，选择合适的预测模型和可视化方法，搭建了一个基于电子病历的乳腺癌群组和治疗方案可视分析系统。首先，对具有高维属性的病人进行降维和聚类处理，形成病人群组，并采用南丁格尔图、词云和时间轴可视化方法，直观展示病人群组间特征的差异；然后，用支持向量机（support vector machine，SVM）模型预测治疗方案，用平行坐标、矩阵热力图和分类图分别展示属性相关性、训练后的特征权重和预测结果；最后，用真实案例验证了系统在群组分析、治疗方案及病人属性关联分析中的有效性，从而较好地帮助医生选择合适的治疗方案。     

A theory of finite tensile deformation of double-network hydrogels

A continuum damage model was developed to describe the finite tensile deformation of tough double-network (DN) hydrogels synthesized by polymerization of a water-soluble monomer inside a highly crosslinked rigid polyelectrolyte network. Damage evolution in DN hydrogels was characterized by performing loading-unloading tensile tests and oscillatory shear rheometry on DN hydrogels synthesized from 3-sulfopropyl acrylate potassium salt (SAPS) and acrylamide (AAm). The model can explain all the mechanical features of finite tensile deformation of DN hydrogels, including idealized Mullins effect and permanent set observed after unloading, qualitatively and quantitatively. The constitutive equation can describe the finite elasto-plastic tensile behavior of DN hydrogels without resorting to a yield function. It was showed that tensile mechanics of DN hydrogels in the model is controlled by two material parameters which are related to the elastic moduli of first and second networks. In effect, the ratio of these two parameters is a dimensionless number that controls the behavior of material. The model can capture the stable branch of material response during neck propagation where engineering stress becomes constant. Consistent with experimental data, by increasing the elastic modulus of the second network the finite tensile behavior of the DN hydrogel changes from necking to strain hardening.     

Nonlinear elastic constitutive relations of residually stressed composites with stiff curved fibres

Applied Mathematics and Mechanics - Mechanical models of residually stressed fibre-reinforced solids, which do not resist bending, have been developed in the literature. However, in some residually...     

A posteriori error analysis of a quadratic finite volume method for nonlinear elliptic problems

In this article, we construct and analyze a residual-based a posteriori error estimator for a quadratic finite volume method (FVM) for solving nonlinear elliptic partial differential equations with homogeneous Dirichlet boundary conditions. We shall prove that the a posteriori error estimator yields the global upper and local lower bounds for the norm error of the FVM. So that the a posteriori error estimator is equivalent to the true error in a certain sense. Numerical experiments are performed to illustrate the theoretical results.     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.