The Implications of Cognitive-style Findings for Operational Research

Cognitive style refers to differences that can be perceived in individuals due to differing cognitive structures. There has been a large amount of research on how cognitive style affects managerial decision-making, particularly in the context of management information systems, but little or no attempt to relate these findings to operational research. This paper reviews the findings of cognitive-style research from the perspective of operational research, and draws a number of useful inferences concerning the matching of OR aids to managers, the presentation of information and recommendations, the use and acceptance of OR, and the structure of OR groups. Further, it is argued that cognitive-style findings help to give a justification to the move towards ‘soft’ approaches to analysis.     

Buchbesprechungen

Ohne Zusammenfassung

---

Book reviews

     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.     

Evaluating the Efficiency of US Air Force Real-Property Maintenance Activities

The objective of this research is to evaluate a new methodology, data envelopment analysis (DEA), as a tool for measuring and evaluating the operational efficiency of US Air Force organizations. This study involves the application of DEA to locate possible inefficiencies in the performance of US Air Force real-property maintenance activities. Dynamic behaviour, as exhibited via window analyses, is reviewed along with static counterparts. The testing was done in close coordination with Air Force officials, who reviewed the results for accuracy, validity and relevance. We conclude that this type of efficiency analysis does have value for the Air Force, where it can serve as a guide to auditors, budget programmers, managers and others in measuring, evaluating and enhancing operational efficiency.     

3D-TOFSIMS characterization of black spots in polymer light emitting diodes

The occurrence and formation of black spots areas in PolyLED devices has been studied by time-of-flight SIMS (TOFSIMS). The composition, shape and position of the black spots is visualised by three-dimensional (3D)-TOFSIMS depth-profiling. It has been established that the formation of non-emissive spots is due to the growth of aluminium oxide clusters at the AlBa/polymer interface. Electron injection in the black spots is lost by the resulting local increase of the resistivity of the cathode.     

Applying Stochastic Algorithms to a Locomotive Scheduling Problem

This paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple ‘local improvement’ method, performed successively from randomly chosen starting points, and a ‘simulated annealing’ approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Aspects of Generic Entanglement

We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the ``concentration of measure' phenomenon, meaning that on a large-probability set these parameters are close to their expectation. For the entropy of entanglement, this has the counterintuitive consequence that there exist large subspaces in which all pure states are close to maximally entangled. This, in turn, implies the existence of mixed states with entanglement of formation near that of a maximally entangled state, but with negligible quantum mutual information and, therefore, negligible distillable entanglement, secret key, and common randomness. It also implies a very strong locking effect for the entanglement of formation: its value can jump from maximal to near zero by tracing over a number of qubits negligible compared to the size of the total system. Furthermore, such properties are generic. Similar phenomena are observed for random multiparty states, leading us to speculate on the possibility that the theory of entanglement is much simplified when restricted to asymptotically generic states. Further consequences of our results include a complete derandomization of the protocol for universal superdense coding of quantum states.     

Luminescence investigations of the GaP-based dilute nitride Ga(NAsP) material system

Multi-quantum well heterostructures (MQWHs) of the novel Ga(NAsP)/GaP material system have been grown, pseudomorphically strained to GaP-substrate. The crystalline perfection is verified by transmission electron microscopy (TEM). For As-concentrations in excess of about 70%, a direct band structure and adequate luminescence efficiency for laser device application is observed. Temperature-dependent photoluminescence (PL) investigations show the influence of carrier localisation and non-radiative recombination processes typical for dilute nitride materials. With rising N content in the active material, the emission wavelength shifts towards longer wavelength, leading to Ga(NAs)/GaP MQW structures with photon energies below the indirect band gap of silicon (Si). At the same time the luminescence intensity drops due to an increase in non-radiative carrier traps and/or structural degradation.