In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have disc...In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have discussed the vector bond graph representation of finite elementmethod in detail,there are:(1)the transformation of reference systems,(2)the transformation ofinertia matrices,stiffness matrices and vectors of joint force,(3)verctor bond graph representationof Lagrangian dynamic equation of structure.展开更多
随着大数据环境下数据安全风险复杂化,现有数据安全审计技术因碎片化特征利用及扩展能力不足,难以实现全生命周期风险覆盖,限制了风险检测效能.因此,提出一种基于风险要素的图嵌入数据安全审计方案(graph-embedded data security audit ...随着大数据环境下数据安全风险复杂化,现有数据安全审计技术因碎片化特征利用及扩展能力不足,难以实现全生命周期风险覆盖,限制了风险检测效能.因此,提出一种基于风险要素的图嵌入数据安全审计方案(graph-embedded data security audit scheme based on risk elements,RE-GDSA).首先构建含数据属性D(data)、用户特征U(user)、载体环境C(carrier)、操作行为A(action)的安全风险要素空间,实现数据全生命周期风险特征的结构化映射;然后利用图嵌入技术将风险要素映射为低维语义向量,构建跨维度关联模型以实现高效风险检测.通过有效性分析和性能分析验证了该方案的可行性.展开更多
We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so ...We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so that these schemes are within the reach of the current technology.展开更多
For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G i...For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.展开更多
文摘In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have discussed the vector bond graph representation of finite elementmethod in detail,there are:(1)the transformation of reference systems,(2)the transformation ofinertia matrices,stiffness matrices and vectors of joint force,(3)verctor bond graph representationof Lagrangian dynamic equation of structure.
文摘随着大数据环境下数据安全风险复杂化,现有数据安全审计技术因碎片化特征利用及扩展能力不足,难以实现全生命周期风险覆盖,限制了风险检测效能.因此,提出一种基于风险要素的图嵌入数据安全审计方案(graph-embedded data security audit scheme based on risk elements,RE-GDSA).首先构建含数据属性D(data)、用户特征U(user)、载体环境C(carrier)、操作行为A(action)的安全风险要素空间,实现数据全生命周期风险特征的结构化映射;然后利用图嵌入技术将风险要素映射为低维语义向量,构建跨维度关联模型以实现高效风险检测.通过有效性分析和性能分析验证了该方案的可行性.
文摘We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so that these schemes are within the reach of the current technology.
基金This work has been supported by the Research Institute for Fundamental Sciences Tabriz,Iran.
文摘For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.
