The frequency assignment problem: A solution via nonlinear programming

This paper gives a mathematical programming model for the problem of assigning frequencies to nodes in a communications network. The objective is to select a frequency assignment which minimizes both cochannel and adjacent-channel interference. In addition, a design engineer has the option to designate key links in which the avoidance of jamming due to self interference is given a higher priority. The model has a nonconvex quadratic objective function, generalized upper-bounding constraints, and binary decision variables. We developed a special heuristic algorithm and software for this model and tested it on five test problems which were modifications of a real-world problem. Even though most of the test problems had over 600 binary variables, we were able to obtain a near optimum in less than 12 seconds of CPU time on a CDC Cyber-875.     

Estimating normal tail probabilities

The estimation problem of normal tail probabilities is considered. The form of generalized Bayes estimators is derived and the asymptotic behavior of the mean square errors is studied. This study shows that the best unbiased estimator, a formula for which is given, is superior to the maximum likelihoood estimator or to a class of generalized Bayes procedures for large parametric values, but can be significantly improved for moderate values of the parameter.     

电磁振动给料机的研究与制造

利用振动原理,研究、设计、制造微型电磁振动给料机（筛）．设计了激磁铁芯、半波可控硅整流及控制电路．在对振动机械的隔振分析及优化设计理论的基础上,设计了整部机器的结构图纸,并制造了一部样机,给出了振动利用的一个范例．所研究制造的微型电磁振动机集机电为一体,在焊接、制药等诸多行业中具有广泛的应用价值．     

Interchange fees for bank ATM networks

Banks have found it advantageous to connect their Automated Teller Machines (ATMs) in networks so that customers of one bank may use the ATMs of any bank in the network. When this occurs, an interchange fee is paid by the customer's bank to the one that owns the ATM. These have been set by historic interbank negotiation. The paper investigates how a model based on n-player game theory concepts of Shapley value and nucleolus could be used as an alternative way of setting such fees. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 407–417, 1998     

The dynamic lot size model with quantity discount: Counterexamples and correction

Federgruen and Lee ([3]) proposed an optimal algorithm for the single-item dynamic lot size model with all-unit discount. In this note we show that their algorithm fails to find the optimal solution for some special cases. We also provide a modification to the algorithm to handle them. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 419–422, 1998