An explanation of anomalous non-Hookean deformation of ionic single crystals

Anomalous non-Hookean deformation of ionic single crystal

Photovoltaic water pumping applications: Assessment of the near-term market

Water pumping applications represent a potential market for photovoltaics. The price of energy for photovoltaic systems was compared to that of utility line extensions and diesel generators. The potential domestic demand was defined in the government, commercial/institutional and public sectors. The foreign demand and sources of funding for water pumping systems in the developing countries were also discussed briefly. It was concluded that a near term domestic market of at least 240 megawatts and a foreign market of about 6 gigawatts exist

Experimental analysis of the Fitzgerald apparatus

Experimental analysis of Fitzgerald dynamic compliance machin

Study of Dairy Manure N Cycling in Soil-Plant Continuum Using \u3csup\u3e15\u3c/sup\u3eN and Other Methods

Ruminant livestock manure impacts on N cycling in the soil-plant continuum. Most studies of manure N cycling are short-term and rely on indirect methods, i.e. apparent N recovery, fertiliser N equivalents or incorporate 15N into ammonium-N fractions. Direct and perhaps more precise measurements may be achieved by long-term studies using 15N incorporated into all manure N components. This paper summarises results of a 6- year trial to compare indirect and direct measures of manure N uptake by corn for 3 years after application

Behavioral and Electrical Responses Associated with Exposure to Extreme Cold or Heat in the Salamander

Author Institution: Albers Biological Laboratory, Xavier University, and the Department of Anatomy, College of Medicine, University of Cincinnati, Cincinnati, Ohi

How to determine linear complexity and kk-error linear complexity in some classes of linear recurring sequences

Several fast algorithms for the determination of the linear complexity of $d$-periodic sequences over a finite field \F_q, i.e. sequences with characteristic polynomial $f(x) = x^d-1$, have been proposed in the literature. In this contribution fast algorithms for determining the linear complexity of binary sequences with characteristic polynomial $f(x) = (x-1)^d$ for an arbitrary positive integer $d$, and $f(x) = (x^2+x+1)^{2^v}$ are presented. The result is then utilized to establish a fast algorithm for determining the $k$-error linear complexity of binary sequences with characteristic polynomial $(x^2+x+1)^{2^v}$