Results 71 to 80 of about 569,188 (376)

Quantitative Assessment of Upper Limb Ataxia Using a Virtual Reality‐Based Evaluation System

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Cerebellar ataxia impairs coordination and balance, reducing quality of life. Conventional clinical scales, including the Scale for the Assessment and Rating of Ataxia (SARA) and the International Cooperative Ataxia Rating Scale (ICARS), are widely used to assess ataxia but are limited by subjectivity and inter‐rater variability ...
Masayuki Sato, Takayuki Abe, Sho Aoki, Setsuki Tsukagoshi, Yasushi Yuminaka, Yoshio Ikeda   +5 more
wiley   +1 more source

Exploring patients’ profiles associated with the resolution of acute calcium pyrophosphate arthritis treatedwith colchicine and prednisone: post hoc analysis of a randomized controlled trial

Arthritis Care &Research, Accepted Article.
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, Laurène Norberciak, Pascal Richette, Pierre Robinet, Aurore Pacaud, Gauthier Marchasson, Thibault Rabin, Hélène Luraschi, Pierre Maciejasz, Anne‐France Georgel, Augustin Latourte, Hang‐Korng Ea, Sébastien Ottaviani, Charlotte Jauffret, Vincent Ducoulombier   +14 more
wiley   +1 more source

Speeding up shortest path algorithms

, 2012
Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg, C. Demetrescu, D. Karger, D.B. Johnson, E.W. Dijkstra, H.N. Gabow, M. Thorup, M.L. Fredman, S. Pettie, S. Pettie, T. Hagerup   +10 more
core   +1 more source

Testing A Personalized Approach to Chronic Low Back Pain: A Randomized Controlled Trial in Older Veterans

Arthritis Care &Research, Accepted Article.
Objective We aimed to test the efficacy of personalized treatment of older Veterans with chronic low back pain (CLBP) delivered by Aging Back Clinics (ABC) as compared with usual care (UC). Methods Two hundred ninety‐nine Veterans age 65‐89 with CLBP from 3 VA medical centers underwent baseline testing, randomization to ABC or UC and 12 months follow ...
Debra K. Weiner, Angela Gentili, Meika A. Fang, Edward Garay, Laura Lawson, Lenore Joseph, Cathy C. Lee, Michelle I. Rossi, Beverly Thorn, Subashan Perera   +9 more
wiley   +1 more source

INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]

The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019
The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination.
S. Behzadi, M. Kolbadinejad
doaj   +1 more source

Cellular Automata Applications in Shortest Path Problem

, 2017
Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally.
A Macwan, A Nash, AI Adamatzky, Anastasios Tsiftsis, C Nieto-Granda, C. Hochberger, C. Y. Lee, Christian Hochberger, D Ferguson, DB Johnson, EW Dijkstra, Fabio M. Marchese, G Ch Sirakoulis, G Ch Sirakoulis, George S. Fishman, H Beigy, Hong Qu, Ioakeim G. Georgoudas, J Li, J Neumann Von, J-H Liang, K Nagel, K. Ioannidis, Konstantinos Ioannidis, Lazaros Nalpantidis, M Defoort, M.A. Porta Garcia, M.G. Kechaidou, Michail-Antisthenis I Tsompanas, Michail-Antisthenis I. Tsompanas, Michail-Antisthenis I. Tsompanas, Michail-Antisthenis I. Tsompanas, Michail-Antisthenis I. Tsompanas, Michail-Antisthenis I. Tsompanas, Nikolaos Dourvas, Nikolaos I. Dourvas, Nikolaos I. Dourvas, O Montiel, PG Tzionas, Q Sun, RW Floyd, S Liu, S Warshall, SK Moghaddam, T Nakagaki, Tiago P. Nascimento, Usman Ahmed Syed, V.S. Kalogeiton, Vasileios G. Ntinas, Vasilis Evangelidis, Vassilios A. Mardiris, Vicky S. Kalogeiton, X Zhang, XGM Wang, XJ Wu, Y Wang   +55 more
core   +1 more source

Shortest path problem under triangular fuzzy neutrosophic information

International Conference on Software, Knowledge, Information Management and Applications, 2016
In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number.
S. Broumi, A. Bakali, M. Talea, F. Smarandache, L. Vlădăreanu   +4 more
semanticscholar   +1 more source

Hopfield Neural Networks for Online Constrained Parameter Estimation With Time‐Varying Dynamics and Disturbances

International Journal of Adaptive Control and Signal Processing, EarlyView.
This paper proposes two projector‐based Hopfield neural network (HNN) estimators for online, constrained parameter estimation under time‐varying data, additive disturbances, and slowly drifting physical parameters. The first is a constraint‐aware HNN that enforces linear equalities and inequalities (via slack neurons) and continuously tracks the ...
Miguel Pedro Silva
wiley   +1 more source

Comparison Analysis of Graph Theory Algorithms for Shortest Path Problem

Jurnal Sisfokom, 2023
The Sumba region, Indonesia, is known for its extraordinary natural beauty and unique cultural richness. There are 19 interesting tourist attractions spread throughout the area, but tourists often face difficulties in planning efficient visiting routes ...
Yosefina Finsensia Riti, Jonathan Steven Iskandar, Hendra Hendra   +2 more
doaj   +1 more source

Near-Linear Query Complexity for Graph Inference

, 2015
How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? Let $G = (V,E)$ be an unweighted, connected graph of bounded degree.
Kannan, Sampath, Mathieu, Claire, Zhou, Hang   +2 more
core   +1 more source