7 resultados para assimilate partitioning
em Instituto Politécnico do Porto, Portugal
Resumo:
In life cycle impact assessment (LCIA) models, the sorption of the ionic fraction of dissociating organic chemicals is not adequately modeled because conventional non-polar partitioning models are applied. Therefore, high uncertainties are expected when modeling the mobility, as well as the bioavailability for uptake by exposed biota and degradation, of dissociating organic chemicals. Alternative regressions that account for the ionized fraction of a molecule to estimate fate parameters were applied to the USEtox model. The most sensitive model parameters in the estimation of ecotoxicological characterization factors (CFs) of micropollutants were evaluated by Monte Carlo analysis in both the default USEtox model and the alternative approach. Negligible differences of CFs values and 95% confidence limits between the two approaches were estimated for direct emissions to the freshwater compartment; however the default USEtox model overestimates CFs and the 95% confidence limits of basic compounds up to three orders and four orders of magnitude, respectively, relatively to the alternative approach for emissions to the agricultural soil compartment. For three emission scenarios, LCIA results show that the default USEtox model overestimates freshwater ecotoxicity impacts for the emission scenarios to agricultural soil by one order of magnitude, and larger confidence limits were estimated, relatively to the alternative approach.
Resumo:
The Darwinian Particle Swarm Optimization (DPSO) is an evolutionary algorithm that extends the Particle Swarm Optimization using natural selection to enhance the ability to escape from sub-optimal solutions. An extension of the DPSO to multi-robot applications has been recently proposed and denoted as Robotic Darwinian PSO (RDPSO), benefiting from the dynamical partitioning of the whole population of robots, hence decreasing the amount of required information exchange among robots. This paper further extends the previously proposed algorithm adapting the behavior of robots based on a set of context-based evaluation metrics. Those metrics are then used as inputs of a fuzzy system so as to systematically adjust the RDPSO parameters (i.e., outputs of the fuzzy system), thus improving its convergence rate, susceptibility to obstacles and communication constraints. The adapted RDPSO is evaluated in groups of physical robots, being further explored using larger populations of simulated mobile robots within a larger scenario.
Resumo:
Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.
Resumo:
This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.
Resumo:
No âmbito da unidade curricular Dissertação/Projeto/Estágio do 2º ano do Mestrado em Engenharia mecânica – Ramo Gestão Industrial do Instituto Superior de Engenharia do Porto, o presente trabalho de dissertação foi enquadrado num projeto de desenvolvimento de ferramentas de apoio à gestão de projetos. O projeto foi desenvolvido no Instituto de Engenharia Mecânica e Gestão Industrial (INEGI) na unidade de Desenvolvimento de Produto e Sistemas (DPS). A realização deste projeto teve como objetivo o desenvolvimento e adequação de ferramentas de apoio à gestão de multi-projeto no processo de desenvolvimento de produto na organização em estudo – o INEGI – DPS. A gestão de projetos tem hoje uma grande importância nos resultados das empresas essencialmente em virtude da necessidade de estas competirem num mundo em grande mudança com concorrentes ferozes, em que a capacidade de responder às mudanças a tempo e de uma forma integrada se torna cada vez mais importante. A atividade levada a cabo pela DPS impõe a necessidade de uma gestão de projetos mais eficaz e eficiente suportada numa gestão de informação centralizada. O presente projeto de investigação teve, numa primeira fase, uma adaptação à organização em estudo. De seguida, foi conduzida uma revisão da literatura com o objetivo de se obter a fundamentação teórica necessária ao desenvolvimento de ferramentas com base nas metodologias lean. Prosseguiu com o levantamento da situação inicial da organização e com a identificação dos problemas existentes na gestão de projetos. Incluiu também uma revisão e análise das ferramentas existentes na unidade em estudo. Este conhecimento permitiu delinear uma visão para guiar o desenvolvimento das ferramentas. Após a definição da visão foi, então, realizado o desenvolvimento das ferramentas de auxílio à gestão multi-projeto na organização. A concretização deste trabalho resultou no desenvolvimento de três ferramentas de auxílio à gestão multi-projeto na unidade. Estas ferramentas tornam o processo de gestão de projetos mais simples e fácil de assimilar, requerendo apenas alguns inputs por parte dos colaboradores. Estas ferramentas estão apoiadas nos pilares do lean, e deste modo estão vocacionadas para reduzir o desperdício, promover a melhoria contínua, aumentar o desempenho global dos vários atores nos projetos de modo a entregar mais valor e qualidade superior com menores custos. Acima de tudo, valorizar o trabalho dos colaboradores, tornando-os mais eficientes, eficazes, motivados e comprometidos com a organização.
Resumo:
Heterogeneous multicore platforms are becoming an interesting alternative for embedded computing systems with limited power supply as they can execute specific tasks in an efficient manner. Nonetheless, one of the main challenges of such platforms consists of optimising the energy consumption in the presence of temporal constraints. This paper addresses the problem of task-to-core allocation onto heterogeneous multicore platforms such that the overall energy consumption of the system is minimised. To this end, we propose a two-phase approach that considers both dynamic and leakage energy consumption: (i) the first phase allocates tasks to the cores such that the dynamic energy consumption is reduced; (ii) the second phase refines the allocation performed in the first phase in order to achieve better sleep states by trading off the dynamic energy consumption with the reduction in leakage energy consumption. This hybrid approach considers core frequency set-points, tasks energy consumption and sleep states of the cores to reduce the energy consumption of the system. Major value has been placed on a realistic power model which increases the practical relevance of the proposed approach. Finally, extensive simulations have been carried out to demonstrate the effectiveness of the proposed algorithm. In the best-case, savings up to 18% of energy are reached over the first fit algorithm, which has shown, in previous works, to perform better than other bin-packing heuristics for the target heterogeneous multicore platform.
Resumo:
Sorption is commonly agreed to be the major process underlying the transport and fate of polycyclic aromatic hydrocarbons (PAHs) in soils. However, there is still a scarcity of studies focusing on spatial variability at the field scale in particular. In order to investigate the variation in the field of phenanthrene sorption, bulk topsoil samples were taken in a 15 × 15-m grid from the plough layer in two sandy loam fields with different texture and organic carbon (OC) contents (140 samples in total). Batch experiments were performed using the adsorption method. Values for the partition coefficient K d (L kg−1) and the organic carbon partition coefficient K OC (L kg−1) agreed with the most frequently used models for PAH partitioning, as OC revealed a higher affinity for sorption. More complex models using different OC compartments, such as non-complexed organic carbon (NCOC) and complexed organic carbon (COC) separately, performed better than single K OC models, particularly for a subset including samples with Dexter n < 10 and OC <0.04 kg kg−1. The selected threshold revealed that K OC-based models proved to be applicable for more organic fields, while two-component models proved to be more accurate for the prediction of K d and retardation factor (R) for less organic soils. Moreover, OC did not fully reflect the changes in phenanthrene retardation in the field with lower OC content (Faardrup). Bulk density and available water content influenced the phenanthrene transport mechanism phenomenon.