碳氢化合物的红外光谱识别

碳氢化合物红外光谱特征吸收主要为甲基、亚甲基等结构基团的振动吸收,特征性不强,但C—C主链红外光谱振动吸收能表达不同碳氢化合物的分子结构特征。应用碳氢化合物红外光谱指纹区谱图形貌特征,建立了根据C—C主链红外光谱识别碳氢化合物的方法。研究结果表明,采用指纹区提供的特征信息能够实现对不同结构碳氢化合物的识别,准确率高达99%,优于采用碳氢化合物甲基、亚甲基等结构基团的红外光谱振动吸收信息获得的识别结果。     

System reliability based on diffusion models for fatigue crack growth

Diffusion processes are commonly used to describe the dynamics of complex systems arising in a wide range of application fields. In this paper we propose, on the basis of diffusion processes, two models concerned with the stochastic behavior of fatigue cracks in a system. They are then used to get the distribution of the failure time, the first time the crack size of at least one of the cracks exceeds a given value. Several properties of our proposed models are presented, and the unknown parameters are estimated by the method of maximum likelihood. From these an estimate of failure time distribution is obtained. In this part, contrary to common practice, we do not assume availability of failure data. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Scheduling recurrent construction

A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

中立型泛函微分方程的周期解

综合利用D算子的性质及Horn不动点定理[8],研究了有限时滞中立型泛函微分方程的周期解的存在性问题,证明了解的一致最终有界性蕴含周期解的存在性,从而推广了著名的Yoshizawa周期解定理[3],同时推广了[1]和[2]的主要结果.     

求解传感器网络最大生存时间的最大流算法

节能是传感器网络研究的中心问题之一,目的是延长网络的生存时间。因此对于一个给定网络,很自然地关心它的最大生存时间是多少。从网络最大流的角度分析这个问题,给出了求解传感器网络最大生存时间确切值的算法。     

Estimating component characteristics from system failure‐time data

Suppose that failure times are available from a random sample of N systems of a given, fixed design with components which have i.i.d. lifetimes distributed according to a common distribution F. The inverse problem of estimating F from data on observed system lifetimes is considered. Using the known relationship between the system and component lifetime distributions via signature and domination theory, the nonparametric maximum likelihood estimator _N(t) of the component survival function (t) is identified and shown to be accessible numerically in any application of interest. The asymptotic distribution of _N(t) is also identified, facilitating the construction of approximate confidence intervals for (t) for N sufficiently large. Simulation results for samples of size N = 50 and N = 100 for a collection of five parametric lifetime models demonstrate the utility of the recommended estimator. Possible extensions beyond the i.i.d. framework are discussed in the concluding section. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于一类T-模的模糊双向联想记忆网络的稳定性分析

首先定义了max-T复合模糊算子,建立了一类基于模糊复合算子的模糊联想记忆网络——模糊双向联想记忆,然后系统地分析了该网络的性质,在Hamming距离意义下证明了该网络的平衡点（吸引子）具有Lyapunov稳定性。     

一种差分空时分组码及其性能分析

文中介绍了一种差分空时分组码的编译方法及其性能分析,与之对比,先导入单天线时差分调制的概念及其方法,理论分析表明,采用无需信道估值的差分空时分组码与相干检测空时分组码相比其性能差3 dB,但与单天线相比仍有接近于10 dB的分集增益。     

基于最大后验风险的多层Bayes方法

为了对指数型产品进行可靠性鉴定,首先给出了失效率的多层先验分布,然后从最大后验风险的角度,运用Bayes方法,制定出可靠性鉴定试验方案.按照此鉴定试验方案,缩短了试验时间,从而降低了鉴定试验所需的费用.