Global ETD Search

1	Fundamental Insights into Propionate Oxidation in Microbial Electrolysis Cells Using a Combination of Electrochemical, Molecular biology and Electron Balance Approaches Rao, Hari Ananda 11 1900 (has links) Increasing demand for freshwater and energy is pushing towards the development of alternative technologies that are sustainable. One of the realistic solutions to address this is utilization of the renewable resources like wastewater. Conventional wastewater treatment processes can be highly energy demanding and can fails to recover the full potential of useful resources such as energy in the wastewater. As a consequence, there is an urgent necessity for sustainable wastewater treatment technologies that could harness such resources present in wastewaters. Advanced treatment process based on microbial electrochemical technologies (METs) such as microbial fuel cells (MFCs) and microbial electrolysis cells (MECs) have a great potential for the resources recovery through a sustainable wastewater treatment process. METs rely on the abilities of microorganisms that are capable of transferring electrons extracellularly by oxidizing the organic matter in the wastewater and producing electrical current for electricity generation (MFC) or H2 and CH4 production (MEC). Propionate is an important volatile fatty acid (VFA) (24-70%) in some wastewaters and accumulation of this VFA can cause a process failure in a conventional anaerobic digestion (AD) system. To address this issue, MECs were explored as a novel, alternative wastewater treatment technology, with a focus on a better understanding of propionate oxidation in the anode of MECs. Having such knowledge could help in the development of more robust and efficient wastewater treatment systems to recover energy and produce high quality effluents. Several studies were conducted to: 1) determine the paths of electron flow in the anode of propionate fed MECs low (4.5 mM) and high (36 mM) propionate concentrations; 2) examine the effect of different set anode potentials on the electrochemical performance, propionate degradation, electron fluxes, and microbial community structure in MECs fed propionate; and 3) examine the temporal dynamics of microbial communities in MECs fed with low or high concentration of acetate or propionate relating to the reactor performance. Overall, the findings from these studies provides new knowledge on propionate oxidation in MECs. The discovery of such findings may shed light on the development of an energy positive wastewater treatment process capable of producing a high quality effluent. Propionate oxidation Microbial Electrolysis Cells multiple paths microbial community dynamics syntrophy Electron fluxes
2	Energy-aware scheduling : complexity and algorithms Renaud-Goud, Paul 05 July 2012 (has links) (PDF) In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental reasons. In the first chapter, we exhibit tight bounds on the energy metric of a classical algorithm that minimizes the makespan of independent tasks. In the second chapter, we schedule several independent but concurrent pipelined applications and address problems combining multiple criteria, which are period, latency and energy. We perform an exhaustive complexity study and describe the performance of new heuristics. In the third chapter, we study the replica placement problem in a tree network. We try to minimize the energy consumption in a dynamic frame. After a complexity study, we confirm the quality of our heuristics through a complete set of simulations. In the fourth chapter, we come back to streaming applications, but in the form of series-parallel graphs, and try to map them onto a chip multiprocessor. The design of a polynomial algorithm on a simple problem allows us to derive heuristics on the most general problem, whose NP-completeness has been proven. In the fifth chapter, we study energy bounds of different routing policies in chip multiprocessors, compared to the classical XY routing, and develop new routing heuristics. In the last chapter, we compare the performance of different algorithms of the literature that tackle the problem of mapping DAG applications to minimize the energy consumption. [INFO:INFO_OH] Computer Science/Other Energy minimization Power Scheduling Complexity Makespan Heuristics Optimal algorithms Greedy algorithm Independent jobs Parallel processors Mapping Concurrent streaming applications Heterogeneous platforms Resource sharing Energy Latency Period Workflow Replica placement Tree networks Update strategies Dynamic programming algorithms Series-parallel graph Routing Chip multiprocesseur Manhattan Single path Multiple paths Slack reclamation DAG
3	Energy-aware scheduling : complexity and algorithms / Ordonnancement sous contrainte d'énergie : complexité et algorithmes Renaud-Goud, Paul 05 July 2012 (has links) Dans cette thèse, nous nous sommes intéressés à des problèmes d'ordonnancement sous contrainte d'énergie, puisque la réduction de l'énergie est devenue une nécessité, tant sur le plan économique qu'écologique. Dans le premier chapitre, nous exhibons des bornes strictes sur l'énergie d'un algorithme classique qui minimise le temps d'exécution de tâches indépendantes. Dans le second chapitre, nous ordonnançons plusieurs applications chaînées de type « streaming », et nous étudions des problèmes contraignant l'énergie, la période et la latence. Nous effectuons une étude de complexité exhaustive, et décrivons les performances de nouvelles heuristiques. Dans le troisième chapitre, nous étudions le problème de placement de répliques dans un réseau arborescent. Nous nous plaçons dans un cadre dynamique, et nous bornons à minimiser l'énergie. Après une étude de complexité, nous confirmons la qualité de nos heuristiques grâce à un jeu complet de simulations. Dans le quatrième chapitre, nous revenons aux applications « streaming », mais sous forme de graphes série-parallèles, et nous tentons de les placer sur un processeur multi-cœur. La découverte d'un algorithme polynomial sur un problème simple nous permet la conception d'heuristiques sur le problème le plus général dont nous avons établi la NP-complétude. Dans le cinquième chapitre, nous étudions des bornes énergétiques de politiques de routage dans des processeurs multi-cœurs, en comparaison avec le routage classique XY, et développons de nouvheuristiques de routage. Dans le dernier chapitre, nous étudions expérimentalement le placement d'applications sous forme de DAG sur des machines réelles. / In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental reasons. In the first chapter, we exhibit tight bounds on the energy metric of a classical algorithm that minimizes the makespan of independent tasks. In the second chapter, we schedule several independent but concurrent pipelined applications and address problems combining multiple criteria, which are period, latency and energy. We perform an exhaustive complexity study and describe the performance of new heuristics. In the third chapter, we study the replica placement problem in a tree network. We try to minimize the energy consumption in a dynamic frame. After a complexity study, we confirm the quality of our heuristics through a complete set of simulations. In the fourth chapter, we come back to streaming applications, but in the form of series-parallel graphs, and try to map them onto a chip multiprocessor. The design of a polynomial algorithm on a simple problem allows us to derive heuristics on the most general problem, whose NP-completeness has been proven. In the fifth chapter, we study energy bounds of different routing policies in chip multiprocessors, compared to the classical XY routing, and develop new routing heuristics. In the last chapter, we compare the performance of different algorithms of the literature that tackle the problem of mapping DAG applications to minimize the energy consumption. Minimisation d'énergie Puissance Ordonnancement Complexité Heuristique Algorithmes optimaux Algorithme glouton Travaux indépendants Processeurs parallèles Placement Applications concurrentes Plate-forme hétérogène Partage de ressources Énergie Latence Période Placement de répliques Réseau arborescent Stratégies de mise à jour Algorithme de programmation dynamique Graphe série-parallèle Routage Multiprocesseur Manhattan Chemin unique Chemin multiples DAG Energy minimization Power Scheduling Complexity Makespan Heuristics Optimal algorithms Greedy algorithm Independent jobs Parallel processors Mapping Concurrent streaming applications Heterogeneous platforms Resource sharing Energy Latency Period Workflow Replica placement Tree networks Update strategies Dynamic programming algorithms Series-parallel graph Routing Chip multiprocesseur Manhattan Single path Multiple paths Slack reclamation DAG

1

Page generated in 0.0563 seconds