909 resultados para Time-to-collision
Resumo:
Mestrado em Auditoria
Resumo:
O presente Relatório de Estágio tem como objecto de pesquisa a concepção e monitorização de duas Oficinas de Teatro dirigidas a dois grupos de mulheres constituídos, respectivamente, por estudantes universitárias e desempregadas. O estágio realizou-se entre Novembro/2013 e Junho/2014 na Quarta Parede - Associação de Artes Performativas da Covilhã e inseriu-se nos Empowerment Labs, laboratórios formativos que cruzam artes performativas e ciências sociais na reflexão e intervenção sobre a igualdade de género com foco no desemprego feminino. Este relatório expõe os três momentos do processo do estágio: pesquisa de referenciais teórico-práticos, concepção e monitorização das Oficinas de Teatro e reflexão a partir da prática laboratorial. Na pesquisa de referenciais, essencial para delinear a metodologia operacional e o programa de conteúdos, explorei dimensões como o feminismo e a igualdade de género, e procurei compreender de que forma o empowerment, a pedagogia de Paulo Freire e as metodologias do teatro aplicado serviam os objectivos do meu trabalho. A realização das oficinas foi o momento de experimentar as metodologias e o programa delineado. Tendo a igualdade de género como temática unificadora, o empowerment através da arte como objectivo maior e o teatro aplicado como base metodológica, as oficinas inserem-se nos processos de educação não-formal aplicados ao incremento de recursos intelectuais, emocionais, sociais, expressivos e criativos e, neste caso específico, à ampliação da consciência de género. Neste sentido, as oficinas desenvolveram uma abordagem metodológica processual, participativa e multidisciplinar, orientada para a pesquisa performativa, primeiro de uma dramaturgia individual, depois de uma dramaturgia do colectivo e, por fim, de uma dramaturgia orientada para a igualdade de género. O conceito de “dramaturgia” surge aqui no sentido metodológico do pachwork (trabalho com retalhos) e do sampling (recolha e transformação de materiais), relevante sobretudo na última fase, dedicada à construção colectiva de um exercício performativo apresentado publicamente.
Resumo:
Dissertação apresentada à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Educação Especial, domínio Cognição e Multideficiência
Resumo:
OBJECTIVE: To determine whether the elimination of certain chronic diseases is capable of leading to the compression of morbidity among elderly individuals.METHODS: A population-based, cross-sectional study was carried out with official data for the city of Sao Paulo, Southeastern Brazil in 2000 and data from the SABE (Health, Wellbeing and Ageing) study. Sullivan's method was used to calculate disability-free life expectancy. Cause-deleted life tables were used to calculate the probabilities of death and disabilities with the elimination of health conditions.RESULTS: The largest gains in disability-free life expectancy, with the elimination of chronic illness, occurred in the female gender. Among individuals of a more advanced age, gains in disability-free life expectancy occurred as result of a relative compression of morbidity. Among men aged 75 years, all conditions studied, except heart disease and systemic arterial pressure, led to an absolute expansion of morbidity and, at the same time, to a relative compression of morbidity upon being eliminated.CONCLUSIONS: The elimination of chronic diseases in the elderly could lead to the compression of morbidity in elderly men and women.
Resumo:
Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.
Resumo:
We consider reliable communications in Body Area Networks (BAN), where a set of nodes placed on human body are connected using wireless links. In order to keep the Specific Absorption Rate (SAR) as low as possible for health safety reasons, these networks operate in low transmit power regime, which however, is known to be error prone. It has been observed that the fluctuations of the Received Signal Strength (RSS) at the nodes of a BAN on a moving person show certain regularities and that the magnitude of these fluctuations are significant (5 - 20 dB). In this paper, we present BANMAC, a MAC protocol that monitors and predicts the channel fluctuations and schedules transmissions opportunistically when the RSS is likely to be higher. The MAC protocol is capable of providing differentiated service and resolves co-channel interference in the event of multiple co-located BANs in a vicinity. We report the design and implementation details of BANMAC integrated with the IEEE 802.15.4 protocol stack. We present experimental data which show that the packet loss rate (PLR) of BANMAC is significantly lower as compared to that of the IEEE 802.15.4 MAC. For comparable PLR, the power consumption of BANMAC is also significantly lower than that of the IEEE 802.15.4. For co-located networks, the convergence time to find a conflict-free channel allocation was approximately 1 s for the centralized coordination mechanism and was approximately 4 s for the distributed coordination mechanism.
Resumo:
Due to the growing complexity and adaptability requirements of real-time systems, which often exhibit unrestricted Quality of Service (QoS) inter-dependencies among supported services and user-imposed quality constraints, it is increasingly difficult to optimise the level of service of a dynamic task set within an useful and bounded time. This is even more difficult when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may be inter-dependent. This paper focuses on optimising a dynamic local set of inter-dependent tasks that can be executed at varying levels of QoS to achieve an efficient resource usage that is constantly adapted to the specific constraints of devices and users, nature of executing tasks and dynamically changing system conditions. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.
Resumo:
Due to the growing complexity and dynamism of many embedded application domains (including consumer electronics, robotics, automotive and telecommunications), it is increasingly difficult to react to load variations and adapt the system's performance in a controlled fashion within an useful and bounded time. This is particularly noticeable when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may exhibit unrestricted QoS inter-dependencies. This paper proposes a novel anytime adaptive QoS control policy in which the online search for the best set of QoS levels is combined with each user's personal preferences on their services' adaptation behaviour. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.
Resumo:
In heterogeneous environments, diversity of resources among the devices may affect their ability to perform services with specific QoS constraints, and drive peers to group themselves in a coalition for cooperative service execution. The dynamic selection of peers should be influenced by user’s QoS requirements as well as local computation availability, tailoring provided service to user’s specific needs. However, complex dynamic real-time scenarios may prevent the possibility of computing optimal service configurations before execution. An iterative refinement approach with the ability to trade off deliberation time for the quality of the solution is proposed. We state the importance of quickly finding a good initial solution and propose heuristic evaluation functions that optimise the rate at which the quality of the current solution improves as the algorithms have more time to run.
Resumo:
Adhesive-bonding for the unions in multi-component structures is gaining momentum over welding, riveting and fastening. It is vital for the design of bonded structures the availability of accurate damage models, to minimize design costs and time to market. Cohesive Zone Models (CZM’s) have been used for fracture prediction in structures. The eXtended Finite Element Method (XFEM) is a recent improvement of the Finite Element Method (FEM) that relies on traction-separation laws similar to those of CZM’s but it allows the growth of discontinuities within bulk solids along an arbitrary path, by enriching degrees of freedom. This work proposes and validates a damage law to model crack propagation in a thin layer of a structural epoxy adhesive using the XFEM. The fracture toughness in pure mode I (GIc) and tensile cohesive strength (sn0) were defined by Double-Cantilever Beam (DCB) and bulk tensile tests, respectively, which permitted to build the damage law. The XFEM simulations of the DCB tests accurately matched the experimental load-displacement (P-d) curves, which validated the analysis procedure.
Resumo:
A construction project is a group of discernible tasks or activities that are conduct-ed in a coordinated effort to accomplish one or more objectives. Construction projects re-quire varying levels of cost, time and other resources. To plan and schedule a construction project, activities must be defined sufficiently. The level of detail determines the number of activities contained within the project plan and schedule. So, finding feasible schedules which efficiently use scarce resources is a challenging task within project management. In this context, the well-known Resource Constrained Project Scheduling Problem (RCPSP) has been studied during the last decades. In the RCPSP the activities of a project have to be scheduled such that the makespan of the project is minimized. So, the technological precedence constraints have to be observed as well as limitations of the renewable resources required to accomplish the activities. Once started, an activity may not be interrupted. This problem has been extended to a more realistic model, the multi-mode resource con-strained project scheduling problem (MRCPSP), where each activity can be performed in one out of several modes. Each mode of an activity represents an alternative way of combining different levels of resource requirements with a related duration. Each renewable resource has a limited availability for the entire project such as manpower and machines. This paper presents a hybrid genetic algorithm for the multi-mode resource-constrained pro-ject scheduling problem, in which multiple execution modes are available for each of the ac-tivities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme. It is evaluated the quality of the schedules and presents detailed comparative computational re-sults for the MRCPSP, which reveal that this approach is a competitive algorithm.
Resumo:
On-chip debug (OCD) features are frequently available in modern microprocessors. Their contribution to shorten the time-to-market justifies the industry investment in this area, where a number of competing or complementary proposals are available or under development, e.g. NEXUS, CJTAG, IJTAG. The controllability and observability features provided by OCD infrastructures provide a valuable toolbox that can be used well beyond the debugging arena, improving the return on investment rate by diluting its cost across a wider spectrum of application areas. This paper discusses the use of OCD features for validating fault tolerant architectures, and in particular the efficiency of various fault injection methods provided by enhanced OCD infrastructures. The reference data for our comparative study was captured on a workbench comprising the 32-bit Freescale MPC-565 microprocessor, an iSYSTEM IC3000 debugger (iTracePro version) and the Winidea 2005 debugging package. All enhanced OCD infrastructures were implemented in VHDL and the results were obtained by simulation within the same fault injection environment. The focus of this paper is on the comparative analysis of the experimental results obtained for various OCD configurations and debugging scenarios.
Resumo:
This paper presents a genetic algorithm for the multimode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme by introducing an improvement procedure. It is evaluated the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that this approach is a competitive algorithm.
Resumo:
We introduce the notions of equilibrium distribution and time of convergence in discrete non-autonomous graphs. Under some conditions we give an estimate to the convergence time to the equilibrium distribution using the second largest eigenvalue of some matrices associated with the system.
Resumo:
ABSTRACT OBJECTIVE To examine whether the level of complexity of the services structure and sociodemographic and clinical characteristics of patients in hemodialysis are associated with the prevalence of poor health self-assessment. METHODS In this cross-sectional study, we evaluated 1,621 patients with chronic terminal kidney disease on hemodialysis accompanied in 81 dialysis services in the Brazilian Unified Health System in 2007. Sampling was performed by conglomerate in two stages and a structured questionnaire was applied to participants. Multilevel multiple logistic regression was used for data analysis. RESULTS The prevalence of poor health self-assessment was of 54.5%, and in multivariable analysis it was associated with the following variables: increasing age (OR = 1.02; 95%CI 1.01–1.02), separated or divorced marital status (OR = 0.62; 95%CI 0.34–0.88), having 12 years or more of study (OR = 0.51; 95%CI 0.37–0.71), spending more than 60 minutes in commuting between home and the dialysis service (OR = 1.80; 95%CI 1.29–2.51), having three or more self-referred diseases (OR = 2.20; 95%CI 1.33–3.62), and reporting some (OR = 2.17; 95%CI 1.66–2.84) or a lot of (OR = 2.74; 95%CI 2.04–3.68) trouble falling asleep. Individuals in treatment in dialysis services with the highest level of complexity in the structure presented less chance of performing a self-assessment of their health as bad (OR = 0.59; 95%CI 0.42–0.84). CONCLUSIONS We showed poor health self-assessment is associated with age, years of formal education, marital status, home commuting time to the dialysis service, number of self-referred diseases, report of trouble sleeping, and also with the level of complexity of the structure of health services. Acknowledging these factors can contribute to the development of strategies to improve the health of patients in hemodialysis in the Brazilian Unified Health System.