模拟电路子网络级故障诊断的新方法

针对目前模拟电路子网络级故障诊断方法普遍存在的问题,提出了一种新的诊断方法,阐述了该方法的诊断原理,给出了可诊断性条件,通过仿真例子,证明了该方法具有测试量少,方法简单,实时性好,适用于非线性电路等特点     

正则有理Bezier曲线的等距曲线算法

通过利用改进的有理德卡斯特里奥算法求得正则有理ｎ次Ｂｅｚｉｅｒ曲线各点处的切矢,由此得到各点的单位法矢量,应用于求原始曲线的等距曲线,从而巧妙地解决了原始正则有理ｎ次Ｂｅｚｉｅｒ曲线上各点的单位法矢量难求的困难。该方法几何意义明显,算法简洁,实践效果比较好,最后本文给出了两个实例。     

嵌入CPU PCB结构测试方法研究

论述了嵌入CPU印制电路板（PCB）故障测试与故障诊断的一般方法。研究表明:只要满足一定的测试性设计要求,嵌入CPU PCB采用结构化测试方法是可行的。     

Allocation with demand competition: Uniform,proportional, and lexicographic mechanisms

We examine capacity allocation mechanisms in a supply chain comprising a monopolistic supplier and two competing retailers with asymmetric market powers. The supplier allocates limited capacity to retailers according to uniform, proportional, or lexicographic mechanism. We study the impact of these allocation mechanisms on supplier pricing decisions and retailer ordering behavior. With individual order size no greater than supplier capacity, we show that all three mechanisms guarantee equilibrium ordering. We provide precise structures of retailer ordering decisions in Nash and dominant equilibria. Further, we compare the mechanisms from the perspective of the supplier, the retailers, and the supply chain. We show that regardless of whether retailer market powers are symmetric, lexicographic allocation with any priority sequence of retailers is better than the other two mechanisms for the supplier. Further, under lexicographic allocation, the supplier gains more profit by granting higher priority to the retailer with greater market power. We also extend our study to the case with multiple retailers. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 85–107, 2017     

宽带噪声环境中FH-FDM/TDMA信号性能分析

新一代高跳速、大带宽通信系统将跳频通信与频分复用、时分多址技术相结合,不仅增加了通信系统容量,形成了灵活的多址方案,同时FH-FDM/TDMA信号具有抗干扰、低截获的能力。为此,在分析FH-FDM/TDMA信号机理的基础上,就同步环路机制进行了深入研究,重点对宽带噪声下的同步捕获环路的相关峰值、跟踪环路的跟踪误差、解调环路的误码率进行了推导;进一步对宽带噪声干扰下的跳频接收环路进行了仿真。结果表明,FH-FDM/TDMA信号具有更强的抗干扰性。     

Capacity games for partially complementary products under multivariate random demands

In this study, we consider n firms, each of which produces and sells a different product. The n firms face a common demand stream which requests all their products as a complete set. In addition to the common demand stream, each firm also faces a dedicated demand stream which requires only its own product. The common and dedicated demands are uncertain and follow a general, joint, continuous distribution. Before the demands are realized, each firm needs to determine its capacity or production quantity to maximize its own expected profit. We formulate the problem as a noncooperative game. The sales price per unit for the common demand could be higher or lower than the unit price for the dedicated demand, which affects the firm's inventory rationing policy. Hence, the outcome of the game varies. All of the prices are first assumed to be exogenous. We characterize Nash equilibrium(s) of the game. At the end of the article, we also provide some results for the endogenous pricing. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 59: 146–159, 2012     

高等教育产业化趋势剖析

分析了教育能否实现产业化以及教育产业化是否会导致教育不公平和丧失教育的公益性等问题。指出了高等教育产业化的必要性 ,并提出了如何规范和促进教育产业化发展的一些观点。     

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     

面向新质作战装备的试验指挥控制体系结构开发

军事技术和武器装备的创新发展,使以新质作战武器装备为代表的新型作战力量脱颖而出.试验指挥控制体系结构的核心要素与描述模型,明确了体系结构开发的新质作战装备更加强调体系作战与联合试验场景,介绍了面向新质作战装备的模型顺序,并以激光武器为例说明了体系结构的构建过程.     

预制破片侵彻靶板临界跳飞角变化规律

为研究预制破片侵彻靶板的临界跳飞角变化规律,采用数值仿真的方法对预制破片侵彻靶板的临界跳飞角变化规律进行分析.利用LS-DYNA有限元仿真软件,建立了不同形状预制破片侵彻靶板的仿真模型,通过与试验结果相对比的方式验证了模型的可信性.分析了破片形状、破片形状比例系数、破片入射速度和靶板厚度对临界跳飞角的影响规律.分析结果表明:在相同条件下,破片临界跳飞角按照圆柱形、方形和球形预制破片的顺序依次减小,随着破片入射速度和破片形状比例系数的增大而增大,并在一定范围内随着靶板厚度的增加而减小.