29 resultados para Branching Processes with Immigration
Resumo:
A detailed study on the removal of pollutants (NOx, aldehydes and CO) from the exhaust of a stationary diesel engine is carried out using barrier discharge hybrid plasma techniques. The objective of the study is to make a comparative analysis. For this purpose, the exhaust treatment was carried out in two stages. In the first stage, the exhaust was treated with plasma process and plasma-adsorbent hybrid process. The effectiveness of the two processes with regard to NOx removal and by-product reduction was discussed. In the second stage, the exhaust was treated by plasma and plasma-catalyst hybrid process. The effectiveness of the two processes with regard to pollutants (NOx, CO) removal and by-product reduction was analyzed. Finally, a comprehensive comparison of different techniques has been made and feasible plasma based hybrid techniques for stationary and non-stationary engine exhaust treatments were proposed.
Resumo:
Since the last decade, there is a growing need for patterned biomolecules for various applications ranging from diagnostic devices to enabling fundamental biological studies with high throughput. Protein arrays facilitate the study of protein-protein, protein-drug or protein-DNA interactions as well as highly multiplexed immunosensors based on antibody-antigen recognition. Protein microarrays are typically fabricated using piezoelectric inkjet printing with resolution limit of similar to 70-100 mu m limiting the array density. A considerable amount of research has been done on patterning biomolecules using customised biocompatible photoresists. Here, a simple photolithographic process for fabricating protein microarrays on a commercially available diazo-naphthoquinone-novolac-positive tone photoresist functionalised with 3-aminopropyltriethoxysilane is presented. The authors demonstrate that proteins immobilised using this procedure retain their activity and therefore form functional microarrays with the array density limited only by the resolution of lithography, which is more than an order of magnitude compared with inkjet printing. The process described here may be useful in the integration of conventional semiconductor manufacturing processes with biomaterials relevant for the creation of next-generation bio-chips.
Resumo:
Ampcalculator (AMPC) is a Mathematica (c) based program that was made publicly available some time ago by Unterdorfer and Ecker. It enables the user to compute several processes at one loop (upto O(p(4))) in SU(3) chiral perturbation theory. They include computing matrix elements and form factors for strong and non-leptonic weak processes with at most six external states. It was used to compute some novel processes and was tested against well-known results by the original authors. Here we present the results of several thorough checks of the package. Exhaustive checks performed by the original authors are not publicly available, and hence the present effort. Some new results are obtained from the software especially in the kaon odd-intrinsic parity non-leptonic decay sector involving the coupling G(27). Another illustrative set of amplitudes at tree level we provide is in the context of tau-decays with several mesons including quark mass effects, of use to the BELLE experiment. All eight meson-meson scattering amplitudes have been checked. The Kaon-Compton amplitude has been checked and a minor error in the published results has been pointed out. This exercise is a tutorial-based one, wherein several input and output notebooks are also being made available as ancillary files on the arXiv. Some of the additional notebooks we provide contain explicit expressions that we have used for comparison with established results. The purpose is to encourage users to apply the software to suit their specific needs. An automatic amplitude generator of this type can provide error-free outputs that could be used as inputs for further simplification, and in varied scenarios such as applications of chiral perturbation theory at finite temperature, density and volume. This can also be used by students as a learning aid in low-energy hadron dynamics.
Resumo:
Background: Taxol (generic name paclitaxel), a plant-derived antineoplastic agent, used widely against breast, ovarian and lung cancer, was originally isolated from the bark of the Pacific yew, Taxus brevifolia. The limited supply of the drug has prompted efforts to find alternative sources, such as chemical synthesis, tissue and cell cultures of the Taxus species both of which are expensive and yield low levels. Fermentation processes with microorganisms would be the methods of choice to lower the costs and increase yields. Previously we have reported that F. solani isolated from T. celebica produced taxol and its precursor baccatin III in liquid grown cultures J Biosci 33: 259-67, 2008. This study was performed to evaluate the inhibition of proliferation and induction of apoptosis of cancer cell lines by the fungal taxol and fungal baccatin III of F. solani isolated from T. celebica. Methods: Cell lines such as HeLa, HepG2, Jurkat, Ovcar3 and T47D were cultured individually and treated with fungal taxol, baccatin III with or without caspase inhibitors according to experimental requirements. Their efficacy on apoptotic induction was examined. Results: Both fungal taxol and baccatin III inhibited cell proliferation of a number of cancer cell lines with IC50 ranging from 0.005 to 0.2 mu M for fungal taxol and 2 to 5 mu M for fungal baccatin III. They also induced apoptosis in JR4-Jurkat cells with a possible involvement of anti-apoptotic Bcl2 and loss in mitochondrial membrane potential, and was unaffected by inhibitors of caspase-9,-2 or -3 but was prevented in presence of caspase-10 inhibitor. DNA fragmentation was also observed in cells treated with fungal taxol and baccatin III. Conclusions: The cytotoxic activity exhibited by fungal taxol and baccatin III involves the same mechanism, dependent on caspase-10 and membrane potential loss of mitochondria, with taxol having far greater cytotoxic potential.
Resumo:
The goal of this work is to reduce the cost of computing the coefficients in the Karhunen-Loeve (KL) expansion. The KL expansion serves as a useful and efficient tool for discretizing second-order stochastic processes with known covariance function. Its applications in engineering mechanics include discretizing random field models for elastic moduli, fluid properties, and structural response. The main computational cost of finding the coefficients of this expansion arises from numerically solving an integral eigenvalue problem with the covariance function as the integration kernel. Mathematically this is a homogeneous Fredholm equation of second type. One widely used method for solving this integral eigenvalue problem is to use finite element (FE) bases for discretizing the eigenfunctions, followed by a Galerkin projection. This method is computationally expensive. In the current work it is first shown that the shape of the physical domain in a random field does not affect the realizations of the field estimated using KL expansion, although the individual KL terms are affected. Based on this domain independence property, a numerical integration based scheme accompanied by a modification of the domain, is proposed. In addition to presenting mathematical arguments to establish the domain independence, numerical studies are also conducted to demonstrate and test the proposed method. Numerically it is demonstrated that compared to the Galerkin method the computational speed gain in the proposed method is of three to four orders of magnitude for a two dimensional example, and of one to two orders of magnitude for a three dimensional example, while retaining the same level of accuracy. It is also shown that for separable covariance kernels a further cost reduction of three to four orders of magnitude can be achieved. Both normal and lognormal fields are considered in the numerical studies. (c) 2014 Elsevier B.V. All rights reserved.
Resumo:
STOAT has been extensively used for the dynamic simulation of an activated sludge based wastewater treatment plant in the Titagarh Sewage Treatment Plant, near Kolkata, India. Some alternative schemes were suggested. Different schemes were compared for the removal of Total Suspended Solids (TSS), b-COD, ammonia, nitrates etc. A combination of IAWQ#1 module with the Takacs module gave best results for the existing scenarios of the Titagarh Sewage Treatment Plant. The modified Bardenpho process was found most effective for reducing the mean b-COD level to as low as 31.4 mg/l, while the mean TSS level was as high as 100.98 mg/l as compared to the mean levels of TSS (92 62 mg/l) and b-COD (92.0 mg/l) in the existing plant. Scheme 2 gave a better scenario for the mean TSS level bringing it down to a mean value of 0.4 mg/l, but a higher mean value for the b-COD level at 54.89 mg/l. The Scheme Final could reduce the mean TSS level to 2.9 mg/l and the mean b-COD level to as low as 38.8 mg/l. The Final Scheme looks to be a technically viable scheme with respect to the overall effluent quality for the plant. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
This paper studies:(i)the long-time behaviour of the empirical distribution of age and normalized position of an age-dependent critical branching Markov process conditioned on non-extinction;and (ii) the super-process limit of a sequence of age-dependent critical branching Brownian motions.
Resumo:
This paper studies the long-time behavior of the empirical distribution of age and normalized position of an age-dependent supercritical branching Markov process. The motion of each individual during its life is a random function of its age. It is shown that the empirical distribution of the age and the normalized position of all individuals alive at time t converges as t -> infinity to a deterministic product measure.
Resumo:
We develop in this article the first actor-critic reinforcement learning algorithm with function approximation for a problem of control under multiple inequality constraints. We consider the infinite horizon discounted cost framework in which both the objective and the constraint functions are suitable expected policy-dependent discounted sums of certain sample path functions. We apply the Lagrange multiplier method to handle the inequality constraints. Our algorithm makes use of multi-timescale stochastic approximation and incorporates a temporal difference (TD) critic and an actor that makes a gradient search in the space of policy parameters using efficient simultaneous perturbation stochastic approximation (SPSA) gradient estimates. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal policy. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Hyperbranched polyurethanes, with varying oligoethyleneoxy spacer segments between the branching points, have been synthesized by a one-pot approach starting from the appropriately designed carbonyl azide that incorporates the different spacer segments. The structures of monomers and polymers were confirmed by IR and H-1-NMR spectroscopy. The solution viscosity of the polymers suggested that they were of reasonably high molecular weight. Reversal of terminal functional groups was achieved by preparing the appropriate monohydroxy dicarbonyl azide monomer. The large number of terminal isocyanate groups at the chain ends of such hyperbranched macromolecules caused them to crosslink prior to its isolation. However, carrying out the polymerization in the presence of 1 equiv of a capping agent, such as an alcohol, resulted in soluble polymers with carbamate chain ends. Using a biphenyl-containing alcohol as a capping agent, we have also prepared novel hyperbranched perbranched polyurethanes with pendant mesogenic segments. These mesogen-containing polyurethanes, however, did not exhibit liquid crystallinity probably due to the wholly aromatic rigid polymer backbone. (C) 1996 John Wiley & Sons, Inc.
Resumo:
The flow and vaporization behaviors of long-chain esters of varying molecular weights (300-900) ana branching (linear, Y-shaped, and +-shaped molecules) have been studied. The flow behavior is found to depend on the structure as well as the molecular weight. Below a molecular weight of 600, the molecules flow wholly but above this, segmental motion occurs, and the flow becomes independent of the molecular weight which is explained from the blob model. The blob concept demonstrates that the hole of a size of about 11 angstrom is needed for the flow to occur and it is much less than the size of the molecule. The blob size is observed to slightly decrease along the series linear and Y- and +-branched esters. The heat of vaporization is found to be independent of the molecular structure since the molecules acquire a coiled spherical shape during vaporization and hence depends only on the molecular weight. A significant structural effect is observed for the esters on their glass transition temperature (T(g)). The T(g) vs molecular weight plot displays contrasting trend for linear and +-branched esters, with Y esters showing an intermediate behavior. It is explained from their molecular packing and entanglement as visualized by the blob model.
Resumo:
We develop an online actor-critic reinforcement learning algorithm with function approximation for a problem of control under inequality constraints. We consider the long-run average cost Markov decision process (MDP) framework in which both the objective and the constraint functions are suitable policy-dependent long-run averages of certain sample path functions. The Lagrange multiplier method is used to handle the inequality constraints. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal solution. We also provide the results of numerical experiments on a problem of routing in a multi-stage queueing network with constraints on long-run average queue lengths. We observe that our algorithm exhibits good performance on this setting and converges to a feasible point.
Resumo:
Accurate supersymmetric spectra are required to confront data from direct and indirect searches of supersymmetry. SuSeFLAV is a numerical tool capable of computing supersymmetric spectra precisely for various supersymmetric breaking scenarios applicable even in the presence of flavor violation. The program solves MSSM RGEs with complete 3 x 3 flavor mixing at 2-loop level and one loop finite threshold corrections to all MSSM parameters by incorporating radiative electroweak symmetry breaking conditions. The program also incorporates the Type-I seesaw mechanism with three massive right handed neutrinos at user defined mass scales and mixing. It also computes branching ratios of flavor violating processes such as l(j) -> l(i)gamma, l(j) -> 3 l(i), b -> s gamma and supersymmetric contributions to flavor conserving quantities such as (g(mu) - 2). A large choice of executables suitable for various operations of the program are provided. Program summary Program title: SuSeFLAV Catalogue identifier: AEOD_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEOD_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License No. of lines in distributed program, including test data, etc.: 76552 No. of bytes in distributed program, including test data, etc.: 582787 Distribution format: tar.gz Programming language: Fortran 95. Computer: Personal Computer, Work-Station. Operating system: Linux, Unix. Classification: 11.6. Nature of problem: Determination of masses and mixing of supersymmetric particles within the context of MSSM with conserved R-parity with and without the presence of Type-I seesaw. Inter-generational mixing is considered while calculating the mass spectrum. Supersymmetry breaking parameters are taken as inputs at a high scale specified by the mechanism of supersymmetry breaking. RG equations including full inter-generational mixing are then used to evolve these parameters up to the electroweak breaking scale. The low energy supersymmetric spectrum is calculated at the scale where successful radiative electroweak symmetry breaking occurs. At weak scale standard model fermion masses, gauge couplings are determined including the supersymmetric radiative corrections. Once the spectrum is computed, the program proceeds to various lepton flavor violating observables (e.g., BR(mu -> e gamma), BR(tau -> mu gamma) etc.) at the weak scale. Solution method: Two loop RGEs with full 3 x 3 flavor mixing for all supersymmetry breaking parameters are used to compute the low energy supersymmetric mass spectrum. An adaptive step size Runge-Kutta method is used to solve the RGEs numerically between the high scale and the electroweak breaking scale. Iterative procedure is employed to get the consistent radiative electroweak symmetry breaking condition. The masses of the supersymmetric particles are computed at 1-loop order. The third generation SM particles and the gauge couplings are evaluated at the 1-loop order including supersymmetric corrections. A further iteration of the full program is employed such that the SM masses and couplings are consistent with the supersymmetric particle spectrum. Additional comments: Several executables are presented for the user. Running time: 0.2 s on a Intel(R) Core(TM) i5 CPU 650 with 3.20 GHz. (c) 2012 Elsevier B.V. All rights reserved.
Resumo:
We present a novel multi-timescale Q-learning algorithm for average cost control in a Markov decision process subject to multiple inequality constraints. We formulate a relaxed version of this problem through the Lagrange multiplier method. Our algorithm is different from Q-learning in that it updates two parameters - a Q-value parameter and a policy parameter. The Q-value parameter is updated on a slower time scale as compared to the policy parameter. Whereas Q-learning with function approximation can diverge in some cases, our algorithm is seen to be convergent as a result of the aforementioned timescale separation. We show the results of experiments on a problem of constrained routing in a multistage queueing network. Our algorithm is seen to exhibit good performance and the various inequality constraints are seen to be satisfied upon convergence of the algorithm.