基于模式理论光栅椭偏参数反演的数值模拟

将一种广泛用于求解系统优化问题的方法——正单纯形法，求解光栅的椭偏方程。首先，利用求解光栅的傅立叶模式理论对TE和TM波的复反射系数进行求解。然后计算出其相应的椭偏参数(△，Ψ)，并在该值的基础上加入不同偏差的随机高斯噪声，将加入噪声后的值(△m，Ψm)作为模拟测量值。最后使用优化算法进行反演。通过对几种常用面形光栅椭偏参数的数值模拟，一方面表明傅立叶模式理论计算光栅的椭偏参数不仅精度高。而且速度快；另一方面表明利用正单纯形法得到的光栅参数值很接近于正演时假设的参数值，从而从理论上证明了利用椭偏法测量光栅各种光学参数的可行性。     

Joint scheduling and power control supporting multicasting in wireless ad hoc networks

This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem.     

Contractor Prebid Planning Principles

Planning is an essential function of project management. Yet, many small- and medium-sized contractors do a relatively poor job of operational planning. Better prebid plans will reduce costs, shorten schedules, and improve labor productivity. Unfortunately, the published literature offers little guidance for smaller contractors on what constitutes effective planning. Most papers describe planning as a macrolevel process for owners. Most emphasize scope definition for industrial projects. This paper describes a microlevel planning process for contractors. It consists of eight steps which are: (1) assess contract risks; (2) develop a preliminary execution plan; (3) develop site layout plans; (4) identify the sequences that are essential-to-success; (5) develop detailed operational plans; (6) develop proactive strategies to assure construction input into design; (7) revise the preliminary plan; and (8) communicate and enforce the plan. The entire process is illustrated with a case study project and is fully illustrated with figures which show how to integrate the work of multiple contractors, keep key resources (crews or equipment) fully engaged with no downtime, provide time buffers so the work of follow on crews can be efficiently done, expedite the schedule using multiple work stations and concurrent work, ways to communicate the work plan to the superintendent and foremen, and how to assess the feasibility of various work methods. The steps are easy to understand and implement. They will yield immediate positive results.     

Coordinating production and distribution of jobs with bundling operations

We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries.     

利用多普勒信息的波达方向最大似然估计方法

为了充分利用信号的时域特性来改善信号波达方向（ＤＯＡ）的估计性能，本文从最大似然估计出发，推导出了有限快拍，低信噪比情况下多普勒信号波达方向的迭代估计计算法，为进一步减小运算量，本文还推导了一种简化算法，本文提出的两种算法对低信噪比，少快拍数下多普勒信号的ＤＯＡ估计性能比不利用时域特性的ＭＬ方法有明显改善，Ｍｏｎｔｅ－Ｃａｒｌｏ实验验证了本文方法的有效性。     

运动估计块匹配两级搜索算法

根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度.     

Optimal task allocation in hypercube multiprocessor ensembles

Criteria are established to determine the optimal policy for allocating a set of uniform tasks onto a multiprocessor hypercube ensemble. It is shown that the optimal policy depends on the ratio of computation to intertask communication required by the distributed program, and that based on this ratio, tasks should be placed either all on one processor or uniformly distributed over the largest possible hypercube.     

解Job－Shop调度问题的一个遗传算法

本文首先介绍了遗传算法的基本概念和流程，然后叙述了如何把Ｊｏｂ－Ｓｈｏｐ调度问题编码成为遗传算法的形式，并解释了对于实现这一算法中一些问题的考虑．最后给出了算法运行结果并对结果与算法做了总结。     

一种新的环网故障诊断与重构算法

为提高环网的容错性能，文献（1）提出了一种基于事件驱动的故障重构算法，其缺点是该算法只能容忍连线故障。本文给出一种新的采用时钟起时驱动的重构算法，该算法既能容忍连线故障也能容忍站（或节点）故障，且令牌控制较文献（1）的简单。