977 resultados para HEAT STORAGE
Resumo:
Most of the fish marketed throughout Nigeria are in either smoked or dried form. The technological requirement for other forms of preservation like chilling and freezing cannot be afforded by the small scale fisher folk. Considerable quantities of fish processed for distant consumer markets are lost at handling, processing, storage and marketing stages. Significant losses occur through infestation by mites, insects, fungal infestation and fragmentation during transportation. This paper attempts to describe the effect of these losses on fish quality and suggests methods of protecting fish from agents of deterioration
Resumo:
Production of mince from Tilapia using a combination of physical and chemical methods was found to improve the storage life of the mince in the deep freezer. Though the chemical composition of the mince was slightly affected, the mince was microbiologically stable throughout the five weeks frozen storage. Fish cakes prepared traditionally from tilapia minces were more acceptable than oven dried cakes. Production of fish cakes form tilapia will improve utilization of this species in areas where small size tilapia are regarded as fish of low economic value
Resumo:
The study was carried out to asses the nutritional qualities of smoked O. niloticus and to discover the best methods of storage to minimize spoilage and infestation of smoked fish. Result showed that the protein contents in A and D decreased while the protein contents of b and C increased. The lipid content increased only in A while it decreased in B-C and D. The moisture content generally increased over the period of storage and there was an increase in ash content only in C while it decreased in A, B and D. The samples packed in polythene bag suffered about 35% mould infection and a few were attached by rodents with some fouling. Samples packed in jute bag were in good condition but were slightly attached by insect. All samples packed in carton and basket were still in good state but there were insect attack in those packed in carton
Resumo:
A modelling study is performed to investigate the characteristics of both plasma flow and heat transfer of a laminar non-transferred arc argon plasma torch operated at atmospheric and reduced pressure. It is found that the calculated flow fields and temperature distributions are quite similar for both cases at a chamber pressure of 1.0 atm and 0.1 atm. A fully developed flow regime could be achieved in the arc constrictor-tube between the cathode and the anode of the plasma torch at 1.0 atm for all the flow rates covered in this study. However the flow field could not reach the fully developed regime at 0.1 atm with a higher flow rate. The arc-root is always attached to the torch anode surface near the upstream end of the anode, i.e. the abruptly expanded part of the torch channel, which is in consistence with experimental observation. The surrounding gas would be entrained from the torch exit into the torch interior due to a comparatively large inner diameter of the anode channel compared to that of the arc constrictor-tube.
Resumo:
The furnace temperature and heat flux distributions of 1 MW tangentially fired furnace were studied during coal-over-coal reburn, and the influences of the position of reburn nozzle and reburn fuel fraction on furnace temperature and heat flux distributions were investigated. Compared with the baseline, the flue gas temperature is 70–90 C lower in primary combustion and 130–150 C higher at furnace exit, and the variations of the flue gas temperature distributions along furnace height are slower. The temperature distribution along the width of furnace wall decreases with the increase of the relative furnace height. In the primary combustion zone and the reburn zone, the temperature and heat flux distributions of furnace wall are much non-uniform and asymmetric along the width of furnace wall, those of furnace wall in the burnout zone are relatively uniform, and the temperature non-uniformity coefficients of the primary combustion zone, the reburn zone and the burnout zone are 0.290, 0.100 and 0.031, respectively.
Resumo:
在概念上,bow wave应译为"头波"而不是"弓形波"。同样,heat sink应译为"热汇"而不是"热沉"。
Resumo:
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.
Resumo:
Investigation were carried out on the effect of some locally available species in the enhancement of the organoleptic quality and the storage periods of smoked Heterotis niloticus using Pprosopis africana as common smoke sources. Samples of fresh H. niloticus were bought, cut into chunks while extract juice from pepper, ginger rhizomes, garlic, onion bulb were used as sources of spices. Samples of fish were divided randomly into five (5) batches dipped into spice extract juices for 10 minutes drained and smoked with common firewood. Treatment without spice extract juice served as control. Each batch of fish was smoked for 7 hours on a drum-made smoking kiln products were individually packaged in polythene bag stored at room temperature and used for sensory evaluation and microbial analysis. Results of the sensory evaluation indicated that there was significant difference (P<0.005) for taste, appearance, colour and overall acceptance for the treatments. Ginger juice extract had the best overall acceptance. Similarly there was significant difference (P>0.05) in the microbial analysis. The garlic juice extract had the longest storage period with minimum total plate and mould count after 8 weeks
Resumo:
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.
Resumo:
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.
Resumo:
Designers who want to manufacture a hardenable steel component need to select both the steel and its heat treatment. This project aims to develop a selection methodology for steels and process routes as an aid to designers. Three studies were conducted: - production of software to calculate the "equivalent diameter" and "equivalent Jominy distance" for simple shapes of a steel component; - prediction of semi-empirical Jominy curves (as-cooled) using CCT diagrams and process modelling methods, which were validated by experiment on plain carbon steels; - investigation of tempering of Jominy bars to explore the potential for semi-empirical models for the hardness after tempering.
Resumo:
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.
Resumo:
4 p.