78 resultados para Anaerobic sequencing batch biofilm reactors
Resumo:
A hybrid simulation technique for identification and steady state optimization of a tubular reactor used in ammonia synthesis is presented. The parameter identification program finds the catalyst activity factor and certain heat transfer coefficients that minimize the sum of squares of deviation from simulated and actual temperature measurements obtained from an operating plant. The optimization program finds the values of three flows to the reactor to maximize the ammonia yield using the estimated parameter values. Powell's direct method of optimization is used in both cases. The results obtained here are compared with the plant data.
Resumo:
Long running multi-physics coupled parallel applications have gained prominence in recent years. The high computational requirements and long durations of simulations of these applications necessitate the use of multiple systems of a Grid for execution. In this paper, we have built an adaptive middleware framework for execution of long running multi-physics coupled applications across multiple batch systems of a Grid. Our framework, apart from coordinating the executions of the component jobs of an application on different batch systems, also automatically resubmits the jobs multiple times to the batch queues to continue and sustain long running executions. As the set of active batch systems available for execution changes, our framework performs migration and rescheduling of components using a robust rescheduling decision algorithm. We have used our framework for improving the application throughput of a foremost long running multi-component application for climate modeling, the Community Climate System Model (CCSM). Our real multi-site experiments with CCSM indicate that Grid executions can lead to improved application throughput for climate models.
Resumo:
A major bottleneck in protein structure prediction is the selection of correct models from a pool of decoys. Relative activities of similar to 1,200 individual single-site mutants in a saturation library of the bacterial toxin CcdB were estimated by determining their relative populations using deep sequencing. This phenotypic information was used to define an empirical score for each residue (Rank Score), which correlated with the residue depth, and identify active-site residues. Using these correlations, similar to 98% of correct models of CcdB (RMSD <= 4 angstrom) were identified from a large set of decoys. The model-discrimination methodology was further validated on eleven different monomeric proteins using simulated RankScore values. The methodology is also a rapid, accurate way to obtain relative activities of each mutant in a large pool and derive sequence-structure-function relationships without protein isolation or characterization. It can be applied to any system in which mutational effects can be monitored by a phenotypic readout.
Resumo:
pplication of pulsed plasma for gas cleaning is gaining prominence in recent years mainly from the energy consideration point of view. Normally, gas treatment is carried out, at or above room temperature, by a conventional dry type corona reactor. However, this treatment is still inadequate in the removal of certain stable gases present in the exhaust/flue gas mixture. The authors report some interesting results of the treatment of such stable gases with pulsed plasma at very low ambient temperature. Also reported in the paper is an improvement in DeNO/DeNOx efficiency using unconventional wet-type reactors, designed and fabricated by the authors, operating at different ambient temperatures. Apart from laboratory tests on simulated gas mixtures, field tests were also carried out on the exhaust gas of a 8 kW diesel engine. Further, an attempt was made to test the feasibility of a helical wire as a corona electrode in place of the conventional straight wire electrode. A comparative analysis of the various tests is presented together with a note on the energy consideration
Resumo:
Application of pulsed plasma for gas cleaning is gaining prominence in recent years mainly from the energy consideration point of view. Normally, gas treatment is carried out, at or above room temperature, by a conventional dry type corona reactor. However, this treatment is still inadequate in the removal of certain stable gases present in the exhaust/flue gas mixture. The authors report some interesting results of the treatment of such stable gases with pulsed plasma at very low ambient temperature. Also reported in the paper is an improvement in DeNO/DeNOx efficiency using unconventional wet-type reactors, designed and fabricated by the authors, operating at different ambient temperatures. Apart from laboratory tests on simulated gas mixtures, field tests were also carried out on the exhaust gas of a 8 kW diesel engine. Further, an attempt was made to test the feasibility of a helical wire as a corona electrode in place of the conventional straight wire electrode. A comparative analysis of the various tests is presented together with a note on the energy consideration
Resumo:
The discharge plasma-chemical hybrid process for NO/sub x/ removal from the due gas emissions is an extremely effective and economical approach in comparison with the conventional selective catalytic reduction system. In this paper we bring out a relative comparison of several discharge plasma reactors from the point of NO removal efficiency. The reactors were either energized by AC or by repetitive pulses. Ferroelectric pellets were used to study the effect of pellet assisted discharges on gas cleaning. Diesel engine exhaust, at different loads, is used to approximately simulate the due gas composition. Investigations were carried out at room temperature with respect to the variation of reaction products against the discharge power. Main emphasis is laid on the oxidation of NO to NO/sub 2/, without reducing NOx concentration (i.e., minimum reaction byproducts), with least power consumption. The produced NO/sub 2/ will be totally converted to N/sub 2/ and Na/sub 2/SO/sub 4/ using Na/sub 2/SO/sub 3/. The AC packed bed reactor and pelletless pulsed corona reactor showed better performance, with minimum reaction products for a given power, when the NO concentration was low (/spl sim/100 ppm). At high engine loads (NO>300 ppm) there was not much decrease in NO/sub x/ reduction and more or less all the reactors performed equally. The paper discusses these observations in detail.
Resumo:
Organo-clay was prepared by incorporating different amounts (in terms of CEC, ranging from 134-840 mg of quaternary ammonium cation (QACs) such as hexadecytrimethylammonium bromide (C19H42N]Br) into the montmorillonite clay. Prepared organo-clays are characterized by CHN analyser and XRD to measure the amount of elemental content and interlayer spacing of surfactant modified clay. The batch experiments of sorption of permanganate from aqueous media by organo-clays was studied at different acidic strengths (pH 1-7). The experimental results show that the rate and amount of adsorption of permanganate was higher at lower pH compared to raw montmorillonite. Laboratory fixed bed experiments were conducted to evaluate the breakthrough time and nature of breakthrough curves. The shape of the breakthrough curves shows that the initial cationic surfactant loadings at 1.0 CEC of the clay is enough to enter the permanganate ions in to the interlamellar region of the surfactant modified smectile clays. These fixed bed studies were also applied to quantify the effect of bed-depth and breakthrough time during the uptake of permanganate. Calculation of thermodynamic parameters shows that the sorption of permanganate is spontaneous and follows the first order kinetics.
Resumo:
Leaves and leaf sheath of banana and areca husk (Areca catechu) constitute an important component of urban solid waste (USW) in India which are difficult to degrade under normal windrow composting conditions. A successful method of anaerobic digestion built around the fermentation properties of these feedstock has been evolved which uses no moving parts, pretreatment or energy input while enabling recovery of four products: fiber, biogas, compost and pest repellent. An SRT of 27 d and 35 d was found to be optimum for fiber recovery for banana leaf and areca husk, respectively. Banana leaf showed a degradation pattern different from other leaves with slow pectin-1 degradation (80%) and 40% lignin removal in 27 d SRT. Areca husk however, showed a degradation pattern similar to other plant biomass. Mass recovery levels for banana leaf were fiber-20%, biogas-70% (400 ml/g TS) and compost-10%. For areca husk recovery was fiber-50%, biogas-45% (250 ml/g TS) and compost-5%. (C) 2012 Elsevier Inc. All rights reserved.
Resumo:
Computational grids with multiple batch systems (batch grids) can be powerful infrastructures for executing long-running multi-component parallel applications. In this paper, we evaluate the potential improvements in throughput of long-running multi-component applications when the different components of the applications are executed on multiple batch systems of batch grids. We compare the multiple batch executions with executions of the components on a single batch system without increasing the number of processors used for executions. We perform our analysis with a foremost long-running multi-component application for climate modeling, the Community Climate System Model (CCSM). We have built a robust simulator that models the characteristics of both the multi-component application and the batch systems. By conducting large number of simulations with different workload characteristics and queuing policies of the systems, processor allocations to components of the application, distributions of the components to the batch systems and inter-cluster bandwidths, we show that multiple batch executions lead to 55% average increase in throughput over single batch executions for long-running CCSM. We also conducted real experiments with a practical middleware infrastructure and showed that multi-site executions lead to effective utilization of batch systems for executions of CCSM and give higher simulation throughput than single-site executions. Copyright (c) 2011 John Wiley & Sons, Ltd.
Resumo:
Bacteria use a number of small basic proteins for organization and compaction of their genomes. By their interaction with DNA, these nucleoid-associated proteins (NAPs) also influence gene expression. Rv3852, a NAP of Mycobacterium tuberculosis, is conserved among the pathogenic and slow-growing species of mycobacteria. Here, we show that the protein predominantly localizes in the cell membrane and that the carboxy-terminal region with the propensity to form a transmembrane helix is necessary for its membrane localization. The protein is involved in genome organization, and its ectopic expression in Mycobacterium smegmatis resulted in altered nucleoid morphology, defects in biofilm formation, sliding motility, and change in apolar lipid profile. We demonstrate its crucial role in regulating the expression of KasA, KasB, and GroEL1 proteins, which are in turn involved in controlling the surface phenotypes in mycobacteria.
Resumo:
Maintaining population diversity throughout generations of Genetic Algorithms (GAs) is key to avoid premature convergence. Redundant solutions is one cause for the decreasing population diversity. To prevent the negative effect of redundant solutions, we propose a framework that is based on the multi-parents crossover (MPX) operator embedded in GAs. Because MPX generates diversified chromosomes with good solution quality, when a pair of redundant solutions is found, we would generate a new offspring by using the MPX to replace the redundant chromosome. Three schemes of MPX will be examined and will be compared against some algorithms in literature when we solve the permutation flowshop scheduling problems, which is a strong NP-Hard sequencing problem. The results indicate that our approach significantly improves the solution quality. This study is useful for researchers who are trying to avoid premature convergence of evolutionary algorithms by solving the sequencing problems.
Resumo:
Staphylococcus aureus is a major human pathogen, first recognized as a leading cause of hospital-acquired infections. Community-associated S. aureus (CA-SA) pose a greater threat due to increase in severity of infection and disease among children and healthy adults. CA-SA strains in India are genetically diverse, among which is the sequence type (ST) 772, which has now spread to Australia, Europe and Japan. Towards understanding the genetic characteristics of ST772, we obtained draft genome sequences of five relevant clinical isolates and studied the properties of their PVL-carrying prophages, whose presence is a defining hallmark of CA-SA. We show that this is a novel prophage, which carries the structural genes of the hlb-carrying prophage and includes the sea enterotoxin. This architecture probably emerged early within the ST772 lineage, at least in India. The sea gene, unique to ST772 PVL, despite having promoter sequence characteristics typical of low expression, appears to be highly expressed during early phase of growth in laboratory conditions. We speculate that this might be a consequence of its novel sequence context. The crippled nature of the hlb-converting prophage in ST772. suggests that widespread mobility of the sea enterotoxin might be a selective force behind its `transfer' to the PVL prophage. Wild type ST772 strains induced strong proliferative responses as well as high cytotoxic activity against neutrophils, likely mediated by superantigen SEA and the PVL toxin respectively. Both proliferation and cytotoxicity were markedly reduced in a cured ST772 strain indicating the impact of the phage on virulence. The presence of SEA alongside he genes for the immune system-modulating PVL toxin may contribute to the success and virulence of ST772.
Resumo:
Transaction processing is a key constituent of the IT workload of commercial enterprises (e.g., banks, insurance companies). Even today, in many large enterprises, transaction processing is done by legacy "batch" applications, which run offline and process accumulated transactions. Developers acknowledge the presence of multiple loosely coupled pieces of functionality within individual applications. Identifying such pieces of functionality (which we call "services") is desirable for the maintenance and evolution of these legacy applications. This is a hard problem, which enterprises grapple with, and one without satisfactory automated solutions. In this paper, we propose a novel static-analysis-based solution to the problem of identifying services within transaction-processing programs. We provide a formal characterization of services in terms of control-flow and data-flow properties, which is well-suited to the idioms commonly exhibited by business applications. Our technique combines program slicing with the detection of conditional code regions to identify services in accordance with our characterization. A preliminary evaluation, based on a manual analysis of three real business programs, indicates that our approach can be effective in identifying useful services from batch applications.
Resumo:
We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.