Success and survival of operational research groups—A review

Operational Research groups were established in private and public sector organizations following on from their success supporting the military in the Second World War. In the early years their numbers grew rapidly but by the mid-1970s evidence started to accumulate that they were being viewed less favourably. Many organizations chose not to set up OR groups. Established groups were closed down or dispersed to operating units in organizations, particularly during the recessionary periods. In 1993 following on the closures of some major OR groups in the UK, the Operational Research Society decided to fund research to examine those factors influencing a group's success and survival. This review, which forms part of the research, first examines the history of OR groups in the UK and North America, arguing that in practice they were one of a number of internal organizational consultancies. As such they were judged by their competitive performance. Despite the intent of the founding fathers of OR many groups found their scope was limited to mainly tactical problems using analytical model based approaches although there were exceptions that were successful in making major contributions at the strategic level also. Within their chosen fields of activity however many groups flourished whilst some failed. This review presents a comprehensive list of influences on success and survival. They include changes in the external environment, together with shifts in managerial style and culture, organizational factors, and the OR group itself. The review concludes that, while OR groups can do much to protect themselves from closure, organizational changes within a hostile managerial culture demand a creative response that acknowledges new requirements. Areas where an OR group has greatest influence over its effectiveness include its leadership and personnel, project balance and management. In addition, to be successful OR groups need to positively develop and market their services in an increasingly competitive managerial climate.     

Max—min神经网络的一种有效学习算法

本文在Ａ．Ｂｌａｎｃｏ等人的算法的基础上，提出了ｍａｘ－ｍｉｎ神经网络的一种改进了的反馈学习算法，严格证明了该算法的迭代收敛性，理论分析及实例计算结果均表明，本文算法具有算法简单，收敛速度快，输出误差小等显著特点。     

苯基取代聚乙炔中的元激发

苯环取代聚乙炔是一类具有简并基态的发光聚合物.利用扩展的SuSchriefferHeeger模型,研究了这类聚合物链中的孤子、极化子等元激发特性.结果表明:由于苯环与聚乙炔主链间的强π电子耦合,苯环取代抑制了聚乙炔主链的二聚化,减小了导带与价带之间的能隙;因此取代聚乙炔中的元激发具有较小的激发能,同时具有更大的相干长度.尽管苯基取代对元激发有很大的影响,但是非取代聚乙炔中元激发的基本物理规律依然成立,表明这些元激发的基本特性不受取代基团的影响 关键词： 孤子 极化子 苯基取代聚乙炔     

处理原子-辐射场相互作用系统的变分方法

用Heisenberg-Weyl(简H-W)群直积SU(2)群上的相干态表述了原子-辐射场相互作用系统的非平衡态统计力学.引入一个新定义的含时分布函数,将非平衡态下密度矩阵所满足的von Neumann方程转化成可分离变量的偏微分方程,给出了方程的形式解,算符的平均值表示.本文还就便于作微扰展开的相互作用绘景作了讨论.     

Development of high-speed video cameras for Dynamic PIV

The most promising next generation Image Velocimtry (IV) is the high-speed Dynamic PIV. It requires the development of innovative high-speed video camera sensors. We started by specifying the required performance of these new sensors, for measurements in air and water flows. These criteria founded on the most recent developments in PIV algorithms and incorporate results from a large questionnaire survey of users of high-speed video cameras in Japan. The results suggest that the followings are required: (1) frame rate of 1,000,000 fps, (2) pixel count of 1,000,000 pixels, (3) frame storage capacity of 100–200 frames for tracing a single event and 10,000 frames for turbulent measurements, (4) gray levels of 4–8 bits for PTV; 12 bits for observation. Finally, we reviewed the state of the art of high-speed video-image sensors. Currently the standard parallel-readout sensors can operate at 1 Kfps with a pixel count of approximately 1 Kpixels. The In-situ Storage Image Sensor (ISIS) developed by the authors has recently achieved frame rates of 1 Mfps.     

羰基镍分析报警仪

羰基镍分析报警仪运用化学发光原理构成，不仅适用于羰基镍生产车间现场的检测和报警，也适于实验室的研究工作。检出限达0.037mg/m^3(0.5ppb），响应时间2min。     

Resolution of Secondary α-Ketoalcohols Catalyzed by Lipase and Inversion of Stereochemistry

Several α-ketoalcohols of synthetic value were resolved using lipase as a catalyst. Lipoprotein lipase (LPL) provided the best rate of hydrolysis and kinetic differentiation. One of these optically pure α-ketoalcohol was converted to (5)-ibuprofen in good optical purity. The stereospecific inversion of (R)-alcohol to (S)-alcohol is described.     

A model of JIT make-to-stock inventory with stochastic demand

We consider a firm that manages its internal manufacturing operations according to a just-in-time (JIT) system but maintains an inventory of finished goods as a buffer against random demands from external customers. We formulate a model in which finished goods are replenished by a small fixed quantity each time period. In the interest of schedule stability, the size of the replenishment quantity must remain fixed for a predetermined interval of time periods. We analyse the single-interval problem in depth, showing how to compute a cost-minimising value of the replenishment quantity for a given interval length, and characterising the optimal cost, inventory levels and service as functions of the interval length and initial inventory. The model displays significant cost and service penalties for schedule stability. A dynamic version of the problem is also formulated, and shown to be convex in nature with relatively easily computed optima.     

An Overview of Scheduling Problems Arising in Satellite Communications

Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints.