The World of IBM Education

Because of its corporate philosophy and its deep immersion in advanced technology, International Business Machines Corporation has an abiding concern for the further training and education of its 260,000 employees. At any given time in this multinational corporation with $10 billion in annual sales, tens of thousands of employees are engaged in some form of training at 275 education centers. IBM's advanced terminal computer-based education is now available at the majority of the company's 230 branch offices in the U.S. For a pervasive look at IBM's training and education accomplishments, Change's editors talked with Charles R. Bowen, IBM's program director for education development, and William C. Carpenter, an IBM education program consultant.     

Software adaptation for poorly IBM compatible personal computers

Translated from Sistemnoe Programmirovanie i Modeli Issledovaniya Operatsii, pp. 7–10, 1993.     

IBM journey management library: an arena system for airport simulations

Airline passenger terminal congestion caused by increasing passenger traffic results in unsatisfactory levels of customer service. We discuss a simulation modelling tool to help airlines and airports to use advanced technology to improve service to passengers. The tool consists of custom designed, reusable modules that represent the most common airline and airport system data, logic and processes. A model of an actual airline operation based on this approach is described.     

Factoring high-degree polynomials over with Niederreiter's algorithm on the IBM SP2

A implementation of Niederreiter's algorithm for factoring polynomials over is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain system of linear equations, is performed in parallel. Once a basis for the solution space is found, all irreducible factors of the polynomial can be extracted by suitable -computations. For this purpose, asymptotically fast polynomial arithmetic algorithms are implemented. These include Karatsuba & Ofman multiplication, Cantor multiplication and Newton inversion. In addition, a new efficient version of the half-gcd algorithm is presented. Sequential run times for the polynomial arithmetic and parallel run times for the factorization are given. A new ``world record' for polynomial factorization over the binary field is set by showing that a pseudo-randomly selected polynomial of degree 300000 can be factored in about 10 hours on 256 nodes of the IBM SP2 at the Cornell Theory Center.