光纤光栅技术与应用专题讲座(三) 第6讲 光纤光栅传感技术在土木工程中的应用

针对利用光纤光栅进行应变、温度等测量已经在土木工程中较为普遍这一现状,首先对光纤光栅传感技术进行应变、温度等测量的基本原理进行了描述,重点讨论了为满足耐久性、安装方便与温度自动补偿等需求光纤光栅传感器的封装技术,最后介绍了光纤光栅传感器在土木工程中实际应用的现状。     

弹性BP神经网络消除轮速传感器误差方法的研究

汽车轮速是汽车运动状态参数的主要信息源,是控制系统的核心,其精度直接影响这些系统的性能.为了提高轮速的精度,降低传感器的研制成本,提出了一种基于弹性BP神经网络的误差分析方法消除轮速传感器误差.将改进的BP神经网络--弹性BP神经网络用于误差分析,并提出误差匹配的算法.理论和仿真结果表明,该方法使绝对误差达到2×10-4>rad,能够有效地消除传感器误差,提高轮速信号的精度.     

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.     

使用双水压传感器抗风浪干扰原理

提出了在水雷上使用双水压传感器的设想.传统水雷只使用一个水压传感器,提供的信号信息稍嫌不足,给水压引信抗风浪干扰带来了限制.通过使用两个传感器,利用海浪水压场传播时在两个传感器上的时延信息,使用抵消方法压制海浪水压信号.初步分析表明,使用双传感器可以使水压引信抵抗一定的海浪水压信号的干扰.     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

机载光电传感器视轴指向的智能辅助决策方法

机载光电传感器视轴应尽可能接近目标线,以缩小指向偏差而不使目标偏离传感器瞬时视场,飞行员在复杂的战场态势下进行视轴操控具有一定困难。针对该问题,提出了一种机载光电传感器视轴指向的智能辅助决策方法,该方法以传感器视轴指向的数学模型为基础,通过专家知识建立引导规则,完成目标与各传感器的配对;计算配对后的各传感器视轴指向偏差和偏差变化率,采用模糊控制算法得出视轴偏移率,引导各传感器视轴指向与之配对的目标。仿真结果表明了该方法能够合理引导各传感器视轴指向目标,并能将视轴指向偏差缩小在很小的范围。     

TEDS技术在加速度传感器数据校正中的应用

提出一种利用传感器电子数据表格技术改善加速度传感器动态性能的办法。传感器标定时，其相关的特征参数被储存在传感器电子数据表格中；测试初始化时，每个传感器的特征参数被读入测试系统，指导系统自动完成其数学模型的建立，并在测试时进行实时数据校正。实验证明传感器电子数据表格技术的引入提高了加速度传感器的工作频带带宽和动态响应速度等动态性能指标。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

A sequential scheduling problem with impatient jobs

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λ_i before departing the system. The service time of customer i has distribution F_i, and on completion of service of customer i a positive reward r_i is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015     

基于改进Rao-Blackwellized粒子滤波的WSN被动目标跟踪

Rao-Blackwellized粒子滤波虽然适合系统状态包含线性高斯分量的非线性状态估计,但是由于其计算量较大,不适用于实时性较高的被动目标跟踪情况。针对Rao-Blackwellized粒子滤波的不足,提出了改进的Rao-Blackwellized粒子滤波算法用于WSN被动目标跟踪。新的算法由一个粒子滤波和一个卡尔曼滤波组成,在执行过程中,粒子滤波和卡尔曼滤波相互交换信息,并行运行。计算机仿真结果表明,新的算法能够更好地减少计算量,提高跟踪的实时性。