By Topic

IBM Journal of Research and Development

Issue 4 • July 1969

Filter Results

Displaying Results 1 - 20 of 20
  • Operations Research [Preface]

    Publication Year: 1969, Page(s): 342
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (242 KB)

    Operations research is the application of scientific analysis to management problems; its aim is to provide decision makers with a sound quantitative basis for decision making in the face of complex relationships, uncertainty and risks, conflicts of interest and alternative courses of action. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic Model for Manufacturing Cost Estimating

    Publication Year: 1969, Page(s):343 - 350
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (714 KB)

    The unit manufacturing cost (i.e., its estimator) for a given manufacturing program with stochastic demand and operation yield is assumed to be a random variable. For a simple series production line the probability distribution of the unit manufacturing cost has been derived by either the transform method, which uses Mellin and Laplace transforms, or the method of moments, which uses either the Gr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Inventory Models and Stochastic Programming

    Publication Year: 1969, Page(s):351 - 356
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (561 KB)

    A wide class of single-product, dynamic inventory problems with convex cost functions and a finite horizon is investigated as a stochastic programming problem. When demands have finite discrete distribution functions, we show that the problem can be substantially reduced in size to a linear program with upper-bounded variables. Moreover, we show that the reduced problem has a network representatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programmed Automatic Customer Engineer (PACE) Dispatch

    Publication Year: 1969, Page(s):357 - 365
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (777 KB)

    An experimental real-time system is described for assigning customer engineers (servicemen) to requests for service, preventive maintenance and engineering- and sales-change activities. The system, which can be applied to service organizations of many kinds, is viewed as a stochastic programming formulation. The resultant mathematical programming problem is structured as a control system, an inner... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model of Competition in a Two-seller Market

    Publication Year: 1969, Page(s):366 - 372
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (616 KB)

    In this model of sellers' competition we are concerned with the transition from a single-seller market to a two-seller market, the effects of transition on the first seller, his likely reactions and the thereby changed market situation that awaits the entering competitor. The decision variables considered in this model are the sizes of the two sales forces. We show that the enterer should not view... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximal Biflow in an Undirected Network

    Publication Year: 1969, Page(s):373 - 379
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (555 KB)

    In this network flow problem we deal with two distinct commodities, each commodity being identified by a pair of source and sink nodes. The problem consists of maximizing the total flow (biflow) of the two commodities. It is solved by an inductive algorithm which starts with a maximal multiterminal flow from the set of sources to the set of sinks in the network, yields the value of the maximal bif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm and Average-value Bounds for Assignment Problems

    Publication Year: 1969, Page(s):380 - 386
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (589 KB)

    A new suboptimal intermediate-speed algorithm which uses n2 ln n steps is developed for the assignment problem. Upper and lower bounds are derived, using this algorithm and other methods, for the average values of three classes of n × n assignment problems: 1. When the elements of the matrix are random numbers uniformly distributed over the range 0 to 1, the average optimal value... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shortcut in the Decomposition Algorithm for Shortest Paths in a Network

    Publication Year: 1969, Page(s):387 - 390
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (496 KB)

    The problem considered is that of finding the shortest path between the two nodes of every pair in a large n-node network. A decomposition algorithm is proposed for use when the number of arcs is less than n(n-1). The network is first decomposed into several overlapping subnetworks. Next, with each subnetwork treated separately, conditional shortest paths are obtained using triple operations. Fina... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimaximal Paths in Disjunctive Graphs by Direct Search

    Publication Year: 1969, Page(s):391 - 399
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (729 KB)

    The problem of finding a minimaximal path in a disjunctive network is stated in terms of both graph theory and linear programming with mixed-integer variables. It is solved in both formulations using a “direct search” scheme with additional dynamic features, which seems to be a more efficient algorithm than those based on other methods. Although it yields an optimal solution, the alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic Algorithm for the Traveling-salesman Problem

    Publication Year: 1969, Page(s):400 - 407
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (724 KB)

    The classical traveling-salesman problem is to determine a tour that will minimize the total distance or cost involved in visiting several cities and returning to the starting point. This paper describes a new heuristic algorithm that has been programmed for a digital computer and that obtains optimal or near-optimal solutions to the problem. The author's general approach was derived from an exist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IBM 2750 Voice and Data Switching System: Organization and Functions

    Publication Year: 1969, Page(s):408 - 415
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (793 KB)

    This paper reviews the functions of private automatic branch exchanges (PABX's) and describes the organization of the IBM 2750 Voice and Data Switching System. This system has two main functional areas: (1) line switching, transmission and signaling, and (2) common control. The switching network uses a new integrated electronic crosspoint. The common control is performed by a built-in duplexed com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Electronic Switching Network of the IBM 2750

    Publication Year: 1969, Page(s):416 - 427
    Cited by:  Papers (5)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (880 KB)

    A description of the voice and data switching network of a fully electronic private automatic branch exchange (PABX) is given, including a description of the crosspoint device and its principles of operation. Some related circuity is described, including the terminal and service circuits, supervision circuits and a loss-compensation device. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operational Program for the IBM 2750

    Publication Year: 1969, Page(s):428 - 438
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (961 KB)

    This paper describes the operational program of the IBM 2750 Voice and Data Switching System. The program runs in the supervisor unit of the two network controllers used in the 2750. This program controls: (1) the duplexing of the network controllers; (2) the switching network; (3) the data collection and transmission operations passing through the system, including interconnection with IBM System... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semiconductor Crosspoints

    Publication Year: 1969, Page(s):439 - 446
    Cited by:  Papers (8)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (767 KB)

    The design considerations for a semiconductor crosspoint consisting of an SCR-diode-resistor circuit are presented and the fabrication process is briefly reviewed. These crosspoints have an ON-resistance of three to four ohms and a capacitance of approximately three picofarads. They can be interconnected on ceramic modules to form matrix arrays for use in telephone line switching applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Response Time of Thyristors: Theoretical Study and Application to Electronic Switching Networks

    Publication Year: 1969, Page(s):447 - 455
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (784 KB)

    After restating the experimental definition of the response time of a low-power thyristor by assuming a well-defined dc triggering current, the authors show that the equivalent two-transistor representation of the thyristor leads to a theoretical interpretation of the triggering condition under certain simplifying assumptions. The accuracy of this theoretical model is shown to be satisfactory. A p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Recovery in a Photo-Digital Storage System

    Publication Year: 1969, Page(s):456 - 467
    Cited by:  Papers (1)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1143 KB)

    A data-recovery feature has been developed for recovering electron-beam recorded information which is microscopic in dimension and has been partially obliterated by flaws in a photographic-film recording medium. This feature provides (1) backup procedures that exploit redundancies in the recording format for the synchronization and identification of data, (2) coding for error detection and correct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Plasma Effects on Radar Cross Section of Reentry Vehicles

    Publication Year: 1969, Page(s):468 - 474
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (710 KB)

    In order to design a radar to detect, track, and identify unknown targets, models of the expected electromagnetic scattering properties of the targets must be developed. This communication begins with a qualitative discussion of interactions between an incident wave and a plasma-clad body in order to give the general reader a heuristic understanding of the problem background. Then rigorous calcula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent Papers by IBM authors

    Publication Year: 1969, Page(s):475 - 478
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (424 KB)

    Reprints of the papers listed here may usually be obtained most eficiently by writing directly to the authors. The authors' IBM divisions and locations are identified as follows: ASDD is the Advanced Systems Development Division; CD, Components Division; DPD, Data Processing Division; FSD, Federal Systems Division: RES, Research Division; SDD, Systems Development Division and SMD, Systems Manufact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Patents Recently Issued to IBM Inventors

    Publication Year: 1969, Page(s):479 - 481
    IEEE is not the copyright holder of this material | PDF file iconPDF (361 KB)
    Freely Available from IEEE
  • Authors

    Publication Year: 1969, Page(s):482 - 484
    IEEE is not the copyright holder of this material | PDF file iconPDF (462 KB)
    Freely Available from IEEE

Aims & Scope

The IBM Journal of Research and Development is a peer-reviewed technical journal, published bimonthly, which features the work of authors in the science, technology and engineering of information systems.

Learn about subscribing to this journal >

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Clifford A. Pickover
IBM T. J. Watson Research Center