一种有效的常规雷达目标识别方法

基于小波变换和进化网络提出一种有效的常规雷达目标识别方法。即首先利用 Mallat算法对雷达目标一维距离像进行特征提取和压缩 ,然后在进化规划的基础上提出一种混合进化算法来优化设计由多层前向网络构成的分类器。实验结果表明 ,整个目标识别系统的结构简单 ,同时具有较好的推广能力     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

一种混合式隔振器及其特性研究

为降低隔振系统在共振频率点的振动传递率,隔振器共振频率点阻尼应较大,为减小高频振动传递率,高频段阻尼应较小,被动隔振器阻尼无法满足该要求.提出了一种混合式隔振器,作动器根据隔振器上下点相对位移产生作动力,通过设计作动力对相对位移的传递函数,可实现阻尼随频率变化的要求.在此基础上对其特性进行了仿真研究,结果表明,由此混合隔振器构成的隔振系统在共振频率点和高频段对基础的传递振动都得到降低.     

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     

SPC技术在导弹厚膜混合电路生产中的应用

SPC(统计过程控制)作为一种先进的质量管理方法,在国外企业被广泛采用,目前国内也有众多企业开始推行.分析了实施SPC的重要性,根据SPC技术在推广应用中的主要工作内容,给出了导弹厚膜混合电路生产中SPC技术的应用方法,包括关键工序节点和工艺参数的确定、工艺参数数据的采集、控制图的使用、工序能力评价以及所采用的控制技术等实际应用方面的内容.     

基于GA-PSO的目标分配问题研究

防空作战中的目标分配问题属于NP完全问题,在综合考虑火力单元作战效能和防御效能的基础上,引入火力单元综合有利度,建立了一种用于大规模多火力单元对抗多轮次目标的静态目标分配模型,给出了基于GA因子的改进PSO算法,并将算法应用于目标分配模型的求解,通过VC 6.0编程和计算机仿真验证了模型的可行性和算法的有效性.     

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     

重庆市某混合式热泵工程经济配置方案模拟分析

基于重庆市某混合式热泵工程,采用TRNSYS软件分别就室内温度、湖水温度、地埋管流体温度以及供冷能耗进行了模拟,并与实际运行数据进行对比分析,确定了该模型的准确性和可行性.最后对土壤源热泵承担总负荷15％,25％,35％,45％的4种方案与传统方案一同进行模拟分析,结果显示,土壤源热泵25％的负荷比例在4种配置方案中最...     

Hilbert空间中拟非扩张映像族公共不动点的迭代算法

给出了Hilbert空间中拟非扩张映像族公共不动点的一个杂交投影算法,使用修正的杂交投影迭代算法,证明了一个强收敛定理,扩展了文献的结果。