984 resultados para Experimental algorithms
Resumo:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática
Resumo:
Dissertação apresentada na faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores
Resumo:
Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.
Resumo:
Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.
Resumo:
Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (Proceedings of the 24th IEEE international real-time systems symposium (RTSS 2003), 2003, J Parallel Distrib Comput 71(10):1411–1425, 2011) proposed an efficient “boundary fair” algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF TeX ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF TeX outperforms the state-of-the-art discrete-time optimal scheduler (PD TeX ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF TeX is barely dependent on the length of the system time unit while PD TeX —the only other existing solution for the scheduling of sporadic tasks in discrete-time systems—sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.
Resumo:
When a pesticide is released into the environment, most of it is lost before it reaches its target. An effective way to reduce environmental losses of pesticides is by using controlled release technology. Microencapsulation becomes a promising technique for the production of controlled release agricultural formulations. In this work, the microencapsulation of chlorophenoxy herbicide MCPA with native b-cyclodextrin and its methyl and hydroxypropyl derivatives was investigated. The phase solubility study showed that both native and b-CD derivatives increased the water solubility of the herbicide and inclusion complexes are formed in a stoichiometric ratio of 1:1. The stability constants describing the extent of formation of the complexes have been determined by phase solubility studies. 1H NMR experiments were also accomplished for the prepared solid systems and the data gathered confirm the formation of the inclusion complexes. 1H NMR data obtained for the MCPA/CDs complexes disclosed noticeable proton shift displacements for OCH2 group and H6 aromatic proton of MCPA provided clear evidence of inclusion complexation process, suggesting that the phenyl moiety of the herbicide was included in the hydrophobic cavity of CDs. Free energy molecular mechanics calculations confirm all these findings. The gathered results can be regarded as an essential step to the development of controlled release agricultural formulations containing herbicide MCPA.
Resumo:
Camundongos albinos heterogenéticos da linhagem Swiss, foram experimentalmente infectados, via subcutânea, com taquizoítos de uma cepa de Toxoplasma gondii de baixa virulência. Todos morreram durante a fase aguda da infecção, entre 7 e 9 dias após a infecção (DAI). Demonstrou-se, utilizando a bioprova, que 80% dos animais eliminou T. gondii pela urina. Nos rins, observou-se, entre outras alterações, hemorragia intersticial intertubular e presença de hemácias íntegras nos espaços subcapsulares de Bowmann de alguns glomérulos. Discutiu-se sobre os possíveis mecanismos de eliminação de T. gondii na urina dos animais infectados. Analisou-se alguns aspectos relacionados com a eliminação de formas infectantes de T. gondii na urina destes animais e a transmissão da toxoplasmose na natureza
Resumo:
Adhesively bonded repairs offer an attractive option for repair of aluminium structures, compared to more traditional methods such as fastening or welding. The single-strap (SS) and double-strap (DS) repairs are very straightforward to execute but stresses in the adhesive layer peak at the overlap ends. The DS repair requires both sides of the damaged structures to be reachable for repair, which is often not possible. In strap repairs, with the patches bonded at the outer surfaces, some limitations emerge such as the weight, aerodynamics and aesthetics. To minimize these effects, SS and DS repairs with embedded patches were evaluated in this work, such that the patches are flush with the adherends. For this purpose, in this work standard SS and DS repairs, and also with the patches embedded in the adherends, were tested under tension to allow the optimization of some repair variables such as the overlap length (LO) and type of adhesive, thus allowing the maximization of the repair strength. The effect of embedding the patch/patches on the fracture modes and failure loads was compared with finite elements (FE) analysis. The FE analysis was performed in ABAQUS® and cohesive zone modelling was used for the simulation of damage onset and growth in the adhesive layer. The comparison with the test data revealed an accurate prediction for all kinds of joints and provided some principles regarding this technique.
Resumo:
The single-lap joint is the most commonly used, although it endures significant bending due to the non-collinear load path, which negatively affects its load bearing capabilities. The use of material or geometric changes is widely documented in the literature to reduce this handicap, acting by reduction of peel and shear peak stresses or alterations of the failure mechanism emerging from local modifications. In this work, the effect of using different thickness adherends on the tensile strength of single-lap joints, bonded with a ductile and brittle adhesive, was numerically and experimentally evaluated. The joints were tested under tension for different combinations of adherend thickness. The effect of the adherends thickness mismatch on the stress distributions was also investigated by Finite Elements (FE), which explained the experimental results and the strength prediction of the joints. The numerical study was made by FE and Cohesive Zone Modelling (CZM), which allowed characterizing the entire fracture process. For this purpose, a FE analysis was performed in ABAQUS® considering geometric non-linearities. In the end, a detailed comparative evaluation of unbalanced joints, commonly used in engineering applications, is presented to give an understanding on how modifications in the bonded structures thickness can influence the joint performance.
Resumo:
Dissertação apresentada para obtenção do grau de Mestre em Engenharia Civil, Perfil de Construção, pela Faculdade de Ciências e Tecnologias da Universidade Nova de Lisboa
Resumo:
We studied the role of ethanol on the modulation of liver granulomata around Schistosoma mansoni eggs in mice. Albino mice, receiving 7% ethanol as the sole drinking liquid, at 60 and 90 days post-infection, presented smaller granulomata than controls did, when sacrificed at 120 days post-infection. No differences in diameters could be observed, when ethanol was given 4 months before up to 120 days after infection. The results suggested that modulation of schistosome granulomata by ethanol ingestion varies with time and duration of drug consumption.
Resumo:
This paper aims to study the best way to express the parasitemia of Trypanosoma cruzi's experimentally infected animals. Individual scores may have a great variability, not emphasized by the majority of the authors. A group of 50 rats infected with 1x10(6) trypomastigotes of T. cruzi Y strain was used and the parasitemia was estimated by BRENER' s method. The results showed that the median can avoid false results due to very high or low parasitemias but it does not have the mathematic properties necessary for analysis of variance. The comparison of the means of the original and transformed data, with their respective coefficients of variability (CV), showed that the logarithmic mean (Mlog) have the minor value of CV. Therefore, the Mlog is the best way to express the parasitemia when the data show great variability. The number of the animal for group did not affect the variability of data when the Mlog and CV were used.
Resumo:
Numerous pulmonary schistosome egg granulomas were present in mice submitted to partial portal vein ligation (Warren's model). The granulomas were characterized by cellular aggregations formed within alveolar tissue. Main cellular types were macrophages (epithelioid cells), eosinophils, plasma cells and lymphocytes. These cells were supported by scanty fibrous stroma and exhibited close membrane contact points amongst themselves, but without forming specialized adhesion apparatus. When granulomas involved arterial structures, proliferation of cndothelial and smooth muscle cells occurred and fibrosis associated with angiogenesis became more evident. Granulomas formed around mature eggs in the pulmonary alveolar tissue presented approximately the same size and morphology regardless of the time of infection, the latter being 10, 18 and 25 weeks after cercarial exposure. This persistence of morphological appearance suggests that pulmonary granulomas do not undergo immunological modulation, as is the case with the granulomas in the liver and, to a lesser extent, in the intestines. Probably, besides general immunological factors, local (stromal) factors play an important role in schistosomal granuloma modulation.
Resumo:
The objective of lhe present study was to determine the stimulatory response to antirabies vaccination promoted by glucan in mice. Glucan increased both resistance to infection and antibody titres and this effect was more evident when glucan was used at dose of 0.5 mg, administered intraperitoneally before, during and after immunization and when the challenge virus was applied to the foot-pad.
Resumo:
River Flow, Vol. 2