基于高温超导本征约瑟夫森效应的新型两端恒流器件

我们利用高温超导本征约瑟夫森效应,研制了一种超导薄膜两端恒流器件.恒流器件是将生长在斜切20度LaAlO3基片上的Tl-2212超导薄膜光刻成微桥得到的.对于6μm×8μm的微桥器件,其最高工作电压可达15V以上,当两端电压在1V～11V之间变化时,电流基本稳定在4.3mA,误差不超过±5%,动态内阻大于104 Ω,在最佳工作位置(3V～8V)动态内阻可以达到105 Ω.通过数字模拟,对实际应用中两端恒流器件的rf调制进行了较详细的分析,并可使恒定电流上rf调制小于1%.     

工件间具有串并有向图约束的单机随机排序问题

研究机器发生随机故障的单机排序问题,其中工件间的优先约束为串并有向图,目标函数为极小化加权完工时间和,证明了此问题多项式时间可解,并给出了多项式时间算法.     

具有优先约束的单机随机排序问题

讨论工件的加工时间为常数,机器发生随机故障的单机随机排序问题,目标函数极小化工件的加权完工时间和的数学期望最小.考虑两类优先约束模型.在第一类模型中,设工件间的约束为串并有向图.证明了模块M的ρ因子最大初始集合I中的工件优先于模块中的其它工件加工,并且被连续加工所得的排序为最优排序,从而将Lawler用来求解约束为串并有向图的单机加权总完工时间问题的方法推广到机器发生随机故障的情况.在第二类模型中,设工件间的约束为出树优先约束.证明了最大家庭树中的工件优先于家庭树中其它的工件加工,并且其工件连续加工所得到的排序为最优排序并给出了最优算法.     

The recognition of the class of indecomposable digraphs under low hemimorphy

Given a digraph G=(V,A), the subdigraph of G induced by a subset X of V is denoted by G[X]. With each digraph G=(V,A) is associated its dual G^?=(V,A^?) defined as follows: for any x,y∈V, (x,y)∈A^? if (y,x)∈A. Two digraphs G and H are hemimorphic if G is isomorphic to H or to H^?. Given k>0, the digraphs G=(V,A) and H=(V,B) are k-hemimorphic if for every X⊆V, with |X|≤k, G[X] and H[X] are hemimorphic. A class C of digraphs is k-recognizable if every digraph k-hemimorphic to a digraph of C belongs to C. In another vein, given a digraph G=(V,A), a subset X of V is an interval of G provided that for a,b∈X and x∈V−X, (a,x)∈A if and only if (b,x)∈A, and similarly for (x,a) and (x,b). For example, 0?, {x}, where x∈V, and V are intervals called trivial. A digraph is indecomposable if all its intervals are trivial. We characterize the indecomposable digraphs which are 3-hemimorphic to a non-indecomposable digraph. It follows that the class of indecomposable digraphs is 4-recognizable.     

On expansions and extensions of powerful digraphs

We study the problem of expanding and extending the structure of a stable powerful digraph to the structure of a stable Ehrenfeucht theory. We define the concepts of type unstability and type strict order property. We establish the presence of the type strict order property for every acyclic graph structure with an infinite chain. The simplest form of expansion of a powerful digraph to the structure of an Ehrenfeucht theory is the expansion with a 1-inessential ordered coloring and locally graph ?-definable many-placed relations, which enable us to mutually realize nonprincipal types; we prove that this expansion is incapable of keeping the structure in the class of stable structures, and moreover, by the type strict order property it generates the first-order definable strict order property. We define the concept of a locally countably categorical theory (LCC theory) and prove that given the list p ₁(x), ..., p _n (x) of all nonprincipal 1-types in an LCC theory, if all types r(x ₁, ..., x _m ) containing \(p_{i_1 } \) (x ₁) ∪ ... ∪ \(p_{i_m } \)(x _m ) are dominated by some type q then q is a powerful type.     

非光滑动力系统的迭代图胞映射法

分析了图胞映射方法在处理非光滑动力系统过程中遇到的关键问题------胞流扩张. 为了有效减小胞流扩张, 基于迭代图胞映射方法, 通过引入人工顶点集的概念, 构建了非光滑系统迭代图胞映射具体实施方案, 讨论了在此过程中值得注意的事项. 结合典型实例分析, 证实了该方法的有效性.      

迹非零的布尔矩阵的广义幂敛指数

设Ｄｎ（ｄ）是恰含ｄ个非零对角元的ｎ阶布尔矩阵的集合,１≤ｄ≤ｎ。本文得到了Ｄｎ（ｄ）中矩阵的广义幂敛指数的最大值。     

具有最小弧数且基指数为3的本原不可幂对称无环带号有向图

Let S be a primitive non-powerful symmetric loop-free signed digraph on even n vertices with base 3 and minimum number of arcs. In [Lihua YOU, Yuhan WU. Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs. Linear Algebra Appl., 2011, 434(5), 1215-1227], authors conjectured that D is the underlying digraph of S with exp(D) = 3 if and only if D is isomorphic to ED n,3,3 , where ED n,3,3 = (V, A) is a digraph with V = {1, 2, . . . , n}, A = {(1, i), (i, 1) | 3≤i≤n} ∪ {(2i-1, 2i), (2i, 2i-1) | 2≤i≤ n/2 } ∪ {(2, 3), (3, 2), (2, 4), (4, 2)}). In this paper, we show the conjecture is true and completely characterize the underlying digraphs which have base 3 and the minimum number of arcs.     

有向图(→C)n×(→P)2的优美性

研究了有向图(→C)n×(→P)2的优美性,利用搜索图的标号的算法与数学证明相结合的方法,证实了有向图(→C)n×(→P)2为优美图,其中n为任意正整数.     

Superpure digraph designs

A digraph design is a decomposition of a complete (symmetric) digraph into copies of pre‐specified digraphs. Well‐known examples for digraph designs are Mendelsohn designs, directed designs or orthogonal directed covers. A digraph design is superpure if any two of the subdigraphs in the decomposition have no more than two vertices in common. We give an asymptotic existence theorem for superpure digraph designs, which is a variation of an earlier result of Lamken and Wilson J Combin Theory Ser A 89: 149–200, 2000. As an immediate consequence, we obtain new results for supersimple designs and pure perfect Mendelsohn designs. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 239–255, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10013