发电机并网测频方法综合比较

发电机并网发电时,应保证发电机与电网的频率相等。综合比较了发电机并 网时常用的几种数字式测频方法:直接测频法、测周法、多周期同步法、基于CROSS算法的 测频、三点拟合法、基于傅立叶变换的测频法、基于神经网络的测频法,对各种方法的测频误 差进行分析,比较其最佳适用范围,为实际应用提供了一定的指导。     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

UML在装备虚拟维修训练系统设计中的应用

介绍了通用装备虚拟维修训练系统的功能需求和面向对象的统一建模语言(UML),结合构造虚拟维修训练系统的软件技术,以某型雷达装备为例,将雷达模型与UML视图相结合,阐述如何用UML语言对虚拟装备进行系统建模,从而完成仿真功能。     

CsLiB6O10晶体Ⅰ型光参量过程中角度调谐研究

根据三波耦合过程中的能量动量守恒,基于非线性晶体的相位匹配理论,利用CsLiB6O10(CLBO)晶体的Sellmeier方程,详细分析了Ⅰ型共线及非共线参变过程中CLBO晶体的角度调谐特性.这对于激光脉冲的激光参量过程的优化具有重要的意义.     

谈公安边防部队缉毒情报侦查信息网络建设

当前和今后一个时期,国际、国内毒潮将持续冲击我国社会,禁毒斗争将是一场持久战。针对当前缉毒情报侦查网络建设中存在的主要问题,公安边防部队应从适应信息化条件下缉毒工作的需要出发,建好缉毒情报侦查信息网络,为边防缉毒工作提供有力的情报保障。     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

Visual SLAM in dynamic environments based on object detection

A great number of visual simultaneous localization and mapping (VSLAM) systems need to assume static features in the environment. However, moving objects can vastly impair the performance of a VSLAM system which relies on the static-world assumption. To cope with this challenging topic, a real-time and robust VSLAM system based on ORB-SLAM2 for dynamic environments was proposed. To reduce the influence of dynamic content, we incorporate the deep-learning-based object detection method in the visual odometry, then the dynamic object probability model is added to raise the efficiency of object detection deep neural network and enhance the real-time performance of our system. Experiment with both on the TUM and KITTI benchmark dataset, as well as in a real-world environment, the results clarify that our method can significantly reduce the tracking error or drift, enhance the robustness, accuracy and stability of the VSLAM system in dynamic scenes.     

利用混合编程改善SMP机群上并行矩阵乘法的性能

针对SMP机群,探讨了分别利用单机优化、OpenMP与MPI从指令级、共享存储级与分布主存级三个层次上改善矩阵并行乘Fox算法性能的方法。并通过调用数学函数库与混合编程的方式,在深腾6800上进行了实验,取得了相当满意的数值效果。     

面向对象的反舰导弹航路规划

针对反舰导弹航路规划的任务特点,提出了一种面向对象的反舰导弹航路规划方法.在全面分析了反舰导弹航路规划中可能用到的类的基础上,建立了对各种类的描述,使得不同算法和不同任务要求的航路规划可以通过对类的继承和对成员函数的重载实现.最后,在VC 平台下,对这种面向对象的反舰导弹航路规划方法进行了编程实验.