MDI一体化项目排污口对长江水质影响的预测

以MDI一体化项目排污口为研究对象,采用二维水质数学模型,预测了不同水位条件下,MDI一体化项目各企业排放的废水污染物对长江下游水体水质的影响。预测结果表明,在达标排放前提下,除挥发酚、硝基苯外,各污染物对排污口下游长江水体水质影响较小,长江水体水质基本满足GB 3838—2002《地表水环境质量标准》中Ⅲ类标准要求;挥发酚、硝基苯在排污口下游会产生一定的超标污染带,岸边5 m以外,下游120 m以远即满足《地表水环境质量标准》中Ⅲ类标准要求,不会对下游水质安全造成影响。     

多输入多输出变换域通信系统设计与研究

传统的变换域通信系统(T ransform D om a in Comm un ication System,TDCS)在获得强抗干扰能力的同时,其传输的有效性差也成为制约其广泛应用的技术瓶颈。通过引入多输入多输出(M u ltip le-inpu tM u ltip le-ou tpu t,M IM O)技术改进收发端天线,提出了一种多输入多输出变换域通信系统(M IM O-TDCS),旨在保持TDCS抗干扰能力的同时,利用空间分集和空间复用改善其性能。对该系统的基本原理、收发信机模型和军事应用作了简要分析和介绍,通过研究表明,M IM O-TDCS是一种可实现的、具有一定研究价值的通信手段。     

某型装备随动系统检测诊断设备设计与实现

为实现对某型装备随动系统进行快速、准确地故障诊断,设计了一种便携式的检测诊断设备。首先提出设计原则,然后遵循设计原则进行了一系列设计。利用光电耦合器实现信号隔离,利用电阻识别电路实现防差错设计,增强设备使用的安全性;检测设备模拟计算机控制系统的控制信号提高了自动化程度;软件设计采用模块化设计,并融入专家系统原理,增强设备的智能性。经实验,该设备使用效果良好,系统操作简单,测试精度高,能大幅提高检测效率,有效地完成了测试任务。     

Resale price maintenance contracts with retailer sales effort: Effect of flexibility and competition

In Resale Price Maintenance (RPM) contracts, the manufacturer specifies the resale price that retailers must charge to consumers. We study the role of using a RPM contract in a market where demand is influenced by retailer sales effort. First, it is well known that RPM alone does not provide incentive for the retailer to use adequate sales effort and some form of quantity fixing may be needed to achieve channel coordination. However, when the market potential of the product is uncertain, RPM with quantity fixing is a rigid contract form. We propose and study a variety of RPM contracts with quantity fixing that offer different forms of flexibility including pricing flexibility and quantity flexibility. Second, we address a long‐time debate in both academia and practice on whether RPM is anti‐competitive in a market when two retailers compete on both price and sales effort. We show that depending on the relative intensity of price competition and sales effort competition, RPM may lead to higher or lower retail prices compared to a two‐part tariff contract, which specifies a wholesale price and a fixed fee. Further, the impact of RPM on price competition and sales effort competition is always opposite to each other. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

故障树近似计算中最优权因子的选取

在故障树近似计算时,探讨通过加权提高计算准确度的简便方法。根据底事件发生概率的不同,利用VisualC 语言进行蒙特卡罗仿真计算,得到了在近似计算故障树顶事件发生概率时,在不同底事件发生概率对应区间内的最优权因子。利用该方法得到的最优权因子可以提高故障树近似计算的准确度,尤其是在当底事件发生概率较大时,其效果更为明显,可较好地满足采用故障树对某些特殊设备进行顶事件发生概率计算时提高计算精度的需求。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Analysis of a new vehicle scheduling and location problem

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001     

一种雷情录报显示系统的实现

针对当前部分雷达装备在报情方面存在的问题 ,提出了一种雷情录报显示系统。系统由数据录取板和读报显示板两大部分组成 ,将两块模板嵌入现役装备中 ,可改善部分雷达报情的自动化程度和测报数据的精度     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016