The activation of transition-metal carbonyl clusters

Methods by which the reactivity of transition-metal osmium carbonyl clusters may be modified are explored.     

A Note on Degeneracy in Integer Linear Programming Problem

A set of three batches of 1000 randomly produced integer linear programming problems of different sizes was solved using a partial enumeration algorithm. That particular algorithm involves the initial ordering of the variables according to their attractiveness when considered individually. The results reveal that, as might have been expected, the most attractive variables appear very much more frequently than do the less attractive. Perhaps less expected is the fact that the average number of variables appearing in the optimum solution is considerably less than might have been anticipated. Thus, for example, the average number of variables which appear in a set of problems featuring 20 variables and 10 constraints is only 4.14, as against the 10 one would have been expecting in continuous LP problems of that size. It is argued that it is this inherent characteristic which results in truncation solution procedures being as effective as they are.     

A Case Study on the Development of the Home Defence Training Game HOT SEAT

Home defence is concerned with enhancing the prospects for survival and recovery of this country in the eventuality of nuclear war. Contingency plans exist for the creation of a system of wartime regional government which includes elements from peacetime local and central governments. Senior officers in local government with designated wartime roles receive training at the Home Defence College. The Home Office decided that a crisis management game should form part of their overall programme of indoctrination. The resulting game, which is known as HOT SEAT, has been successfully implemented and is now in regular use at the College. This paper describes how the need for the game arose, the structure of the resulting game, the problems that arose during its development, and should be of interest to those concerned with the development of management and crisis games.     

A versatile new synthesis of quinolines and related fused pyridines. Part III.

The action of dimethylformamide in phosphorus oxychloride on acylanilides gives 2-chloro-3-substituted quinolines, which may be dechlorinated to give 3-substituted quinolines in good yield. Similarly, N-nitrosodimethylamine in phosphorus oxychloride converts acylanilides into 2-chloro-3-substituted quinoxazolines.     

Preparation of,and alkylation of enolate anions with,dimethyl 3-bromo-2 ethoxypropenylphosphonate. An efficient,convergent synthesis of 2-cyclo-penten-1-ones

The alkylation of enolate anions with dimethyl 3-bromo-2-ethoxypropenylphosphonate, followed by acid hydrolysis of the resultant products, affords diketo phosphonate compounds which can be cyclized efficiently to give the corresponding 2-cyclopenten-1-ones. This overall five-membered ring annelation process can be carried out without affecting acid-labile functional groups (e.g. ketal) in the enolate substrate.     

Resolution of N-benzyl-N-(1,2-dihydro-2-oxoquinolin-1-yl)glycine

The $\text{N}$$\text{N}$ chiral axis in the title glycine derivative has allowed its resolution into enantiomers: the barrier Δ G^≠ for racemisation (rotation around the $\text{N}$$\text{N}$ bond) is 26.2 Kcal mol^?1.     

Distributed Modelling

Budgeting, which can be defined as establishing medium-term control standards for an organisation as a whole and for each of its constituent parts, requires considerable amounts of both high-level management attention and also low-level data manipulation. In a large organisation, conventional methods of computerising the budgeting procedure tend merely to substitute one set of difficulties for another, and to alienate the managers in doing so. This paper describes the development and introduction of an interactive computer-based system in British Gas that successfully avoids such problems and assists the managers to improve their budgets while largely eliminating the requirement for low-level time and effort. The design principles of the system are outlined and the implementation history is described. It is concluded that with skilful use of existing computer techniques, significant improvements can be made in medium-term planning and control at little cost.     

On the second Goldbach conjecture

The results in this paper suggest that Goldbach's conjecture that every odd number is the sum of three primes is true even under the requirement that two of the primes be the same and the third be arbitrarily small.     

Nonseparable graphs with a given number of cycles

G. Ringel conjectured that for every positive integer n other than 2, 4, 5, 8, 9, and 16, there exists a nonseparable graph with n cycles. It is proved here that the conjecture is true even with the restriction to planar and hamiltonian graphs.