Problems of industrial fisheries development in the Cross River State

The industrial fisheries as opposed to artisanal fisheries in Cross River State, Nigeria, is discussed, considering the prospect of industrial fisheries in the State and identifying the major fish and shrimp resources within the coastal waters. Industrial fishing was introduced in 1973 when the state government invited a Japaneese company to carry out a joint exploratory shrimp fishing venture. The contributions made by the Seastate Seafoods Company, the Eyib's Nutritional Food and the Arawak Fishing Companies towards the increase in the number of fishing fleet in the state are noted.

Utilization of agro-industrial wastes as fish feedstuffs in Nigeria

Fish feeding accounts for a substantial amount in the variable expenditure of a fish farming enterprises. There is a need to examine closely the potentials and advantages of locally available agro-industrial by-products, as possible substitutes for the conventional feedstuffs which are dwindling in supply, and escalating in their cost. A wide range of by products from plant, animal and industrial processes have been studied and posses nutrient composition which can be exploited as dietary ingredients for warm water species as the Tilapia and Clarias sp. Such useful by-products include poultry feathers, rice bran, soybean hulls and cocoa husks which are discarded as wastes. However, some processing treatments might be required to alleviate the toxic effects of possible anti-nutritional factors in the by-products, for the achievement of optimum benefit

Cálculo y diseño de una nave industrial con puente grúa

Cálculo y dimensionamiento de una nave industrial para la producción y almacenaje de bombas hidráulicas de pequeño y gran tamaño, con grúa puente de capacidad 6,3 Tn y una zona de oficinas donde se ubican los distintos departamentos de la empresa. Redactado en castellano.

Diseño y cálculo de una nave industrial para instalación de cogeneración

Diseño y cálculo de una nave industrial para la posterior instalación de una planta de cogeneración.

Nave industrial para troquelería

Diseño y cálculo de una nave industrial destinada a ser una troquelería.

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.

Electro-optic integration of embedded electrodes and waveguides in LiNbO3 using a femtosecond laser

We describe the fabrication of a Mach-Zehnder optical modulator in LiNbO3 by femtosecond laser micormachining, which is composed of optical waveguides inscripted by a femtosecond laser and embedded microelectrodes subsequently using femtosecond laser ablation and selective electroless plating. A half-wave voltage close to 19 V is achieved at a wavelength of 632.8 nm with an interaction length of 2.6 mm. This simple and cost-effective technique opens up new opportunities for fabricating integrated electro-optic devices. (C) 2008 Optical Society of America

Geometric integration applied to moving mesh methods and degenerate Lagrangians

Moving mesh methods (also called r-adaptive methods) are space-adaptive strategies used for the numerical simulation of time-dependent partial differential equations. These methods keep the total number of mesh points fixed during the simulation, but redistribute them over time to follow the areas where a higher mesh point density is required. There are a very limited number of moving mesh methods designed for solving field-theoretic partial differential equations, and the numerical analysis of the resulting schemes is challenging. In this thesis we present two ways to construct r-adaptive variational and multisymplectic integrators for (1+1)-dimensional Lagrangian field theories. The first method uses a variational discretization of the physical equations and the mesh equations are then coupled in a way typical of the existing r-adaptive schemes. The second method treats the mesh points as pseudo-particles and incorporates their dynamics directly into the variational principle. A user-specified adaptation strategy is then enforced through Lagrange multipliers as a constraint on the dynamics of both the physical field and the mesh points. We discuss the advantages and limitations of our methods. The proposed methods are readily applicable to (weakly) non-degenerate field theories---numerical results for the Sine-Gordon equation are presented.

In an attempt to extend our approach to degenerate field theories, in the last part of this thesis we construct higher-order variational integrators for a class of degenerate systems described by Lagrangians that are linear in velocities. We analyze the geometry underlying such systems and develop the appropriate theory for variational integration. Our main observation is that the evolution takes place on the primary constraint and the 'Hamiltonian' equations of motion can be formulated as an index 1 differential-algebraic system. We then proceed to construct variational Runge-Kutta methods and analyze their properties. The general properties of Runge-Kutta methods depend on the 'velocity' part of the Lagrangian. If the 'velocity' part is also linear in the position coordinate, then we show that non-partitioned variational Runge-Kutta methods are equivalent to integration of the corresponding first-order Euler-Lagrange equations, which have the form of a Poisson system with a constant structure matrix, and the classical properties of the Runge-Kutta method are retained. If the 'velocity' part is nonlinear in the position coordinate, we observe a reduction of the order of convergence, which is typical of numerical integration of DAEs. We also apply our methods to several models and present the results of our numerical experiments.