Results 81 to 90 of about 3,867,667 (297)

Exploring Patients’ Profiles Associated With the Resolution of Acute Calcium Pyrophosphate Arthritis Treated With Colchicine and Prednisone: Post Hoc Analysis of a Randomized Controlled Trial

open access: yesArthritis Care &Research, EarlyView.
Objective The objective was to identify factors determining acute arthritis resolution and safety with colchicine and prednisone in acute calcium pyrophosphate (CPP) crystal arthritis. Methods We conducted a post hoc analysis of the COLCHICORT trial, which compared colchicine and prednisone for the treatment of acute CPP crystal arthritis, using a ...
Tristan Pascart   +14 more
wiley   +1 more source

Entrebanquets [PDF]

open access: yes, 1993
Localització: Universitat Autònoma de Barcelona, Arb 491.Forma part del fons personal de Jordi Arbonès.Text ...
Tree, Matthew.
core  

Latent tree models

open access: yes, 2017
Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class ...
Zwiernik, Piotr
core   +1 more source

Functional Trees [PDF]

open access: yesMachine Learning, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Clinical Practice Guideline for Evaluation and Management of Peripheral Nervous System Manifestations in Sjögren's Disease

open access: yesArthritis Care &Research, EarlyView.
Objective Sjögren's disease is an autoimmune disorder that can impact multiple organ systems, including the peripheral nervous system (PNS). PNS manifestations, which can exist concurrently, include mononeuropathies, polyneuropathies, and autonomic nervous system neuropathies.
Anahita Deboo   +88 more
wiley   +1 more source

Trajectories of Physical Function in Canadian Children with Juvenile Idiopathic Arthritis

open access: yesArthritis Care &Research, Accepted Article.
Objectives 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   +14 more
wiley   +1 more source

Random Indexing K-tree [PDF]

open access: yes, 2009
Random Indexing (RI) K-tree is the combination of two algorithms for clustering. Many large scale problems exist in document clustering. RI K-tree scales well with large inputs due to its low complexity.
De Vine, Lance   +2 more
core   +2 more sources

Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments

open access: yesSpecial Matrices, 2019
Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact recent analysis shows that the geometric multiplicity theory for the eigenvalues of such matrices closely parallels that for real symmetric (and complex ...
Saiago Carlos M.
doaj   +1 more source

Evaluation of the Potential of Laser Shock Peening Compared with Cold Expansion for Improving Fatigue Resistance of Riveted Lap Joints of Aerospace Grade 7175 Al Alloy

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar   +6 more
wiley   +1 more source

Weakly connected domination critical graphs [PDF]

open access: yesOpuscula Mathematica, 2008
A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\).
Magdalena Lemańska, Agnieszka Patyk
doaj  

Home - About - Disclaimer - Privacy