双拉试样裂纹扩展过程中的应力强度因子计算

论文将使用一种界面单元来解决二维裂纹的静态扩展问题.这种界面单元基于虚拟裂纹闭合法,利用商业有限元软件ABAQUS的用户自定义单元UEL功能,发展为界面断裂单元,计算应变能释放率(GⅠ和GⅡ).在裂纹尖端的两个节点间设置一个特殊刚度的弹簧,并引入哑节点计算裂纹尖端后面的张开位移和裂纹尖端前面的虚拟裂纹扩展量.采用这种单元计算应变能释放率时不需要使用奇异单元或折叠单元,不会出现收敛问题,也不需要复杂的后续处理.因此,采用这种断裂单元分析二维裂纹扩展问题是方便的、高效率的,而且也能得到可靠的精度.     

基于SEMMA的网络安全事件可视探索

网络安全可视化可直观地提取网络安全特征、全方位感知网络安全态势,但如何宏观把控网络安全的整体分析流程仍是一大研究难题。为此,引入了数据挖掘中经典的示例-探索-修改-模型-评估（sample-explore-modify-model-assess,SEMMA）分析范式,并结合网络安全可视化提出了一套通用的网络安全事件分析模型,将分析过程划分为数据处理、行为特征探索、异常对象定位、异常事件描述与行为模式关联分析等步骤,规范安全事件探索分析流程。在行为特征探索环节,用模糊C均值算法量化主机行为,识别网络资产结构;提出了用基于协议的节点链接图（protocol-based node link diagram,PBNLD）可视化表征形式构建网络通信模型,以提升大规模节点的绘制质量;以安全事件分析模型为指导,面向多源安全日志实例数据,搭建了网络安全事件可视探索系统,通过多视图协同与故事线回溯的方式实现网络资产划分、网络异常事件提取和攻击事件演化。最后,通过实验证明了分析模型的有效性。     

Understanding the Uniqueness of 2p Elements in Periodic Tables

The Periodic Table, and the unique chemical behavior of the first element in a column (group), were discovered simultaneously one and a half centuries ago. Half a century ago, this unique chemistry of the light homologs was correlated to the then available atomic orbital (AO) radii. The radially nodeless 1s, 2p, 3d, 4f valence AOs are particularly compact. The similarity of r (2s)≈r(2p) leads to pronounced sp-hybrid bonding of the light p-block elements, whereas the heavier p elements with n≥3 exhibit r (ns) ≪ r (np) of approximately −20 to −30 % . Herein, a comprehensive physical explanation is presented in terms of kinetic radial and angular, as well as potential nuclear-attraction and electron-screening effects. For hydrogen-like atoms and all inner shells of the heavy atoms, r (2s) ≫ r (2p) by +20 to +30 % , whereas r (3s)≳r(3p) ≳r(3d), since in Coulomb potentials radial motion is more radial orbital expanding than angular motion. However, the screening of nuclear attraction by inner core shells is more efficient for s than for p valence shells. The uniqueness of the 2p AO is explained by this differential shielding. Thereby, the present work paves the way for future physical explanations of the 3d, 4f, and 5g cases.     

节点有自环的网络流数学模型

以网络流中节点有自环的情形为对象进行研究,把节点分开为入点和出点,节点自环转换为流量相同,方向相反的两条弧,改进了网络流数学模型.改进后的数学模型在处理原来网络流中节点发生异常情况时,即节点不遵守流量守恒条件时,其节点自环的流能够起特殊的调节作用.在描述网络流异常状态时,给出了网络流状态周期的阶跃性质.通过网络模型对应的邻接矩阵对网络流进行计算和监控,给出一个节点环流的应用实例.     

Complexity of networks I: The set‐complexity of binary graphs

The balance between symmetry and randomness as a property of networks can be viewed as a kind of “complexity.” We use here our previously defined “set complexity” measure (Galas et al., IEEE Trans Inf Theory 2010, 56), which was used to approach the problem of defining biological information, in the mathematical analysis of networks. This information theoretic measure is used to explore the complexity of binary, undirected graphs. The complexities, Ψ, of some specific classes of graphs can be calculated in closed form. Some simple graphs have a complexity value of zero, but graphs with significant values of Ψ are rare. We find that the most complex of the simple graphs are the complete bipartite graphs (CBGs). In this simple case, the complexity, Ψ, is a strong function of the size of the two node sets in these graphs. We find the maximum Ψ binary graphs as well. These graphs are distinct from, but similar to CBGs. Finally, we explore directed and stochastic processes for growing graphs (hill‐climbing and random duplication, respectively) and find that node duplication and partial node duplication conserve interesting graph properties. Partial duplication can grow extremely complex graphs, while full node duplication cannot do so. By examining the eigenvalue spectrum of the graph Laplacian we characterize the symmetry of the graphs and demonstrate that, in general, breaking specific symmetries of the binary graphs increases the set‐based complexity, Ψ. The implications of these results for more complex, multiparameter graphs, and for physical and biological networks and the processes of network evolution are discussed. © 2011 Wiley Periodicals, Inc. Complexity, 17,51–64, 2011     

On integral sum graphs

A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u)+f(v)=f(w) for some node w in G. A node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K₃ has at most two saturated nodes. We determine the structure for all integral sum graphs with exactly two saturated nodes, and give an upper bound for the number of edges of a connected integral sum graph with no saturated nodes. We introduce a method of identification on constructing new connected integral sum graphs from given integral sum graphs with a saturated node. Moreover, we show that every graph is an induced subgraph of a connected integral sum graph. Miscellaneous related results are also presented.     

谈"圆驻波"演示实验中的思维误区

指出了对“圆驻波”演示实验在认识上的两个误区，并在理论上分析了在该装置中实现圆环驻波的条件，得到了和实验现象相一致的理论结果。     

Kawasaki disease

Short history of Kawasaki disease, clinical features (principal symptoms and other significant symptoms or findings), diagnosis, cardiovascular involvement, epidemiology. Pathological features (lesion of vessels and lesion of organs exclusive of vessels), comparison between infantile periarteritis nodosa (IPN)/Kawasaki disease and classic periarteritis nodosa (CPN), etiology, treatment and management of Kawasaki disease are described.     

自由空间光交换网络中FET-SEED灵巧象素(2,2,2)光开关节点

灵巧象素作为自由空间光交换网络中的光开关节点具有开关能量小、高速、智能等优点.本文首次分别设计了在集中控制方式下和嵌入控制方式下(2,2,2)FET-SEED(场效应-自电光效应器件)灵巧象素光开关节点,并对其开关逻辑功能进行了分析.