A COST-BENEFIT ANALYSIS OF A 25% RPS IN MICHIGAN

Michigan depends heavily on fossil fuels to generate electricity. Compared with fossil fuels, electricity generation from renewable energy produces less pollutants emissions. A Renewable Portfolio Standard (RPS) is a mandate that requires electric utilities to generate a certain amount of electricity from renewable energy sources. This thesis applies the Cost-Benefits Analysis (CBA) method to investigate the impacts of implementing a 25% in Michigan by 2025. It is found that a 25% RPS will create about $20.12 billion in net benefits to the State. Moreover, if current tax credit policies will not change until 2025, its net present value will increase to about $26.59 billion. Based on the results of this CBA, a 25% RPS should be approved. The result of future studies on the same issue can be improved if more state specific data become available.

ECONOMIC PROFITABILITY OF THE BAKKEN, NORTH DAKOTA UNCONVENTIONAL OIL PLAYS BASED ON A TYPICAL WELL PERFORMANCE WITH CURRENT MARKET CONDITIONS

Increases in oil prices after the economic recession have been surprising for domestic oil production in the United States since the beginning of 2009. Not only did the conventional oil extraction increase, but unconventional oil production and exploration also improved greatly with the favorable economic conditions. This favorable economy encourages companies to invest in new reservoirs and technological developments. Recently, enhanced drilling techniques including hydraulic fracturing and horizontal drilling have been supporting the domestic economy by way of unconventional shale and tight oil from various U.S. locations. One of the main contributors to this oil boom is the unconventional oil production from the North Dakota Bakken field. Horizontal drilling has increased oil production in the Bakken field, but the economic issues of unconventional oil extraction are still debatable due to volatile oil prices, high decline rates of production, a limited production period, high production costs, and lack of transportation. The economic profitability and viability of the unconventional oil play in the North Dakota Bakken was tested with an economic analysis of average Bakken unconventional well features. Scenario analysis demonstrated that a typical North Dakota Bakken unconventional oil well is profitable and viable as shown by three financial metrics; net present value, internal rate of return, and break-even prices.

Future value based single assignment program representations and optimizations

An optimizing compiler internal representation fundamentally affects the clarity, efficiency and feasibility of optimization algorithms employed by the compiler. Static Single Assignment (SSA) as a state-of-the-art program representation has great advantages though still can be improved. This dissertation explores the domain of single assignment beyond SSA, and presents two novel program representations: Future Gated Single Assignment (FGSA) and Recursive Future Predicated Form (RFPF). Both FGSA and RFPF embed control flow and data flow information, enabling efficient traversal program information and thus leading to better and simpler optimizations. We introduce future value concept, the designing base of both FGSA and RFPF, which permits a consumer instruction to be encountered before the producer of its source operand(s) in a control flow setting. We show that FGSA is efficiently computable by using a series T1/T2/TR transformation, yielding an expected linear time algorithm for combining together the construction of the pruned single assignment form and live analysis for both reducible and irreducible graphs. As a result, the approach results in an average reduction of 7.7%, with a maximum of 67% in the number of gating functions compared to the pruned SSA form on the SPEC2000 benchmark suite. We present a solid and near optimal framework to perform inverse transformation from single assignment programs. We demonstrate the importance of unrestricted code motion and present RFPF. We develop algorithms which enable instruction movement in acyclic, as well as cyclic regions, and show the ease to perform optimizations such as Partial Redundancy Elimination on RFPF.