RB30-252 Sex and Age as Factors in Cattle Feeding

Varying economic conditions and changes in the demands of the meat consuming public have been responsible for the turns that have taken place in the beef industry during recent years. Both feeder and producer must recognize and conform to these changes if they are to continue in business. Among the most important of these changes have been the turn toward the marketing of lighter cattle and the gradual disappearance from feed lots of two- and three-year-old animals. Furthermore, the cattle population of the United States is fast reaching stabilization with the resulting effect that more heifers are being marketed, since only one-fourth of the heifer crop is needed to replace worn-out breeding animals. Realizing the increasing importance of the heifer problem from the standpoint of the producer, feeder, and consumer, the Nebraska Experiment Station undertook to compare steers and heifers in a series of trials both in the feedlot and in the beef. It was hoped that these experiments would yield results which would bring out existing differences, if any, between steers and heifers both in quality and quantity of beef produced and thus provide or disprove many of the complaints against heifers. The results of these trials are summarized in this bulletin. Age as well as the sex factor has been considered, since two-year-olds, yearlings, and calves were included in these trials.

Least-cost Disjoint Paths with Dependent Cost Structure in Wavelength Continuous Optical WDM Networks

One of the important issues in establishing a fault tolerant connection in a wavelength division multiplexing optical network is computing a pair of disjoint working and protection paths and a free wavelength along the paths. While most of the earlier research focused only on computing disjoint paths, in this work we consider computing both disjoint paths and a free wavelength along the paths. The concept of dependent cost structure (DCS) of protection paths to enhance their resource sharing ability was proposed in our earlier work. In this work we extend the concept of DCS of protection paths to wavelength continuous networks. We formalize the problem of computing disjoint paths with DCS in wavelength continuous networks and prove that it is NP-complete. We present an iterative heuristic that uses a layered graph model to compute disjoint paths with DCS and identify a free wavelength.