种植烤瓷冠与烤塑冠临床咬合磨耗研究

目的比较种植用烤塑冠和烤瓷冠修复在两年后的磨耗情况。方法在临床应用烤塑冠和烤瓷冠修复两年,用咬合纸的方法来测定义齿磨耗情况。结果种植烤塑冠修复组和种植烤瓷冠修复组磨耗没有统计学差异(p0.05)。结论用种植烤塑冠及烤瓷冠修复磨耗性能在临床上无显著差异。     

浅析“四项负责制”在高校图书馆的实施——以湖北工程学院图书馆为例

分别从"四项负责制"的基本概念入手,阐述了在高校图书馆实施"四项负责制"的基本内容及基本要求,以湖北工程学院图书馆为例,介绍了该馆倡导和推行"四项负责制"的情况,以提高图书馆整体服务质量。     

第十二种孤独——从《复活节游行》解读理查德·耶茨“孤独的女性”主题

发表于1976年的《复活节游行》是美国现代作家理查德·耶茨的"女性小说"。在作品中,耶茨从一个男性作家的视角,细致入微地描写了上世纪70年代美国都市普通家庭两姐妹,用犀利但满含怜悯的笔触展示了以主人公艾米莉一家为代表的孤独的女性群体,是作家在其短篇小说集《十一种孤独》之后所描述的"第十二种孤独"——女性孤独。从孤独的女性主题着手,以《复活节游行》的分析为突破口,结合存在主义探讨作家对女性孤独的理解,并试图找到破解现代人孤独的钥匙。     

是是非非话海龄

海龄是鸦片战争时期镇江保卫战的主要指挥者之一。他作战勇敢,以身殉国,是反抗外敌入侵的知名抗战派将领。海龄又屠杀群众,得罪官绅商民,受到多方责难。形成这种矛盾性评价的根源,在于海龄所属阶级与民族的时代局限性。     

运用Actigraph GT3X三轴加速度传感器测量成年及老年男性人群步行的信效度研究

评价Actigraph GT3X三轴加速度传感器测量中国男性人群典型体力互动信效度,开发基于中国人群步行活动模式的GT3X三轴加速度传感器能耗推算方程。方法受试对象包括青年组(21.92±1.14岁),老年组(55.5±4.52岁)。受试者佩戴GT3X三轴加速度传感器,在跑台上分别完成3km/h(慢走)、4.5km/h(正常步行)、4.5km/h10%(上坡步行)、6km/h(快走)以及7.5km/h(慢跑)速度的走跑运动各5min。受试者佩戴COSMED K4b2便携式代谢测试仪,并将GT3X三轴加速度传感器佩戴于髋部,同步采集心肺功能仪及加速度传感器数据。结果根据受试对象4种无坡度走跑运动推导出线性方程MET=0.000653*counts(Axis1)+2.345521以及线性方程MET=0.000689*counts(VM)+1.640721,但其相关系数不高;GT3X+三轴加速度传感器记录上坡步行(4.5km/h10%)运动与无坡度运动(4.5km/h)相比,三轴counts及VM均显示有差异性(P<0.05),但counts增加率远低于MET增加率;GT3X+三轴加速度传感器两次重复测试,pearson值高,即离散程度低。结论本研究推导垂直轴(Axis1)、三轴矢量和(VM)的线性方程,为中度相关,误差值较大,且上坡运动时的GT3X+三轴加速度传感器记录counts值与MET值呈非线性相关,提示Actigraph GT3X三轴加速度传感器能耗推算方程可根据不同运动方式、运动强度推算相对应方程;Actigraph GT3X三轴加速度传感器测量我国成年及老年男性人群步行活动其信度较高。     

A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

Uniform local well-posedness and inviscid limit for the Benjamin-Ono-Burgers equation

In this paper, we study the Cauchy problem for the Benjamin-Ono-Burgers equation \({\partial _t}u - \epsilon \partial _x^2u + {\cal H}\partial _x^2u + u{u_x} = 0\), where \({\cal H}\) denotes the Hilbert transform operator. We obtain that it is uniformly locally well-posed for small data in the refined Sobolev space \({\tilde H^\sigma }(\mathbb{R})\,\,(\sigma \geqslant 0)\), which is a subspace of L²(ℝ). It is worth noting that the low-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is scaling critical, and thus the small data is necessary. The high-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is equal to the Sobolev space H^σ (ℝ) (σ ⩾ 0) and reduces to L²(ℝ). Furthermore, we also obtain its inviscid limit behavior in \({\tilde H^\sigma }(\mathbb{R})\) (σ ⩾ 0).

     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.