基于Modbus/TCP的配电网自动化远方终端设计

为了提高对现代雷达系统的故障诊断能力,开发了一种融合在雷达系统内部的嵌入式测试系统;系统通过在雷达内部布设测试设备,设置故障监测点和加入测试信号,对雷达各部分的工作状态、性能进行监测,用于雷达系统的性能检测和故障诊断,缩短平均维修时间（MTTR）; 硬件选用精密的测量仪器和先进的总线通讯技术保证测试精度,软件采用先进的算法,融合了加电BIT、周期BIT和维护BIT等测试手段,保证故障隔离的准确,该系统已在多种雷达系统中得到成功的应用。     

基于电源电流和输出电压的模拟电路故障模型研究

基于模拟电路电源电流和输出电压的协同分析,研究了复数域的故障建模方法,提出了一种2D故障模型的数学表达式,该模型为复平面上的一簇圆轨迹。为了扩大故障轨迹之间的距离,在相同测量精度和元件容差条件下提高故障检测率和隔离率,进一步提出了3D复数空间的优化故障模型。两种故障模型都极大简化了测点选择算法和模拟故障状态仿真的复杂度,理论上对模拟电路单故障的覆盖率为100%。基于滤波器电路的实验仿真结果验证了两种故障模型的有效性。     

基于阿秒抖动光纤锁模激光器的时钟同步

光纤锁模激光器结构简单, 运转稳定, 且输出的超短脉冲序列具有极高的时钟稳定性, 在抽运探测、脉冲相干合成等要求高精度时钟同步的前沿领域有着广阔的应用前景. 本文通过激光器腔内的电光调制器进行反馈控制, 实现了两台光纤锁模激光器之间的紧密时钟信号同步; 并且通过平衡光学互相关方法, 对残余的时钟误差信号进行了测量, 分辨率达到了13 as. 通过优化激光器的腔内动力学过程及反馈环路的参数, 在[1 Hz, 10 MHz]的积分区间内得到了109 as的残余时钟误差, 对应单台激光器的平均时间抖动为77 as.     

表面活性剂辅助二氧化硅纳米颗粒在非水基液中的分散研究（英文）

研究了粒径10~100nm的二氧化硅纳米颗粒在非水基液中的表面活性剂辅助分散。结合颗粒表面特定官能团结构,针对性选择了合适的表面活性剂,氢键桥梁作用和长链分子空间位阻作用抑制了颗粒团聚行为。当表面活性剂体积分数6%的时候,动态光散射测试结果表明颗粒中位尺度30.2nm,与透射电镜测试结果吻合,展现了良好的分散性。     

微型平面复合薄膜电爆炸开关的设计和研究（英文）

开关技术是影响爆炸箔起爆系统可靠作用、微型化、低能化、集成化的关键技术。电爆炸平面开关是利用强脉冲电流使触发极金属桥箔发生电爆炸,产生高温高压等离子体,使爆炸桥区两侧的电极导通。基于微加工技术,采用Al/CuO复合薄膜材料作为触发电极,设计制造了微型平面复合薄膜电爆炸开关。采用扫描电子显微镜、差示扫描量热法和光谱谱线测温研究了触发极Al/CuO复合薄膜的形貌、反应性和电爆炸等离子体温度,通过放电电流测试研究了开关性能。结果表明,在主回路电压2000V时,开关输出电流峰值约为1938A,上升时间390ns,性能优于仅以铜薄膜为触发电极的电爆炸平面开关。     

基于光腔衰荡光谱的宽范围水汽探测

介绍基于光腔衰荡光谱技术的光学湿度测量装置．该装置具有高真空兼容性,衰荡腔由低膨胀的殷钢制成,并利用其自身的自由光谱范围实现光谱的自标定．使用单个在1.39 μm的半导体激光器,实 现了从真空、高纯氦气中痕量水汽,一直到大气湿度的测量,可测量的水汽分压范围极大：0.1 μPa～1 kPa．该光学湿度计可用于作为基本水汽标准,以及测定低温下水(冰)的蒸气压．     

Optimum step-stress accelerated degradation test for Wiener degradation process under constraints

To assess a product's reliability for subsequent managerial decisions such as designing an extended warranty policy and developing a maintenance schedule, Accelerated Degradation Test (ADT) has been used to obtain reliability information in a timely manner. In particular, Step-Stress ADT (SSADT) is one of the most commonly used stress loadings for shortening test duration and reducing the required sample size. Although it was demonstrated in many previous studies that the optimum SSADT plan is actually a simple SSADT plan using only two stress levels, most of these results were obtained numerically on a case-by-case basis. In this paper, we formally prove that, under the Wiener degradation model with a drift parameter being a linear function of the (transformed) stress level, a multi-level SSADT plan will degenerate to a simple SSADT plan under many commonly used optimization criteria and some practical constraints. We also show that, under our model assumptions, any SSADT plan with more than two distinct stress levels cannot be optimal. These results are useful for searching for an optimum SSADT plan, since one needs to focus only on simple SSADTs. A numerical example is presented to compare the efficiency of the proposed optimum simple SSADT plans and a SSADT plan proposed by a previous study. In addition, a simulation study is conducted for investigating the efficiency of the proposed SSADT plans when the sample size is small.     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.