Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are widely used in the development of algorithms that execute directly on compressed structures (without prior decompression). It is shown that every linear straight-line context-free tree grammar can be transformed in polynomial tim...

0

A parametric conversion of speech individuality is proposed based on STRAIGHT speech representation. STRAIGHT speech analysis-synthesis can produce high quality speech for various kinds of transformations by using 1) pitch synchronous windowing, 2) time-frequency spectrum interpolating and 3) randomized all-pass filtering for shaping phase spectrum. In order to utilize the smoothness of STRAIGH...

a practical application of the spherical involute surface to the forged straight bevel gears is provided and demonstrated in this work. conjugate (pure involute) theoretical surfaces are developed from the input design parameters. the surfaces are modified to suit the actual application (automotive differential). the unloaded (or low load) tooth contact analysis of modified surfaces is performe...