Sustainable energy solutions for irrigation and harvesting in developing countries

One of the critical problems currently being faced by agriculture industry in developing nations is the alarming rate of groundwater depletion. Irrigation accounts for over 70% of the total groundwater withdrawn everyday. Compounding this issue is the use of polluting diesel generators to pump groundwater for irrigation. This has made irrigation not only the biggest consumer of groundwater but also one of the major contributors to green house gases. The aim of this thesis is to present a solution to the energy-water nexus. To make agriculture less dependent on fossil fuels, the use of a solar-powered Stirling engine as the power generator for on-farm energy needs is discussed. The Stirling cycle is revisited and practical and ideal Stirling cycles are compared. Based on agricultural needs and financial constraints faced by farmers in developing countries, the use of a Fresnel lens as a solar-concentrator and a Beta-type Stirling engine unit is suggested for sustainable power generation on the farms. To reduce the groundwater consumption and to make irrigation more sustainable, the conceptual idea of using a Stirling engine in drip irrigation is presented. To tackle the shortage of over 37 million tonnes of cold-storage in India, the idea of cost-effective solar-powered on-farm cold storage unit is discussed.

Studies on photoblastic germination in lettuce seed

It was shown, with the aid of osmotic inhibition of germination, that the action of the far-red-absorbing form of phytochrome (Pf) in promoting germination can be completed even if the seed is held under conditions where germination is not possible. An effect of the continuing action of Pf beyond the point of complete germination promotion was demonstrated by enhancement of germination rate after removal of the osmotically active solute.

Previous reports that the rate of growth in water of seeds freed from the expansion-restricting endosperm is independent of the state of phytochrome were confirmed. However, a marked, phytochrome-mediated enhancement of the growth potential of such seeds was demonstrated through restricting water uptake by incubation in an osmoticum.

An experimental system, utilizing the appearance of a geotropic curvature in the radicle of the excised axial portion of the seed, was developed for more detailed studies of the phytochrome-enhanced growth potential. It was possible to demonstrate the light effect in water as well as in osmotica; this apparently is not possible with de-endospermed entire seeds. As in intact seeds, the effect of the continuing action of Pf is to enhance the rate of the response. Secretion of a chemical inhibitor of growth by the endosperm as a possible mechanism of induction of light sensitivity has been ruled out.

The phytochrome-dependent rate of appearance of geotropic curvature in osmotica is paralleled in time by a similar dependence of the rate of early extension growth of the embryonic axis. Only the first small increment of growth is a differentially responsive to red (R) and far-red (F); the rate of later increase in length is independent of the light regime.

It was shown that the high concentrations of gibberellic acid required for germination promotion in the intact seed are due at least in part to a diffusion barrier in the endosperm, and that the occasional reports in the literature of the ineffectiveness of kinetin are probably due to the same phenomenon. It was shown that gibberellin, like red light, enhances the growth potential of the axis, but kinetin does not. The difference in rates of response obtained after R-irradiation or gibberellin treatment, together with other results reported in the literature, strongly suggests that gibberellic acid and red light promote germination by different means. The idea that kinetin promotes germination by yet another mechanism, probably operating in the cotyledons, was supported through two different experimental approaches.

The phenomenon of temperature-dependent dark germination was examined in detail, using a wide range of both temperatures and incubation times. With the aid of the half-seed system, it was demonstrated that the promotive effect of low temperature on germination could not be due to a low optimum temperature for early growth of the radicle, since the rate of that process increased with increasing temperature, up to the highest temperature used.

It was shown that phytochrome does not function at high temperatures. This fact is of considerable importance in interpreting the phenomenon of thermodormancy, since in the literature only a small part of the effect of high temperature has been ascribed to an effect on phytochrome, and at that, only to an acceleration of dark reversion of Pf to the red-absorbing form of phytochrome (Pr). Partial denaturation of phytochrome may also make some contribution.

It was shown that the germination-promoting effect of low temperature depends on the presence of Pf, and concluded that low temperatures act by delaying or preventing transformation of Pf. Support for the assumption that Pf, not Pr, is the active form of phytochrome in lettuce seeds was drawn from the same evidence.

Attempts to stimulate germination by repeated irradiation with F over relatively prolonged incubation times resulted in failure, as have similar attempts reported in the literature. However, an enhancement of growth potential in the half-seed system by the maintenance of a small amount of Pf over long periods at ordinary temperatures by repeated irradiation with F was demonstrated.

It was observed that cold storage of the dry seed prevents or delays loss of dark dormancy during post-harvest storage. No change in the response of the half-seed in osmoticum to R and F was observed in seeds that has lost dark dormancy; that is, no internal change took place to measurably increase the growth potential of the embryonic axis. This suggests that the endosperm is the seat of changes responsible for after-ripening of photoblastic lettuce seed.

Nonexistence of looping trajectories in hydromagnetic waves of finite amplitude. Breaking of waves in a cold collision-free plasma in a magnetic field. On stabilities of periodic waves in a cold collision-free plasma in a magnetic field.

This dissertation consists of three parts. In Part I, it is shown that looping trajectories cannot exist in finite amplitude stationary hydromagnetic waves propagating across a magnetic field in a quasi-neutral cold collision-free plasma. In Part II, time-dependent solutions in series expansion are presented for the magnetic piston problem, which describes waves propagating into a quasi-neutral cold collision-free plasma, ensuing from magnetic disturbances on the boundary of the plasma. The expansion is equivalent to Picard's successive approximations. It is then shown that orbit crossings of plasma particles occur on the boundary for strong disturbances and inside the plasma for weak disturbances. In Part III, the existence of periodic waves propagating at an arbitrary angle to the magnetic field in a plasma is demonstrated by Stokes expansions in amplitude. Then stability analysis is made for such periodic waves with respect to side-band frequency disturbances. It is shown that waves of slow mode are unstable whereas waves of fast mode are stable if the frequency is below the cutoff frequency. The cutoff frequency depends on the propagation angle. For longitudinal propagation the cutoff frequency is equal to one-fourth of the electron's gyrofrequency. For transverse propagation the cutoff frequency is so high that waves of all frequencies are stable.

Coding for information storage

Storage systems are widely used and have played a crucial rule in both consumer and industrial products, for example, personal computers, data centers, and embedded systems. However, such system suffers from issues of cost, restricted-lifetime, and reliability with the emergence of new systems and devices, such as distributed storage and flash memory, respectively. Information theory, on the other hand, provides fundamental bounds and solutions to fully utilize resources such as data density, information I/O and network bandwidth. This thesis bridges these two topics, and proposes to solve challenges in data storage using a variety of coding techniques, so that storage becomes faster, more affordable, and more reliable.

We consider the system level and study the integration of RAID schemes and distributed storage. Erasure-correcting codes are the basis of the ubiquitous RAID schemes for storage systems, where disks correspond to symbols in the code and are located in a (distributed) network. Specifically, RAID schemes are based on MDS (maximum distance separable) array codes that enable optimal storage and efficient encoding and decoding algorithms. With r redundancy symbols an MDS code can sustain r erasures. For example, consider an MDS code that can correct two erasures. It is clear that when two symbols are erased, one needs to access and transmit all the remaining information to rebuild the erasures. However, an interesting and practical question is: What is the smallest fraction of information that one needs to access and transmit in order to correct a single erasure? In Part I we will show that the lower bound of 1/2 is achievable and that the result can be generalized to codes with arbitrary number of parities and optimal rebuilding.

We consider the device level and study coding and modulation techniques for emerging non-volatile memories such as flash memory. In particular, rank modulation is a novel data representation scheme proposed by Jiang et al. for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. It eliminates the need for discrete cell levels, as well as overshoot errors, when programming cells. In order to decrease the decoding complexity, we propose two variations of this scheme in Part II: bounded rank modulation where only small sliding windows of cells are sorted to generated permutations, and partial rank modulation where only part of the n cells are used to represent data. We study limits on the capacity of bounded rank modulation and propose encoding and decoding algorithms. We show that overlaps between windows will increase capacity. We present Gray codes spanning all possible partial-rank states and using only ``push-to-the-top'' operations. These Gray codes turn out to solve an open combinatorial problem called universal cycle, which is a sequence of integers generating all possible partial permutations.

On erasure coding for distributed storage and streaming communications

The work presented in this thesis revolves around erasure correction coding, as applied to distributed data storage and real-time streaming communications.

First, we examine the problem of allocating a given storage budget over a set of nodes for maximum reliability. The objective is to find an allocation of the budget that maximizes the probability of successful recovery by a data collector accessing a random subset of the nodes. This optimization problem is challenging in general because of its combinatorial nature, despite its simple formulation. We study several variations of the problem, assuming different allocation models and access models, and determine the optimal allocation and the optimal symmetric allocation (in which all nonempty nodes store the same amount of data) for a variety of cases. Although the optimal allocation can have nonintuitive structure and can be difficult to find in general, our results suggest that, as a simple heuristic, reliable storage can be achieved by spreading the budget maximally over all nodes when the budget is large, and spreading it minimally over a few nodes when it is small. Coding would therefore be beneficial in the former case, while uncoded replication would suffice in the latter case.

Second, we study how distributed storage allocations affect the recovery delay in a mobile setting. Specifically, two recovery delay optimization problems are considered for a network of mobile storage nodes: the maximization of the probability of successful recovery by a given deadline, and the minimization of the expected recovery delay. We show that the first problem is closely related to the earlier allocation problem, and solve the second problem completely for the case of symmetric allocations. It turns out that the optimal allocations for the two problems can be quite different. In a simulation study, we evaluated the performance of a simple data dissemination and storage protocol for mobile delay-tolerant networks, and observed that the choice of allocation can have a significant impact on the recovery delay under a variety of scenarios.

Third, we consider a real-time streaming system where messages created at regular time intervals at a source are encoded for transmission to a receiver over a packet erasure link; the receiver must subsequently decode each message within a given delay from its creation time. For erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts whose maximum length is sufficiently short or long, we show that a time-invariant intrasession code asymptotically achieves the maximum message size among all codes that allow decoding under all admissible erasure patterns. For the bursty erasure model, we also show that diagonally interleaved codes derived from specific systematic block codes are asymptotically optimal over all codes in certain cases. We also study an i.i.d. erasure model in which each transmitted packet is erased independently with the same probability; the objective is to maximize the decoding probability for a given message size. We derive an upper bound on the decoding probability for any time-invariant code, and show that the gap between this bound and the performance of a family of time-invariant intrasession codes is small when the message size and packet erasure probability are small. In a simulation study, these codes performed well against a family of random time-invariant convolutional codes under a number of scenarios.

Finally, we consider the joint problems of routing and caching for named data networking. We propose a backpressure-based policy that employs virtual interest packets to make routing and caching decisions. In a packet-level simulation, the proposed policy outperformed a basic protocol that combines shortest-path routing with least-recently-used (LRU) cache replacement.

A study of the proposed Diamond Creek Reservoir

Politically the Colorado river is an interstate as well as an international stream. Physically the basin divides itself distinctly into three sections. The upper section from head waters to the mouth of San Juan comprises about 40 percent of the total of the basin and affords about 87 percent of the total runoff, or an average of about 15 000 000 acre feet per annum. High mountains and cold weather are found in this section. The middle section from the mouth of San Juan to the mouth of the Williams comprises about 35 percent of the total area of the basin and supplies about 7 percent of the annual runoff. Narrow canyons and mild weather prevail in this section. The lower third of the basin is composed of mainly hot arid plains of low altitude. It comprises some 25 percent of the total area of the basin and furnishes about 6 percent of the average annual runoff.

The proposed Diamond Creek reservoir is located in the middle section and is wholly within the boundary of Arizona. The site is at the mouth of Diamond Creek and is only 16 m. from Beach Spring, a station on the Santa Fe railroad. It is solely a power project with a limited storage capacity. The dam which creats the reservoir is of the gravity type to be constructed across the river. The walls and foundation are of granite. For a dam of 290 feet in height, the back water will be about 25 m. up the river.

The power house will be placed right below the dam perpendicular to the axis of the river. It is entirely a concrete structure. The power installation would consist of eighteen 37 500 H.P. vertical, variable head turbines, directly connected to 28 000 kwa. 110 000 v. 3 phase, 60 cycle generators with necessary switching and auxiliary apparatus. Each unit is to be fed by a separate penstock wholly embedded into the masonry.

Concerning the power market, the main electric transmission lines would extend to Prescott, Phoenix, Mesa, Florence etc. The mining regions of the mountains of Arizona would be the most adequate market. The demand of power in the above named places might not be large at present. It will, from the observation of the writer, rapidly increase with the wonderful advancement of all kinds of industrial development.

All these things being comparatively feasible, there is one difficult problem: that is the silt. At the Diamond Creek dam site the average annual silt discharge is about 82 650 acre feet. The geographical conditions, however, will not permit silt deposites right in the reservoir. So this design will be made under the assumption given in Section 4.

The silt condition and the change of lower course of the Colorado are much like those of the Yellow River in China. But one thing is different. On the Colorado most of the canyon walls are of granite, while those on the Yellow are of alluvial loess: so it is very hard, if not impossible, to get a favorable dam site on the lower part. As a visitor to this country, I should like to see the full development of the Colorado: but how about THE YELLOW!