A determinação dos números de indivíduos mínimos necessários na experimentação genética

The main object of the present paper consists in giving formulas and methods which enable us to determine the minimum number of repetitions or of individuals necessary to garantee some extent the success of an experiment. The theoretical basis of all processes consists essentially in the following. Knowing the frequency of the desired p and of the non desired ovents q we may calculate the frequency of all possi- ble combinations, to be expected in n repetitions, by expanding the binomium (p-+q)n. Determining which of these combinations we want to avoid we calculate their total frequency, selecting the value of the exponent n of the binomium in such a way that this total frequency is equal or smaller than the accepted limit of precision n/pª{ 1/n1 (q/p)n + 1/(n-1)| (q/p)n-1 + 1/ 2!(n-2)| (q/p)n-2 + 1/3(n-3) (q/p)n-3... < Plim - -(1b) There does not exist an absolute limit of precision since its value depends not only upon psychological factors in our judgement, but is at the same sime a function of the number of repetitions For this reasen y have proposed (1,56) two relative values, one equal to 1-5n as the lowest value of probability and the other equal to 1-10n as the highest value of improbability, leaving between them what may be called the "region of doubt However these formulas cannot be applied in our case since this number n is just the unknown quantity. Thus we have to use, instead of the more exact values of these two formulas, the conventional limits of P.lim equal to 0,05 (Precision 5%), equal to 0,01 (Precision 1%, and to 0,001 (Precision P, 1%). The binominal formula as explained above (cf. formula 1, pg. 85), however is of rather limited applicability owing to the excessive calculus necessary, and we have thus to procure approximations as substitutes. We may use, without loss of precision, the following approximations: a) The normal or Gaussean distribution when the expected frequency p has any value between 0,1 and 0,9, and when n is at least superior to ten. b) The Poisson distribution when the expected frequecy p is smaller than 0,1. Tables V to VII show for some special cases that these approximations are very satisfactory. The praticai solution of the following problems, stated in the introduction can now be given: A) What is the minimum number of repititions necessary in order to avoid that any one of a treatments, varieties etc. may be accidentally always the best, on the best and second best, or the first, second, and third best or finally one of the n beat treatments, varieties etc. Using the first term of the binomium, we have the following equation for n: n = log Riim / log (m:) = log Riim / log.m - log a --------------(5) B) What is the minimun number of individuals necessary in 01der that a ceratin type, expected with the frequency p, may appaer at least in one, two, three or a=m+1 individuals. 1) For p between 0,1 and 0,9 and using the Gaussean approximation we have: on - ó. p (1-p) n - a -1.m b= δ. 1-p /p e c = m/p } -------------------(7) n = b + b² + 4 c/ 2 n´ = 1/p n cor = n + n' ---------- (8) We have to use the correction n' when p has a value between 0,25 and 0,75. The greek letters delta represents in the present esse the unilateral limits of the Gaussean distribution for the three conventional limits of precision : 1,64; 2,33; and 3,09 respectively. h we are only interested in having at least one individual, and m becomes equal to zero, the formula reduces to : c= m/p o para a = 1 a = { b + b²}² = b² = δ2 1- p /p }-----------------(9) n = 1/p n (cor) = n + n´ 2) If p is smaller than 0,1 we may use table 1 in order to find the mean m of a Poisson distribution and determine. n = m: p C) Which is the minimun number of individuals necessary for distinguishing two frequencies p1 and p2? 1) When pl and p2 are values between 0,1 and 0,9 we have: n = { δ p1 ( 1-pi) + p2) / p2 (1 - p2) n= 1/p1-p2 }------------ (13) n (cor) We have again to use the unilateral limits of the Gaussean distribution. The correction n' should be used if at least one of the valors pl or p2 has a value between 0,25 and 0,75. A more complicated formula may be used in cases where whe want to increase the precision : n (p1 - p2) δ { p1 (1- p2 ) / n= m δ = δ p1 ( 1 - p1) + p2 ( 1 - p2) c= m / p1 - p2 n = { b2 + 4 4 c }2 }--------- (14) n = 1/ p1 - p2 2) When both pl and p2 are smaller than 0,1 we determine the quocient (pl-r-p2) and procure the corresponding number m2 of a Poisson distribution in table 2. The value n is found by the equation : n = mg /p2 ------------- (15) D) What is the minimun number necessary for distinguishing three or more frequencies, p2 p1 p3. If the frequecies pl p2 p3 are values between 0,1 e 0,9 we have to solve the individual equations and sue the higest value of n thus determined : n 1.2 = {δ p1 (1 - p1) / p1 - p2 }² = Fiim n 1.2 = { δ p1 ( 1 - p1) + p1 ( 1 - p1) }² } -- (16) Delta represents now the bilateral limits of the : Gaussean distrioution : 1,96-2,58-3,29. 2) No table was prepared for the relatively rare cases of a comparison of threes or more frequencies below 0,1 and in such cases extremely high numbers would be required. E) A process is given which serves to solve two problemr of informatory nature : a) if a special type appears in n individuals with a frequency p(obs), what may be the corresponding ideal value of p(esp), or; b) if we study samples of n in diviuals and expect a certain type with a frequency p(esp) what may be the extreme limits of p(obs) in individual farmlies ? I.) If we are dealing with values between 0,1 and 0,9 we may use table 3. To solve the first question we select the respective horizontal line for p(obs) and determine which column corresponds to our value of n and find the respective value of p(esp) by interpolating between columns. In order to solve the second problem we start with the respective column for p(esp) and find the horizontal line for the given value of n either diretly or by approximation and by interpolation. 2) For frequencies smaller than 0,1 we have to use table 4 and transform the fractions p(esp) and p(obs) in numbers of Poisson series by multiplication with n. Tn order to solve the first broblem, we verify in which line the lower Poisson limit is equal to m(obs) and transform the corresponding value of m into frequecy p(esp) by dividing through n. The observed frequency may thus be a chance deviate of any value between 0,0... and the values given by dividing the value of m in the table by n. In the second case we transform first the expectation p(esp) into a value of m and procure in the horizontal line, corresponding to m(esp) the extreme values om m which than must be transformed, by dividing through n into values of p(obs). F) Partial and progressive tests may be recomended in all cases where there is lack of material or where the loss of time is less importent than the cost of large scale experiments since in many cases the minimun number necessary to garantee the results within the limits of precision is rather large. One should not forget that the minimun number really represents at the same time a maximun number, necessary only if one takes into consideration essentially the disfavorable variations, but smaller numbers may frequently already satisfactory results. For instance, by definition, we know that a frequecy of p means that we expect one individual in every total o(f1-p). If there were no chance variations, this number (1- p) will be suficient. and if there were favorable variations a smaller number still may yield one individual of the desired type. r.nus trusting to luck, one may start the experiment with numbers, smaller than the minimun calculated according to the formulas given above, and increase the total untill the desired result is obtained and this may well b ebefore the "minimum number" is reached. Some concrete examples of this partial or progressive procedure are given from our genetical experiments with maize.

Biologia da Arsenura xanthopus (Walker, 1855) ( Lepidoptera - Adelocephalidae ), praga do «Açoita-Cavalo» (Luehea spp.) e notas sôbre seus inimigos naturais

Biology of Arsenura xanthopus (Walker, 1855) (Lep., Adelocephalidae), a pest of Luehea spp. (Tiliaceae), and notes on its natural enemies. In the beginning of 1950, one of the Authors made some observations about the biology of Arsenura xanthopus (Walker), in Piracicaba, State of S. Paulo, Brazil. From 1951 to 1953, both Authors continued the observations on such an important Adelocephalidae, the caterpillars of which represent a serious pest of Luehea spp. leaves. Actually, in some occasions, the caterpillars can destroy completely the leaves of the trees. The species is efficientely controlled by two natural enemies: an egg parasite (Tetrastichus sp., Hym., Eulophidae) and a fly attacking the last instar caterpillar (Winthemia tricolor (van der Wulp), Dip., Tachinidae). Tetrastichus sp. can destroy 100% of the eggs and the fly, 70 to 100% of the caterpillars. Indeed, facts as such are very interesting because we rarely know of a case of so complete a control of a pest by an insect. A. xanthopus had not yet been mentioned in our literature. Actually neither the systematic bibliography nor the economic one has treated of this species. However, a few other species of Arsenura are already known as living on Luehea spp. According to the Authors' observations, W. tricolor was also unknown by the Brazilian entomological literature. Arsenura xanthopus (Walker, 1855) After giving the sinonimy and a few historical data concerning the species, and its geographical distribution, the Authors discuss its placing in the genus Arsenura Duncan or Rhescyntis Huebner, finishing by considering Arsenura xanthopus as a valid name. The Authors put the species in the family Adelocephalidae, as it has been made by several entomologists. The host plant The species of Tiliaceae plants belonging to the genus Luehea are called "açoita-cavalo" and are well known for the usefulness of their largely utilized wood. The genus comprises exclusively American plants, including about 25 species distributed throughout the Latin America. Luehea divaricata Mart, is the best known species and the most commonly cultivated. Biology of Arsenura xanthopus Our observations show that the species passes by 6 larval stages. Eggs and egg-postures, all the 6 instars of the caterpillars as well as the chrysalid are described. The pupal period is the longest of the cycle, taking from 146 to 256 days. Data on the eclosion and habits of the caterpillars are also presented. A redescription of the adult is also given. Our specimens agreed with BOUVIER's description, except in the dimension between the extremities of the extended wings, which is a little shorter (107 mm according to BOUVlErVs paper against from 80 to 100mm in our individuals). Winthemia tricolor (van der Wulp, 1890) Historical data, geographical distribution and host are first related. W. tricolor had as yet a single known host-; Ar^-senura armida (Cramer). This chapter also contains some observations on the biolcn gy of the fly and on its behaviour when trying to lay eggs on the caterpillars' skin. The female of W. tricolor lays from 1 to 33 eggs on the skin of the last instar caterpillar. The mam region of the body where the eggs are laid are the membranous legs. Eggs are also very numerous oh the ventral surface of the thorax and abdomen. The. preference for such regions is easily cleared up considering the position assumed by the caterpillar when fixed motionless in a branch. In such an occasion, the fly approaches, the victim, puts the ovipositor out and lays the eggs on different parts of the body, mainly on the mentioned regions, which are much more easily reached. The eggs of the fly are firmly attached to the host's skin, being almost impossible to detach them, without having them broken. The minute larvae of the fly enter the body of, the host when it transforms into chrysalid. Chrysalids recentely formed and collected in nature f requentely show a few small larvae walking on its skin and looking for an adequate place to get into the body. A few larvae die by remaining in the skin of the caterpillar which is pushed away to some distance by the active movements of the chrysalid recentely formed. From 1 to 10 larvae completely grown may emerge from the attacked chrysalid about 8 days after their penetrating into the caterpillars' body and soon begin to look for an adequate substratum where they can transform themselves into pupae. In natural conditions, the metamorphosis occurs in the soil. The flies appear within 15 days. Tetrastichus sp. This microhymenoptera is economically the most interesting parasite, being commonly able to destroy the whole pos^ ture of the moth. Indeed, some days after the beginning of the infestation of the trees, it is almost impossible to obtain postures completely free of parasites. The active wasp introduces the ovipositor into the egg of the moth, laying its egg inside, from 80 to 120 seconds after having introduced it. A single adult wasp emerges from each egg. Sarcophaga lambens Wiedemann, 1830 During the observations carried out, the Authors obtained 10 flies from a chysalid that were recognized as belonging to the species above. S. lambens is a widely distributed Sarcophagidae, having a long list of hosts. It is commonly obtained from weak or died invertebrates, having no importance as one of their natural enemies. Sinonimy, list of hosts and distribution are presented in this paper. Control of Arsenura xanthopus A test has been carefully made in the laboratory just to find out the best insecticide for controlling A. xanthopus caterpillars. Four different products were experimented (DDT, Pa-rathion, BHC and Fenatox), the best results having been obtained with DDT at 0,25%. However, the Authors believe in spite of the initial damages of the trees, that the application of an insecticide may be harmful by destroying the natural agents of control. A biological desiquilibrium may in this way take place. The introduction of the parasites studied (Tetrastichus sp. and Winthemia tricolor) seems to be the most desirable measure to fight A. xanthopus.

Efficiency Comparison of DFT/IDFT Algorithms by Evaluating Diverse Hardware Implementations

In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniques for maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables, and an approach for performing parallel addition of N input symbols.

Efficiency Comparison of DFT/IDFT Algorithms by Evaluating Diverse Hardware : Implementations,Parallelization Prospectsand Possible Improvements

In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniquesfor maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables,and an approach for performing parallel addition of N input symbols.

Bounding right-arm rotation distances

Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each restricted rotation distance to the word length of elements of Thompson's group F with respect to different generating sets, including both finite and infinite generating sets.

The 2004 election in Spain: terrorism, accountability, and voting

In this paper the electoral consequences of the Islamist terrorist attacks on March 11, 2004 are analysed. According to a quantitative analysis based on a post-electoral survey, we show the causal mechanisms that transform voters’ reactions to the bombings into a particular electoral behaviour and estimate their relevance in the electoral results on March 14, 2004

La Phoronomia (1716) de Jacob Hermann (1678 -1733): entre la filosofía natural y la mecánica analítica

La "Phoronomia", primer libro de mecánica escrito tras los "Principia", es representativo del proceso de transición que transformó la dinámica a principios del XVIII y que concluye con la "Mecánica" de Euler (1736). Está escrita en estilo geométrico y algebraico, y mezcla los conceptos y métodos de Leibniz y Newton de forma idiosincrásica. En esta obra se encuentra por primera vez la segunda ley de Newton escrita en la forma en que hoy la conocemos, así como un intento de construcción de la estática y la dinámica de sólidos y fluidos basado en reglas generales diferenciales.

BOI 2.0: disseny d'una implementació de JPEG 2000

JPEG 2000 és un estàndard de compressió d'imatges que utilitza tècniques estat de l’art basades en la transformada wavelet. Els principals avantatges són la millor compressió, la possibilitat d’operar amb dades comprimides i que es pot comprimir amb i sense pèrdua amb el mateix mètode. BOI és la implementació de JPEG 2000 del Grup de Compressió Interactiva d’Imatges del departament d’Enginyeria de la Informació i les Comunicacions, pensada per entendre, criticar i millorar les tecnologies de JPEG 2000. La nova versió intenta arribar a tots els extrems de l’estàndard on la versió anterior no va arribar.

Stem Cell Transplantation for Retinal Degenerations

Within the last few years, several reports have revealed that cell transplantation can be an effective way to replace lost neurons in the central nervous system (CNS) of patients affected with neurodegenerative diseases. Concerning the retina, the concept that newborn photoreceptors can integrate the retina and restore some visual functions was univocally demonstrated recently in the mouse eye (MacLaren et al. 2006) and remains to be achieved in human. These results pave the way to a standard approach in regenerative medicine aiming to replace lost photoreceptors. With the discovery of stem cells a great hope has appeared towards elaborating protocols to generate adequate cells to restore visual function in different retinal degeneration processes. Retinal stem cells (RSCs) are good candidates to repair the retina and are present throughout the retina development, including adulthood. However, neonatal mouse RSCs derived from the radial glia population have a different potential to proliferate and differentiate in comparison to adult RSCs. Moreover, we observed that adult mouse RSCs, depending on the culture conditions, have a marked tendency to transform, whereas neonatal RSCs show subtle chromosome abnormalities only after extensive expansion. These characteristics should help to identify the optimal cell source and culture conditions for cell transplantation studies. These results will be discussed in light of other studies using RSCs as well as embryonic stem cells. Another important factor to consider is the host environment, which plays a crucial role for cell integration and which was poorly studied in the normal and the diseased retina. Nonetheless, important results were recently generated to reconsider cell transplantation strategy. Perspectives to enhance cell integration by manipulating the environment will also be presented.

New FFT/IFFT Factorizations with Regular Interconnection Pattern Stage-to-Stage Subblocks

Les factoritzacions de la FFT (Fast Fourier Transform) que presenten un patró d’interconnexió regular entre factors o etapes son conegudes com algorismes paral·lels, o algorismes de Pease, ja que foren originalment proposats per Pease. En aquesta contribució s’han desenvolupat noves factoritzacions amb blocs que presenten el patró d’interconnexió regular de Pease. S’ha mostrat com aquests blocs poden ser obtinguts a una escala prèviament seleccionada. Les noves factoritzacions per ambdues FFT i IFFT (Inverse FFT) tenen dues classes de factors: uns pocs factors del tipus Cooley-Tukey i els nous factors que proporcionen la mateix patró d’interconnexió de Pease en blocs. Per a una factorització donada, els blocs comparteixen dimensions, el patró d’interconnexió etapa a etapa i a més cada un d’ells pot ser calculat independentment dels altres.

Identification of a novel determinant for membrane association in hepatitis C virus nonstructural protein 4B.

Nonstructural protein 4B (NS4B) plays an essential role in the formation of the hepatitis C virus (HCV) replication complex. It is a relatively poorly characterized integral membrane protein predicted to comprise four transmembrane segments in its central portion. Here, we describe a novel determinant for membrane association represented by amino acids (aa) 40 to 69 in the N-terminal portion of NS4B. This segment was sufficient to target and tightly anchor the green fluorescent protein to cellular membranes, as assessed by fluorescence microscopy as well as membrane extraction and flotation analyses. Circular dichroism and nuclear magnetic resonance structural analyses showed that this segment comprises an amphipathic alpha-helix extending from aa 42 to 66. Attenuated total reflection infrared spectroscopy and glycosylation acceptor site tagging revealed that this amphipathic alpha-helix has the potential to traverse the phospholipid bilayer as a transmembrane segment, likely upon oligomerization. Alanine substitution of the fully conserved aromatic residues on the hydrophobic helix side abrogated membrane association of the segment comprising aa 40 to 69 and disrupted the formation of a functional replication complex. These results provide the first atomic resolution structure of an essential membrane-associated determinant of HCV NS4B.

Detector de contorns basat en el domini transformat

RESUM En aquest document es presenta un detector de contorns d’imatges basat en el domini transformat. A partir de la interpretació de la transformada de Fourier de la imatge i la seva formulació matricial en termes dels diferents modes, es realitza una selecció de les components passa baixes a partir de les quals es reconstrueix la component de baixa freqüència que es resta de la imatge original per tal d’obtenir el detector. Aquest detector de contorns no és esbiaixat. L’algorisme pot ser aplicat utilitzant diferents mides del bloc de processament, que pot anar de la imatge sencera a blocs de reduïdes dimensions: 36X36, 16x16 o 8x8, per fer un seguiment de les propietats locals de la imatge quan aquesta és presenta característiques espacials poc uniformes.

Representació no-lineal de les imatges per a codificació perceptiva

JPEG2000 és un estàndard de compressió d’imatges que utilitza la transformada wavelet i, posteriorment, una quantificació uniforme dels coeficients amb dead-zone. Els coeficients wavelet presenten certes dependències tant estadístiques com visuals. Les dependències estadístiques es tenen en compte a l'esquema JPEG2000, no obstant, no passa el mateix amb les dependències visuals. En aquest treball, es pretén trobar una representació més adaptada al sistema visual que la que proporciona JPEG2000 directament. Per trobar-la utilitzarem la normalització divisiva dels coeficients, tècnica que ja ha demostrat resultats tant en decorrelació estadística de coeficients com perceptiva. Idealment, el que es voldria fer és reconvertir els coeficients a un espai de valors en els quals un valor més elevat dels coeficients impliqui un valor més elevat d'aportació visual, i utilitzar aquest espai de valors per a codificar. A la pràctica, però, volem que el nostre sistema de codificació estigui integrat a un estàndard. És per això que utilitzarem JPEG2000, estàndard de la ITU que permet una elecció de les distorsions en la codificació, i utilitzarem la distorsió en el domini de coeficients normalitzats com a mesura de distorsió per a escollir quines dades s'envien abans.

15

Developing a predictive understanding of subsurface flow and transport is complicated by the disparity of scales across which controlling hydrological properties and processes span. Conventional techniques for characterizing hydrogeological properties (such as pumping, slug, and flowmeter tests) typically rely on borehole access to the subsurface. Because their spatial extent is commonly limited to the vicinity near the wellbores, these methods often cannot provide sufficient information to describe key controls on subsurface flow and transport. The field of hydrogeophysics has evolved in recent years to explore the potential that geophysical methods hold for improving the quantification of subsurface properties and processes relevant for hydrological investigations. This chapter is intended to familiarize hydrogeologists and water-resource professionals with the state of the art as well as existing challenges associated with hydrogeophysics. We provide a review of the key components of hydrogeophysical studies, which include: geophysical methods commonly used for shallow subsurface characterization; petrophysical relationships used to link the geophysical properties to hydrological properties and state variables; and estimation or inversion methods used to integrate hydrological and geophysical measurements in a consistent manner. We demonstrate the use of these different geophysical methods, petrophysical relationships, and estimation approaches through several field-scale case studies. Among other applications, the case studies illustrate the use of hydrogeophysical approaches to quantify subsurface architecture that influence flow (such as hydrostratigraphy and preferential pathways); delineate anomalous subsurface fluid bodies (such as contaminant plumes); monitor hydrological processes (such as infiltration, freshwater-seawater interface dynamics, and flow through fractures); and estimate hydrological properties (such as hydraulic conductivity) and state variables (such as water content). The case studies have been chosen to illustrate how hydrogeophysical approaches can yield insights about complex subsurface hydrological processes, provide input that improves flow and transport predictions, and provide quantitative information over field-relevant spatial scales. The chapter concludes by describing existing hydrogeophysical challenges and associated research needs. In particular, we identify the area of quantitative watershed hydrogeophysics as a frontier area, where significant effort is required to advance the estimation of hydrological properties and processes (and their uncertainties) over spatial scales relevant to the management of water resources and contaminants.