874 resultados para practical turn
Resumo:
The paper examines the fisheries resources and activities in Ondo State, Nigeria. As a result of the geographical advantage via location along the Atlantic coast the potentials and constraints of coastal artisanal fisheries in Ondo State are assessed. Practical suggestions and approaches for a successful commercialisation of fishery production are given. These include: (a) Identification of useful and reliable fisheries institutions, (b) Inauguration establishment and coordination of a fishery development agency, (c) establishment of aquaculture technology centres (ATC), (d) provision of fishery development fund, (e) Standardisation of fishery consultancy units, etc
Resumo:
Be it a physical object or a mathematical model, a nonlinear dynamical system can display complicated aperiodic behavior, or "chaos." In many cases, this chaos is associated with motion on a strange attractor in the system's phase space. And the dimension of the strange attractor indicates the effective number of degrees of freedom in the dynamical system.
In this thesis, we investigate numerical issues involved with estimating the dimension of a strange attractor from a finite time series of measurements on the dynamical system.
Of the various definitions of dimension, we argue that the correlation dimension is the most efficiently calculable and we remark further that it is the most commonly calculated. We are concerned with the practical problems that arise in attempting to compute the correlation dimension. We deal with geometrical effects (due to the inexact self-similarity of the attractor), dynamical effects (due to the nonindependence of points generated by the dynamical system that defines the attractor), and statistical effects (due to the finite number of points that sample the attractor). We propose a modification of the standard algorithm, which eliminates a specific effect due to autocorrelation, and a new implementation of the correlation algorithm, which is computationally efficient.
Finally, we apply the algorithm to chaotic data from the Caltech tokamak and the Texas tokamak (TEXT); we conclude that plasma turbulence is not a low- dimensional phenomenon.
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 use of pseudoephedrine as a practical chiral auxiliary for asymmetric synthesis is describe. Both enantiomers of pseudoephedrine are inexpensive commodity chemicals and can be N-acylated in high yields to form tertiary amides. In the presence of lithium chloride, the enolates of the corresponding pseudoephedrine amides undergo highly diastereoselective a1kylations with a wide range of alkyl halides to afford α-substituted products in high yields. These products can then be transformed in a single operation into highly enantiomerically enriched carboxylic acids, alcohols, and aldehydes. Lithium amidotrihydroborate (LAB) is shown to be a powerful reductant for the selective reduction of tertiary amides in general and pseudoephedrine amides in particular to form primary alcohols.
Resumo:
Lan honen helburua, EAE-ko curriculuma oinarritzat hartuz, Lehen Hezkuntzako testuliburuetan sormena eta intuizioa garatzen diren problemak lantzen diren, aztertu eta analizatzea da. Horrez gain, testuliburuan atal honetan gabeziak dituzten haur talde batean, mota hauetako problemak praktikan jarriko dira, beraien jarrera eta erantzuna aztertuz.