965 resultados para Fully-Implicit Method


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract is not available.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Three anaerobic ponds used to store and treat piggery wastes were fully covered with permeable materials manufactured from polypropylene geofabric, polyethylene shade cloth and supported straw. The covers were assessed in terms of efficacy in reducing odour emission rates over a 40-month period. Odour samples were collected from the surface of the covers, the surface of the exposed liquor and from the surface of an uncovered (control) pond at one of the piggeries. Relative to the emission rate of the exposed liquor at each pond, the polypropylene, shade cloth and straw covers reduced average emission rates by 76%, 69% and 66%, respectively. At the piggery with an uncovered control pond, the polypropylene covers reduced average odour emission rates by 50% and 41%, respectively. A plausible hypothesis, consistent with likely mechanisms for the odour reduction and the olfactometric method used to quantifying the efficacy of the covers, is offered.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An approach towards the highly functionalized bicyclo[3.3.1]nonan-9-one core of the complex PPAP-based natural product hyperforin, with the full complement of prenyl substituents in required stereo-disposition, is delineated.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we consider the bi-criteria single machine scheduling problem of n jobs with a learning effect. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). The objective is to find a sequence that performs well with respect to both the objectives: the total completion time and the total absolute differences in completion times. In an earlier study, a method of solving bi-criteria transportation problem is presented. In this paper, we use the methodology of solvin bi-criteria transportation problem, to our bi-criteria single machine scheduling problem with a learning effect, and obtain the set of optimal sequences,. Numerical examples are presented for illustrating the applicability and ease of understanding.