Using interval graphs in an order processing optimization problem

In this paper we address an order processing optimization problem known as minimization of open stacks (MOSP). We present an integer pro gramming model, based on the existence of a perfect elimination scheme in interval graphs, which finds an optimal sequence for the costumers orders.

NEPHROTOXICITY ATTRIBUTED TO MEGLUMINE ANTIMONIATE (GLUCANTIME) IN THE TREATMENT OF GENERALIZED CUTANEOUS LEISHMANIASIS

Background: Pentavalent antimonials have became of basic importance for the treatment of leishmaniasis. Their most severe side effects have been reported to be increased hepatic enzyme levels and electrocardiographic abnormalities. Nephrotoxicity has been rarely related. Observations: We report a case of generalized cutaneous leishmaniasis involving a 50-year old male patient who was submitted to treatment with meglumine antimoniate (Glucantime). He developed acute renal failure (ARF) due to acute tubular necrosis (ATN), followed by death after receiving a total of 53 ampoules of Glucantime. Conclusions: The treatment with Glucantime was responsible by ARF diagnosed in this patient. The previous urine osmolarity and serum creatinine levels were normal and the autopsy showed ATN. It should be pointed out if ARF may also be explained by massive deposits of immunocomplexes by leishmania antibodies and antigens due to the antigenic break by the antimonial compound, since our patient presented countless lesions covering the entire tegument, similar to the Hexheimer phenomenon, but at the autopsy no glomerular alterations were seen.

Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP 2015). 4 to 6, Mar, 2015. Turku, Finland.

Description of continuous data using bar graphs: a misleading approach

INTRODUCTION:With the ease provided by current computational programs, medical and scientific journals use bar graphs to describe continuous data.METHODS:This manuscript discusses the inadequacy of bars graphs to present continuous data.RESULTS:Simulated data show that box plots and dot plots are more-feasible tools to describe continuous data.CONCLUSIONS:These plots are preferred to represent continuous variables since they effectively describe the range, shape, and variability of observations and clearly identify outliers. By contrast, bar graphs address only measures of central tendency. Bar graphs should be used only to describe qualitative data.

Mortality attributed to myocardial infarction in the male and female population of Salvador, BA, between 1981 and 1996

OBJECTIVE: To describe according to gender the trend in mortality attributed to myocardial infarction (MI) in the population of Salvador, Bahia between 1981 and 1996. METHODS: This study was on mortality due to MI estimates by period and gender of the city of Salvador, Bahia. Data from 1981 to 1996 were stratified by quadrienia, and the percentage reduction in death rate due to MI relative to the preceding period (PRR) was determined. Comparisons between genders were expressed by the male/female death ratio (DR) based on the gender-related PPR. RESULTS: An overall increase of approximately 8% was observed in the death rate attributed to MI for the period 1985-1988 (89.2/10 5 individuals / year) versus the period 1981-1984 (82.1/10(5)/ year). In the subsequent periods, overall reductions of 10% and 20.3% were observed for the periods 1989-1992 and 1993-1996, respectively. For men, the PPRs were 11.1 in the period 1989-1992 and 22.7% in the period 1993-1996. The PPRs in women were lower: 8.6% and 17.4% between 1989 and 1992, and 1993 and 1996, respectively. Death rate reduction was greater for men than women, then the male/female DR decreased from 1.66 in 1981-1984 to 1.35 in 1993-1996. CONCLUSION: The results indicate a trend towards a reduction in the death rate attributed to myocardial infarction in the city of Salvador from the second half of the 1980s onwards, striking in men.

On the number of K3,3-minor-free and maximal K3,3-minor-free graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

On the growth rate of minor-closed classes of graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

On graphs with few disjoint t-stars

"Vegeu el resum a l'inici del document del fitxer adjunt."

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

In a seminal paper [10], Weitz gave a deterministic fully polynomial approximation scheme for counting exponentially weighted independent sets (which is the same as approximating the partition function of the hard-core model from statistical physics) in graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the innite d-regular tree. ore recently Sly [8] (see also [1]) showed that this is optimal in the sense that if here is an FPRAS for the hard-core partition function on graphs of maximum egree d for activities larger than the critical activity on the innite d-regular ree then NP = RP. In this paper we extend Weitz's approach to derive a deterministic fully polynomial approximation scheme for the partition function of general two-state anti-ferromagnetic spin systems on graphs of maximum degree d, up to the corresponding critical point on the d-regular tree. The main ingredient of our result is a proof that for two-state anti-ferromagnetic spin systems on the d-regular tree, weak spatial mixing implies strong spatial mixing. his in turn uses a message-decay argument which extends a similar approach proposed recently for the hard-core model by Restrepo et al [7] to the case of general two-state anti-ferromagnetic spin systems.

Comparing Multilevel Clustering Methods on Weighted Graphs : The Case of Worldwide Air Passenger Traffic 2000-2004

Specific properties emerge from the structure of large networks, such as that of worldwide air traffic, including a highly hierarchical node structure and multi-level small world sub-groups that strongly influence future dynamics. We have developed clustering methods to understand the form of these structures, to identify structural properties, and to evaluate the effects of these properties. Graph clustering methods are often constructed from different components: a metric, a clustering index, and a modularity measure to assess the quality of a clustering method. To understand the impact of each of these components on the clustering method, we explore and compare different combinations. These different combinations are used to compare multilevel clustering methods to delineate the effects of geographical distance, hubs, network densities, and bridges on worldwide air passenger traffic. The ultimate goal of this methodological research is to demonstrate evidence of combined effects in the development of an air traffic network. In fact, the network can be divided into different levels of âeurooecohesionâeuro, which can be qualified and measured by comparative studies (Newman, 2002; Guimera et al., 2005; Sales-Pardo et al., 2007).

On a family of strongly regular graphs with λ = 1

Vegeu el resum a l'inici del document del fitxer adjunt.

Reasons and meanings attributed by women who experienced induced abortion: an integrative review

OBJECTIVE Identifying the contribution of developed research on what motivates women to induce an abortion and the meaning attributed to these experiences in their lives. METHOD An integrative review conducted in MEDLINE/PubMed, LILACS, BDENF, CINAHL and SciELO databases, covering the periods from 2001 to 2011. RESULTS We selected and analyzed 11 studies with selection criteria being reasons given by women for inducing abortion and/or the meaning attributed to this experience in their lives, including social, religious, ethical and moral aspects related to this practice, as well as the suffering experienced from the experience. The illegality of abortion is identified as a risk factor for unsafe abortions, reaffirming this issue as a public health and social justice problem. CONCLUSION Results evidence aspects that can contribute to improving health quality and ratify the importance of research to support nursing practices.