917 resultados para Inverse Problem in Optics
Resumo:
The heat conduction problem, in the presence of a change of state, was solved for the case of an indefinitely long cylindrical layer cavity. As boundary conditions, it is imposed that the internal surface of the cavity is maintained below the fusion temperature of the infilling substance and the external surface is kept above it. The solution, obtained in nondimensional variables, consists in two closed form heat conduction equation solutions for the solidified and liquid regions, which formally depend of the, at first, unknown position of the phase change front. The energy balance through the phase change front furnishes the equation for time dependence of the front position, which is numerically solved. Substitution of the front position for a particular instant in the heat conduction equation solutions gives the temperature distribution inside the cavity at that moment. The solution is illustrated with numerical examples. [DOI: 10.1115/1.4003542]
Resumo:
Malaria is still a major health problem in developing countries. It is caused by the protist parasite Plasmodium, in which proteases are activated during the cell cycle. Ca(2+) is a ubiquitous signalling ion that appears to regulate protease activity through changes in its intracellular concentration. Proteases are crucial to Plasmodium development, but the role of Ca(2+) in their activity is not fully understood. Here we investigated the role of Ca(2+) in protease modulation among rodent Plasmodium spp. Using fluorescence resonance energy transfer (FRET) peptides, we verified protease activity elicited by Ca(2+) from the endoplasmatic reticulum (ER) after stimulation with thapsigargin (a sarco/endoplasmatic reticulum Ca(2+)-ATPase (SERCA) inhibitor) and from acidic compartments by stimulation with nigericin (a K(+)/H(+) exchanger) or monensin (a Na(+)/H(+) exchanger). Intracellular (BAPTA/AM) and extracellular (EGTA) Ca(2+) chelators were used to investigate the role played by Ca(2+) in protease activation. In Plasmodium berghei both EGTA and BAPTA blocked protease activation, whilst in Plasmodium yoelii these compounds caused protease activation. The effects of protease inhibitors on thapsigargin-induced proteolysis also differed between the species. Pepstatin A and phenylmethylsulphonyl fluoride (PMSF) increased thapsigargin-induced proteolysis in P. berghei but decreased it in P. yoelii. Conversely. E64 reduced proteolysis in P. berghei but stimulated it in P. yoelii. The data point out key differences in proteolytic responses to Ca(2+) between species of Plasmodium. (C) 2011 Australian Society for Parasitology Inc. Published by Elsevier Ltd. All rights reserved.
Resumo:
Drug abuse is a concerning health problem in adults and has been recognized as a major problem in adolescents. induction of immediate-early genes (IEG), such as c-Fos or Egr-1, is used to identify brain areas that become activated in response to various stimuli, including addictive drugs. It is known that the environment can alter the response to drugs of abuse. Accordingly, environmental cues may trigger drug-seeking behavior when the drug is repeatedly administered in a given environment. The goal of this study was first to examine for age differences in context-dependent sensitization and then evaluate IEG expression in different brain regions. For this, groups of mice received i.p. ethanol (2.0 g/kg) or saline in the test apparatus, while other groups received the solutions in the home cage, for 15 days. One week after this treatment phase, mice were challenged with ethanol injection. Acutely, ethanol increased both locomotor activity and IEG expression in different brain regions, indistinctly, in adolescent and adult mice. However, adults exhibited a typical context-dependent behavioral sensitization following repeated ethanol treatment, while adolescent mice presented gradually smaller locomotion across treatment, when ethanol was administered in a paired regimen with environment. Conversely, ethanol-treated adolescents expressed context-independent behavioral sensitization. Overall, repeated ethanol administration desensitized IEG expression in both adolescent and adult mice, but this effect was greatest in the nucleus accumbens and prefrontal cortex of adolescents treated in the context-dependent paradigm. These results suggest developmental differences in the sensitivity to the conditioned and unconditioned locomotor effects of ethanol. (C) 2008 Elsevier B.V. All rights reserved.
Resumo:
Resistance of Leishmania parasites to specific chemotherapy has become a well-documented problem in the Indian subcontinent in recent years but only a few studies have focused on the susceptibility of American Leishmania isolates. Our susceptibility assays to meglumine antimoniate were performed against intracellular amastigotes after standardizing an in vitro model of macrophage infection appropriate for Leishmania (Viannia) braziliensis isolates. For the determination of promastigote susceptibility to amphotericin B, we developed a simplified MTT-test. The sensitivity in vitro to meglumine antimoniate and amphotericin B of 13 isolates obtained from Brazilian patients was determined. L. (V.) braziliensis isolates were more susceptible to meglumine antimoniate than Leishmania (Leishmania) amazonensis. EC(50), EC(90) and activity indexes (calculated over the sensitivity of reference strains), suggested that all isolates tested were susceptible in vitro to meglumine antimoniate, and did not show association with the clinical outcomes. Isolates were also uniformly susceptible in vitro to amphotericin B.
Resumo:
Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
In this paper we conclude the analysis started in [J.M. Arrieta, AN Carvalho, G. Lozada-Cruz, Dynamics in dumbbell domains I. Continuity of the set of equilibria, J. Differential Equations 231 (2006) 551-597] and continued in [J.M. Arrieta, AN Carvalho, G. Lozada-Cruz, Dynamics in dumbbell domains II. The limiting problem, J. Differential Equations 247 (1) (2009) 174-202 (this issue)] concerning the behavior of the asymptotic dynamics of a dissipative reaction-diffusion equation in a dumbbell domain as the channel shrinks to a line segment. In [J.M. Arrieta, AN Carvalho. G. Lozada-Cruz, Dynamics in dumbbell domains I. Continuity of the set of equilibria, J. Differential Equations 231 (2006) 551-597], we have established an appropriate functional analytic framework to address this problem and we have shown the continuity of the set of equilibria. In [J.M. Arrieta, AN Carvalho, G. Lozada-Cruz. Dynamics in dumbbell domains II. The limiting problem, J. Differential Equations 247 (1) (2009) 174-202 (this issue)], we have analyzed the behavior of the limiting problem. In this paper we show that the attractors are Upper semicontinuous and, moreover, if all equilibria of the limiting problem are hyperbolic, then they are lower semicontinuous and therefore, continuous. The continuity is obtained in L(p) and H(1) norms. (C) 2008 Elsevier Inc. All rights reserved.
Resumo:
We consider an agricultural production problem, in which one must meet a known demand of crops while respecting ecologically-based production constraints. The problem is twofold: in order to meet the demand, one must determine the division of the available heterogeneous arable areas in plots and, for each plot, obtain an appropriate crop rotation schedule. Rotation plans must respect ecologically-based constraints such as the interdiction of certain crop successions, and the regular insertion of fallows and green manures. We propose a linear formulation for this problem, in which each variable is associated with a crop rotation schedule. The model may include a large number of variables and it is, therefore, solved by means of a column-generation approach. We also discuss some extensions to the model, in order to incorporate additional characteristics found in field conditions. A set of computational tests using instances based on real-world data confirms the efficacy of the proposed methodology. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
Recently the paper ""Schwinger mechanism for gluon pair production in the presence of arbitrary time dependent chromo-electric field"" by G. C. Nayak was published [Eur. Phys. J. C 59: 715, 2009; arXiv:0708.2430]. Its aim is to obtain an exact expression for the probability of non-perturbative gluon pair production per unit time per unit volume and per unit transverse momentum in an arbitrary time-dependent chromo-electric background field. We believe that the obtained expression is open to question. We demonstrate its inconsistency on some well-known examples. We think that this is a consequence of using the socalled ""shift theorem""[arXiv:hep-th/0609192] in deriving the expression for the probability. We make some critical comments on the theorem and its applicability to the problem in question.
Resumo:
In this article, we introduce a semi-parametric Bayesian approach based on Dirichlet process priors for the discrete calibration problem in binomial regression models. An interesting topic is the dosimetry problem related to the dose-response model. A hierarchical formulation is provided so that a Markov chain Monte Carlo approach is developed. The methodology is applied to simulated and real data.
Resumo:
BACKGROUND: A major problem in Chagas disease donor screening is the high frequency of samples with inconclusive results. The objective of this study was to describe patterns of serologic results among donors to the three Brazilian REDS-II blood centers and correlate with epidemiologic characteristics. STUDY DESIGN AND METHODS: The centers screened donor samples with one Trypanosoma cruzi lysate enzyme immunoassay (EIA). EIA-reactive samples were tested with a second lysate EIA, a recombinant-antigen based EIA, and an immunfluorescence assay. Based on the serologic results, samples were classified as confirmed positive (CP), probable positive (PP), possible other parasitic infection (POPI), and false positive (FP). RESULTS: In 2007 to 2008, a total of 877 of 615,433 donations were discarded due to Chagas assay reactivity. The prevalences (95% confidence intervals [CIs]) among first-time donors for CP, PP, POPI, and FP patterns were 114 (99-129), 26 (19-34), 10 (5-14), and 96 (82-110) per 100,000 donations, respectively. CP and PP had similar patterns of prevalence when analyzed by age, sex, education, and location, suggesting that PP cases represent true T. cruzi infections; in contrast the demographics of donors with POPI were distinct and likely unrelated to Chagas disease. No CP cases were detected among 218,514 repeat donors followed for a total of 718,187 person-years. CONCLUSION: We have proposed a classification algorithm that may have practical importance for donor counseling and epidemiologic analyses of T. cruzi-seroreactive donors. The absence of incident T. cruzi infections is reassuring with respect to risk of window phase infections within Brazil and travel-related infections in nonendemic countries such as the United States.
Resumo:
This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.
Resumo:
Ghana faces a macroeconomic problem of inflation for a long period of time. The problem in somehow slows the economic growth in this country. As we all know, inflation is one of the major economic challenges facing most countries in the world especially those in African including Ghana. Therefore, forecasting inflation rates in Ghana becomes very important for its government to design economic strategies or effective monetary policies to combat any unexpected high inflation in this country. This paper studies seasonal autoregressive integrated moving average model to forecast inflation rates in Ghana. Using monthly inflation data from July 1991 to December 2009, we find that ARIMA (1,1,1)(0,0,1)12 can represent the data behavior of inflation rate in Ghana well. Based on the selected model, we forecast seven (7) months inflation rates of Ghana outside the sample period (i.e. from January 2010 to July 2010). The observed inflation rate from January to April which was published by Ghana Statistical Service Department fall within the 95% confidence interval obtained from the designed model. The forecasted results show a decreasing pattern and a turning point of Ghana inflation in the month of July.
Resumo:
The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.
Resumo:
Written about the time of the Golden Venture incident, Chang-rae Lee’s Native Speaker makes a particular reference to that incident, whereby implying that particular immigrants, on the grounds of their racial identities, are mistreated and considered as aliens by some Americas. While some whites discriminate against immigrants, there is widespread ethnic tension between Korean Americans and African Americans. Significantly, racial conflict between Koreans and blacks and the racist attitude of some whites toward immigrants are mirrored in the relationship between the Korean-American protagonist Henry and his American wife Lelia. That is, due to their different racial identities they do not understand each other and they always argue. However, toward the end of the novel, Henry and Lelia come to understand each other. While ethnic conflict between Koreans and blacks and certain whites’ discriminatory attitudes toward immigrants is serious one, the novel suggests the unimportance of racial identity. In other words, the novel concludes that there is no discriminatory treatment of immigrants and, in fact, every one is a native Speaker in America. In the novel there is no message of how racial conflict could be resolved. However, this essay suggests that by investigating how the tension between Henry and Lelia is resolved, one could suggest a solution for the ethnicity problem in America and in real life.