Plastic Deformation Of Nanocrystalline Nickel

A high-resolution electron microscopy study has uncovered the plastic behavior of accommodating large strains in nanocrystalline (NC) Ni subject to cold rolling at liquid nitrogen temperature. The activation of grain-boundary-mediated-plasticity is evidenced in NC-Ni, including twinning and formation of stacking fault via partial dislocation slips from the grain boundary. The formation and storage of 60A degrees full dislocations are observed inside NC-grains. The grain/twin boundaries act as the barriers of dislocation slips, leading to dislocation pile-up, severe lattice distortion, and formation of sub-grain boundary. The vicinity of grain/twin boundary is where defects preferentially accumulate and likely the favorable place for onset of plastic deformation. The present results indicate the heterogeneous and multiple natures of accommodating plastic strains in NC-grains.

Detailed experimental iced-storage characteristics of Barents Sea cod (Gadus morhua)

Im August 1997 wurde an Bord des FFS „Walther Herwig“ ein Eislagerversuch mit Kabeljau aus der Barebtssee durchgeführt. Die Fische wurden in täglichem Abstand auf ihre chemischen, physikalischen, sensorischen und mikrobiologischen Eigenschaften hin untersucht. Die analytischen Daten wurden jeweils mit den Tagen in Eis korreliert. Es erwies sich, daß die Werte vom Fischtester VI sowie RT Frischetester, von Dimethylamin- und Trimethylaminoxidstickstoff, die Qualitätseinstufung anhand des EUQualitätsbewertungsschemas, die sensorische Bewertung von gegarten Filetproben und die Gesamtkeimzahl auf der Haut am besten mit den im Eis verbrachten Tagen korrelierten. Die guteKorrelation zwischen sensorischen und instrumentell ermittelten Daten läßt in gewissem Umfang einen Ersatz von Sensorikdaten durch instrumentell ermittelten zu.

Design, analysis and implementation of a versatile low level radio frequency system for accelerating cavities

179 p.

Splitting the fast and slow motions in molecular dynamics simulations based on the change of cold potential well bottom

Abstract. The atomic motion is coupled by the fast and slow components due to the high frequency vibration of atoms and the low frequency deformation of atomic lattice, respectively. A two-step approximate method was presented to determine the atomic slow motion. The first step is based on the change of the location of the cold potential well bottom and the second step is based on the average of the appropriate slow velocities of the surrounding atoms. The simple tensions of one-dimensional atoms and two-dimensional atoms were performed with the full molecular dynamics simulations. The conjugate gradient method was employed to determine the corresponding location of cold potential well bottom. Results show that our two-step approximate method is appropriate to determine the atomic slow motion under the low strain rate loading. This splitting method may be helpful to develop more efficient molecular modeling methods and simulations pertinent to realistic loading conditions of materials.

Experimental Research On Fatigue Property Of Steel Rubber Vibration Isolator For Offshore Jacket Platform In Cold Environment

Jacket platform is the most widely used offshore platform. Steel rubber vibration isolator and damping isolation system are often used to reduce or isolate the ice-induced and seismic-induced vibrations. The previous experimental and theoretical studies concern mostly with dynamic properties, vibration isolation schemes and vibration-reduction effectiveness analysis. In this paper, the experiments on steel rubber vibration isolator were carried out to investigate the compressive properties and fatigue properties in different low temperature conditions. The results may provide some guidelines for design of steel rubber vibration isolator for offshore platform in a cold environment, and for maintenance and replacement of steel rubber vibration isolator, and also for fatigue life assessment of the steel rubber vibration isolator. (C) 2009 Elsevier Ltd. All rights reserved.

The effect of traditional handling, processing and storage methods on the quality of dried fish in small scale fisheries in Nigeria

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

Storage potential and utilization of tilapia mince

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

A preliminary investigation into the effect of different storage methods on the keeping quality of smoked Oreochromis niloticus

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

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.

Triploidy induction in Heterobranchus longifilis (Family: Clariidae) by cold shock

Triploid was induced in African Catfish (Heterobranchus longifilis) by cold shocking activated eggs at 5 degree C for forty minutes starting 3-4 minutes after fertilization. Triploidy was confirmed from mitotic chromosomes prepared from embryo which showed 100% triploidy in the cold shocking treatment and 100% diploidy in the control treatment

Effect of locally available spices on the organoleptic and storage periods of Heterotis niloticus

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

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.