Some new results on the preservation of the NBUE and NWUE aging classes under the formation of coherent systems

We consider the classical problem of whether certain classes of lifetime distributions are preserved under the formation of coherent systems. Under the assumption of independent and identically distributed (i.i.d.) component lifetimes, we consider the NBUE (new better than used in expectation) and NWUE (new worse than used in expectation) classes. First, a necessary condition for a coherent system to preserve the NBUE class is given. Sufficient conditions are then obtained for systems satisfying this necessary condition. The sufficient conditions are satisfied for a collection of systems which includes all parallel systems, but the collection is shown to be strictly larger. We also prove that no coherent system preserves the NWUE class. As byproducts of our study, we obtain the following results for the case of i.i.d. component lifetimes: (a) the DFR (decreasing failure rate) class is preserved by no coherent systems other than series systems, and (b) the IMRL (increasing mean residual life) class is not preserved by any coherent systems. Generalizations to the case of dependent component lifetimes are briefly discussed.     

Bilateral phase-type distributions

In this article we define a class of distributions called bilateral phase type (BPH), and study its closure and computational properties. The class of BPH distributions is closed under convolution, negative convolution, and mixtures. The one-sided version of BPH, called generalized phase type (GPH), is also defined. The class of GPH distributions is strictly larger than the class of phase-type distributions introduced by Neuts, and is closed under convolution, negative convolution with nonnegativity condition, mixtures, and formation of coherent systems. We give computational schemes to compute the resulting distributions from the above operations and extend them to analyze queueing processes. In particular, we present efficient algorithms to compute the steady-state and transient waiting times in GPH/GPH/1 queues and a simple algorithm to compute the steady-state waiting time in M/GPH/1 queues.     

Life distribution analysis based on Lévy subordinators for degradation with random jumps

For a component or a system subject to stochastic degradation with sporadic jumps that occur at random times and have random sizes, we propose to model the cumulative degradation with random jumps using a single stochastic process based on the characteristics of Lévy subordinators, the class of nondecreasing Lévy processes. Based on the inverse Fourier transform, we derive a new closed‐form reliability function and probability density function for lifetime, represented by Lévy measures. The reliability function derived using the traditional convolution approach for common stochastic models such as gamma degradation process with random jumps, is revealed to be a special case of our general model. Numerical experiments are used to demonstrate that our model performs well for different applications, when compared with the traditional convolution method. More importantly, it is a general and useful tool for life distribution analysis of stochastic degradation with random jumps in multidimensional cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 483–492, 2015     

对内地新疆班思想政治与教育管理的思考

本文介绍了内地新疆班概况,内地新疆班人才培养工作取得的成效,分析了内地新疆高中班的思想政治与教育管理工作存在的问题,提出了内地新疆班的思想政治与教育管理工作的思路。     

Log‐concave and concave distributions in reliability

Nonparametric classes of life distributions are usually based on the pattern of aging in some sense. The common parametric families of life distributions also feature monotone aging. In this paper we consider the class of log‐concave distributions and the subclass of concave distributions. The work is motivated by the fact that most of the common parametric models of life distributions (including Weibull, Gamma, log‐normal, Pareto, and Gompertz distributions) are log‐concave, while the remaining life of maintained and old units tend to have a concave distribution. The classes of concave and log‐concave distributions do not feature monotone aging. Nevertheless, these two classes are shown to have several interesting and useful properties. We examine the closure of these classes under a number of reliability operations, and provide sharp reliability bounds for nonmaintained and maintained units having life distribution belonging to these classes. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 419–433, 1999     

多属性决策中的线性组合赋权方法研究

权向量的确定是多属性决策中一个重要问题,线性组合赋权方法是解决该问题的一个有效途径。对线性组合赋权的求解问题进行了一般性的描述,并根据求解所用信息的不同将求解方法分为四类,阐述了每类方法常用的求解思路和原则,进一步分析了不同类别方法的特点。对求解方法进行分类,有利于对不同求解方法本质和特性的了解,可以为不同组合赋权方法的应用提供参考。     

Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future

Many sequential planning problems can be represented as a shortest path problem in an acyclic network. This includes all deterministic dynamic programs as well as certain stochastic sequential decision problems. In this article, we identify a large class of shortest path problems for which a general efficient algorithm for the simultaneous solution and detection of minimal forecast horizons is developed. Detection of a such minimal forecast horizons is essential when accurate information regarding various relevant parameters is obtained progressively, i.e., when the initial information is restricted to a limited horizon of “future” stages only. We describe five classes of planning problems which can be efficiently addressed by the general algorithm. These classes deal with multi-item joint replenishment systems, combined inventory and routing problems, machine scheduling issues, single item stochastic inventory settings and routing problems in the plane and in space. © 1996 John Wiley & Sons, Inc.     

基于快速傅里叶变换的扫描单发单收面阵近场成像技术

近年来,扫描单发单收面阵近场成像技术在安检、医疗等民用领域中引起了广泛关注.然而,传统的距离徙动算法在对回波进行处理的过程中无法避免多步近似和插值操作,并且忽视了信号传播衰减带来的不利影响.因此,提出了一种基于快速傅里叶变换的扫描单发单收面阵近场成像技术,该技术通过保留回波模型中的幅度衰减因子,并根据目标回波方程特性对...     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

对象边框标注数据的弱监督图像语义分割

针对图像语义分割应用中像素级标注数据费时昂贵的问题,主要研究以对象边框标注数据为代表的弱监督模型下的图像语义分割方法。使用基于金字塔的密集采样全卷积网络提取图像的像素级特征,并用GrabCut算法转化对弱监督数据进行数据标记,通过将图像特征和标记数据进行联合训练,构建了基于金字塔密集采样全卷积网络的对象边框标注弱监督图像语义分割模型,并在公开数据集上进行了验证。实验结果表明,所构建的弱监督模型与DET3-Proposed模型、全矩形转化模型以及Bbox-Seg模型相比,达到了更好的分割效果。     

Time minimizing flows in directed networks

An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented.     

自适应控制中的Hartley块算法及实验

针对小波包自适应控制子频带内包含大量卷积和相关运算导致算法收敛速度慢的问题,提出基于Hartley块的小波包滤波最小均方算法。将快速Hartley变换引入块算法,实现频域内快速卷积和相关运算;在子频带内应用Hartley块算法生成控制信号,通过重叠保留法提出基于Hartley块的小波包滤波最小均方算法;通过仿真和实验研究了定频和扫频两种工况下的隔振性能和控制效果。结果表明,基于Hartley块的小波包滤波最小均方算法不仅可以大幅缩短收敛时间,还能显著提高控制精度,且鲁棒性和稳定性良好,能够很好地应用在工程实际中。     

A generalized recursive algorithm for a class of non-stationary regeneration (scheduling) problems

Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques.     

二维矩阵卷积在向量处理器中的设计与实现

为了加快卷积神经网络模型的计算速度,便于大规模神经网络模型在嵌入式微处理器中的实现,以FT-matrix2000向量处理器体系结构为研究背景,通过对多核向量处理器体系结构的分析和对卷积神经网络算法的深入研究,提出将规模较小的卷积核数据置于标量存储体,尺寸较大的卷积矩阵置于向量存储体的数据布局方案。针对矩阵卷积中数据难以复用的问题,提出根据卷积核移动步长的不同动态可配置的混洗模式,通过对所取卷积矩阵元素进行不同的移位操作,进而大幅提高卷积矩阵数据的复用率。针对二维矩阵卷积由于存在数据相关性进而难以多核并行的问题,提出将卷积矩阵多核共享,卷积核矩阵多核独享的多核并行方案。设计了卷积核尺寸不变、卷积矩阵规模变化和卷积矩阵尺寸不变、卷积核规模变化的两种计算方式,并在主流CPU、GPU、TI6678、FT-matrix2000平台进行了性能对比与分析。实验结果表明:FT-matrix2000相比CPU最高可加速238倍,相比TI6678可加速21倍,相比GPU可加速663 805倍。     

关于思想政治教育本质的思考

事物的本质是该事物得以存在和发展的根据。思想政治教育的本质问题是思想政治教育学的＂元问题＂,自该学科成立以来,这一问题并未得到完满解决,影响到了其理论发展和实践效用;要给出符合其学科特征的界定,就不能脱离本质的原义与思想政治教育的学科特殊性。结合它的起源发展、内容及其特殊矛盾,应在阶级性这一本质属性的规限下做到工具性与合目的性的统一。     

Revenue management with aircraft reassignment flexibility

A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

The class of mifra lifetimes and its relation to other classes

In a previous paper, the authors have introduced a class of multivariate lifetimes (MIFRA) which generalize the univariate lifetimes with increasing failure rate average (IFRA). They have also shown that this class satisfies many fundamental properties. In this paper it is shown that other concepts of multivariate IFRA do not satisfy all of these properties. Relationships between MIFRA and these other concepts are given. Finally, positive dependence implications with respect to these classes are also discussed.     

Preservation of stochastic orders for random minima and maxima,with applications

It is shown, in this note, that the right spread order and the increasing convex order are both preserved under the taking of random maxima, and the total time on test transform order and the increasing concave order are preserved under the taking of random minima. Some inequalities and preservation properties in reliability and economics are given as applications. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

一种基于混合概率PCA模型的高光谱图像非监督分类方法

提出了一种在期望最大化(EM)算法框架下同时实现混合概率主成分分析(PPCA)降维和聚类的高光谱图像非监督分类方法。它根据不同类别应各有自己代表性的特征集,将通常意义下的特征抽取和模式分类合并在一步内完成,尽可能地保留了可分性;同时该方法具有概率模型的优点,更适合高维数据处理。采用仿真数据和真实数据进行的比较实验表明,该算法较一般不加区分地对所有原始数据进行PCA降维再分类的方法能得到更好的分类结果。     

On the (S − 1, S) lost sales inventory model with priority demand classes

In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot‐for‐lot or (S ? 1, S) inventory model with lost sales. For each demand class there is a critical stock level at and below which demand from that class is not satisfied from stock on hand. In this way stock is retained to meet demand from higher priority demand classes. A set of such critical levels determines the stocking policy. For Poisson demand and a generally distributed lead time, we derive expressions for the service levels for each demand class and the average total cost per unit time. Efficient solution methods for obtaining optimal policies, with and without service level constraints, are presented. Numerical experiments in which the solution methods are tested demonstrate that significant cost reductions can be achieved by distinguishing between demand classes. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 593–610, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10032