费用约束下产品寿命试验与退化试验优化

针对Wiener退化失效型产品寿命试验与退化试验优化问题,以Wiener过程和逆高斯分布为依据,用分位寿命渐近方差作为可靠性指标进行了分析.首先比较了退化试验与定时截尾寿命试验的试验设计变量之间关系.然后考虑实际情况,研究试验费用有限情况下,寿命试验和退化试验分别达到渐近方差最小时的最优试验方案设计,发现退化试验的效率高于寿命试验.研究为小子样条件下长寿命产品可靠性试验设计提供了依据.     

基于广义逆理论的步进应力加速寿命试验的最优设计

步进应力加速寿命试验的最优设计问题早在20世纪60年代就已提出.本文在应力个数和未知参数个数不相等的情况下,以MLE渐近方差最小为准则,运用广义加号逆的理论,解决指数分布时定数截尾寿命试验和定时截尾寿命试验的最优设计问题.通过理论推导,得出定数截尾寿命试验时的不同应力下失效产品数的安排,以及定时截尾寿命试验时的最优应力变换点.并且,对每一种情况进行了数据模拟,结果显示,这些理论和方法在实际运用中是可行的和有效的.     

双应力步进加速试验设计及可靠性统计分析（指数分布）

本文对于一种在两种应力（应压应力和温度应力）的作用下的电子产品，当它的寿命服从指数分布时，提出双应力步加试验的试验设计及对所获得的失效数据进行可靠性的统计分析，并用自行编制的计算机软件完成了实例分析。     

逐次截尾步加试验的最优设计

本文研究的是一类特殊的步进应力加速寿命试验,即在试验过程中会有部分未失效产品移去(退出试验),我们称这种试验为逐次截尾加速寿命试验.本文在两种最优准则下分别研究了k个加速应力下定时与定数逐次截尾步加试验的最优设计问题.     

��ν�β����������������

本文研究的是一类特殊的步进应力加速寿命试验,即在试验过程中会有部分未失效产品移去(退出试验),我们称这种试验为{\kaishu\,逐次截尾加速寿命试验}.本文在两种最优准则下分别研究了$k$个加速应力下定时与定数逐次截尾步加试验的最优设计问题.     

指数分布场合下步进应力加速寿命试验的统计分析

一、引言与引理 步进应力加速寿命试验是将一定数量的产品在一组逐步升高的应力水平下进行寿命试验,每步试验停留一段时间,使得有一定数量的产品失效,下一步试验是对剩下的产品进行,如此进行下去,直到最高应力水平下的寿命试验中有一定数量的产品失效为止。与恒定应力加速寿命试验相比,步进应力加速寿命试验(以后简称步加试验)更能缩短试验时间,减少试验样品。因此步加试验在实际使用中也是一种重要的试验方法。对步加试验的试验数据如何进行统计分析是实际中必须解决的一个问题。     

具有竞争风险的步进应力加速寿命试验的最优设计和Bayes估计

讨论了渐进II型截尾数据中具有竞争风险的步进应力加速寿命试验的最优试验设计和参数估计.通过假定产品寿命服从Weibull分布,尺度参数对数是应力水平的线性函数基础上,利用KH模型采用极大似然方法和Bayes方法对模型参数进行了点估计和区间估计,而最优试验设计是使尺度参数对数的极大似然估计值在正常应力水平下的渐进方差达到最小.最后进行了仿真研究,结果显示提出的估计量具有良好的稳健性和有效性.     

CE模型下Weibull分布序加试验的Bayes分析

序进应力加速寿命试验是一种最为有效而经济的寿命试验方法,随着其理论的日趋成熟,在实践中开始得到应用和推广．本文给出了逆幂律模型下Weilbull分布定时和定数场合序进应力加速寿命试验的一种Bayes统计分析,并利用Gibbs抽样方法解决了分布的形状参数取为连续先验时各参数的Bayes估计．这种先验意义更明确,实例表明这是一种非常有效的方法．     

对数正态分布场合下步进应力加速寿命试验模型和数据分析方法

对数正态分布场合下步进应力加速寿命试验模型和数据分析方法马海训，李彩霞（河北经贸大学０５００６１）关键词：对数正态分布；寿命试验；数据分析ＡＭＳ（１９９１）主ｇ分类：６５Ｕ０５假设有ｎ个产品在加速应力水平ｓ；＜ｓ。＜…＜ｓ。下进行定时截尾步进应力加速...     

加速方程有偏场合下加速寿命试验的稳健设计

考虑在加速寿命试验中,当假定的加速模型不是转化应力的线性模型时,模型参数的极大似然估计的近似分布。研究在一定的条件下,获得正常应力下寿命分布的p分位寿命估计的最优稳健设计方法。并通过数值例子说明方法的有效性。     

Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines

This paper deals with a power-aware scheduling of preemptable independent jobs on identical parallel processors where ready time for each job is given and its completion time has to meet a given deadline. Jobs are described by (different) continuous, strictly concave functions relating their processing speeds at a time to the amount of power allotted at the moment. Power is a continuous, doubly constrained resource, i.e. both: its availability at each time instant and consumption over scheduling horizon are constrained. A methodology based on properties of minimum-length schedules is utilized to determine the existence of a feasible schedule for given amounts of energy and power. The question about minimum levels of power and energy ensuring the existence of a feasible schedule for a given set of jobs is also studied.     

无重叠区的双抓钩周期性排序问题的求解

在当今的自动化制造系统中，计算机控制的抓钩的排序直接影响系统的生产率。本文研究了产品在系统的一边装载、而在另一边卸载的电镀线周期性排序问题。工件在每个工作站的处理时间在给定时间范围内，工作站之间没有缓冲槽，相同轨道上的两个抓钩用于工作站之间工件的运送，目标是对运送进行排序以极小化生产周期。为了求解这个问题，本文提出一个求解方法，所提出的方法首先将生产线分为两个无重叠的区域，并且为每个区域分配一个抓钩，然后，提出了一个给定抓钩分配下的混合整数线性规划模型。通过求解不同抓钩分配下模型的最优解，并且选择这些解中最好的一个，以便得到最优解，一个标杆示例被运行，以表明该方法的应用。另外，给出有多重处理槽工序问题的模型和求解方法。     

Synchronization of a growing chaotic network model

Synchronization in large ensembles of coupled interacting units is a fundamental phenomenon, which is helpful for the understanding of working mechanisms in neuronal networks, social network, etc. In this paper, we will investigate the synchronization phenomenon in a network model. A feedback control scheme is proposed for the synchronization of the given complex networks. The obtained result indicates that synchronization can be achieved for growing chaotic network model. Method enhance the synchronizability of the given model are given at the same time. Finally, numerical simulations are given to show the effectiveness of obtained results.     

The approximation of generalized turning points by projection methods with superconvergence to the critical parameter

Summary A procedure is given that generates characterizations of singular manifolds for mildly nonlinear mappings between Banach spaces. This characterization is used to develop a method for determining generalized turning points by using projection methods as a discretization. Applications are given to parameter dependent two-point boundary value problems. In particular, collocation at Gauss points is shown to achieve superconvergence in approximating the parameter at simple turning points.     

最短时限缺省指派问题的一种解法

将周良泽在 1998年提出的最短时限缺省指派问题转化成赋权二分图的最小权 K-匹配问题。研究了其解的最优性充分及必要条件 ,并给出了适合在图上求解的生长树法及适合在表上直接求解的标号法 ,最后给出一个实例。该解法是一种较简便的算法。     

A sequential sampling rule for selecting the most probable multinomial event

Summary A sequential sampling rule is given for selecting the most probable event from a multinomial distribution withk cells. A random number of observations is taken from the given multinomial distribution at each stage of sampling, where the number is distributed according to a Poisson distribution with mean λ. The sampling is stopped when the count in any cell is greater than or equal to a given positive integerN. The cell with the highest count is selected for the most probable event. The mathematical analysis of the problem is simplified as a result of the statistical independence of the cell frequencies due to the randomization of the sample number. The expected value of the stage when the sampling terminates is decreasing in λ. The sequential sampling scheme in which one observation is taken at a time until the highest cell count is equal toN, corresponds to λ→0. A table is given showing some properties of the given selection procedure.     

一类迭代方程的集值解

该文将文献 [9] 中关于一类集值迭代方程解的存在性的结果推进到更广范围的一类集值映射. 作者还研究了解对已知集值映射的连续依赖性.     

The firefighter problem for cubic graphs

We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is at the same distance from the root, it is NP-complete to decide whether or not there is a strategy that protects every leaf from the fire, which starts at the root. By contrast, we describe a polynomial time algorithm to decide if it is possible to save a given subset of the vertices of a graph with maximum degree three, provided the fire breaks out at a vertex of degree at most two.     

On component-size bounded Steiner trees

A Steiner tree is a tree interconnecting a given set of points in a metric space such that all leaves are given points. A (full) component of a Steiner tree is a subtree which results from splitting the Steiner tree at some given points. A k-size Steiner tree is a Steiner tree in which every component has at most k given points. The k-Steiner ratio is the largest lower bound for the ratio between lengths of a minimum Steiner tree and a minimum k-size Steiner tree for the same set of points. In this paper, we determine the 3-Steiner ratio in weighted graphs.     

On the choice of aggregation points for continuousp-median problems: A case for the gravity centre

In large scale location-allocation studies it is necessary to use data-aggregation in order to obtain solvable models. A detailed analysis is given of the errors induced by this aggregation in the evaluation of thep-median objective function. Then it is studied how to choose the points at which to aggregate given groups of demand points so as to minimise this aggregation error. Forp-median problems with euclidean distances, arguments are given in favour of the centre of gravity of the groups. These arguments turn out to be much stronger for rectangular distance. Aggregating at the centroid also leads to much higher precision bounds on the errors for rectangular distance. Some numerical results are obtained validating the theoretical developments. This research was partially done while the author was on visit at the Laboratoire d’Analyse Appliquée et Optimisation at the Université de Bourgogne, Dijon, France. Thanks to E. Carrizosa, B. Rayco and four anonymous referees for many thoughtful remarks.