Let k ≥ 2 be an integer. For fixed N , we consider a set A of non-negative integers such that for all integer n ≤ N , n can be written as n = a + b, a ∈ A , b a positive integer. We are interested in a lower bound for the number of elements of A . Improving a result of Balasubramanian [1], we prove the following theorem: Theorem 1. |AN | ≥ N1− 1 k { 1 Γ(2− 1 k )Γ(1 + 1 k ) + o(1) } . 1. STATMEN...

This article contains a description of rules controlling the singing synthesis at the Department of Speech Communication and Music Acoustics at the Royal Institute of Technology (KTH) in Stockholm. In our research, synthesis of singing has played an important part for a long period of time. The rules controlling the singing synthesiser MUSSE DIG are implemented in a programming environment orig...

flowers, gay curtains hide the marks on the windowsills where the bars used to be. I climb the stairs and go along the endless corridors with the cell-like bedrooms on one side and the open ward on the other. More visitors today, wives are going home for Bank Holiday and husbands have brought suitcases... Grandma holds up a baby to his mother: 'Hasn't he grown! You'll be home soon, Jean shuffle...