#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1997

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Douglas A. Cenzer, S. Ali Dashti, Jonathan L. F. King
- Electr. Notes Theor. Comput. Sci.
- 2008

- D H Dimitrov, S A Dashti, +4 authors M K Estes
- Journal of medical virology
- 1997

Baculovirus recombinant-expressed antigens of Norwalk viruses (rNV) and a Mexico strain (rMX) of the Snow Mountain serogroup of human caliciviruses (HuCVs) were used in enzyme immunoassays to study the antibody prevalence among the Kuwaiti population and foreign workers employed in Kuwait. The antibody titers in 16 different age groups which ranged from… (More)

- Salman K Al-Sabah, Sulaiman M Almazeedi, Shaimaa A Dashti, Ahmed Y Al-Mulla, Daliya AlMohammad Ali, Talib H Jumaa
- Obesity surgery
- 2015

BACKGROUND
Laparoscopic sleeve gastrectomy (SG) is becoming a popular and preferred primary bariatric intervention; however, its applicability in the adolescent age group remains controversial. The aim of this study is to evaluate the efficacy of SG in treating obesity and its co-morbidities among adolescents.
METHODS
A retrospective study was conducted… (More)

- Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman
- Theory of Computing Systems
- 2011

We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor–Bendixson rank two contain only eventually periodic elements. Any rank two subshift in 2ℤ is decidable. Subshifts of rank three may contain members of arbitrary Turing degree. In contrast, effectively closed ( $\Pi^{0}_{1}$ ) subshifts of rank… (More)

- Douglas A. Cenzer, S. Ali Dashti, Jonathan L. F. King
- Math. Log. Q.
- 2008

We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Π1 class P is a subshift if and only if there is a computable function F mapping 2N to 2N such that P is the set of itineraries of elements of 2N. Π1 subshifts are constructed in 2N and in 2Z which have no computable elements. We also… (More)

The computability of countable subshifts and their members is examined. Results include the following. Subshifts of CantorBendixson rank one contain only eventually periodic elements. Any rank one subshift, in which every limit point is periodic, is decidable. Subshifts of rank two may contain members of arbitrary Turing degree. In contrast, effectively… (More)

- ‹
- 1
- ›