نتایج جستجو برای: generating families
تعداد نتایج: 227496 فیلتر نتایج به سال:
In August 1996, Congress and the president replaced the 60-year-old Aid to Families with Dependent Children (AFDC) program with a block grant, Temporary Assistance to Needy Families (TANF), permitting states to experiment with new forms of assistance to low-income families. States seem likely to try increasingly ambitious reforms as they gain experience under their TANF flexibility, at least if...
This article describes a topological approach to generating families of open- and closed-loop walking gaits for underactuated 2-D 3-D biped walkers subject configuration inequality constraints, physical holonomic constraints (e.g., linkages), virtual (user-defined enforced through feedback control). Our method constructs implicitly defined manifolds feasible periodic within state-time-control s...
The aim of this paper is to construct general forms ordinary generating functions for special numbers and polynomials involving Fibonacci type polynomials, Lucas Chebyshev Sextet Humbert-type chain anti-chain rank the lattices, length any alphabet words, partitions, other graph polynomials. By applying Euler transform Lambert series these functions, many new identities relations are derived. us...
we find an explicit expression of the tutte polynomial of an $n$-fan. we also find a formula of the tutte polynomial of an $n$-wheel in terms of the tutte polynomial of $n$-fans. finally, we give an alternative expression of the tutte polynomial of an $n$-wheel and then prove the explicit formula for the tutte polynomial of an $n$-wheel.
BACKGROUND The purpose of this study was to understand the strategies employed by families that adopt Acquired Immune Deficiency Syndrome (AIDS)-orphaned children (Adoptive families) for coping with and mitigating the impact of AIDS in Mbeya Rural District, Tanzania. High numbers of AIDS-orphaned children aged below 18 years in Mbeya Region have led to increasing the burden of families caring f...
There are two complementary ways to evaluate planning algorithms: performance on benchmark problems derived from real applications and analysis of performance on parametrized families of problems with known properties. Prior to this work, few means of generating parametrized families of hard planning problems were known. We generate hard planning problems from the solvable/unsolvable phase tran...
A prime number sieve is an algorithm that nds the primes up to a bound n. We present four new prime number sieves. Each of these sieves gives new space complexity bounds for certain ranges of running times. In particular, we give a linear time sieve that uses only O(p n=(log log n) 2) bits of space, an O l (n= log log n) time sieve that uses O(n=((log n) l log log n)) bits of space, where l > 1...
A system for transferring vocal expressions separately from singing voices with accompaniment to singing voice synthesizers is described. The expressions appear as fluctuations in the fundamental frequency contour of the singing voice, such as vibrato, glissando, and kobushi. The fundamental frequency contour of the singing voice is estimated using the subharmonic summation in a limited frequen...
In this paper we present two different approaches to the modeling of the singing voice. Each of these approaches has been thought to fit in the specific requirements of two applications. These are an automatic voice impersonator for karaoke systems and a singing voice synthesizer.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید