Sensitivity improvement of aluminum-based far-ultraviolet nearly guided-wave surface plasmon resonance sensor

An aluminum (Al) based nearly guided-wave surface plasmon resonance (NGWSPR) sensor is investigated in the far-ultraviolet (FUV) region. By simultaneously optimizing the thickness of Al and dielectric films, the sensitivity of the optimized Al-based FUV-NGWSPR sensor increases from 183°/RIU to 309°/RIU, and its figure of merit rises from 26.47 RIU^-1 to 32.59 RIU^-1 when the refractive index of dielectric increases from 2 to 5. Compared with a traditional FUV-SPR sensor without dielectric, the optimized FUV-NGWSPR sensor can realize simultaneous improvement of sensitivity and figure of merit. In addition, the FUV-NGWSPR sensor with realistic materials (diamond, Ta₂O₅, and GaN) is also investigated, and 137.84%, 52.70%, and 41.89% sensitivity improvements are achieved respectively. This work proposes a method for performance improvement of FUV-SPR sensors by exciting nearly guided-wave, and could be helpful for the high-performance SPR sensor in the short-wavelength region.     

一类正交空间填充设计的构造

空间填充设计在计算机试验中应用十分广泛,当拟合回归模型时,正交的空间填充设计保证了因子效应估计的独立性.基于广义正交设计,文章给出了构造二阶正交拉丁超立方体设计和列正交设计的方法,新构造的设计不仅满足任意两列之间相互正交,还能保证每一列与任一列元素平方组成的列以及任两列元素相乘组成的列都正交.当某些正交的空间填充设计不存在时,具有较小相关系数的近似正交设计可作为替代设计使用.设计构造的灵活性为计算机试验在实践中的广泛应用提供了必要的支持.     

局部凸空间P-自反下的中点局部k-一致凸性(光滑性)

在局部凸空间已有的中点局部kk-一致凸性和中点局部k-一致光滑性这一对对偶概念的基础上,证明了中点局部kk-一致凸性与中点局部(k+1)-一致凸性的关系,给出了在P-自反的条件下它们之间的等价对偶定理.     

Toll number of the Cartesian and the lexicographic product of graphs

Toll convexity is a variation of the so-called interval convexity. A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$. A toll interval between $u,v\in V\left(G\right)$ is a set $T_G(u,v)=\{x\in V\left(G\right):x\text{ lies on a tolled walk between }u\text{ and }v\}$. A set $S?V\left(G\right)$ is toll convex, if $T_G(u,v)?S$ for all $u,v\in S$. A toll closure of a set $S?V\left(G\right)$ is the union of toll intervals between all pairs of vertices from $S$. The size of a smallest set $S$ whose toll closure is the whole vertex set is called a toll number of a graph $G$, $tn\left(G\right)$. The first part of the paper reinvestigates the characterization of convex sets in the Cartesian product of two graphs. It is proved that the toll number of the Cartesian product of two graphs equals 2. In the second part, the toll number of the lexicographic product of two graphs is studied. It is shown that if $H$ is not isomorphic to a complete graph, $tn(G°H)\le 3?tn\left(G\right)$. We give some necessary and sufficient conditions for $tn(G°H)=3?tn\left(G\right)$. Moreover, if $G$ has at least two extreme vertices, a complete characterization is given. Furthermore, graphs with $tn(G°H)=2$ are characterized. Finally, the formula for $tn(G°H)$ is given — it is described in terms of the so-called toll-dominating triples or, if $H$ is complete, toll-dominating pairs.     

Strict topologies on measure spaces

Let X be a measurable space, let be a family of measurable subsets of it, and let be a subspace of complex measures on X that is also closed under restrictions of measures. In this paper we introduce the ‐convergence topology and the ‐strict topology on . Among other results, we find necessary and sufficient conditions for Hausdorff‐ness and coincide‐ness of these topologies. Applications to Lebesgue spaces, and also examples in Hausdorff topological spaces and locally compact groups are given.     

Hölder Continuity of the Saddle Point Set for Real-Valued Functions

This paper is concerned with Hölder continuity of the solution to a saddle point problem. Some new su?cient conditions for the uniqueness and Hölder continuity of the solution for a perturbed saddle point problem are established. Applications of the result on Hölder continuity of the solution for perturbed constrained optimization problems are presented under mild conditions. Examples are given to illustrate the obtained results.     

Nearly m-embedded subgroups and solvability of finite groups

A subgroup A of a finite group G is called {1≤G}-embedded in G if for each two subgroups K≤H of G, where K is a maximal subgroup of H, A either covers the pair (K,H) or avoids it. Moreover, a subgroup H of G is called nearly m-embedded in G if G has a subgroup T and a {1≤G}-embedded subgroup C such that G?=?HT and H∩T≤C≤H. In this paper, we mainly prove that G is solvable if and only if its Sylow 3-subgroups, Sylow 5-subgroups and Sylow 7-subgroups are nearly m-embedded in G.     

集值映射多目标半定规划问题的epsilon-弱有效性

对于集值映射多目标半定规划问题, 在近似锥-次类凸的框架下, 建立了含矩阵和向量的择一性定理, 给出了问题的epsilon-弱有效解的epsilon-Lagrange乘子定理及标量化定理和epsilon-弱鞍点定理．     

三维非规则非均匀边界元网格的简便的高精度算法

对三维直接边界元中一阶奇异积分、一阶近奇异积分以及非奇异积分进行统一处理，给出了一种提高积分计算精度的简便有效的方法，对非规则非均匀边界元网格可获得比一般方法高得多的计算精度，非常适合边界形状比较复杂的三维实际问题的边界元分析．