Results 81 to 90 of about 166,958 (306)

A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi, Giorgio Ricciardiello Mejia, Andre Metzger, Kang Hyun Ryu, Salonee Marwaha, Eva Grzegorczyk, Li Zhou, Eliana Jacobs, Boris Gilyadov, Claudia Kunney, Liqhwa Ncube, Ankit Parekh, Emmanuel Mignot, Fanny M. Elahi, Joseph Winer, Kathleen Poston, Andreas Brink‐Kjaer, Emmanuel H. During   +17 more
wiley   +1 more source

Random trees in queueing systems with deadlines

, 1995
We survey our research on scheduling aperiodic tasks in real-time systems in order to illustrate the benefits of modelling queueing systems by means of random trees.
Schmid, U., U. Schmid
core   +1 more source

Holonomic equations and efficient random generation of binary trees [PDF]

Discrete Mathematics & Theoretical Computer Science
Holonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj   +1 more source

Degree distribution of random Apollonian network structures and Boltzmann sampling [PDF]

Discrete Mathematics & Theoretical Computer Science, 2007
Random Apollonian networks have been recently introduced for representing real graphs. In this paper we study a modified version: random Apollonian network structures (RANS), which preserve the interesting properties of real graphs and can be handled ...
Alexis Darrasse, Michèle Soria
doaj   +1 more source

Trajectories of Physical Function in Canadian Children With Juvenile Idiopathic Arthritis

Arthritis Care &Research, EarlyView.
Objective We describe trajectories of physical function in children newly diagnosed with juvenile idiopathic arthritis (JIA) and identify trajectories with persisting functional impairments and associated baseline characteristics. Methods We included patients enrolled in the Canadian Alliance of Pediatric Rheumatology Investigators (CAPRI) Registry ...
Clare Cunningham, Meghan McPherson, Lillian Lim, Roberta A. Berard, Matthew Berkowitz, Jean‐Philippe Proulx‐Gauthier, Brian M. Feldman, Nicole Johnson, Dax G. Rumsey, Heinrike Schmeling, Lori B. Tucker, Thomas Loughin, Kristin M. Houghton, Jaime Guzman, for the Canadian Alliance of Pediatric Rheumatology Investigators (CAPRI) Registry Investigators, David A. Cabral, Gaëlle Chédeville, Ciarán M. Duffy, Kerstin Gerhold, Jaime Guzman, Linda Hiraki, Adam M. Huber, Heinrike Schmeling, Natalie J. Shiff, Lori B. Tucker, Julie Barsalou, Daniah Basodan, Michelle Batthish, Roberta A. Berard, Nicholas Blanchette, Gilles Boire, Roxana Bolaria, Alessandra Bruns, David A. Cabral, Sarah Campillo, Tania Cellucci, Mercedes Chan, Gaëlle Chédeville, Amieleena Chhabra, Julie Couture, Paul Dancey, Jean‐Jacques De Bruycker, Erkan Demirkaya, Muhammed Dhalla, Ciarán M. Duffy, Talal El Tal, Tommy Gerschman, Jaime Guzman, Liane Heale, Julie Herrington, Kristin M. Houghton, Adan M. Huber, Andrea Human, Nicole Johnson, Roman Jurencak, Bianca Lang, Claire LeBlanc, Lillian Lim, Lily S. H. Lim, Nadia Luca, Jeanine McColl, Tara McGrath, Tamara McMillan, Megan McPherson, Paivi Miettunen, Kimberly Morishita, Honyan Ng, Jonathan Park, Jean‐Philippe Proulx‐Gauthier, Johannes Roth, Evelyn Rozenblyum, Dax G. Rumsey, Heinrike Schmeling, Rosie Scuccimarri, Gordon Soon, Rebeka Stevenson, Elizabeth Stringer, Herman Tam, Lori B. Tucker, Marinka Twilt, Ruud H. J. Verstegen, Karen Watanabe Duffy   +81 more
wiley   +1 more source

Parallel Quantum Rapidly-Exploring Random Trees

IEEE Access
In this paper, we present the Parallel Quantum Rapidly-Exploring Random Tree (Pq-RRT) algorithm, a parallel version of the Quantum Rapidly-Exploring Random Trees (q-RRT) algorithm.
Paul Lathrop, Beth Boardman, Sonia Martinez   +2 more
doaj   +1 more source

Associations of Lifestyle‐Related Factors and Psoriatic Arthritis Disease Activity: The Dutch South West Psoriatic Arthritis Study

Arthritis Care &Research, EarlyView.
Objective This study aims to investigate lifestyle‐related factors in patients with psoriatic arthritis (PsA) and their association with disease activity measurements. Methods This multicenter cohort included 938 patients who were newly diagnosed with PsA between 2013 and 2023.
Batoul Hojeij, Ilja Tchetverikov, Marc R. Kok, Marijn Vis, Yvonne Goekoop‐Ruiterman, Jessica Bijsterbosch, Paul Baudoin, Reinhard Bos, Jos H. van der Kaap, Petra Kok, Lindy‐Anne Korswagen, Jolanda J. Luime   +11 more
wiley   +1 more source

General Edgeworth expansions with applications to profiles of random trees [PDF]

, 2017
We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity.
Marynych, Alexander, Henning Sulzbach, Sulzbach, Henning, Zakhar Kabluchko, Kabluchko, Zakhar, Alexander Marynych   +5 more
core   +1 more source

Symbolic Regression and Multi‐Objective Optimization of the Flory–Huggins Interaction Parameter for Hydrogels

Advanced Engineering Materials, EarlyView.
We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang, Adrian Ehrenhofer, Thomas Wallmersperger   +2 more
wiley   +1 more source

On the tree-depth of random graphs

Discrete Applied Mathematics, 2014
The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s. td(G)=n-O(sqrt(n/p)). Random graphs with p=c/n, have a.a.s.
Perarnau Llobet, Guillem, Serra Albó, Oriol   +1 more
openaire   +4 more sources