Eugene Braunwald,∗ Dominick Angiolillo,† Eric Bates,‡ Peter B. Berger,§ Deepak Bhatt,|| Christopher P. Cannon,∗ Mark I. Furman,¶ Paul Gurbel,∗∗ Alan D. Michelson,†† Eric Peterson,‡‡ Stephen Wiviott∗ ∗TIMI Study Group, Cardiovascular Division, Brigham and Women’s Hospital, Department of Medicine, Harvard Medical School, Boston, Massachusetts; †Department of Internal Medicine, University of Flori...

This study explains the phenomenon of living qur'an practiced by Tebuwung Society in Dukun, Gresik, East Java, regarding meaning surah Yusuf and Maryam tingkepantradition. The Qur'anic this pregnancy ritual is a form Qur'an's content that surrounds local community's life. Based on qualitative research with phenomenological approach, while data were obtained through in-depth interviews, observat...

Dynoides elegans (Boone, 1923) from southern California is reviewed, redescribed, and figured. The original species description did not include figures, making it difficult to attribute individuals to the species. Dynoides saldanai Carvacho and Haasmann, 1984 and Dynoides crenulatus Carvacho & Haasman, 1984 from the Pacific Coast of Mexico and Dynoides brevicornis Kussakin & Malyutina, 1987, fr...

This study intends to identify the establishment of Islamic social construction in Shi’a community Pekalongan City. Qualitative research applied this gathered from case studies using a phenomenological approach. Data came in-depth observation, interviews, and documentation. The theory formulated by Peter L. Berger Thomas Luckmann became basic analysis. results showed that Islam City was formed ...

This paper presents a new method for designing totally self-checking (TSC) Berger code checkers for any number k of information bits, even for k"2r~1, taking into account realistic faults as stuck-at, transistor stuck-open, transistor stuck-on and resistive bridging faults. Doubleas well as single-output TSC checkers are given. The proposed single-output TSC Berger code checkers are the "rst in...

q–ary codes capable of correcting all unidirectional errors of certain level 1 ≤ l ≤ q − 2 are considered. We also discuss some related extremal combinatorial problems.

We give efficient constructions for error correcting unordered {ECU) codes, i.e., codes such that any pair of codewords are at a certain minimal distance apart and at the same time they are unordered. These codes are used for detecting a predetermined number of (symmetric) errors and for detecting all unidirectional errors. We also give an application in parallel asynchronous communications.