Annual Compendium of Disability Statistics: 2015

Statistics are a powerful tool—in research, policymaking, program evaluation, and advocacy. They are used to frame the issues, monitor current circumstances and progress, judge the effectiveness of policies and programs, make projections about the future, and predict the costs of potential policy changes. In the United States, statistics about the population with disabilities and about the government programs that serve people with disabilities—disability statistics—are often difficult to find. Numerous government agencies generate and publish disability statistics, and as a result, disability statistics are scattered and buried in documents and websites all across the federal government. The Annual Disability Statistics Compendium is a publication of statistics about people with disabilities and about the government programs which serve them. It is modeled after the Statistical Abstracts of the United States, published yearly by the U.S. Department of Commerce. The Compendium is designed to serve as a summary of government statistics

Study to determine and improve design for lithium-doped solar cells Quarterly report, 1 Jan. - 31 Mar. 1971

Lithium donor density gradient measurements for prediction of lithium cell behavior after electron irradiation and recoverabilit

Study to determine and improve design for lithium-doped solar cells Quarterly report, 1 Apr. - 30 Jun. 1970

Lithium action effects on spontaneous annealing of radiation damage in bulk silicon and silicon solar cell

Action of lithium in radiation-hardened silicon solar cells Quarterly report, 16 Jul. - 15 Oct. 1968

Action of lithium in recovery of irradiated silicon solar cell

Action of lithium in radiation hardened silicon solar cells Quarterly report, 23 Apr. - 15 Jul. 1968

Recovery properties of lithium containing p-n silicon solar cells after radiation damag

The Complexity of Mean Flow Time Scheduling Problems with Release Times

We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that when all jobs have equal processing times then the problem can be solved in polynomial time using linear programming. Our algorithm can also be applied to the open-shop problem with release times and unit processing times. For the general case (when processing times are arbitrary), we show that the problem is unary NP-hard.Comment: Subsumes and replaces cs.DS/0412094 and "Complexity of mean flow time scheduling problems with release dates" by P.B, S.