Early carboniferous brachiopod faunas from the Baoshan block, west Yunnan, southwest China

38 brachiopod species in 27 genera and subgenera are described from the Yudong Formation in the Shidian-Baoshan area, west Yunnan, southwest China. New taxa include two new subgenera: Unispirifer (Septimispirifer) and Brachythyrina (Longathyrina), and seven new species: Eomarginifera yunnanensis, Marginatia cylindrica, Unispirifer (Unispirifer) xiangshanensis, Unispirifer (Septimispirifer) wafangjieensis, Brachythyrina (Brachythyrina) transversa, Brachythyrina (Longathyrina) baoshanensis, and Girtyella wafangjieensis. Based on the described material and constraints from associated coral and conodont faunas, the age of the brachiopod fauna from the Yudon Formation is considered late Tournaisian (Early Carboniferous), with a possibility extending into earlyViseacutean.<br /

Computation of the flow in a cascade of high stagger transonic tip sections

SIGLEAvailable from British Library Lending Division - LD:3106.129(TPRD/M--1418/N84) / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Deriving parallel codes via invariants

Systematic parallelization of sequential programs remains a major challenge in parallel computing. Traditional approaches using program schemestendtobenarrower in scope, as the properties which enable parallelism are difficult to capture via ad-hoc schemes. In [CTH98], a systematic approach to parallelization based on the notion of preserving the context of recursive sub-terms has been proposed. This approach can be used to derive a class of divide-and-conquer algorithms. In this paper, we enhance the methodology by using invariants to guide the parallelization process. The enhancement enables the parallelization of a class of recursive functions with conditional and tupled constructs, which were not possible previously. We further show how such invariants can be discovered and veri ed systematically, and demonstrate the power of our methodology by deriving a parallel code for maximum segment product. To the best of our knowledge, this is the first systematic parallelization for the maximum segment product problem