富 BaCO3对YBCO超导样品的超导性能的影响

为提高123相高温超导材料的临界电流密度Jc,本文从改变样品的用料配方、革新制备工艺等方面做了一些尝试和研究.在生成约 10 g123相超导样品正常配比的基础上,分别多加了5mg到100mg不等的BaCO3,采用固相反应法制备了超导体块材.通过比较各样品的超导转变温度Tc、超导转变宽度ΔT、临界电流密度Jc、扫描电镜照片和X-Ray衍射谱图,可以得出:富BaCO3123相超导体的超导转变温度Tc均大于90K;ΔT=1～3K;20mg的富BaCO3有利于123相的形成;一定量富BaCO3的加入对提高123相超导材料的临界电流密度Jc很有利.     

基于有限体积法的高温超导磁体热扰动下温度场仿真

为了研究局部热扰动下高温超导磁体热输运特性,建立了三维各向异性非稳态热传导模型,并采用有限体积法在时域与三维空间进行离散计算,获得了高温超导磁体瞬态温度响应。仿真结果表明:高温超导磁体由于自身热导与体积热容的存在,具有一定承受热冲击的能力,可根据各向异性高温超导磁体热输运特性提出改善磁体热性能的方法。     

基于遗传算法的二维最大熵图像分割算法

二维最大熵图像分割算法充分利用了图像象素的灰度分布信息和各象素间的空间相关信息 ,因此具有很好的分割效果。但该算法的计算复杂度高、计算时间长。为解决这一问题 ,本文提出了一种基于遗传算法的二维最大熵法。该算法充分利用遗传算法的特点 ,极大地减少了计算量和存储空间。实验结果证明了该算法的快速性、有效性和稳定性。     

高透波性大刚度桅杆设计与性能测试分析

提出了用复合材料技术设计与制造高透波性大刚度桅杆的方法,以高强玻璃纤维为增强材料、SW905乙烯基脂树脂为基体材料,制作出1∶1桅杆模型,对制作出的桅杆模型进行了性能测试.测试结果表明,制作出的桅杆具有高透波性和较大的动刚度.     

二维非线性正交异性材料的瞬态热传导反问题研究

针对正交异性材料的二维非线性热传导反问题,本文采用顺序函数法对表面热流辨识进行了研究。在求解反问题时用到有限体积法、牛顿-拉夫逊法并引入未来时间步长的概念。在每个时间步内,将待辨识热流视为非线性方程组的未知量,通过一个迭代过程进行求解。从文中的例子可以看出,真实热流和辨识热流结果相近,从而证明了本方法在辨识二维非线性热传导反问题时是准确、稳定、有效的。     

卷积调制的SAR雷达二维间歇采样转发干扰技术

SAR雷达二维间歇采样转发干扰可以在距离向和方位向同时形成假目标串,对SAR雷达具有良好的欺骗干扰效果,但该方法存在间歇采样转发干扰共同缺陷。针对SAR雷达二维间歇采样转发干扰的缺陷,提出了基于卷积调制的SAR雷达二维间歇采样转发干扰方法,即对二维间歇转发干扰信号进行距离向和方位向的二维卷积调制,通过选择参与卷积调制信号的形式,可以产生灵活可控的干扰效果,能够有效克服间歇采样转发干扰的缺陷,理论分析和仿真实验证明了该方法的可行性、有效性。     

二维相关的G0分布雷达杂波仿真

G0分布模型可实现对不同均匀度雷达杂波的较好拟合,二维相关G0分布雷达杂波的精确仿真对雷达系统设计和性能评估具有重要意义。在利用分段多项式拟合的方法近似表示非线性变换的基础上,将二维相关的高斯随机过程作为输入,提出了基于无记忆非线性变换的二维相关G0分布雷达杂波仿真方法。更进一步,为了实现对杂波幅度与相关性的独立控制,并仿真具有同相和正交分量的相参雷达杂波,推导了单视条件下G0分布模型的球不变随机过程特征函数表达式,提出了基于球不变随机过程的仿真方法。仿真结果表明,这两种方法均能够仿真产生满足幅度和相关性要求的二维相关G0分布雷达杂波。     

二维 DFT 和 DCT 的 Systolic 阵列

超级计算中一个活跃的研究领域是将某些有限和,如离散富里叶变换(DFT)、离散余弦变换(DCT),映射到多处理机阵列上。本文首先通过二维DFT的行列分解算法流程图,给出了计算二维DFT的二种Systolic阵列:一种是由N_1个处理器组成的线性阵列,所花时间步为O(N_1N_2)(设二维DFT为N_1×N_2长的),与行列分解算法在单处理机上顺序执行所花时间相比,加速比为O(N)(设N_1=N_2=N)。这一结果无论是在时间消耗,还是在PE数量上都是目前最优的。另一种是由N_1×N_2个处理器组成的矩形阵列,所需时间为O(N_1+N_2),与行列算法在单处理机上顺序运行所花时间相比,加速比为O(N~2)(这里仍假定N_1=N_2=N)。本文还给出了二维DCT的与二维DFT相似的Systoilc阵列结构。不难将上述阵列推广到多维的情况。     

一种新的二维谐波估计方法

研究了二维谐波信号相关矩阵后 ,提出了一种称之为“矩阵束的二维谐波估计 (MP2D)”算法 ,该算法既不需要求解二维特征多项式的根 ,也不需要在二维频率空间搜索谱峰 ,算法具有高效性。仿真实验表明 ,该算法在白噪声条件下对二维谐波频率估计具有高的精度和强的抗干扰能力。     

二维离散映象的拓扑熵

本文计算了二维离散映象在经过倍周期分岔、同周期分岔到混沌时的拓扑熵,并得到这些映象通向混沌的各种道路和与其对应的拓扑熵之间的关系,揭示了拓扑熵与混沌之间的内在联系。     

On the first time a separately maintained parallel system has been down for a fixed time

Consider a system consisting of n separately maintained independent components where the components alternate between intervals in which they are “up” and in which they are “down”. When the i^th component goes up [down] then, independent of the past, it remains up [down] for a random length of time, having distribution F_i[G_i], and then goes down [up]. We say that component i is failed at time t if it has been “down” at all time points s ?[t-A.t]: otherwise it is said to be working. Thus, a component is failed if it is down and has been down for the previous A time units. Assuming that all components initially start “up,” let T denote the first time they are all failed, at which point we say the system is failed. We obtain the moment-generating function of T when n = l, for general F and G, thus generalizing previous results which assumed that at least one of these distributions be exponential. In addition, we present a condition under which T is an NBU (new better than used) random variable. Finally we assume that all the up and down distributions F_i and G_i i = l,….n, are exponential, and we obtain an exact expression for E(T) for general n; in addition we obtain bounds for all higher moments of T by showing that T is NBU.     

The asymptotic joint distribution of the state occupancy times in an alternating renewal process

An alternating renewal process starts at time zero and visits states 1,2,…,r, 1,2, …,r 1,2, …,r, … in sucession. The time spent in state i during any cycle has cumulative distribution function F_i, and the sojourn times in each state are mutually independent, positive and nondegenerate random variables. In the fixed time interval [0,T], let U_i(T) denote the total amount of time spent in state i. In this note, a central limit theorem is proved for the random vector (U_i(T), 1 ≤ i ≤ r) (properly normed and centered) as T → ∞.     

A heterogeneous arrival and service queueing loss model

Consider a single-server exponential queueing loss system in which the arrival and service rates alternate between the paris (γ₁, γ₁), and (γ₂, μ₂), spending an exponential amount of time with rate cμ_i in (γ_i, μ_i), i = 1.2. It is shown that if all arrivals finding the server busy are lost, then the percentage of arrivals lost is a decreasing function of c. This is in line with a general conjecture of Ross to the effect that the “more nonstationary” a Poisson arrival process is, the greater the average customer delay (in infinite capacity models) or the greater the precentage of lost customers (in finite capacity models). We also study the limiting cases when c approaches 0 or infinity.     

Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues

T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least K_i of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest K_i and allocates functioning components to subsystems in increasing order of the K_i's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the K_i's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001     

Decomposition algorithms for minimal cut problems

Consider a network G(N. A) with n nodes, where node 1 designates its source node and node n designates its sink node. The cuts (Z_i, =), i= 1…, n - 1 are called one-node cuts if 1 ? Z_i,. n q Z_i, Z₁-_? {1}, Z_i ? Z_i+1 and Z_i and Z_i+l differ by only one node. It is shown that these one-node cuts decompose G into 1 m n/2 subnetworks with known minimal cuts. Under certain circumstances, the proposed one-node decomposition can produce a minimal cut for G in 0(n² ) machine operations. It is also shown that, under certain conditions, one-node cuts produce no decomposition. An alternative procedure is also introduced to overcome this situation. It is shown that this alternative procedure has the computational complexity of 0(n³).     

基于随机森林的重要性测度指标体系

重要性测度分析可以找出重要特征变量,从而降低输入空间的维数,节约运算成本。基于随机森林重要性测度的分析原理,探寻随机森林的重要性测度指标与基于方差的全局灵敏度指标之间的联系,得到求解方差灵敏度主指标S_i及其总指标S_i~T的新途径。建立基于随机森林的单变量、组变量重要性测度指标,并明确具体的求解过程,完善基于随机森林的重要性测度指标体系。通过算例验证了所提基于随机森林的重要性测度指标体系的有效性及其与方差灵敏度指标之间关系的正确性。     

A general treatment of upper unbounded and bounded hitchcock problems

This paper is designed to treat (a) the problem of the determination of the absolute minimum cost, with the associated assignments, when there is no limit, N, on the number of parcels available for shipment in a modified Hitchcock problem. This is accomplished with the use of a transformed cost matrix. C*, to which the so-called transportation paradox does not apply. The general Hitchcock solution using C* gives the cost T*, which is the absolute minimum cost of the original problem, as well as sets of assignments which are readily transformed to give the general assignments of the original problem. The sum of these latter assignments gives the value of N_u, the unbounded N for minimum cost. In addition, this paper is designed to show (b) how the method of reduced matrices may be used, (c) how a particular Hitchcock solution can be used to determine a general solution so that one solution using C* can provide the general answer, (d) how the results may be modified to apply to problems with fixed N, and hence (e) to determine the function of the decreasing T as N approaches N_u, and finally (f) to provide a treatment when the supplies at origin i and/or the demands at destination j, are bounded.     

Confidence intervals for ranked means

Suppose that observations from populations π₁, …, π_k (k ≥ 1) are normally distributed with unknown means μ₁., μ_k, respectively, and a common known variance σ². Let μ_[1] μ … ≤ μ_[k] denote the ranked means. We take n independent observations from each population, denote the sample mean of the n observation from π₁ by X _i (i = 1, …, k), and define the ranked sample means X _[1] ≤ … ≤ X _[k]. The problem of confidence interval estimation of μ₍₁₎, …,μ_[k] is stated and related to previous work (Section 1). The following results are obtained (Section 2). For i = 1, …, k and any γ(0 < γ < 1) an upper confidence interval for μ_[i] with minimal probability of coverage γ is (? ∞, X _[i]+ h) with h = (σ/n^1/2) Φ^?1(γ^1/k-i+1), where Φ(·) is the standard normal cdf. A lower confidence interval for μ_[i] with minimal probability of coverage γ is (X _i[i] – g, + ∞) with g = (σ/n^1/2) Φ^?1(γ^1/i). For the upper confidence interval on μ_[i] the maximal probability of coverage is 1– [1 – γ^1/k-i+1]ⁱ, while for the lower confidence interval on μ_[i] the maximal probability of coverage is 1–[1– γ^1/i] ^k-i+¹. Thus the maximal overprotection can always be calculated. The overprotection is tabled for k = 2, 3. These results extend to certain translation parameter families. It is proven that, under a bounded completeness condition, a monotone upper confidence interval h(X ₁, …, X _k) for μ_[i] with probability of coverage γ(0 < γ < 1) for all μ = (μ_[1], …,μ_[k]), does not exist.     

On convexity proofs in location theory

It is often assumed in the facility location literature that functions of the type ø_i(x_i, y) = β_i[(x_i-x)²+(y_i-y)²]^K/2 are twice differentiable. Here we point out that this is true only for certain values of K. Convexity proofs that are independent of the value of K are given.     

Covariance of weibull order statistics

Let X₁ < X₂ <… < X_n denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?x^p), x > 0. Formulae for computing Cov (X_i, X_j) are well known, but they are difficult to use in practice. A simple approximation to Cov(X_i, X_j) is presented here, and its accuracy is discussed.