6 resultados para Asymmetric Coplanar Strip

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We analyze by numerical simulations and mean-field approximations an asymmetric version of the stochastic sandpile model with height restriction in one dimension. Each site can have at most two particles. Single particles are inactive and do not move. Two particles occupying the same site are active and may hop to neighboring sites following an asymmetric rule. Jumps to the right or to the left occur with distinct probabilities. In the active state, there will be a net current of particles to the right or to the left. We have found that the critical behavior related to the transition from the active to the absorbing state is distinct from the symmetrical case, making the asymmetry a relevant field.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the dynamics of cargo driven by a collection of interacting molecular motors in the context of ail asymmetric simple exclusion process (ASEP). The model is formulated to account for (i) excluded-volume interactions, (ii) the observed asymmetry of the stochastic movement of individual motors and (iii) interactions between motors and cargo. Items (i) and (ii) form the basis of ASEP models and have already been considered to study the behavior of motor density profile [A. Parmeggiani. T. Franosch, E. Frey, Phase Coexistence in driven one-dimensional transport, Phys. Rev. Lett. 90 (2003) 086601-1-086601-4]. Item (iii) is new. It is introduced here as an attempt to describe explicitly the dependence of cargo movement on the dynamics of motors in this context. The steady-state Solutions Of the model indicate that the system undergoes a phase transition of condensation type as the motor density varies. We study the consequences of this transition to the behavior of the average cargo velocity. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background: The definitive diagnosis of visceral. leishmaniasis (VL) requires invasive procedures with demonstration of amastigotes in tissue or promastigotes in culture. Unfortunately, these approaches require laboratory materials not available in poor countries where the disease is endemic. The correct diagnosis of VL is important, and made more difficult by the fact that several common tropical diseases such as malaria, disseminated tuberculosis, and enteric fever share the same clinical presentation. Serological tests have been developed to replace parasitological diagnosis in the field. A commercially available K39-based strip test for VL has been developed for this purpose. The endemic area of leishmaniasis in Brazil overlaps the endemic area of Chagas disease, a disease that can cause false-positive serological test results. The aim of this study was to evaluate the incidence of false-positive exams using a rapid test for VL in patients with Chagas disease. Methods: A rapid test based on the recombinant K39 antigen of Leishmania was used in: (1) 30 patients with confirmed Chagas disease, (2) 30 patients with a serological diagnosis of Chagas disease by ELISA, indirect immunofluorescence, indirect hemagglutination, and chemiluminescence, (3) 30 healthy patients from a non-endemic area as the control group, (4) 30 patients with confirmed VL, and (5) 20 patients with proved cutaneous leishmaniasis. Results: The sensitivity and specificity of the rapid strip test were 100% when compared with healthy volunteers and those with confirmed Chagas disease. One false-positive result occurred in the group with Chagas disease diagnosed by serological tests (specificity of 96%). Conclusion: The rapid test based on recombinant K39 is a useful diagnostic assay, and a false-positive result rarely occurs in patients with a serological diagnosis of Chagas disease. (C) 2008 International Society for Infectious Diseases. Published by Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Consider the following problem: Forgiven graphs G and F(1),..., F(k), find a coloring of the edges of G with k colors such that G does not contain F; in color i. Rodl and Rucinski studied this problem for the random graph G,,, in the symmetric case when k is fixed and F(1) = ... = F(k) = F. They proved that such a coloring exists asymptotically almost surely (a.a.s.) provided that p <= bn(-beta) for some constants b = b(F,k) and beta = beta(F). This result is essentially best possible because for p >= Bn(-beta), where B = B(F, k) is a large constant, such an edge-coloring does not exist. Kohayakawa and Kreuter conjectured a threshold function n(-beta(F1,..., Fk)) for arbitrary F(1), ..., F(k). In this article we address the case when F(1),..., F(k) are cliques of different sizes and propose an algorithm that a.a.s. finds a valid k-edge-coloring of G(n,p) with p <= bn(-beta) for some constant b = b(F(1),..., F(k)), where beta = beta(F(1),..., F(k)) as conjectured. With a few exceptions, this algorithm also works in the general symmetric case. We also show that there exists a constant B = B(F,,..., Fk) such that for p >= Bn(-beta) the random graph G(n,p) a.a.s. does not have a valid k-edge-coloring provided the so-called KLR-conjecture holds. (C) 2008 Wiley Periodicals, Inc. Random Struct. Alg., 34, 419-453, 2009

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Increased diastereoisomeric excesses are obtained for the sulfanylation reactions of some 2-methylsulfinyl cyclanones under phase-transfer catalysis using the chiral catalyst QUIBEC instead of TEBA. The optically pure (SS,2S)-2-methylsulfinyl-2-methylsulfanylcyclohexanone thus prepared reacts with ethyl acetate lithium enolate affording, after hydrolysis, (R)-2-[(ethoxycarbonyl)methyl]-2-hydroxycyclohexanone in 60% ee. Density functional theory calculations (at the B3LYP/6-311++G(d,p) level) can successfully explain the origin of this result as the kinetically favored axial attack of the nucleophile to the carbonyl group of the most stable conformer of the cyclanone, in which the CH(3)SO and CH(3)S groups are at the equatorial and axial positions, respectively. (C) 2010 Elsevier Ltd. All rights reserved.