The last normal curve programs
نویسندگان
چکیده
منابع مشابه
Interpretations of the Curve of Normal Growth.
2 W. J. Crozier, J. Gen. Physiol., 10: 53, 1926. 3 C. S. Minot, "Age, Growth and Death," G. P. Putnam 's Sons, New York, 1908. 4 C. M. Child, " Senescence and Rejuvenescence," University of Chicago Press, 1915. 5 Sewall Wright, J. Amer. Statis. Assoc., 21: 493, 1926. was found by Davidson6 to give a good fit to growth in weight W of dairy cattle. Equation (3) was applied by Weymouth7 with excel...
متن کاملDisjunctive Logic Programs versus Normal Logic Programs
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is proposed and then proved to be sound over infinite structures. The equivalence of expressive power of two kinds of logic programs over arbitrary structures ...
متن کاملDual-normal logic programs - the forgotten class
Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of po...
متن کاملThe Unicorn, The Normal Curve, and Other Improbable Creatures
An investigation of the distributional characteristics of 440 large-sample achievement and psychometric measures found all to be significantly nonnormal at the alpha .01 significance level. Several classes of contamination were found, including tail weights from the uniform to the double exponential, exponential-level asymmetry, severe digit preferences, multimodalities, and modes external to t...
متن کاملNormal based subdivision scheme for curve design
In this paper we propose a new kind of nonlinear and geometry driven subdivision scheme for curve interpolation. Instead of using linear combination of old vertexes, displacement vector for every new vertex is given by normal vectors at old vertexes. The normal vectors are computed adaptively for each time of subdivision, and the limit curve is G1 smooth with wide ranges of free parameters. Wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods, Instruments, & Computers
سال: 1987
ISSN: 0743-3808,1532-5970
DOI: 10.3758/bf03202572