1 |
Analyzing The Effectiveness of Electrical Stimulation (E-Stim) On Knee Injuries: Exploring The Optimal Timing of UseLarenas, Briana M 01 January 2024 (has links) (PDF)
This paper investigates the importance of electrical stimulation (E-Stim) treatment pre- exercise, during exercise, and post-exercise on knee pain management and exercise performance on individuals with knee injuries. Common problems from which individuals experience pain and injuries are arthritis, ACL tears, and osteoarthritis. One therapeutic approach to address the pain has been electrical stimulation. This is a non-invasive treatment that introduces electrical currents into the injured tissue or muscle. However, there are several modalities of electrical stimulation treatment that include Transcutaneous Electrical Nerve Stimulation (TENS), Neuromuscular Electrical Stimulation (NMES), and Patterned Electrical Neuromuscular Stimulation (PENS). These treatments have the same goal: to provide a non-invasive method to stimulate the muscles and nerves to aid the healing process.
Throughout this research, the populations targeted were females and males with age ranging from adolescents to older adults. The subjects were 15 – 75 years of age and had experienced knee injuries. They included athletes, older adults with osteoarthritis, and those who required arthroplasty. Between January 2023 and April 2024, the review of literature was conducted using UCF Libraries, PubMed, (MedLine), and SPORTDiscus (EBSCOhost). Keywords used included “TENS (Transcutaneous Electrical Nerve Stimulation) *”, “NMES (Neuromuscular Electrical Stimulation) *”, “osteoarthritis (OA)*”, Electrical Stimulation (E- Stim) *”, “knee injuries*”, “pain management*”, “before exercise*”, “after exercise*” and “during exercise*”. The results from these studies suggested that the application of e-stim was favored either during or after exercise.
|
2 |
Etude et résolution d'un problème de transport à la demande multicritère / Study and solving an multicriteria demand responsive transport problemAtahran, Ahmed 03 December 2012 (has links)
Les travaux présentés dans cette thèse visent à proposer des méthodes permettant de résoudre un problème de Transport à la Demande multicritère. Le premier travail réalisé dans cette thèse est l'étude d'un problème de Dial-a-Ride (DARP) statique multicritère. Trois critères qui peuvent être conflictuels ont été définis : le premier consiste à minimiser le coût de transport, le deuxième critère consiste à minimiser l'insatisfaction des passagers et enfin le troisième critère consiste à minimiser la quantité de CO2 émise par l'ensemble des véhicules. Nous avons développé une méthode évolutionnaire NSGA-II pour chercher un ensemble approximatif d'optimas de Pareto. Le second travail réalisé est l'étude d'un problème d'Optimal Timing dans une tournée. Ce problème consiste à calculer les dates de début de service optimales des points d'arrêts d'une tournée afin de minimiser l'insatisfaction des passagers. Le dernier travail de cette thèse a porté sur l'étude d'un problème de Transport à la Demande dynamique dans lequel de nouvelles requêtes à traiter arrivent en cours de journée. Deux méthodes ont été proposées pour résoudre ce problème : la première est une heuristique d'insertion rapide et la seconde est une méthode arborescente tronquée connue sous le nom de Recovering Beam Search. / The work presented in this thesis aims to propose methods to solve a multicriteria dial-a-ride problem (DARP). Three objective functions that have to be optimized in order to measure the potential efficiency of the DARP solution on different aspects : the cost for the transportation operator, the quality of service for users and the impact on the environment. The first work in this thesis is the study of static DARP for which a NSGA-II algorithm is developped to identify a good approximation of the Pareto optimal set. The second work deals with an optimal timing algorithm which computes pickup and delivery dates when the requests are sequenced on the vehicles, the objective is to minimize the total customer' dissatisfaction. The last problem studied in this thesis aims to solve the dynamic version of DARP for which two methods are proposed. The first one is a fast insertion heuristic based on an attractive index. However, the second methode uses a recovering beam search heuristic which unlike the insertion heuristic allows to modify the structure of the routes previously scheduled in order to schedule the new requests.
|
Page generated in 0.0809 seconds