963 resultados para decomposition bags


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Demand response (DR) algorithms manipulate the energy consumption schedules of controllable loads so as to satisfy grid objectives. Implementation of DR algorithms using a centralized agent can be problematic for scalability reasons, and there are issues related to the privacy of data and robustness to communication failures. Thus, it is desirable to use a scalable decentralized algorithm for the implementation of DR. In this paper, a hierarchical DR scheme is proposed for peak minimization based on Dantzig-Wolfe decomposition (DWD). In addition, a time weighted maximization option is included in the cost function, which improves the quality of service for devices seeking to receive their desired energy sooner rather than later. This paper also demonstrates how the DWD algorithm can be implemented more efficiently through the calculation of the upper and lower cost bounds after each DWD iteration.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Upgrade of hydrogen to valuable fuel is a central topic in modern research due to its high availability and low price. For the difficulties in hydrogen storage, different pathways are still under investigation. A promising way is in the liquid-phase chemical hydrogen storage materials, because they can lead to greener transformation processes with the on line development of hydrogen for fuel cells. The aim of my work was the optimization of catalysts for the decomposition of formic acid made by sol immobilisation method (a typical colloidal method). Formic acid was selected because of the following features: it is a versatile renewable reagent for green synthesis studies. The first aim of my research was the synthesis and optimisation of Pd nanoparticles by sol-immobilisation to achieve better catalytic performances and investigate the effect of particle size, oxidation state, role of stabiliser and nature of the support. Palladium was chosen because it is a well-known active metal for the catalytic decomposition of formic acid. Noble metal nanoparticles of palladium were immobilized on carbon charcoal and on titania. In the second part the catalytic performance of the “homemade” catalyst Pd/C to a commercial Pd/C and the effect of different monometallic and bimetallic systems (AuxPdy) in the catalytic formic acid decomposition was investigated. The training period for the production of this work was carried out at the University of Cardiff (Group of Dr. N. Dimitratos).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Co-Al-Ox mixed metal oxides partially modified with Cu or Mg, as well as Ag were successfully prepared, characterized and evaluated as potential catalysts for the N2O decomposition. The materials were characterized by the following techniques: X-Ray Diffraction, Thermogravimetric Analysis (TGA), N2 Physisorption, Hydrogen Temperature-Programmed Reduction (H2-TPR), and X-ray photoelectron spectroscopy (XPS). Ag-modified HT-derived mixed oxides showed enhanced activity compared to the undoped materials, the optimum composition was found for (1 wt.% Ag)CHT-Co3Al. The catalyst characterization studies suggested that the improved catalytic activity of Ag-promoted catalysts were mainly because of the altered redox properties of the materials.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract not available

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Inverse heat conduction problems (IHCPs) appear in many important scientific and technological fields. Hence analysis, design, implementation and testing of inverse algorithms are also of great scientific and technological interest. The numerical simulation of 2-D and –D inverse (or even direct) problems involves a considerable amount of computation. Therefore, the investigation and exploitation of parallel properties of such algorithms are equally becoming very important. Domain decomposition (DD) methods are widely used to solve large scale engineering problems and to exploit their inherent ability for the solution of such problems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Finance is one of the fastest growing areas in modern applied mathematics with real world applications. The interest of this branch of applied mathematics is best described by an example involving shares. Shareholders of a company receive dividends which come from the profit made by the company. The proceeds of the company, once it is taken over or wound up, will also be distributed to shareholders. Therefore shares have a value that reflects the views of investors about the likely dividend payments and capital growth of the company. Obviously such value will be quantified by the share price on stock exchanges. Therefore financial modelling serves to understand the correlations between asset and movements of buy/sell in order to reduce risk. Such activities depend on financial analysis tools being available to the trader with which he can make rapid and systematic evaluation of buy/sell contracts. There are other financial activities and it is not an intention of this paper to discuss all of these activities. The main concern of this paper is to propose a parallel algorithm for the numerical solution of an European option. This paper is organised as follows. First, a brief introduction is given of a simple mathematical model for European options and possible numerical schemes of solving such mathematical model. Second, Laplace transform is applied to the mathematical model which leads to a set of parametric equations where solutions of different parametric equations may be found concurrently. Numerical inverse Laplace transform is done by means of an inversion algorithm developed by Stehfast. The scalability of the algorithm in a distributed environment is demonstrated. Third, a performance analysis of the present algorithm is compared with a spatial domain decomposition developed particularly for time-dependent heat equation. Finally, a number of issues are discussed and future work suggested.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract not available

Relevância:

20.00% 20.00%

Publicador:

Resumo:

As the efficiency of parallel software increases it is becoming common to measure near linear speedup for many applications. For a problem size N on P processors then with software running at O(N=P ) the performance restrictions due to file i/o systems and mesh decomposition running at O(N) become increasingly apparent especially for large P . For distributed memory parallel systems an additional limit to scalability results from the finite memory size available for i/o scatter/gather operations. Simple strategies developed to address the scalability of scatter/gather operations for unstructured mesh based applications have been extended to provide scalable mesh decomposition through the development of a parallel graph partitioning code, JOSTLE [8]. The focus of this work is directed towards the development of generic strategies that can be incorporated into the Computer Aided Parallelisation Tools (CAPTools) project.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A colonização por invertebrados aquáticos no detrito de Salvinia herzogii foi estudada em dois lagos rasos subtropicais de diferentes estados tróficos (eutrófico e oligotrófico) localizados no campus Carreiros da Universidade Federal do Rio Grande, extremo sul do Brasil. Aproximadamente 6g (peso úmido) de S. herzogii foram incubados em experimentos com litter bags (30 X 20 cm com 10 mm de malha) e a decomposição do detrito acompanhada durante 110 dias (entre setembro de 2008 e janeiro de 2009), período no qual o detrito decompôs-se cerca de 95%. Quatro réplicas foram retiradas após os intervalos de 1, 30, 60, 90 e 110 dias de incubação e o detrito foi limpo em água corrente sob peneira de 250µm de malha para que fossem retidos os organismos e depois fixados em álcool 80%. As plantas depois de limpas foram secas à 60ºC por 72 horas para obtenção do peso seco, depois trituradas, para as análises de nitrogênio e fósforo total e para obtenção do peso seco livre de cinzas, equivalente a porcentagem de massa remanescente (%R). Os invertebrados foram identificados até o menor nível taxonômico possível e depositados na coleção de Invertebrados Límnicos – ICB - FURG. Para cada amostra foram calculadas a riqueza e a densidade de táxons, os índices de diversidade de Shannon - Wiener (H’), homogeneidade de Pielou (J). Para determinar qual grupo de invertebrados foi mais importante para a estruturação da comunidade em cada lago, foi realizada a análise de espécies indicadoras (indicator especies analysis). Um total de 32.399 organismos distribuídos em 38 táxons foram registrados para os lagos estudados. Dezoito táxons foram comuns entre os lagos em cada experimento. Um total de 1.449.612 ind. 100g PS no ambiente eutrófico e 372.380 ind. 100g PS para o ambiente oligotrófico foi registrado (p=0,4771). O táxon mais abundante encontrado para o lago eutrófico foi Goeldichironomus (Chironomidae; 81% de todos os organismos coletados), enquanto queno lago oligotrófico, o táxon mais abundante foi Caenis (Caenidae; 29,1% de todos os organismos coletados). A colonização do detrito foi rápida, nas primeiras 24 horas foram registrados 10 táxons nos lagos eutrófico e oligotrófico, sendo os predadores o grupo dominante (52 e 70%, respectivamente) neste período. Durante o período do experimento,no lago eutrófico, os coletores-catadores foram os mais abundantes (91,2 % do número total de organismos), seguido de coletores-filtradores (4,7 %) e predadores (3,5 %). No lago oligotrófico, os coletores-catadores foram os mais abundantes (34,1 % do número total de organismos), seguido de predadores (26,8 %), raspadores (24,9 %) e fragmentadores (10,5 %). O Índice de diversidade acompanhou os aumentos de densidade durante os experimentos, sendo que o valor máximo observado foi no lago oligotrófico(H’=2,31) no 60º dia de incubação, enquanto que o menor valor foi registrado para o lago eutrófico (H’=0,19) no 110º dia de incubação. A taxa de decomposição de S. herzogii foi diferente no lago eutrófico (k = 0,019; R2 = 0,88) e oligotrófico (k = 0,021; R2 = 0,81),porém essa diferença não foi significativa (ANCOVA; F = 6,38 e p = 0,6755).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents our work on decomposing a specific nurse rostering problem by cyclically assigning blocks of shifts, which are designed considering both hard and soft constraints, to groups of nurses. The rest of the shifts are then assigned to the nurses to construct a schedule based on the one cyclically generated by blocks. The schedules obtained by decomposition and construction can be further improved by a variable neighborhood search. Significant results are obtained and compared with a genetic algorithm and a variable neighborhood search approach on a problem that was presented to us by our collaborator, ORTEC bv, The Netherlands. We believe that the approach has the potential to be further extended to solve a wider range of nurse rostering problems.