947 resultados para iterative determinant maximization
Resumo:
The results observed in this work support the view that coronary perfusion pressure affects ventricular performance independently of metabolic effects; a mechanism operating in beat-to-beat regulation is proposed.
Resumo:
A parameter-free variational iterative method is proposed for scattering problems. The present method yields results that are far better, in convergence, stability and precision, than any other momentum space method. Accurate result is obtained for the atomic exponential (Yukawa) potential with an estimated error of less than 1 in 1015 (1010) after some 13 (10) iterations.
Resumo:
This work develops two approaches based on the fuzzy set theory to solve a class of fuzzy mathematical optimization problems with uncertainties in the objective function and in the set of constraints. The first approach is an adaptation of an iterative method that obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. The second one is a metaheuristic approach that adapts a standard genetic algorithm to use fuzzy numbers. Both approaches use a decision criterion called satisfaction level that reaches the best solution in the uncertain environment. Selected examples from the literature are presented to compare and to validate the efficiency of the methods addressed, emphasizing the fuzzy optimization problem in some import-export companies in the south of Spain. © 2012 Brazilian Operations Research Society.
Resumo:
ABSTRACT: This work presents a method to analyze characteristics of a set of genes that can have an influence in a certain anomaly, such as a particular type of cancer. A measure is proposed with the objective of diagnosing individuals regarding the anomaly under study and some characteristics of the genes are analyzed. Maximum likelihood equations for general and particular cases are presented.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Introduction: Prognostic factors are used in the Intensive Care Unit (ICU) to predict morbidity and mortality , especially in patients on mechanical ventilation (MV ) . Training protocols are used in MV patients with the aim of promoting the success of the weaning process. Objective: To assess which variables determine the outcome of patients undergoing mechanical ventilation and compare the effects of two protocols for weaning. Method: Patients under MV for more than 48 hours had collected the following information: sex, age , ideal weight, height , Acute Physiology and Chronic Health Evaluation (APACHE II), risk of mortality, Glasgow Coma Scale (GCS) and index Quick and perfunctory (IRRS) breathing. Patients with unsuccessful weaning performed one of weaning protocols: Progressive T - tube or tube - T + Threshold ® IMT. Patients were compared for outcome (death or non- death in the ICU ) and the protocols through the t test or Mann-Whitney test was considered significant when P <0.05. Results: Of 128 patients evaluated 56.25% were men, the mean age was 60.05 ± 17.85 years and 40.62 % patients died, and they had higher APACHE II scores, mortality risk, time VM and IRRS GCS and the lower value (p<0.05). The age, initial and final maximal inspiratory pressure, time of weaning and duration of MV was similar between protocols. Conclusion: The study suggests that the GCS, APACHE II risk of mortality, length of MV and IRRS variables determined the evolution of MV patients in this sample. Not found differences in the variables studied when comparing the two methods of weaning.
Resumo:
Nicotinic acetylcholine receptors (nAChRs) have been studied in detail with regard to their interaction with therapeutic and drug addiction-related compounds. Using a structureactivity approach, we have examined the relationship among the molecular features of a set of eight para-R-substituted N,N-[(dimethylamino)ethyl] benzoate hydrochlorides, structurally related to procaine and their affinity for the a3 beta 4 nAChR heterologously expressed in KXa3 beta 4R2 cells. Affinity values (log[1/IC50]) of these compounds for the a3 beta 4 nAChR were determined by their competition with [3H]TCP binding. Log(1/IC50) values were analyzed considering different hydrophobic and electronic parameters and those related to molar refractivity. These have been experimentally determined or were taken from published literature. In accordance with literature observations, the generated cross-validated quantitative structureactivity relationship (QSAR) equations indicated a significant contribution of hydrophobic term to binding affinity of procaine analogs to the receptor and predicted affinity values for several local anesthetics (LAs) sets taken from the literature. The predicted values by using the QSAR model correlated well with the published values both for neuronal and for electroplaque nAChRs. Our work also reveals the general structure features of LAs that are important for interaction with nAChRs as well as the structural modifications that could be made to enhance binding affinity. (c) 2012 Wiley Periodicals, Inc.
Resumo:
We study the spectral functions, and in particular the zeta function, associated to a class of sequences of complex numbers, called of spectral type. We investigate the decomposability of the zeta function associated to a double sequence with respect to some simple sequence, and we provide a technique for obtaining the first terms in the Laurent expansion at zero of the zeta function associated to a double sequence.
Resumo:
This paper presents a new parallel methodology for calculating the determinant of matrices of the order n, with computational complexity O(n), using the Gauss-Jordan Elimination Method and Chio's Rule as references. We intend to present our step-by-step methodology using clear mathematical language, where we will demonstrate how to calculate the determinant of a matrix of the order n in an analytical format. We will also present a computational model with one sequential algorithm and one parallel algorithm using a pseudo-code.
Resumo:
[EN] Background: All the relevant risk factors contributing to breast cancer etiology are not fully known. Exposure to organochlorine pesticides has been linked to an increased incidence of the disease, although not all data have been consistent. Most published studies evaluated the exposure to organochlorines individually, ignoring the potential effects exerted by the mixtures of chemicals. Methods: This population-based study was designed to evaluate the profile of mixtures of organochlorines detected in 103 healthy women and 121 women diagnosed with breast cancer from Gran Canaria Island, and the relation between the exposure to these compounds and breast cancer risk.Results: The most prevalent mixture of organochlorines among healthy women was the combination of lindane and endrin, and this mixture was not detected in any affected women. Breast cancer patients presented more frequently a combination of aldrin, dichlorodiphenyldichloroethylene (DDE) and dichlorodiphenyldichloroethane (DDD), and this mixture was not found in any healthy woman. After adjusting for covariables, the risk of breast cancer was moderately associated with DDD (OR = 1.008, confidence interval 95% 1.001-1.015, p = 0.024).Conclusions: This study indicates that healthy women show a very different profile of organochlorine pesticide mixtures than breast cancer patients, suggesting that organochlorine pesticide mixtures could play a relevant role in breast cancer risk.
Resumo:
This Ph.D thesis focuses on iterative regularization methods for regularizing linear and nonlinear ill-posed problems. Regarding linear problems, three new stopping rules for the Conjugate Gradient method applied to the normal equations are proposed and tested in many numerical simulations, including some tomographic images reconstruction problems. Regarding nonlinear problems, convergence and convergence rate results are provided for a Newton-type method with a modified version of Landweber iteration as an inner iteration in a Banach space setting.
Resumo:
In the present dissertation we consider Feynman integrals in the framework of dimensional regularization. As all such integrals can be expressed in terms of scalar integrals, we focus on this latter kind of integrals in their Feynman parametric representation and study their mathematical properties, partially applying graph theory, algebraic geometry and number theory. The three main topics are the graph theoretic properties of the Symanzik polynomials, the termination of the sector decomposition algorithm of Binoth and Heinrich and the arithmetic nature of the Laurent coefficients of Feynman integrals.rnrnThe integrand of an arbitrary dimensionally regularised, scalar Feynman integral can be expressed in terms of the two well-known Symanzik polynomials. We give a detailed review on the graph theoretic properties of these polynomials. Due to the matrix-tree-theorem the first of these polynomials can be constructed from the determinant of a minor of the generic Laplacian matrix of a graph. By use of a generalization of this theorem, the all-minors-matrix-tree theorem, we derive a new relation which furthermore relates the second Symanzik polynomial to the Laplacian matrix of a graph.rnrnStarting from the Feynman parametric parameterization, the sector decomposition algorithm of Binoth and Heinrich serves for the numerical evaluation of the Laurent coefficients of an arbitrary Feynman integral in the Euclidean momentum region. This widely used algorithm contains an iterated step, consisting of an appropriate decomposition of the domain of integration and the deformation of the resulting pieces. This procedure leads to a disentanglement of the overlapping singularities of the integral. By giving a counter-example we exhibit the problem, that this iterative step of the algorithm does not terminate for every possible case. We solve this problem by presenting an appropriate extension of the algorithm, which is guaranteed to terminate. This is achieved by mapping the iterative step to an abstract combinatorial problem, known as Hironaka's polyhedra game. We present a publicly available implementation of the improved algorithm. Furthermore we explain the relationship of the sector decomposition method with the resolution of singularities of a variety, given by a sequence of blow-ups, in algebraic geometry.rnrnMotivated by the connection between Feynman integrals and topics of algebraic geometry we consider the set of periods as defined by Kontsevich and Zagier. This special set of numbers contains the set of multiple zeta values and certain values of polylogarithms, which in turn are known to be present in results for Laurent coefficients of certain dimensionally regularized Feynman integrals. By use of the extended sector decomposition algorithm we prove a theorem which implies, that the Laurent coefficients of an arbitrary Feynman integral are periods if the masses and kinematical invariants take values in the Euclidean momentum region. The statement is formulated for an even more general class of integrals, allowing for an arbitrary number of polynomials in the integrand.