SAFARI engineering model 50 mK cooler

SAFARI is an infrared instrument developed by a European based consortium to be flown in SPICA, a Japanese led mission. The SAFARI detectors are transition edge sensors (TES) and require temperatures down to 50 mK for their operation. For that purpose we have developed a hybrid architecture based on the combination of a 300 mK sorption stage and a small adiabatic demagnetization stage. An engineering model has been designed to provide net heat lifts of 0.4 and 14 μW respectively at 50 and 300 mK, with an overall cycle duration of 48 h and a duty cycle objective of over 75%. The cooler is self-contained, fits in a volume of 156 × 312 × 182 mm and is expected to weigh 5.1 kg. It has been designed to withstand static loads of 120 g and a random vibration level of 21 g RMS.     

双管正激电路数字控制系统设计方法的分析与对比

主要针对双管正激电路进行数字化控制。首先,分别采用s域间接设计、ω域波特图设计和z域根轨迹设计3种方法对数字控制系统进行设计;然后,对这3种设计方法进行了详细的分析和对比,并且用Matlab仿真验证了设计方法的正确性;最后,给出了3种数字控制系统设计的总结和对比,对指导数字控制系统的设计有着积极的意义。     

基于Chopping-Peaking开关组合的亚纳秒双极化器的PSPICE模拟

给出了单极脉冲经过Chopping-Peaking组合开关形成双极脉冲的原理,用PSPICE程序模拟计算了不同因素(入射单极脉冲上升时间及Chopping开关与Peaking开关特性等)对输出双极脉冲的影响,实验结果与模拟结果符合较好.     

基于深度学习的高压隔离开关分合状态检测算法研究

高压隔离开关的正常工作是电力系统稳定运行的前提。为正确识别隔离开关的分合状态,提出一种轻量化改进型YOLOv5s目标检测算法。首先,针对隔离开关数据集,采用二次优化K-means++聚类算法重新获取锚框参数。然后,将模型中的损失函数由CIOU替换为具有更强收敛性能的EIOU,加快模型训练的收敛速度。最后,在模型主干特征提取网络的最后一层添加CBAM注意力模块,加强模型特征提取能力。在此基础上,采用通道稀疏化剪枝的方法对改进后的模型进行轻量化处理,减小模型体积和算力消耗。实验结果表明,改进后的模型识别平均精度均值到达97.4%,轻量化处理后的模型大小为3.92 MB,使得模型更加容易部署到移动端设备完成实时检测。     

基于接近开关的桥式布料机的位置识别及定位控制的设计

当前双梁桥式带式布料机的定位方式主要采用造价比较高的绝对值编码器和激光测距方法,绝对值编码器存在累积误差,激光测距不适用于粉尘较多场合,针对上述问题,提出采用接近开关编码实现位置绝对地址的识别,配合减速信号实现双梁桥式带式布料机的精确定位与停车。该方法造价低,能适应多种工况,适于需要自动或半自动运行在几个固定点上的布料机应用场合。     

An efficient scheduling algorithm for input-queued switches

This letter presents an efficient scheduling algorithm DTRR （Dual-Threshold Round Robin） for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue （VOQ） exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultaneously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simulation results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.     

PBG-630/6Z矿用隔爆型智能高压开关的使用维护与故障处理

结合生产实践,对PBG-630/6Z矿用隔爆型智能高压开关的使用维护与故障处理进行了论述,为使用好高压开关提供经验。     

High-voltage portable pulsed power supply fed by low voltage source

This article proposes a new structure of voltage multiplier for portable pulsed power applications. In this configuration, which is based on capacitor-diode voltage multiplier, the capacitors are charged by low AC input voltage and discharge through the load in series during pulse generation mode. The proposed topology is achieved by integrating of solid-state switches with conventional voltage multiplier, which can increase the low input voltage step by step and generate high-voltage high-frequency pulsed power across the load. After some discussion, simulations and experimental results are provided to verify the effectiveness of the proposed topology.     

Preemptive and non-preemptive scheduling of optical switches with configuration delay

Utilizing optical technologies for the design of packet switches and routers offers several advantages in terms of scalability, high bandwidth, power consumption, and cost. However, the configuration delays of optical crossbars are much longer than that of the electronic counterpart, which makes the conventional slot-by-slot scheduling methods no longer the feasible solution. Therefore, some tradeoff must be found between the empty time slots and configuration overhead. This paper classifies such scheduling problems into preemptive and non-preemptive scenarios, each has its own advantages and disadvantages. Although non-preemptive scheduling is inherently not good at achieving the above-mentioned tradeoff, it is shown, however, that the proposed maximum weight matching (MWM) based greedy algorithm is guaranteed to achieve an approximation 2 for arbitrary configuration delay, and with a relatively low time complexity O(N2). For preemptive scheduling, a novel 2-approximation heuristic is presented. Each time in finding a switch configuration, the 2-approximation heuristic guarantees the covering cost of the remaining traffic matrix to have 2-approximation. Simulation results demonstrate that 2-approximation heuristic (1) performs close to the optimal scheduling, and (2) outperforms ADJUST and DOUBLE in terms of traffic transmission delay and time complexity.