Nearly free molecular heat transfer from a sphere

Consider a sphere immersed in a rarefied monatomic gas with zero mean flow. The distribution function of the molecules at infinity is chosen to be a Maxwellian. The boundary condition at the body is diffuse reflection with perfect accommodation to the surface temperature. The microscopic flow of particles about the sphere is modeled kinetically by the Boltzmann equation with the Krook collision term. Appropriate normalizations in the near and far fields lead to a perturbation solution of the problem, expanded in terms of the ratio of body diameter to mean free path (inverse Knudsen number). The distribution function is found directly in each region, and intermediate matching is demonstrated. The heat transfer from the sphere is then calculated as an integral over this distribution function in the inner region. Final results indicate that the heat transfer may at first increase over its free flow value before falling to the continuum level.

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.

An experimental investigation of the heat transfer from a buoyant gas plume to a horizontal unobstructed ceiling

This thesis presents an experimental investigation of the axisymmetric heat transfer from a small scale fire and resulting buoyant plume to a horizontal, unobstructed ceiling during the initial stages of development. A propane-air burner yielding a heat source strength between 1.0 kW and 1.6 kW was used to simulate the fire, and measurements proved that this heat source did satisfactorily represent a source of buoyancy only. The ceiling consisted of a 1/16" steel plate of 0.91 m. diameter, insulated on the upper side. The ceiling height was adjustable between 0.5 m and 0.91 m. Temperature measurements were carried out in the plume, ceiling jet, and on the ceiling.

Heat transfer data were obtained by using the transient method and applying corrections for the radial conduction along the ceiling and losses through the insulation material. The ceiling heat transfer coefficient was based on the adiabatic ceiling jet temperature (recovery temperature) reached after a long time. A parameter involving the source strength Q and ceiling height H was found to correlate measurements of this temperature and its radial variation. A similar parameter for estimating the ceiling heat transfer coefficient was confirmed by the experimental results.

This investigation therefore provides reasonable estimates for the heat transfer from a buoyant gas plume to a ceiling in the axisymmetric case, for the stagnation region where such heat transfer is a maximum and for the ceiling jet region (r/H ≤ 0.7). A comparison with data from experiments which involved larger heat sources indicates that the predicted scaling of temperatures and heat transfer rates for larger scale fires is adequate.

A Detailed Analysis of Transcriptional Regulators Affecting the Saccharomyces cerevisiae Heat-shock Gene SSA1

The yeast Saccharomyces cerevisiae contains a family of hsp70 related genes. One member of this family, SSA1, encodes a 70kD heat-shock protein which in addition to its heat inducible expression has a significant basal level of expression. The first 500 bp upstream of the SSA1 start point of transcription was examined by DNAse I protection analysis. The results reveal the presence of at least 14 factor binding sites throughout the upstream promoter region. The function of these binding sites has been examined using a series of 5' promoter deletions fused to the recorder gene lacZ in a centromere-containing yeast shuttle vector. The following sites have been identified in the promoter and their activity in yeast determined individually with a centromere-based recorder plasmid containing a truncated CYC1 /lacZ fusion: a heat-shock element or HSE which is sufficient to convey heat-shock response on the recorder plasmid; a homology to the SV40 'core' sequence which can repress the GCN4 recognition element (GCRE) and the yAP1 recognition element (ARE), and has been designated a upstream repression element or URE; a 'G'-rich region named G-box which can also convey heatshock response on the recorder plasmid; and a purine-pyrimidine alternating sequence name GT-box which is an activator of transcription. A series of fusion constructs were made to identify a putative silencer-like element upstream of SSA1. This element is position dependent and has been localized to a region containing both an ABF1 binding site and a RAP1 binding site. Five site-specific DNA-binding factors are identified and their purification is presented: the heat-shock transcription factor or HSTF, which recognizes the HSE; the G-box binding factor or GBF; the URE recognition factor or URF; the GT-box binding factor; and the GC-box binding factor or yeast Sp1.

The heat capacity of superfluid ^4He in the presence of a constant heat flux near Tλ

We present the first experimental evidence that the heat capacity of superfluid ⁴He, at temperatures very close to the lambda transition temperature, T_λ,is enhanced by a constant heat flux, Q. The heat capacity at constant Q, C_Q,is predicted to diverge at a temperature T_c(Q) < T_λ at which superflow becomes unstable. In agreement with previous measurements, we find that dissipation enters our cell at a temperature, T_DAS(Q),below the theoretical value, T_c(Q). Our measurements of C_Q were taken using the discrete pulse method at fourteen different heat flux values in the range 1µW/cm² ≤ Q≤ 4µW /cm². The excess heat capacity ∆C_Q we measure has the predicted scaling behavior as a function of T and Q:∆C_Q • t^α ∝ (Q/Q_c)², where Q_cT) ~ t^2ν is the critical heat current that results from the inversion of the equation for T_c(Q). We find that if the theoretical value of T_c( Q) is correct, then ∆C_Q is considerably larger than anticipated. On the other hand,if T_c(Q)≈ T_DAS(Q),then ∆C_Q is the same magnitude as the theoretically predicted enhancement.

Part I: Latent heat of vaporization of n-decane. Part II: Heat and mass transfer from a cylinder placed in a turbulent air stream - Sherwood and Frössling numbers as a function of free stream turbulence level and Reynolds number

Part I

The latent heat of vaporization of n-decane is measured calorimetrically at temperatures between 160° and 340°F. The internal energy change upon vaporization, and the specific volume of the vapor at its dew point are calculated from these data and are included in this work. The measurements are in excellent agreement with available data at 77° and also at 345°F, and are presented in graphical and tabular form.

Part II

Simultaneous material and energy transport from a one-inch adiabatic porous cylinder is studied as a function of free stream Reynolds Number and turbulence level. Experimental data is presented for Reynolds Numbers between 1600 and 15,000 based on the cylinder diameter, and for apparent turbulence levels between 1.3 and 25.0 per cent. n-heptane and n-octane are the evaporating fluids used in this investigation.

Gross Sherwood Numbers are calculated from the data and are in substantial agreement with existing correlations of the results of other workers. The Sherwood Numbers, characterizing mass transfer rates, increase approximately as the 0.55 power of the Reynolds Number. At a free stream Reynolds Number of 3700 the Sherwood Number showed a 40% increase as the apparent turbulence level of the free stream was raised from 1.3 to 25 per cent.

Within the uncertainties involved in the diffusion coefficients used for n-heptane and n-octane, the Sherwood Numbers are comparable for both materials. A dimensionless Frössling Number is computed which characterizes either heat or mass transfer rates for cylinders on a comparable basis. The calculated Frössling Numbers based on mass transfer measurements are in substantial agreement with Frössling Numbers calculated from the data of other workers in heat transfer.

Friction and heat transfer coefficients in smooth and rough pipes with dilute polymer solutions

Measurements of friction and heat transfer coefficients were obtained with dilute polymer solutions flowing through electrically heated smooth and rough tubes. The polymer used was "Polyox WSR-301", and tests were performed at concentrations of 10 and 50 parts per million. The rough tubes contained a close-packed, granular type of surface with roughness-height-to-diameter ratios of 0.0138 and 0.0488 respectively. A Prandtl number range of 4.38 to 10.3 was investigated which was obtained by adjusting the bulk temperature of the solution. The Reynolds numbers in the experiments were varied from =10,000 (Pr= 10.3) to 250,000 (Pr= 4.38).

Friction reductions as high as 73% in smooth tubes and 83% in rough tubes were observed, accompanied by an even more drastic heat transfer reduction (as high as 84% in smooth tubes and 93% in rough tubes). The heat transfer coefficients with Polyox can be lower for a rough tube than for a smooth one.

The similarity rules previously developed for heat transfer with a Newtonian fluid were extended to dilute polymer solution pipe flows. A velocity profile similar to the one proposed by Deissler was taken as a model to interpret the friction and heat transfer data in smooth tubes. It was found that the observed results could be explained by assuming that the turbulent diffusivities are reduced in smooth tubes in the vicinity of the wall, which brings about a thickening of the viscous layer. A possible mechanism describing the effect of the polymer additive on rough pipe flow is also discussed.