RESUMO Objetivo Testar a variável da hereditariedade familiar para gagueira crônica do desenvolvimento (GCD) como preditora de efeito direto no desfecho fluência fala em crianças. Métodos Participaram estudo 200 crianças, 2 12 anos, ambos os gêneros, sem distinção raça e nível sócio-econômico-cultural, que apresentaram queixa GCD, outras intercorrências linguagem e/ou audição, período cinco ano...

Fast generation of a large prime is important to enhance security. However, primality test of prime generation takes long time. Therefore, primality tests are combined to speed up. A combination of trial division and Miller-Rabin test (TD combined test hereafter) is the most popular combination. GCD operation and Miller-Rabin test combination (GCD combined test hereafter) is also popular and ea...

Granule cell dispersion (GCD) in the dentate gyrus is a frequent feature of Ammon's horn sclerosis (AHS) which is often associated with temporal lobe epilepsy (TLE). It has been hypothesized that GCD may be caused by an abnormal migration of newly born granule cells. To test this hypothesis, we used markers of proliferation and neurogenesis and immunocytochemical methods as well as quantitative...

The computation of the greatest common divisor (GCD) of a set of polynomials has interested the mathematicians for a long time and has attracted a lot of attention in recent years. A challenging problem that arises from several applications, such as control or image and signal processing, is to develop a numerical GCD method that inherently has the potential to work efficiently with sets of sev...

We present the FPGA implementation of an extension of the binary plus–minus systolic algorithm which computes the GCD (greatest common divisor) and also the normal form of a rational number, without using division. A sample array for 8 bit operands consumes 83.4% of an Atmel 40K10 chip and operates at 25 MHz.

In this article, we prove the existence and uniqueness of a certain distribution function on the unit interval. This distribution appears in Brent's model of the analysis of the binary gcd algorithm. The existence and uniqueness of such a function has been conjectured by Richard Brent in his original paper [1]. Donald Knuth also supposes its existence in [5] where developments of its properties...

BACKGROUND Mutation of the human transforming growth factor beta-induced (TGFBI) gene causes granular corneal dystrophy (GCD) in various ethnic groups. In this report, we identify the genetic defect on the TGFBI gene in a Vietnamese family with atypical GCD . CASES The patient and her relatives were examined clinically. Genomic DNA was extracted from blood leukocytes. Fifty normal Vietnamese ...

We investigate weighted gcd-sum functions, including the alternating gcd-sum function and those having as weights the binomial coefficients and values of the Gamma function. We also consider the alternating lcm-sum function.

We describe algorithms for computing the greatest common divisor (GCD) of two univariate polynomials with inexactly-known coeecients. Assuming that an estimate for the GCD degree is available (e.g., using an SVD-based algorithm), we formulate and solve a nonlinear optimization problem in order to determine the coeecients of the \best" GCD. We discuss various issues related to the implementation...