Some economic effects of the California agricultural labor relations act

The California Agricultural Labor Relations Act (CALRA) evolved in the 1970s because the National Labor Relations Act (NLRA) excluded agricultural workers. CALRA effectively placed the United Farm Workers Union in a stronger bargaining position vis-a-vis farmers than the NLRA had done for industrial unions vis-a-vis nonfarm business firms. Society has suffered a net economic loss from CALRA and the events preceding its enactment. Since passage of the act, at least three effects have been verified: Relative to conditions that would otherwise have been expected to exist, consumers are facing higher prices; agricultural workers are earning lower wages; and landowners have suffered losses in land values.     

The decision to add a second system producer

Typically in the United States only one contractor (the developer or first producer) makes a weapon system because it is too expensive or for some other reason infeasible to develop a second source. Congress and higher headquarters are constantly challenging the Armed Services to add other sources who can competitively make their systems. This paper describes a method of analyzing this complex problem which often has very large monetary and other significant impacts. Procedures and a case study are presented which consider cost and other criteria which might be used to make the second source decision.     

A family life cycle plan for delivering services to the developmentally handicapped

A treatment model for the developmentally handicapped child does more than meet crisis situations.     

Optimal algorithms for uncovering synteny problem

The syntenic distance between two genomes is the minimum number of fusions, fissions, and translocations that can transform one genome to the other, ignoring the gene order within chromosomes. As the problem is NP-hard in general, some particular classes of synteny instances, such as linear synteny, exact synteny and nested synteny, are examined in the literature. In this paper, we propose a new special class of synteny instances, called uncovering synteny. We first present a polynomial time algorithm to solve the connected case of uncovering synteny optimally. By performing only intra-component moves, we then solve the unconnected case of uncovering synteny. We will further calculate the diameters of connected and unconnected uncovering synteny, respectively.