958 resultados para Geometric pattern
Resumo:
The findings are presented of a nutrition survey carried out in the framework of the Nigerian-German Kainji Lake Fisheries Promotion Project in March/April 1995. The major aim of the study was to obtain closer information on the food habits and food consumption patterns of the fishing population, especially the quantification of fish and small fish in particular, consumed at the household level. A standardized questionnaire was used to collect relevant information on demographic, education and occupational profiles; the information was collected in 39 villages in the southern sector of Kainji Lake. (PDF contains 75 pages)
Resumo:
We propose a highly efficient content-lossless compression scheme for Chinese document images. The scheme combines morphologic analysis with pattern matching to cluster patterns. In order to achieve the error maps with minimal error numbers, the morphologic analysis is applied to decomposing and recomposing the Chinese character patterns. In the pattern matching, the criteria are adapted to the characteristics of Chinese characters. Since small-size components sometimes can be inserted into the blank spaces of large-size components, we can achieve small-size pattern library images. Arithmetic coding is applied to the final compression. Our method achieves much better compression performance than most alternative methods, and assures content-lossless reconstruction. (c) 2006 Society of Photo-Optical Instrumentation Engineers.
Resumo:
In this paper, we give a geometric interpretation of determinantal forms, both in the case of general matrices and symmetric matrices. We will prove irreducibility of the determinantal singular loci and state its dimension. We also provide detailed description of the singular locus for small dimensions.
Resumo:
Demixing is the task of identifying multiple signals given only their sum and prior information about their structures. Examples of demixing problems include (i) separating a signal that is sparse with respect to one basis from a signal that is sparse with respect to a second basis; (ii) decomposing an observed matrix into low-rank and sparse components; and (iii) identifying a binary codeword with impulsive corruptions. This thesis describes and analyzes a convex optimization framework for solving an array of demixing problems.
Our framework includes a random orientation model for the constituent signals that ensures the structures are incoherent. This work introduces a summary parameter, the statistical dimension, that reflects the intrinsic complexity of a signal. The main result indicates that the difficulty of demixing under this random model depends only on the total complexity of the constituent signals involved: demixing succeeds with high probability when the sum of the complexities is less than the ambient dimension; otherwise, it fails with high probability.
The fact that a phase transition between success and failure occurs in demixing is a consequence of a new inequality in conic integral geometry. Roughly speaking, this inequality asserts that a convex cone behaves like a subspace whose dimension is equal to the statistical dimension of the cone. When combined with a geometric optimality condition for demixing, this inequality provides precise quantitative information about the phase transition, including the location and width of the transition region.
Resumo:
Life is the result of the execution of molecular programs: like how an embryo is fated to become a human or a whale, or how a person’s appearance is inherited from their parents, many biological phenomena are governed by genetic programs written in DNA molecules. At the core of such programs is the highly reliable base pairing interaction between nucleic acids. DNA nanotechnology exploits the programming power of DNA to build artificial nanostructures, molecular computers, and nanomachines. In particular, DNA origami—which is a simple yet versatile technique that allows one to create various nanoscale shapes and patterns—is at the heart of the technology. In this thesis, I describe the development of programmable self-assembly and reconfiguration of DNA origami nanostructures based on a unique strategy: rather than relying on Watson-Crick base pairing, we developed programmable bonds via the geometric arrangement of stacking interactions, which we termed stacking bonds. We further demonstrated that such bonds can be dynamically reconfigurable.
The first part of this thesis describes the design and implementation of stacking bonds. Our work addresses the fundamental question of whether one can create diverse bond types out of a single kind of attractive interaction—a question first posed implicitly by Francis Crick while seeking a deeper understanding of the origin of life and primitive genetic code. For the creation of multiple specific bonds, we used two different approaches: binary coding and shape coding of geometric arrangement of stacking interaction units, which are called blunt ends. To construct a bond space for each approach, we performed a systematic search using a computer algorithm. We used orthogonal bonds to experimentally implement the connection of five distinct DNA origami nanostructures. We also programmed the bonds to control cis/trans configuration between asymmetric nanostructures.
The second part of this thesis describes the large-scale self-assembly of DNA origami into two-dimensional checkerboard-pattern crystals via surface diffusion. We developed a protocol where the diffusion of DNA origami occurs on a substrate and is dynamically controlled by changing the cationic condition of the system. We used stacking interactions to mediate connections between the origami, because of their potential for reconfiguring during the assembly process. Assembling DNA nanostructures directly on substrate surfaces can benefit nano/microfabrication processes by eliminating a pattern transfer step. At the same time, the use of DNA origami allows high complexity and unique addressability with six-nanometer resolution within each structural unit.
The third part of this thesis describes the use of stacking bonds as dynamically breakable bonds. To break the bonds, we used biological machinery called the ParMRC system extracted from bacteria. The system ensures that, when a cell divides, each daughter cell gets one copy of the cell’s DNA by actively pushing each copy to the opposite poles of the cell. We demonstrate dynamically expandable nanostructures, which makes stacking bonds a promising candidate for reconfigurable connectors for nanoscale machine parts.
Resumo:
A total of 61 specimens of Heterotis niloticus were evaluated by linear regression and correlation. The specimens had mean standard length of 27.09 plus or minus 4.73cm, total length of 33-49cm, mean weight of 2445,108.3g, mean snout length of 48 plus or minus 0.86cm, mean eye diameter of 1.30 plus or minus 0.15cm, mean head length of 6.29 plus or minus 1.75cm. There was a strong relationship between the length and the weight, the eye diameter and the standard length, snout length and the standard length, head length and the standard length, snout length and the weight, head length and the weight (P<0.05). But the correlation of the eye diameters and the weight was insignificant (P>0.05). The growth pattern analysis depicts that the growth was negatively allometric with a b value of 1.16
Recruitment pattern and fish production within the Andoni River system in the Niger Delta of Nigeria
Resumo:
Biweekly samples of fish species obtained from five randomly selected Andoni artisanal fisheries within the Andoni River system, Niger Delta of Nigeria were collected between January and December 1999 and their length frequencies analyzed using FISAT (FAO-ICLARM STOCK ASSESSMENT TOOL). The peak recruitment period for Chrysichthys nigrodigitatus, Ethmalosa fimbriata, Eucinostomus melanopterus, Galeodes decadactylus, Pomadasys jubelini and Sarotherodon melanotheron constituting 54.55% was between June and October while Liza grandisquamis and Lutjanus goreensis, Ilisha Africana. Tilapia guinensis and Pseudotolithus elongate constituting 27.27% had two peak recruitment periods including March-May and May- October. In view of this result it is advisable for fishers to intensify fishing effort between May and October for most commercially important fish species for bountiful harvest
Resumo:
A standard question in the study of geometric quantization is whether symplectic reduction interacts nicely with the quantized theory, and in particular whether “quantization commutes with reduction.” Guillemin and Sternberg first proposed this question, and answered it in the affirmative for the case of a free action of a compact Lie group on a compact Kähler manifold. Subsequent work has focused mainly on extending their proof to non-free actions and non-Kähler manifolds. For realistic physical examples, however, it is desirable to have a proof which also applies to non-compact symplectic manifolds.
In this thesis we give a proof of the quantization-reduction problem for general symplectic manifolds. This is accomplished by working in a particular wavefunction representation, associated with a polarization that is in some sense compatible with reduction. While the polarized sections described by Guillemin and Sternberg are nonzero on a dense subset of the Kähler manifold, the ones considered here are distributional, having support only on regions of the phase space associated with certain quantized, or “admissible”, values of momentum.
We first propose a reduction procedure for the prequantum geometric structures that “covers” symplectic reduction, and demonstrate how both symplectic and prequantum reduction can be viewed as examples of foliation reduction. Consistency of prequantum reduction imposes the above-mentioned admissibility conditions on the quantized momenta, which can be seen as analogues of the Bohr-Wilson-Sommerfeld conditions for completely integrable systems.
We then describe our reduction-compatible polarization, and demonstrate a one-to-one correspondence between polarized sections on the unreduced and reduced spaces.
Finally, we describe a factorization of the reduced prequantum bundle, suggested by the structure of the underlying reduced symplectic manifold. This in turn induces a factorization of the space of polarized sections that agrees with its usual decomposition by irreducible representations, and so proves that quantization and reduction do indeed commute in this context.
A significant omission from the proof is the construction of an inner product on the space of polarized sections, and a discussion of its behavior under reduction. In the concluding chapter of the thesis, we suggest some ideas for future work in this direction.
Resumo:
Pattern formation during animal development involves at least three processes: establishment of the competence of precursor cells to respond to intercellular signals, formation of a pattern of different cell fates adopted by precursor cells, and execution of the cell fate by generating a pattern of distinct descendants from precursor cells. I have analyzed the fundamental mechanisms of pattern formation by studying the development of Caenorhabditis elegans vulva.
In C. elegans, six multipotential vulval precursor cells (VPCs) are competent to respond to an inductive signal LIN-3 (EGF) mediated by LET- 23 (RTK) and a lateral signal via LIN-12 (Notch) to form a fixed pattern of 3°-3°-2°-1°-2°-3°. Results from expressing LIN-3 as a function of time in animals lacking endogenous LIN-3 indicate that both VPCs and VPC daughters are competent to respond to LIN-3. Although the daughters of VPCs specified to be 2° or 3° can be redirected to adopt the 1°fate, the decision to adopt the 1° fate is irreversible. Coupling of VPC competence to cell cycle progression reveals that VPC competence may be periodic during each cell cycle and involve LIN-39 (HOM-C). These mechanisms are essential to ensure a bias towards the 1° fate, while preventing an excessive response.
After adopting the 1° fate, the VPC executes its fate by dividing three rounds to form a fixed pattern of four inner vulF and four outer vulE descendants. These two types of descendants can be distinguished by a molecular marker zmp-1::GFP. A short-range signal from the anchor cell (AC), along with signaling between the inner and outer 1° VPC descendants and intrinsic polarity of 1° VPC daughters, patterns the 1° lineage. The Ras and the Wnt signaling pathways may be involved in these mechanisms.
The temporal expression pattern of egl-17::GFP, another marker ofthe 1° fate, correlates with three different steps of 1° fate execution: the commitment to the 1° fate, as well as later steps before and after establishment of the uterine-vulval connection. Six transcription factors, including LIN-1(ETS), LIN-39 (HOM-C), LIN-11(LIM), LIN-29 (zinc finger), COG-1 (homeobox) and EGL-38 (PAX2/5/8), are involved in different steps during 1° fate execution.