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.     

Ba（n，x）~（134）Cs，~（134）Ba（n，2n）~（133）Ba，

用中子活化法相对于５４Ｆｅ（ｎ，Ｐ）５４Ｍｎ反应，在１３．５０—１４．８０ＭｅＶ中子能区测量了Ｂａ（ｎ，ｘ）１３４Ｃｓ，１３４Ｂａ（ｎ，２ｎ）１３３Ｂａ，１４０Ｃｅ（ｎ，２ｎ）１３９Ｃｅ，１４２Ｃｅ（ｎ，２ｎ）１４１Ｃｅ和２３Ｎａ（ｎ，２ｎ）２２Ｎａ的反应截面．并将所测的结果和其他作者的结果进行了比较，中子能量是用９０Ｚｒ（ｎ，２ｎ）８９ｍ＋ｇＺｒ反应和９３Ｎｂ（ｎ，２ｎ）９２ｍＮｂ反应截面比法测定的。     

The Geometric Construction of WZW Effective Action in Noncommutative Manifold

By constructing close-one-cochain density Ω^12n in the gauge group space we get the Wess-Zumino-Witten (WZW) effective Lagrangian on high-dimensional noncommutative space.Especially consistent anomalies derived from this WZW effective action in noncommutative four-dimensional space coincide with those obtained by L.Bonora etc.(het-th/0002210).     

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.     

激光调Q CAI

从激光调Q速率方程出发,分析推导了激光调Q过程中,腔内光子数与工作物质内反转粒子数间的关系.再根据激光调Q的过程中,对腔Q值控制方式不同,将激光调Q技术分为:转镜调Q、声光调Q、电光调Q、饱和吸收调Q和脉冲透射式调Q.用C语言进行了激光调Q CAI软件的开发研制,获得了将文学、图形、动画和计算融为一体的,直观而生动地将调Q的理论和过程再现于屏幕的CAI课件.介绍了课件的内容、结构及其特点.     

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.