960 resultados para Effort musculaire


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

As part of the Prato Collaborative I am undertaking a Delphi Study to explore the developmental journeys that nine different countries (including NI and Ireland) have undertaken to better meet the needs of families where a parent has a mental illness in adult mental health and children’s services. This research has potential to impact FFP in adult mental health and children's services.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In many sport associations, regardless of level, women and men rarely practice together. Previous studies indicate that work groups are generally more efficient when there is an even distribution between the sexes. Could that also be the case in sports? This study aims to investigate whether the sex composition of a training group affects the effort and performance of the participants. Eleven volunteers participated in the crossover study consisting of three different 150-meter sprint conditions; individually, single-sex group and mixed-sex group. Sprint times, heart rate and RPE were recorded during all three trials. The result of this study suggests that there might be practical benefits in regards to physical performance and effort to exercise in a training group consisting of both sexes instead of training only with the same-sex or individually. The understanding could be useful in areas such as; training optimisation for both athletes and in patient- and rehabilitation groups, increasing efficiency in work environments, in schools and sports clubs striving for both athletic success and gender equality.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Over recent decades recreational fisheries have grown substantially throughout the world. Despite this increase, catches from recreational fisheries have often been ignored in fisheries management, although this is now being remedied. Monitoring recreational fisheries can be expensive, and the primary means used for monitoring is angler (creel) surveys, typically funded from sales of fishing licences. The studies presented in this thesis examine different approaches to monitoring recreational trolling fisheries’ catch and effort, where fishing licenses are not required and there are no reporting requirements. I present results from a complemented roving/mail-in survey undertaken during 2013-2014 to estimate recreational effort and catch of Atlantic salmon (Salmo salar) and brown trout (S. trutta) in the largest lake in the European Union, Lake Vänern, Sweden. I also evaluate different angler catch reporting methods (mail-in, tournament reports and face-to-face interviews) and compare catch rates within and among spring and fall fishing periods. In addition, mail-in survey data are examined for recall bias.   I estimate that 28.7 tonnes of salmon and trout combined were harvested by the recreational trolling fishery in 2014, more than the commercial and subsistence fisheries combined. Seasonal differences in both recreational effort and catch were observed. Effort, in boat hours, was significantly higher in spring than in fall. Catch rates of trout were higher in fall than in spring, but there were no seasonal differences in catches of salmon. Harvest per boat day did not differ significantly among catch reporting methods, indicating that all three methods could be useful for managers interested in harvest rates. In contrast, total and released catch per boat day differed among reporting methods, with tournament anglers catching more fish in total. Finally, there was little evidence for recall bias in mail-in surveys, indicating that mail-in surveys are useful for collecting unbiased catch data. My study is the most comprehensive angler survey to date for Lake Vänern, and my results should be of immediate use to local fisheries managers and should also be of interest to researchers and managers interested in estimating catch and effort for fisheries at large spatial scales.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

PURPOSE: The use of information and communication technology (ICT) is common in modern working life. ICT demands may give rise to experience of work-related stress. Knowledge about ICT demands in relation to other types of work-related stress and to self-rated health is limited. Consequently, the aim of this study was to examine the association between ICT demands and two types of work-related stress [job strain and effort-reward imbalance (ERI)] and to evaluate the association between these work-related stress measures and self-rated health, in general and in different SES strata. METHODS: This study is based on cross-sectional data from the Swedish Longitudinal Occupational Survey of Health collected in 2014, from 14,873 gainfully employed people. ICT demands, job strain, ERI and self-rated health were analysed as the main measures. Sex, age, SES, lifestyle factors and BMI were used as covariates. RESULTS: ICT demands correlated significantly with the dimensions of the job strain and ERI models, especially with the demands (r = 0.42; p < 0.01) and effort (r = 0.51; p < 0.01) dimensions. ICT demands were associated with suboptimal self-rated health, also after adjustment for age, sex, SES, lifestyle and BMI (OR 1.49 [95 % CI 1.36-1.63]), but job strain (OR 1.93 [95 % CI 1.74-2.14) and ERI (OR 2.15 [95 % CI 1.95-2.35]) showed somewhat stronger associations with suboptimal self-rated health. CONCLUSION: ICT demands are common among people with intermediate and high SES and associated with job strain, ERI and suboptimal self-rated health. ICT demands should thus be acknowledged as a potential stressor of work-related stress in modern working life.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Altération de la régénération musculaire dans la maladie pulmonaire obstructive chronique. La maladie pulmonaire obstructive chronique (MPOC) est caractérisée par une obstruction bronchique irréversible et progressive. L’atrophie musculaire périphérique y est fréquente et a un impact négatif sur la capacité fonctionnelle et la survie des sujets atteints. Toutefois, on ignore si une altération du processus de régénération musculaire est un processus ayant cours dans l’atrophie musculaire périphérique. Le but de la présente thèse était donc d’étudier les cellules satellites, principales cellules responsables de la régénération musculaire dans les muscles périphériques de patients ayant une MPOC. Dans un premier temps, nous avons évalué l’historique de réplication du tissu musculaire et la sénescence des cellules satellites. Les changements morphologiques ayant lieu dans le muscle au cours de la progression de la maladie rendent le muscle plus susceptible aux dommages, induisant un raccourcissement prématuré des télomères. Un raccourcissement des télomères chez les sujets ayant une MPOC avec atrophie est concomitant avec une augmentation du nombre de cellules satellites sénescentes et de l’épuisement du potentiel de régénération compromettant le maintien de la masse musculaire chez ces sujets. Dans un deuxième et troisième temps, nous avons étudié les étapes amenant une cellule satellite vers une cellule musculaire dans les muscles périphériques et respiratoires de patients ayant une MPOC comparativement à des sujets contrôles. Les cellules satellites sont impliquées dans la réparation du tissu musculaire. Dans les cellules satellites provenant des sujets ayant une MPOC, une altération de la prolifération et de la différentiation a été observée. Ces résultats sont compatibles avec une altération de la régénération musculaire pouvant conduire à l’atrophie musculaire dans la MPOC. Le quatrième volet de ce projet s’intéressait à l’impact d’un entraînement en résistance sur l’activité des cellules satellites et le rôle joué par la myostatine dans ce contexte. La littérature montre que l’exercice en résistance est bien toléré et aide les patients ayant une MPOC à retrouver une meilleure qualité de vie. Cependant, il semble qu’ils n’y répondent pas tous aussi bien que les sujets contrôles. La capacité de réponse des cellules satellites à un entraînement en résistance semble inadéquate, suggérant ainsi un défaut de leur activation. Dans la dernière étude de cette thèse, nous avons voulu évaluer l’impact de l’inflammation systémique en étudiant SAA1, une protéine de phase aiguë et p21, une protéine du cycle cellulaire dans la dégradation des protéines des cellules musculaires. Les liens de causalité entre l’affection primaire et les différentes comorbidités demeurent nébuleux dans la MPOC. SAA1 et p21 sont augmentés dans les muscles squelettiques des patients ayant une MPOC et par ailleurs, SAA1 est capable d’induire la dégradation des protéines musculaires. Cette thèse expose les premiers éléments impliquant l’altération de la régénération musculaire avec la dysfonction musculaire observée chez les patients ayant une MPOC. Ces résultats vont certainement contribuer au développement de nouvelles thérapies et stratégies d’intervention dans le but d’améliorer la qualité de vie des personnes atteintes d’une MPOC. En somme, les travaux effectués dans le cadre de la présente thèse montrent que plusieurs mécanismes agissent de concert avec l’inactivité physique afin d’induire le phénotype dysfonctionnel dans les muscles des patients ayant une MPOC.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its infancy. Mimicking the natural evolutionary process of the survival of the fittest, Genetic Algorithms (GAs) have attracted much attention in solving difficult scheduling problems in recent years. Some obstacles exist when using GAs: there is no canonical mechanism to deal with constraints, which are commonly met in most real-world scheduling problems, and small changes to a solution are difficult. To overcome both difficulties, indirect approaches have been presented (in [1] and [2]) for nurse scheduling and driver scheduling, where GAs are used by mapping the solution space, and separate decoding routines then build solutions to the original problem. In our previous indirect GAs, learning is implicit and is restricted to the efficient adjustment of weights for a set of rules that are used to construct schedules. The major limitation of those approaches is that they learn in a non-human way: like most existing construction algorithms, once the best weight combination is found, the rules used in the construction process are fixed at each iteration. However, normally a long sequence of moves is needed to construct a schedule and using fixed rules at each move is thus unreasonable and not coherent with human learning processes. When a human scheduler is working, he normally builds a schedule step by step following a set of rules. After much practice, the scheduler gradually masters the knowledge of which solution parts go well with others. He can identify good parts and is aware of the solution quality even if the scheduling process is not completed yet, thus having the ability to finish a schedule by using flexible, rather than fixed, rules. In this research we intend to design more human-like scheduling algorithms, by using ideas derived from Bayesian Optimization Algorithms (BOA) and Learning Classifier Systems (LCS) to implement explicit learning from past solutions. BOA can be applied to learn to identify good partial solutions and to complete them by building a Bayesian network of the joint distribution of solutions [3]. A Bayesian network is a directed acyclic graph with each node corresponding to one variable, and each variable corresponding to individual rule by which a schedule will be constructed step by step. The conditional probabilities are computed according to an initial set of promising solutions. Subsequently, each new instance for each node is generated by using the corresponding conditional probabilities, until values for all nodes have been generated. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the Bayesian network is updated again using the current set of good rule strings. The algorithm thereby tries to explicitly identify and mix promising building blocks. It should be noted that for most scheduling problems the structure of the network model is known and all the variables are fully observed. In this case, the goal of learning is to find the rule values that maximize the likelihood of the training data. Thus learning can amount to 'counting' in the case of multinomial distributions. In the LCS approach, each rule has its strength showing its current usefulness in the system, and this strength is constantly assessed [4]. To implement sophisticated learning based on previous solutions, an improved LCS-based algorithm is designed, which consists of the following three steps. The initialization step is to assign each rule at each stage a constant initial strength. Then rules are selected by using the Roulette Wheel strategy. The next step is to reinforce the strengths of the rules used in the previous solution, keeping the strength of unused rules unchanged. The selection step is to select fitter rules for the next generation. It is envisaged that the LCS part of the algorithm will be used as a hill climber to the BOA algorithm. This is exciting and ambitious research, which might provide the stepping-stone for a new class of scheduling algorithms. Data sets from nurse scheduling and mall problems will be used as test-beds. It is envisaged that once the concept has been proven successful, it will be implemented into general scheduling algorithms. It is also hoped that this research will give some preliminary answers about how to include human-like learning into scheduling algorithms and may therefore be of interest to researchers and practitioners in areas of scheduling and evolutionary computation. References 1. Aickelin, U. and Dowsland, K. (2003) 'Indirect Genetic Algorithm for a Nurse Scheduling Problem', Computer & Operational Research (in print). 2. Li, J. and Kwan, R.S.K. (2003), 'Fuzzy Genetic Algorithm for Driver Scheduling', European Journal of Operational Research 147(2): 334-344. 3. Pelikan, M., Goldberg, D. and Cantu-Paz, E. (1999) 'BOA: The Bayesian Optimization Algorithm', IlliGAL Report No 99003, University of Illinois. 4. Wilson, S. (1994) 'ZCS: A Zeroth-level Classifier System', Evolutionary Computation 2(1), pp 1-18.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Lake Kyoga at the time of Worthington Survey (Worthington, 1929) was fished by only natives around it. The fishing gears consisted of locally made basket traps, hooks and seine nets made out of papyrus. Fishing was mainly during the dry season as in wet season, the fishers would revert to crop growing. During 1937 to 1950s Oreochromis variabilis, oreochromis esculentus (Ngege) and Protopterus aethiopicus (Mamba) were the most important commercial fish species and contributed over 95% to the total landings until early 1950s when their proportions started to change as a result of changes in fishing techniques. The tilapiines' were then being caught using mainly basket traps and P.aethiopicus was caught in hooks prior to the mid 1950s.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the present studies I investigated whether college students’ perceptions of effort source influenced their perceptions of the relation between levels of their own effort and ability in mathematics. In Study 1 (N = 210), I found using hypothetical vignettes that perceptions of task-elicited effort (i.e., effort that arises due to the subjective difficulty or ease of the task) led to perceptions of an inverse relation between one’s effort and ability, and perceptions of self-initiated effort (i.e., effort that arises due to one’s own motivation or lack of motivation) led to perceptions of a positive relation between one’s effort and ability, consistent with my hypotheses and prior research. In Study 2 (N = 160), participants completed an academic task and I used open-ended questions to manipulate their perceptions of effort source. I found that participants in the task-elicited condition endorsed no overall relation between effort and ability, and participants in the self-initiated condition endorsed an overall inverse relation, which is inconsistent with my hypotheses and prior research. Possible explanations for the findings, as well as broader theoretical and educational implications are discussed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The thesis is an investigation of the principle of least effort (Zipf 1949 [1972]). The principle is simple (all effort should be least) and universal (it governs the totality of human behavior). Since the principle is also functional, the thesis adopts a functional theory of language as its theoretical framework, i.e. Natural Linguistics. The explanatory system of Natural Linguistics posits that higher principles govern preferences, which, in turn, manifest themselves as concrete, specific processes in a given language. Therefore, the thesis’ aim is to investigate the principle of least effort on the basis of external evidence from English. The investigation falls into the three following strands: the investigation of the principle itself, the investigation of its application in articulatory effort and the investigation of its application in phonological processes. The structure of the thesis reflects the division of its broad aims. The first part of the thesis presents its theoretical background (Chapter One and Chapter Two), the second part of the thesis deals with application of least effort in articulatory effort (Chapter Three and Chapter Four), whereas the third part discusses the principle of least effort in phonological processes (Chapter Five and Chapter Six). Chapter One serves as an introduction, examining various aspects of the principle of least effort such as its history, literature, operation and motivation. It overviews various names which denote least effort, explains the origins of the principle and reviews the literature devoted to the principle of least effort in a chronological order. The chapter also discusses the nature and operation of the principle, providing numerous examples of the principle at work. It emphasizes the universal character of the principle from the linguistic field (low-level phonetic processes and language universals) and the non-linguistic ones (physics, biology, psychology and cognitive sciences), proving that the principle governs human behavior and choices. Chapter Two provides the theoretical background of the thesis in terms of its theoretical framework and discusses the terms used in the thesis’ title, i.e. hierarchy and preference. It justifies the selection of Natural Linguistics as the thesis’ theoretical framework by outlining its major assumptions and demonstrating its explanatory power. As far as the concepts of hierarchy and preference are concerned, the chapter provides their definitions and reviews their various understandings via decision theories and linguistic preference-based theories. Since the thesis investigates the principle of least effort in language and speech, Chapter Three considers the articulatory aspect of effort. It reviews the notion of easy and difficult sounds and discusses the concept of articulatory effort, overviewing its literature as well as various understandings in a chronological fashion. The chapter also presents the concept of articulatory gestures within the framework of Articulatory Phonology. The thesis’ aim is to investigate the principle of least effort on the basis of external evidence, therefore Chapters Four and Six provide evidence in terms of three experiments, text message studies (Chapter Four) and phonological processes in English (Chapter Six). Chapter Four contains evidence for the principle of least effort in articulation on the basis of experiments. It describes the experiments in terms of their predictions and methodology. In particular, it discusses the adopted measure of effort established by means of the effort parameters as well as their status. The statistical methods of the experiments are also clarified. The chapter reports on the results of the experiments, presenting them in a graphical way and discusses their relation to the tested predictions. Chapter Four establishes a hierarchy of speakers’ preferences with reference to articulatory effort (Figures 30, 31). The thesis investigates the principle of least effort in phonological processes, thus Chapter Five is devoted to the discussion of phonological processes in Natural Phonology. The chapter explains the general nature and motivation of processes as well as the development of processes in child language. It also discusses the organization of processes in terms of their typology as well as the order in which processes apply. The chapter characterizes the semantic properties of processes and overviews Luschützky’s (1997) contribution to NP with respect to processes in terms of their typology and incorporation of articulatory gestures in the concept of a process. Chapter Six investigates phonological processes. In particular, it identifies the issues of lenition/fortition definition and process typology by presenting the current approaches to process definitions and their typology. Since the chapter concludes that no coherent definition of lenition/fortition exists, it develops alternative lenition/fortition definitions. The chapter also revises the typology of phonological processes under effort management, which is an extended version of the principle of least effort. Chapter Seven concludes the thesis with a list of the concepts discussed in the thesis, enumerates the proposals made by the thesis in discussing the concepts and presents some questions for future research which have emerged in the course of investigation. The chapter also specifies the extent to which the investigation of the principle of least effort is a meaningful contribution to phonology.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The National Fisheries Resources Research Institute (NaFIRRI), the Directorate of Fisheries Resources (DiFR), the Local Government fisheries staff and those from the Beach Management Units (BMUs) of the riparian districts to Lake Victoria regularly and jointly conduct Frame and Catch Assessment Surveys. The information obtained is used to guide fisheries management and development. We reveal the trends in the commercial fish catch landings and fishing effort on the Uganda side of Lake Victoria, over a 15 year period (2000-2015) and provide the underlying factors to the observed changes. The contribution of the high value large size species (Nile perch and Tilapia) to the commercial catch of Lake Victoria has significantly reduced while that of the low value small size species, Mukene has increased over a ten year (2005-2015)period. The information is intended to update and sensitize the key stakeholders on the status of the Lake Victoria fisheries. In addition, the information provided is expected to guide policy formulation and management planning by the fisheries managers at all levels including the BMUs and Landing Site Management Committees (LSMCs), the Local government fisheries staff and the Directorate of Fisheries Resources. The information is anticipated to create awareness among the lakeside fisher communities to reverse the current trend in fish declines.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development of a general scheduling algorithm is still in its infancy. Mimicking the natural evolutionary process of the survival of the fittest, Genetic Algorithms (GAs) have attracted much attention in solving difficult scheduling problems in recent years. Some obstacles exist when using GAs: there is no canonical mechanism to deal with constraints, which are commonly met in most real-world scheduling problems, and small changes to a solution are difficult. To overcome both difficulties, indirect approaches have been presented (in [1] and [2]) for nurse scheduling and driver scheduling, where GAs are used by mapping the solution space, and separate decoding routines then build solutions to the original problem. In our previous indirect GAs, learning is implicit and is restricted to the efficient adjustment of weights for a set of rules that are used to construct schedules. The major limitation of those approaches is that they learn in a non-human way: like most existing construction algorithms, once the best weight combination is found, the rules used in the construction process are fixed at each iteration. However, normally a long sequence of moves is needed to construct a schedule and using fixed rules at each move is thus unreasonable and not coherent with human learning processes. When a human scheduler is working, he normally builds a schedule step by step following a set of rules. After much practice, the scheduler gradually masters the knowledge of which solution parts go well with others. He can identify good parts and is aware of the solution quality even if the scheduling process is not completed yet, thus having the ability to finish a schedule by using flexible, rather than fixed, rules. In this research we intend to design more human-like scheduling algorithms, by using ideas derived from Bayesian Optimization Algorithms (BOA) and Learning Classifier Systems (LCS) to implement explicit learning from past solutions. BOA can be applied to learn to identify good partial solutions and to complete them by building a Bayesian network of the joint distribution of solutions [3]. A Bayesian network is a directed acyclic graph with each node corresponding to one variable, and each variable corresponding to individual rule by which a schedule will be constructed step by step. The conditional probabilities are computed according to an initial set of promising solutions. Subsequently, each new instance for each node is generated by using the corresponding conditional probabilities, until values for all nodes have been generated. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the Bayesian network is updated again using the current set of good rule strings. The algorithm thereby tries to explicitly identify and mix promising building blocks. It should be noted that for most scheduling problems the structure of the network model is known and all the variables are fully observed. In this case, the goal of learning is to find the rule values that maximize the likelihood of the training data. Thus learning can amount to 'counting' in the case of multinomial distributions. In the LCS approach, each rule has its strength showing its current usefulness in the system, and this strength is constantly assessed [4]. To implement sophisticated learning based on previous solutions, an improved LCS-based algorithm is designed, which consists of the following three steps. The initialization step is to assign each rule at each stage a constant initial strength. Then rules are selected by using the Roulette Wheel strategy. The next step is to reinforce the strengths of the rules used in the previous solution, keeping the strength of unused rules unchanged. The selection step is to select fitter rules for the next generation. It is envisaged that the LCS part of the algorithm will be used as a hill climber to the BOA algorithm. This is exciting and ambitious research, which might provide the stepping-stone for a new class of scheduling algorithms. Data sets from nurse scheduling and mall problems will be used as test-beds. It is envisaged that once the concept has been proven successful, it will be implemented into general scheduling algorithms. It is also hoped that this research will give some preliminary answers about how to include human-like learning into scheduling algorithms and may therefore be of interest to researchers and practitioners in areas of scheduling and evolutionary computation. References 1. Aickelin, U. and Dowsland, K. (2003) 'Indirect Genetic Algorithm for a Nurse Scheduling Problem', Computer & Operational Research (in print). 2. Li, J. and Kwan, R.S.K. (2003), 'Fuzzy Genetic Algorithm for Driver Scheduling', European Journal of Operational Research 147(2): 334-344. 3. Pelikan, M., Goldberg, D. and Cantu-Paz, E. (1999) 'BOA: The Bayesian Optimization Algorithm', IlliGAL Report No 99003, University of Illinois. 4. Wilson, S. (1994) 'ZCS: A Zeroth-level Classifier System', Evolutionary Computation 2(1), pp 1-18.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this article, the change in examinee effort during an assessment, which we will refer to as persistence, is modeled as an effect of item position. A multilevel extension is proposed to analyze hierarchically structured data and decompose the individual differences in persistence. Data from the 2009 Program of International Student Achievement (PISA) reading assessment from N = 467,819 students from 65 countries are analyzed with the proposed model, and the results are compared across countries. A decrease in examinee effort during the PISA reading assessment was found consistently across countries, with individual differences within and between schools. Both the decrease and the individual differences are more pronounced in lower performing countries. Within schools, persistence is slightly negatively correlated with reading ability; but at the school level, this correlation is positive in most countries. The results of our analyses indicate that it is important to model and control examinee effort in low-stakes assessments. (DIPF/Orig.)