... and open treatment for nonatherosclerotic renal artery disease (NARAD).Retrospective review.Academic institution.Fifty-five patients (47 women; mean age, 40 years) with NARAD. Underlying disease included Takayasu arteritis in 31 and ... and 78%, respectively.Endovascular and open management of NARAD confers long-term benefit for blood pressure, renal ... management and provides the most durable outcome for NARAD.
Tópico(s): Peripheral Artery Disease Management
2010 - American Medical Association | Archives of Surgery
... receive intervention (Glennen, 2007; Glennen& Masters, 2002; Mason &Narad, 2005), a rate higher than the incidence of ... 35(2),165–188. CrossrefGoogle Scholar Mason P., & Narad C. (2005). International adoption: A health and developmental ...
Tópico(s): Child Development and Digital Technology
2008 - American Speech–Language–Hearing Association | ASHA Leader
F. Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox,
... Grant No. DMS–1060775. James D. Currie and Narad Rampersad’s research was supported by NSERC Discovery ...
Tópico(s): graph theory and CDMA systems
2014 - De Gruyter | Integers
Andrew Yaeger, Fred A. Weaver, Karen Woo,
... a rare case of nonatherosclerotic renal artery disease (NARAD) in a patient with Erdheim–Chester disease (ECD), ... term graft patency demonstrated in other forms of NARAD. Nine months postoperatively, the patient's hypertension was ... bilateral renal artery bypasses. Revascularization in patients with NARAD, such as ECD, should be managed in an ...
Tópico(s): Vasculitis and related conditions
2014 - Elsevier BV | Annals of Vascular Surgery
James D. Currie, Narad Rampersad,
We extend Carpi’s results by showing that Dejean’s conjecture holds for n≥30.
Tópico(s): Analytic Number Theory Research
2009 - Elsevier BV | Theoretical Computer Science
Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit,
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we characterize the languages accepted. Finally, we discuss some state complexity problems involving such automata.
Tópico(s): Formal Methods in Verification
2009 - Elsevier BV | Theoretical Computer Science
Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey Shallit,
Let the words of a language L be arranged in increasing radix order: L={w0,w1,w2,…}. We consider transformations that extract terms from L in an arithmetic progression. For example, two such transformations are even(L)={w0,w2,w4…} and odd(L)={w1,w3,w5,…}. Lecomte and Rigo observed that if L is regular, then so are even(L), odd(L), and analogous transformations of L. We find good upper and lower bounds on the state complexity of this transformation. We also give an example of a context-free language ...
Tópico(s): DNA and Biological Computing
2009 - Elsevier BV | Theoretical Computer Science
Jean‐Paul Allouche, Narad Rampersad, Jeffrey Shallit,
We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately periodic. We prove that it is decidable whether a given k-automatic sequence is overlap-free (or squarefree, or cubefree, etc.). We prove that the lexicographically least sequence in the orbit closure of a k-automatic sequence is k-automatic, and use this last result ...
Tópico(s): Algorithms and Data Compression
2009 - Elsevier BV | Theoretical Computer Science
Terry Anderson, John A. Loftus, Narad Rampersad, Nicolae Sântean, Jeffrey Shallit,
Given a language L and a non-deterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider how long a shortest word can be. The languages L that we examine include the palindromes, the non-palindromes, the k-powers, the non-k-powers, the powers, the non-powers (also called primitive words), the words matching a general pattern, the bordered ...
Tópico(s): Coding theory and cryptography
2009 - Elsevier BV | Information and Computation
Bradley S. Miller, MariaG Kroupina, Sandra Iverson, Patrick Mason, Christine Narad, John H. Himes, Dana E. Johnson, Anna Petryk,
Article Auxological Evaluation and Determinants of Growth Failure at the Time of Adoption in Eastern European Adoptees was published on January 1, 2009 in the journal Journal of Pediatric Endocrinology and Metabolism (volume 22, issue 1).
Tópico(s): Folate and B Vitamins Research
2009 - De Gruyter | Journal of Pediatric Endocrinology and Metabolism
James D. Currie, Narad Rampersad,
We show that Dejean's conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible.
Tópico(s): Meromorphic and Entire Functions
2009 - EDP Sciences | RAIRO - Theoretical Informatics and Applications
Paweł Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit,
Tópico(s): Algorithms and Data Compression
2008 - Springer Science+Business Media | Lecture notes in computer science
James D. Currie, Narad Rampersad,
We prove the non-existence of recurrent words with constant Abelian complexity containing four or more distinct letters. This answers a question of Richomme et al.
Tópico(s): DNA and Biological Computing
2010 - Elsevier BV | Advances in Applied Mathematics
Bradley S. Miller, Maria Kroupina, Patrick Mason, Sandra Iverson, Christine Narad, John H. Himes, Dana E. Johnson, Anna Petryk,
Children raised in orphanages frequently experience growth suppression due to multiple risk factors. Placing such children in more nurturing environments through adoption leads to significant catch-up growth (CUG), the determinants of which are not entirely understood. The goal of this study was to perform an auxological evaluation and examine the degree and correlates of CUG in international adoptees. Children adopted from Eastern Europe, ( , 71 males), 7 to 59 months of age, were recruited within 3 ...
Tópico(s): Child Welfare and Adoption
2010 - Springer Science+Business Media | International Journal of Pediatric Endocrinology
BradleyS Miller, MariaG Kroupina, Patrick Mason, SandraL Iverson, Christine Narad, JohnH Himes, D. E. Johnson, Anna Petryk,
Children raised in orphanages frequently experience growth suppression due to multiple risk factors.Placing such children in more nurturing environments through adoption leads to significant catch-up growth (CUG), the determinants of which are not entirely understood.The goal of this study was to perform an auxological evaluation and examine the degree and correlates of CUG in international adoptees.Children adopted from Eastern Europe, (n = 148, 71 males), 7 to 59 months of age, were recruited within ...
Tópico(s): Demographic Trends and Gender Preferences
2010 - Springer Science+Business Media | International Journal of Pediatric Endocrinology
Paweł Gawrychowski, Dalia Krieger, Narad Rampersad, JEFFREY SHALLIT,
We give an O(n + t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. Given an NFA accepting a language of polynomial growth, we can also determine the order of polynomial growth in O(n+t) time. We also give polynomial time algorithms to solve these problems for context-free grammars.
Tópico(s): DNA and Biological Computing
2010 - World Scientific | International Journal of Foundations of Computer Science
James D. Currie, Narad Rampersad,
We prove Dejean's conjecture. Specifically, we show that Dejean's conjecture holds for the last remaining open values of $n$, namely $15 \leq n \leq 26$.
Tópico(s): Meromorphic and Entire Functions
2010 - American Mathematical Society | Mathematics of Computation
Jeffery N. Epstein, Joshua M. Langberg, Paul J. Rosen, Amanda J. Graham, Megan E. Narad, Tanya N. Antonini, William B. Brinkman, Tanya E. Froehlich, John O. Simon, Mekibib Altaye,
The purpose of the research study was to examine the manifestation of variability in reaction times (RT) in children with attention deficit hyperactivity disorder (ADHD) and to examine whether RT variability presented differently across a variety of neuropsychological tasks, was present across the two most common ADHD subtypes, and whether it was affected by reward and event rate (ER) manipulations.Children with ADHD-combined type (n = 51), ADHD-predominantly inattentive type (n = 53), and 47 controls completed ...
Tópico(s): Neural and Behavioral Psychology Studies
2011 - American Psychological Association | Neuropsychology
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $x$ of $w$ and no non-erasing morphism $h$ from $\Delta^*$ to $\Sigma^*$ such that $h(p) = x$. Bell and Goh have recently applied an algebraic technique due to Golod to show that for a certain wide class of patterns $p$ there are exponentially many words of length $n$ over a $4$-letter alphabet that avoid $p$. We consider some further consequences of their work. In particular, ...
Tópico(s): DNA and Biological Computing
2011 - Electronic Journal of Combinatorics | The Electronic Journal of Combinatorics
Jeffery N. Epstein, William B. Brinkman, Tanya E. Froehlich, Joshua M. Langberg, Megan E. Narad, Tanya N. Antonini, Keri Shiels, John O. Simon, Mekibib Altaye,
This study examined the effects of methylphenidate (MPH) on reaction time (RT) variability in children with attention deficit hyperactivity disorder (ADHD). Using a broad battery of computerized tasks, and both conventional and ex-Gaussian indicators of RT variability, in addition to within-task manipulations of incentive and event rate (ER), this study comprehensively examined the breadth, specificity, and possible moderators of effects of MPH on RT variability. A total of 93 children with ADHD completed ...
Tópico(s): Behavioral and Psychological Studies
2011 - Springer Nature | Neuropsychopharmacology
Tópico(s): DNA and Biological Computing
2006 - Elsevier BV | Information Processing Letters
Émilie Charlier, Narad Rampersad, JEFFREY SHALLIT,
We show that various aspects of k-automatic sequences — such as having an unbordered factor of length n — are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or k-regular. These include many sequences previously studied in the literature, such as the recurrence function, the appearance function, and the repetitivity index. We also give some new characterizations of the class of k-regular sequences. Many results extend to other ...
Tópico(s): Algorithms and Data Compression
2012 - World Scientific | International Journal of Foundations of Computer Science
Narad Rampersad, Jeffrey Shallit, Zhi Xu,
In this paper we consider the computational complexity of the following problems: given a DFA or NFA representing a regular language L over a finite alphabet Σ, is the set of all prefixes (resp., suffixes, factors, subwords) of all words of L equal t
Tópico(s): DNA and Biological Computing
2012 - IOS Press | Fundamenta Informaticae
Leanne Tamm, Megan E. Narad, Tanya N. Antonini, Kathleen O’Brien, Larry W. Hawk, Jeffery N. Epstein,
For the past decade, intra-individual variability in reaction times on computerized tasks has become a central focus of cognitive research on Attention-Deficit/Hyperactivity Disorder (ADHD). Numerous studies document increased reaction time variability among children and adults with ADHD, relative to typically developing controls. However, direct comparisons with other disorders with heightened reaction time variability are virtually nonexistent, despite their potential to inform our understanding ...
Tópico(s): Neural and Behavioral Psychology Studies
2012 - Springer Science+Business Media | Neurotherapeutics
Patrick Mason, Christine Narad,
Growth delay is one of the most common and persistent findings in children who have been adopted from abroad. Although the cause is not clearly understood, it may be related to the observed phenomenon of psychosocial short stature described in children from abusive and neglectful settings in western countries. Fortunately, adopted children generally experience significant improvement in growth after joining their new family, but this may put girls at risk for early and rapidly progressing puberty. ...
Tópico(s): Reproductive Health and Technologies
2005 - Elsevier BV | Pediatric Clinics of North America
Christine Narad, Patrick Mason,
Internationally adopted children come from high risk environments that differ significantly from those of children born and raised in the United States. This can impact their developmental and parenting needs. Aware adoptive parents can do many things to lessen the effects of a highly deprived early start to life and encourage optimal development. However, preconceived ideas and myths about adoption often stand in the way of parental desires to provide the best for their newly adopted child. Pediatric ...
Tópico(s): Child and Adolescent Health
2005 - A Jannetti Publications Inc. | Pediatric nursing
Patrick Mason, Christine Narad,
Adoptions from international countries have become an option for many US families, with over 150,000 children adopted in the past 14 years. Typically, internationally adopted children present with a host of medical and developmental concerns. Issues such as growth stunting, abnormal behaviors, and significant delays in motor, speech, and language development are likely directly related to the prenatal and early postnatal environment experienced prior to adoption. The new family and its health-care ...
Tópico(s): Reproductive Health and Technologies
2005 - Thieme Medical Publishers (Germany) | Seminars in Speech and Language
Narad Rampersad, Jeffrey Shallit, Ming‐Wei Wang,
We consider three aspects of avoiding large squares in infinite binary words. First, we construct an infinite binary word avoiding both cubes xxx and squares yy with |y|⩾4; our construction is somewhat simpler than the original construction of Dekking. Second, we construct an infinite binary word avoiding all squares except 02, 12, and (01)2; our construction is somewhat simpler than the original construction of Fraenkel and Simpson. In both cases, we also show how to modify our construction to obtain ...
Tópico(s): Natural Language Processing Techniques
2005 - Elsevier BV | Theoretical Computer Science
Ali Aberkane, James D. Currie, Narad Rampersad,
We show that the number of ternary words of length n avoiding abelian cubes grows faster than r n , where r = 2 1=24 .
Tópico(s): Cellular Automata and Applications
2004 - University of Waterloo | Journal of integer sequences
Urmiladevi Narad Yadav, Preeti L. Pant, Darshana Sharma, Suban K. Sahoo, Ganapati S. Shankarling,
Tópico(s): Analytical Chemistry and Sensors
2014 - Elsevier BV | Sensors and Actuators B Chemical