Biophysical Model of Larval Yellow Perch Advection and Settlement in Lake Michigan

Potential for large-scale physical transport processes to affect recruitment of Lake Michigan yellow perch (Perca flavescens) was studied by examining the variation in larval distribution, growth rate, and settlement during June–August 1998–2003 using a 3D particle transport model linked with an individual-based bioenergetics growth model. In all years, virtual larvae were released nearshore in southwestern Lake Michigan, a known and important spawning region for yellow perch. For any given year, the same circulation pattern and water temperature either promoted or reduced yellow perch settlement depending on the consumption rates and settlement size chosen in the growth model. Increased consumption increased the number of settled larvae and expanded the total area where larvae settled, whereas increased settlement size reduced the number of settled larvae and reduced the overall settlement area. Interannual variability in circulation patterns and water temperature also resulted in contrasting larval settlement rates, settlement locations, and size of settlement areas between years. Model predictions were most consistent with field observations of age-0 yellow perch from Illinois and Michigan waters when settlement was assumed to occur at 50 mm. Moreover, our model suggests that larvae originating from southwestern Lake Michigan can recruit anywhere within the southern basin and even in the northern basin. Future model improvement will require information on the relative contribution of various sectors to the larval pool, their distribution with reference to the hydrodynamic landscape, the feeding and growth of yellow perch during their pelagic phase, and the size at transition to demersal stage.     

Formation of geothermal resources at lithospheric subduction zones

This paper examines in a very broad fashion the formation of geothermal resources at lithospheric subduction zones. Regions of highly silicic calc-alkaline Quaternary volcanoes and/or plutons have been identified as prime candidates for having high-temperature hydrothermal systems. Regions of large tholeiitic Quaternary volcanoes have been identified as prime candidates for having large moderate-temperature hydrothermal systems. In addition, active magmatic, phreatomagnetic, and/or tectonic fracturing must be occurring in order to keep any moderate to high temperature hydrothermal system from chemically sealing. Connate, meteoric and/or oceanic water sources must also be present. Owing to tectonic and magmatic processes, volcanic arcs of subduction zones represent regions of the crust that have anomalously high mechanical and heat energy. Such arc regions are expected to contain significantly more moderate to high temperature hydrothermal systems than what is presently known. Many of these arcs are briefly discussed with respect to their potential for containing such resources.     

Heating energy use management in residential buildings by temperature control

This paper presents the results of analytical investigations to determine the potential heating energy savings that can be achieved in residential buildings by controlling the house temperature through either night setback or night setback plus day zone setback. A typical U.S. single family house is analyzed for different levels of thermal integrity of the building envelope (i.e., levels of insulation, window glazing, and infiltration). Reduced infiltration, insulated interior walls, and various window orientations are also considered. Results are given for four major U.S. climate zones—cool, temperate, hot-humid, and hot-arid. The analysis shows that both types of setbacks are most effective in loose houses, with the greatest absolute savings for the cool climates, and the greatest percent savings for the hot climates. However, the benefits from thermostat setbacks are smaller for tighter houses, and may actually be counterproductive owing to corollary effects such as increased peak loads and degradation of system efficiency.     

A PROCEDURE FOR THE PRODUCTION OF ULTRA-PURE PRECURSORS FROM COAL FOR THE MANUFACTURE OF VALUE-ADDED CARBON PRODUCTS - TREATMENT OF THE RESIDUE

Solvent extraction of coal results in a coal-derived extract containing the solvent-soluble organic portion of coal free of almost all mineral matter. A residue is also produced and consists of most of the mineral matter. Although a procedure has been developed to manufacture ultra-pure coke precursors for value-added carbon products from coal-derived extracts, treatment/rc-usc of the residue is necessary to make the process economically attractive and environmentally friendly. In this study, a technique has been developed to beneficiate the residue by specific gravity fractionation. It is found that nearly 70 % of the residue can be separated into a fraction containing less than 3.5% ash for a typical WV bituminous coal using an organic liquid having a specific gravity of 1.5. This treatment enables the residue to serve as a low-ash boiler fuel or a suitable precursor for the manufacture of materials such as activated carbons. Consequently, the potential for coal-derived precursors leading to new and non-conventionai marketable carbon products can be realized easily.     

The VLISP verified PreScheme compiler

This paper describes a verified compiler for PreScheme, the implementation language for thevlisp run-time system. The compiler and proof were divided into three parts: A transformational front end that translates source text into a core language, a syntax-directed compiler that translates the core language into a combinator-based tree-manipulation language, and a linearizer that translates combinator code into code for an abstract stored-program machine with linear memory for both data and code. This factorization enabled different proof techniques to be used for the different phases of the compiler, and also allowed the generation of good code. Finally, the whole process was made possible by carefully defining the semantics ofvlisp PreScheme rather than just adopting Scheme's. We believe that the architecture of the compiler and its correctness proof can easily be applied to compilers for languages other than PreScheme.This work was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001, through the MITRE Corporation, and by NSF and DARPA under NSF grants CCR-9002253 and CCR-9014603. Author's current address: Department of Computer Science and Engineering, Oregon Graduate Institute, P.O. Box 91000, Portland, OR 97291-1000.The work reported here was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001. Preparation of this paper was generously supported by The MITRE Corporation.This work was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001, through the MITRE Corporation, and by NSF and DARPA under NSF grants CCR-9002253 and CCR-9014603.     

On formalism and stability of switched systems

In this paper,we formulate a uniform mathematical framework for studying switched systems with piecewise linear partitioned state space and state dependent switching.Based on known results from the the...     

Intrinsically patterned electrical systems: physical requirements and experimental demonstration

Microsystem Technologies - This paper introduces a method of replicating electrical circuits through a series of specific requirements as part of a design methodology referred to as Intrinsically...     

The expected complexity of analytic tableaux analyses in propositional calculus — II

The article continues a study of the complexity of an analytic tableaux algorithm for SAT. The main result is that the average number of branches in analytic tableaux of formulae of lengthn is((1.09988...) ⁿ ). The maximum number of branches is also studied. Both the average and worst case complexity measures are used to compare analytic tableaux and truth tables.For the average case result the precise number of consistent branches and the precise number of inconsistent branches (for formulae of lengthn) are each expressed as multiply indexed sums whose terms involve factorials and Stirling numbers of the second kind. The asymptotic behavior of these sums is determined by adapting a classical technique for determining the asymptotic behavior of singly indexed sums whose terms involve factorials.     

An analytical and numerical study of the two-dimensional Bratu equation

Bratu's problem, which is the nonlinear eigenvalue equationu+ exp(u)=0 withu=0 on the walls of the unit square and as the eigenvalue, is used to develop several themes on applications of Chebyshev pseudospectral methods. The first is the importance ofsymmetry: because of invariance under the C₄ rotation group and parity in bothx andy, one can slash the size of the basis set by a factor of eight and reduce the CPU time by three orders of magnitude. Second, the pseudospectral method is ananalytical as well as a numerical tool: the simple approximation3.2A exp(–0.64A), whereA is the maximum value ofu(x, y), is derived via collocation with but a single interpolation point, but is quantitatively accurate for small and moderateA. Third, the Newton-Kantorovich/Chebyshev pseudospectral algorithm is so efficient that it is possible to compute good numerical solutions—five decimal places—on amicrocomputer inbasic. Fourth, asymptotic estimates of the Chebyshev coefficients can be very misleading: the coefficients for moderately or strongly nonlinear solutions to Bratu's equations fall off exponentially rather than algebraically withv untilv is so large that one has already obtained several decimal places of accuracy. The corner singularities, which dominate the behavior of the Chebyshev coefficients in thelimit v, are so weak as to be irrelevant, and replacing Bratu's problem by a more complicated and realistic equation would merely exaggerate the unimportance of the corner branch points even more.