Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s₁ and s₂ to, respectively, a given vertex t₁, and each vertex of a given subset of vertices T₂.     

Modification to the Fringe Component of Diffraction Coefficient in TD-EEC Method

A modified formulation for fringe component of diffraction coefficient is implemented to TD-EEC method. An example of diffraction by perfectly conducting plate is used to illustrate our scheme. Comparing with the FDTD results we observe that the improved expression for fringe component is more accurate than that of Michaeli's formulation. This high frequency time domain technique is available for treating the bistatic scattering problems for millimeter waves.     

Strongly confined quantum wire states in strained T-shaped GaAs/InAlAs structures

The confinement energy of T-shaped quantum wires (QWRs), which were fabricated by the cleaved edge overgrowth technique in a way that the QWRs form at the intersection of In_0.2Al_0.8As stressor layers and the overgrown (1 1 0) GaAs quantum well (QW), is examined using micro-photoluminescence spectroscopy. Photoluminescence (PL) signals from individual QWRs can be spatially resolved, since the strained films are separated by 1 μm wide Al_0.3Ga_0.7As layers. We find that due to the tensile strain being transmitted to the QW, the confinement energy of the QWRs rises systematically up to 40 meV with increasing thickness of the stressor layers. By reducing the excitation power to 0.1 μW the QWR PL emission occurs 48 meV redshifted with respect to the QW. All QWR peaks exhibit smooth lineshapes, indicating the absence of pronounced exciton localization.     

Highly edge‐connected detachments of graphs and digraphs

Let G = (V,E) be a graph or digraph and r : V → Z₊. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν₁,…,ν_r(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003     

图的边韧性度

文[1]中,定义图G(V,E)的边韧性度定义为min{(|S|+T(G-S))/(ω(G-S)):S?E(G)},这里,T-(G-S)和ω(G-S)分别表示G-S中最大分支的顶点数和连通分支数.这是一个能衡量网络图稳定性较好的参数,因为它不仅考虑到了图G-S的分支数也考虑到了它的阶数.在以前的工作中,作者得到了边韧性度图的一个充要条件.利用这些结果证明了K-树是严格边韧性度图,并找到了边韧性度与较高阶的边坚韧度和边坚韧度之间的关系.     

基于分层光学扫描的三维数字化测量技术

采用切削分层光扫描测量与计算机数据信息合成相结合的方法，有效地解决了具有复杂内外腔结构零件的三维数字化测量。该方法比传统三维测量速度快、自动化程度高，能同时准确测量零件内外腔表面，零件边缘测量误差可控制在CCD两个像素内。利用获取的铝合金精密小箱体三维数据，在计算机上重构了零件的三维模型，并用RP技术制造出了零件物理原形。     

基于积分方法的二维平行剪切层声远场预测

本文采用二维Ffowcs Williams＆Hawkings(FW-H)方程对平行剪切层远声场辐射特性进行了研究。近流场时间精确数据通过计算气动声学(Computational Aeroacoustics,CAA)技术数值模拟获得,声远场信息则通过FW-H方程对近流场内的可穿透积分面进行积分获得。该方法首先采用具有解析解的涡/尾缘干涉问题进行了校核,进一步采用CAA/FW-H匹配技术对二维平行剪切层声辐射问题进行了预测,计算结果表明,积分解与计算域内的CAA数值解吻合较好。     

Pulsed-Field-Gradient Measurements of Time-Dependent Gas Diffusion

Pulsed-field-gradient NMR techniques are demonstrated for measurements of time-dependent gas diffusion. The standard PGSE technique and variants, applied to a free gas mixture of thermally polarized xenon and O₂, are found to provide a reproducible measure of the xenon diffusion coefficient (5.71 × 10⁻⁶m²s⁻¹for 1 atm of pure xenon), in excellent agreement with previous, non-NMR measurements. The utility of pulsed-field-gradient NMR techniques is demonstrated by the first measurement of time-dependent (i.e., restricted) gas diffusion inside a porous medium (a random pack of glass beads), with results that agree well with theory. Two modified NMR pulse sequences derived from the PGSE technique (named the Pulsed Gradient Echo, or PGE, and the Pulsed Gradient Multiple Spin Echo, or PGMSE) are also applied to measurements of time dependent diffusion of laser polarized xenon gas, with results in good agreement with previous measurements on thermally polarized gas. The PGMSE technique is found to be superior to the PGE method, and to standard PGSE techniques and variants, for efficiently measuring laser polarized noble gas diffusion over a wide range of diffusion times.     

ON THE COHOMOLOGY OF GENERALIZED RESTRICTED LIE ALGEBRAS

0.IntroductionThispaperisaimedatdevelopingthecohomologytheoryofmodularLiealgebrasandthendeterminingthefirstcohomologygroupsofCartantypeLiealgebras.AsgeneralizationoftheconceptofrestrictedLiealgebras,ageneralizedrestrictedLiealgebra(GRLiealgebra)wasintroducedin[21],whichisassociatedwithabasisandamappingofthebasisintotheLiealgebrasatisfyingthegeneralized-restrictednessconditions.Generalizedrestrictedrepresentations(GRrepresentations)werethenintroduced,whichcanbereducedtotherepresentationsofa…     

k连通图可缩边导出子图的连通性

引进S1 3边形的概念 .证明了 ,对于k(k =3或 4)连通图G ,若G无S1 3边形 ,则 是 2连通的 ;另外也得到 ,设G是k(k≥ 2 )连通图 ,若对G的任一断片F ,有｜F｜ >[k/2 ]+ 1 ,则 是 2连通的 .从而改进并推广了N .Dean的结论 .