Publication Abstracts 
for 
Christopher K. McCord 
Department of Mathematical Sciences
University of Cincinnati

 For convenience (or as an expression of an anal-retentive personality), my publications are arranged into four categories:

Dynamical Systems  - Celestial Mechanics & Hamiltonian Systems

We compute the homology of the integral manifolds of the restrictedthree-body problem --- planar and spatial, unregularized and regularized.  Holding the Jacobi constant fixed defines a three dimensional algebraic set in the planar case and a five dimensional algebraic set in the spatial case (the integral manifolds). The singularities of the restricted problem due to collusions are removable which defines the regularized problem.

There are five positive critical values of the Jacobi constant: one is due to a critical point at infinity, another is due to the Lagrangian critical points, and three are due to the Eulerian critical points. The critical point at infinity occurs only in the spatial problems. We compute the homology of the integral manifold for each regular value of the Jacobi constant. These computations show that at each critical value the integral manifolds undergo a bifurcation in their topology.  The bifurcation due to a critical point at infinity shows that Birkhoff's conjecture is false even in the restricted problem.

Birkhoff also asked if the planar problem is the boundary of a cross section for the spatial problem. Our computations and homological criteria show that this can never happen in the restricted problem, but may be possible in the regularized problem for some values of the Jacobi constant. We also investigate the existence of global cross sections in each of the problems.

Return to top of page

Dynamical Systems  - Conley Index & Topological Methods

This paper is an introduction to connection and transition matrices in the Conley index theory for flows. Basic definitions and simple examples are discussed.

This is an expository summary of the simplicial modeling of global attractors described in Simplicial models for the global dynamics of attractors.

Return to top of page

Topology - Nielsen Theory

Nielsen theory, originally developed as a homotopy-theoretic approach to fixed point theory, has been translated and extended to various other problems, such as the study of periodic points, coincidence points and roots. Recently, the techniques of Nielsen theory have been applied to the study of intersections of maps. A Nielsen- type number, the Nielsen intersection number NI(f,g), was introduced, and shown to have many of the properties analogous to those of the Nielsen fixed point number. In particular, it is a homotopy-invariant lower bound for the number of intersections of a pair of maps. The question of whether or not this lower bound is sharp can be thought of as the Wecken problem for intersection theory. In this paper, the Wecken problem for intersections is considered, and some Wecken theorems are proved.
 

Return to top of page

Industrial Engineering - Cutting Stock Problem

The two-dimensional cutting stock problem is the problem of cutting two-dimensional parts from a sheet such that the cutting requirements are met and no cuts overlap.

 This paper presents a genetic algorithm for the cutting-stock problem which handles non-convex, irregularly shaped parts. The objective is to maximize the utilization of the sheet for a given set  of parts that need to be cut from it. The salient features of this algorithm are the way in which layouts are described, and the way in which the efficiency function is computed. We create ‘pseudo-layouts’ of the parts on the sheet , which are easier to be manipulated by the genetic algorithm. These pseudo layouts can be changed into unique actual layouts in a simple manner.

   The proposed algorithm can handle placement of highly irregular parts with ease as no simplifying assumptions are made  about the shape of the parts to be placed. The algorithm was tested with part requirements resembling those from an actual leather industry stock cut need.  Several runs were made with different part requirements and varying sheet dimensions. The efficiency of placement ranged from 65-75%.

 

The two-dimensional stock cutting problem is a well-known and oft-studied problem. We have developed a genetic algorithm approach to the problem, which is capable of handling some of the more intractable forms of the problem: non-convex parts; non-convex sheets; multiple irregularly shaped sheets; etc. We are developing an integrated manufacturing system, which incorporates a machine vision module for acquisition of the images of irregular (non-convex) parts and sheets, polygonalizing them and storing them in a database of parts and sheets. Using the polygonal images as well as the manufacturing schedules and priorities as input, genetic algorithms are used to generate part layouts that satisfy the manufacturing constraints. The significant features of this approach are the integration of all aspects of the layout process; and the flexibility of the genetic algorithm approach, that allows it to be adapted to fit the special requirements of different problems. The proposed methods can be particularly useful in leather and apparel industries where non-convex parts and sheets are commonly used.

Return to top of page

Return to my Home Page