890 resultados para Cache Replacement.
Resumo:
The puqjose of this study was to examine the manner in which an inviting approach to a preoperative teaching and learning educational experience influenced the perception and subsequent recovery of clients who were awaiting total hip and total knee replacement surgery. An in-depth review of the internal and external factors that shape client perceptions was undertaken in this study. In addition, this study also explored whether or not the Prehab Program was preparing clients physically, socially, and psychologically for surgery. Data for this qualitative case study research were collected through preoperative interviews with 4 participants awaiting total hip replacement surgery and 1 participant awaiting total knee replacement surgery. Four postoperative interviews were conducted with the participants who had received total hip replacement surgery. The occupational therapist and physical therapist who were the coleaders of the Prehab Program at the time of this study were also interviewed. The results of this study suggest that while individuals may receive similar educational experiences, their perceptions of the manner in which they benefited from these experiences varied. This is illustrated in the research findings, which concluded that while clients benefited physically from the inviting approach used during the practical teaching session, not all clients perceived the psychological benefits of this practice session, especially clients with preexisting high levels of anxiety. In addition to increasing the understanding of the internal as well as external factors that influence the perceptions of clients, this study has also served as an opportunity for reflection on practice for the Prehab therapists and other healthcare educators.
Resumo:
We study the problem of locating two public goods for a group of agents with single-peaked preferences over an interval. An alternative specifies a location for each public good. In Miyagawa (1998), each agent consumes only his most preferred public good without rivalry. We extend preferences lexicographically and characterize the class of single-peaked preference rules by Pareto-optimality and replacement-domination. This result is considerably different from the corresponding characterization by Miyagawa (2001a).
Resumo:
Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal.
Resumo:
Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal.
Resumo:
Pour répondre aux exigences du gouvernement fédéral quant aux temps d’attente pour les chirurgies de remplacement du genou et de la hanche, les établissements canadiens ont adopté des stratégies de gestion des listes d’attentes avec des niveaux de succès variables. Notre question de recherche visait à comprendre Quels facteurs ont permis de maintenir dans le temps un temps d’attente répondant aux exigences du gouvernement fédéral pendant au moins 6-12 mois? Nous avons développé un modèle possédant quatre facteurs, inspiré du modèle de Parsons (1977), afin d’analyser les facteurs comprenant la gouvernance, la culture, les ressources, et les outils. Trois études de cas ont été menées. En somme, le 1er cas a été capable d’obtenir les exigences pendant six mois mais incapable de les maintenir, le 2e cas a été capable de maintenir les exigences > 18 mois et le 3e cas a été incapable d’atteindre les objectifs. Des documents furent recueillis et des entrevues furent réalisées auprès des personnes impliquées dans la stratégie. Les résultats indiquent que l’hôpital qui a été en mesure de maintenir le temps d’attente possède certaines caractéristiques: réalisation exclusive de chirurgie de remplacement de la hanche et du genou, présence d’un personnel motivé, non distrait par d’autres préoccupations et un esprit d’équipe fort. Les deux autres cas ont eu à faire face à une culture médicale moins homogène et moins axés sur l’atteinte des cibles; des ressources dispersées et une politique intra-établissement imprécise. Le modèle d’hôpital factory est intéressant dans le cadre d’une chirurgie surspécialisée. Toutefois, les patients sont sélectionnés pour des chirurgies simples et dont le risque de complication est faible. Il ne peut donc pas être retenu comme le modèle durable par excellence.
Resumo:
L’objectif de la présente étude est d’étudier les différences entre les homicides par strangulation et les suicides par pendaison ainsi que l’importance du rôle que jouent les lésions dans la détermination du mode de décès dans les cas apparents de pendaison, et ce dans l’optique d’établir un outil permettant de renseigner le coroner ou médecin légiste sur le mode de décès probable dans les cas apparents de pendaison. Deux cent quatorze cas de suicide par pendaison ont été révisés rétrospectivement et comparés à 51 cas d’homicide par strangulation. La fréquence d’ecchymoses (6,1 %), d’abrasions (4,7 %) et de lacérations (0,5 %) était significativement plus faible chez les victimes de suicide par pendaison que chez les victimes d’homicides par strangulation (58,8 %, 51,0 % et 5,9 % respectivement). Les ecchymoses, chez les victimes de suicide par pendaison, se trouvent habituellement sur les membres supérieurs antérieurs et postérieurs ou sur les membres inférieurs antérieurs. Elles se situent généralement soit sur les membres supérieurs, soit sur les membres inférieurs, et non aux deux endroits à la fois. Les abrasions sont davantage susceptibles de se trouver sur la face postérieure des membres supérieurs et sur la face antérieure des membres inférieurs. Cette concentration préférentielle n’est pas observée chez les victimes d’homicide par strangulation. De possibles critères de suspicion et des modèles de prédiction du mode de décès sont évalués.
Resumo:
In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our vision cache resolution should satisfy the following requirements: (i) it should result in low message overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission range. The proposed approach reduces the number of messages flooded in to the network to find the requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The experimental results gives a promising result based on the metrics of studies.
Resumo:
Two experiments were conducted to evaluate cassava root peel (CRP) as diet component for fattening pigs. In the first experiment, ten male pigs were used to investigate the nutrient digestibility and the nutritive value of CRP as replacement for maize in the diet at 0 %, 30 %, 40 %, 50 % and 60 %, while supplementing free amino acids (fAA). During two experimental periods, faeces were quantitatively collected and analysed for chemical composition. In the second experiment, 40 pigs received the same diets as in Experiment 1, and daily feed intake and weekly weight changes were recorded. Four pigs per diet were slaughtered at 70 kg body weight to evaluate carcass traits. Digestibility of dry and organic matter, crude protein, acid detergent fibre and gross energy were depressed (p<0.05) at 60 % CRP; digestible energy content (MJ kg^(−1) DM) was 15.4 at 0 % CRP and 12.7 at 60 % CRP. In the second experiment, CRP inclusion had only a small impact on feed intake, weight gain and feed conversion ratio (p>0.05) as well as on the length of the small intestine and the Longissimus dorsi muscle area. The missing correlation of daily weight gain and feed-to-gain ratio up to a CRP inclusion of 40 % indicates that negative effects of CRP on pig growth can be avoided by respecting upper feeding limits. Hence, a combined use of CRP and fAA can reduce feeding costs for small-scale pig farmers in countries where this crop-by product is available in large amounts.
Resumo:
As the number of processors in distributed-memory multiprocessors grows, efficiently supporting a shared-memory programming model becomes difficult. We have designed the Protocol for Hierarchical Directories (PHD) to allow shared-memory support for systems containing massive numbers of processors. PHD eliminates bandwidth problems by using a scalable network, decreases hot-spots by not relying on a single point to distribute blocks, and uses a scalable amount of space for its directories. PHD provides a shared-memory model by synthesizing a global shared memory from the local memories of processors. PHD supports sequentially consistent read, write, and test- and-set operations. This thesis also introduces a method of describing locality for hierarchical protocols and employs this method in the derivation of an abstract model of the protocol behavior. An embedded model, based on the work of Johnson[ISCA19], describes the protocol behavior when mapped to a k-ary n-cube. The thesis uses these two models to study the average height in the hierarchy that operations reach, the longest path messages travel, the number of messages that operations generate, the inter-transaction issue time, and the protocol overhead for different locality parameters, degrees of multithreading, and machine sizes. We determine that multithreading is only useful for approximately two to four threads; any additional interleaving does not decrease the overall latency. For small machines and high locality applications, this limitation is due mainly to the length of the running threads. For large machines with medium to low locality, this limitation is due mainly to the protocol overhead being too large. Our study using the embedded model shows that in situations where the run length between references to shared memory is at least an order of magnitude longer than the time to process a single state transition in the protocol, applications exhibit good performance. If separate controllers for processing protocol requests are included, the protocol scales to 32k processor machines as long as the application exhibits hierarchical locality: at least 22% of the global references must be able to be satisfied locally; at most 35% of the global references are allowed to reach the top level of the hierarchy.
Resumo:
Caches are known to consume up to half of all system power in embedded processors. Co-optimizing performance and power of the cache subsystems is therefore an important step in the design of embedded systems, especially those employing application specific instruction processors. In this project, we propose an analytical cache model that succinctly captures the miss performance of an application over the entire cache parameter space. Unlike exhaustive trace driven simulation, our model requires that the program be simulated once so that a few key characteristics can be obtained. Using these application-dependent characteristics, the model can span the entire cache parameter space consisting of cache sizes, associativity and cache block sizes. In our unified model, we are able to cater for direct-mapped, set and fully associative instruction, data and unified caches. Validation against full trace-driven simulations shows that our model has a high degree of fidelity. Finally, we show how the model can be coupled with a power model for caches such that one can very quickly decide on pareto-optimal performance-power design points for rapid design space exploration.
Resumo:
gvSIG Mini es una aplicación open-source de usuario final cliente móvil de Infraestructura de Datos Espaciales IDEs con licencia GNU/ GPL, diseñada para teléfonos móviles Java y Android que permite la visualización y navegación sobre cartografía digital estructurada en tiles procedente de servicios web OGC como WMS(-C) y de servicios como OpenStreetMap (OSM), Yahoo Maps, Maps Bing, así como el almacenamiento en caché para reducir al mínimo el ancho de banda. gvSIG Mini puede acceder a servicios geoespaciales como NameFinder, para la búsqueda de puntos de interés y YOURS (Yet Another OpenStreetMap Routing Service) para el cálculo de rutas y la renderización de la información vectorial el lado del cliente. Por otra parte, gvSIG Mini también ofrece servicio de localización GPS. La versión de gvSIG Mini para Android, posee algunas características adicionales como son el soporte de localización Android o el uso del lacelerómetro para centrado. Esta versión también hace uso de servicios como son la predicción del tiempo o TweetMe que permite compartir una localización utilizando el popular servicio social Twitter. gvSIG Mini es una aplicación que puede ser descargada y usada libremente, convirtiéndose en una plataforma para el desarrollo de nuevas soluciones y aplicaciones en el campo de Location Based Services (LBS). gvSIG Mini ha sido desarrollado por Prodevelop, S.L. No es un proyecto oficial de gvSIG, pero se une a la familia a través del catálogo de extensiones no oficiales de gvSIG. Phone Cache es una extensión que funciona sobre gvSIG 1.1.2 que permite generar una caché, para poder utilizar gvSIG Mini para Java en modo desconectado