Mortality problems in Brazil and in Germany: past-present-future. Learning from each other?

This article was written by a Swiss-German historical demographer after having visited different Brazilian Universities in 1984 as a guest-professor. It aims at promoting a real dialog between developed and developing countries, commencing the discussion with the question: Can we learn from each other? An affirmative answer is given, but not in the superficial manner in which the discussion partners simply want to give each other some "good advice" or in which the one declares his country's own development to be the solely valid standard. Three points are emphasized: 1. Using infant mortality in S. Paulo from 1908 to 1983 as an example, it is shown that Brazil has at its disposal excellent, highly varied research literature that is unjustifiably unknown to us (in Europe) for the most part. Brazil by no means needs our tutoring lessons as regards the causal relationships; rather, we could learn two things from Brazil about this. For one, it becomes clear that our almost exclusively medical-biological view is inappropriate for passing a judgment on the present-day problems in Brazil and that any conclusions so derived are thus only transferable to a limited extent. For another, we need to reinterpret the history of infant mortality in our own countries up to the past few decades in a much more encompassing "Brazilian" sense. 2. A fruitful dialog can only take place if both partners frankly present their problems. For this reason, the article refers with much emprasis to our present problems in dealing with death and dying - problems arising near the end of the demographic and epidemiologic transitions: the superanuation of the population, chronic-incurable illnesses as the main causes of death, the manifold dependencies of more and more elderly and really old people at the end of a long life. Brazil seems to be catching up to us in this and will be confronted with these problems sooner or later. A far-sighted discussion already at this time seems thus to be useful. 3. The article, however, does not want to conclude with the rather depressing state of affairs of problems alternatingly superseding each other. Despite the caution which definitely has a place when prognoses are being made on the basis of extrapolations from historical findings, the foreseeable development especially of the epidemiologic transition in the direction of a rectangular survival curve does nevertheless provide good reason for being rather optimistic towards the future: first in regards to the development in our own countries, but then - assuming that the present similar tendencies of development are stuck to - also in regard to Brazil.

Completion problems for real matrices, II

Thirty years ago, G.N. de Oliveira has proposed the following completion problems: Describe the possible characteristic polynomials of [C-ij], i,j is an element of {1, 2}, where C-1,C-1 and C-2,C-2 are square submatrices, when some of the blocks C-ij are fixed and the others vary. Several of these problems remain unsolved. This paper gives the solution, over the field of real numbers, of Oliveira's problem where the blocks C-1,C-1, C-2,C-2 are fixed and the others vary.

Positive solutions of fourth order problems with clamped beam boundary conditions

n this paper we make an exhaustive study of the fourth order linear operator u((4)) + M u coupled with the clamped beam conditions u(0) = u(1) = u'(0) = u'(1) = 0. We obtain the exact values on the real parameter M for which this operator satisfies an anti-maximum principle. Such a property is equivalent to the fact that the related Green's function is nonnegative in [0, 1] x [0, 1]. When M < 0 we obtain the best estimate by means of the spectral theory and for M > 0 we attain the optimal value by studying the oscillation properties of the solutions of the homogeneous equation u((4)) + M u = 0. By using the method of lower and upper solutions we deduce the existence of solutions for nonlinear problems coupled with this boundary conditions. (C) 2011 Elsevier Ltd. All rights reserved.

Self-optimization module for scheduling using case-based reasoning

Metaheuristics performance is highly dependent of the respective parameters which need to be tuned. Parameter tuning may allow a larger flexibility and robustness but requires a careful initialization. The process of defining which parameters setting should be used is not obvious. The values for parameters depend mainly on the problem, the instance to be solved, the search time available to spend in solving the problem, and the required quality of solution. This paper presents a learning module proposal for an autonomous parameterization of Metaheuristics, integrated on a Multi-Agent System for the resolution of Dynamic Scheduling problems. The proposed learning module is inspired on Autonomic Computing Self-Optimization concept, defining that systems must continuously and proactively improve their performance. For the learning implementation it is used Case-based Reasoning, which uses previous similar data to solve new cases. In the use of Case-based Reasoning it is assumed that similar cases have similar solutions. After a literature review on topics used, both AutoDynAgents system and Self-Optimization module are described. Finally, a computational study is presented where the proposed module is evaluated, obtained results are compared with previous ones, some conclusions are reached, and some future work is referred. It is expected that this proposal can be a great contribution for the self-parameterization of Metaheuristics and for the resolution of scheduling problems on dynamic environments.

Are severe occlusal problems more frequent in permanent than deciduous dentition?

OBJECTIVE: To determine the prevalence and severity of occlusal problems in populations at the ages of deciduous and permanent dentition and to carry out a meta-analysis to estimate the weighted odds ratio for occlusal problems comparing both groups. METHODS: Data of a probabilistic sample (n=985) of schoolchildren aged 5 and 12 from an epidemiological study in the municipality of São Paulo, Brazil, were analyzed using univariate logistic regression (MLR). Results of cross-sectional study data published in the last 70 years were examined in the meta-analysis. RESULTS: The prevalence of occlusal problems increased from 49.0% (95% CI =47.4%-50.6%) in the deciduous dentition to 71.3% (95% CI =70.3%-72.3%) in the permanent dentition (p<0.001). Dentition was the only variable significantly associated to the severity of malocclusion (OR=1.87; 95% CI =1.43-2.45; p<0.001). The variables sex, type of school and ethnic group were not significant. The meta-analysis showed that a weighted OR of 1.95 (1.91; 1.98) when compared the second dentition period with deciduous and mixed dentition. CONCLUSIONS: In planning oral health services, some activities are indicated to reduce the proportion of moderate/severe malocclusion to levels that are socially more acceptable and economically sustainable.

Nodal price simulation in competitive electricity markets

Locational Marginal Prices (LMP) are important pricing signals for the participants of competitive electricity markets, as the effects of transmission losses and binding constraints are embedded in LMPs [1],[2]. This paper presents a software tool that evaluates the nodal marginal prices considering losses and congestion. The initial dispatch is based on all the electricity transactions negotiated in the pool and in bilateral contracts. It must be checked if the proposed initial dispatch leads to congestion problems; if a congestion situation is detected, it must be solved. An AC power flow is used to verify if there are congestion situations in the initial dispatch. Whenever congestion situations are detected, they are solved and a feasible dispatch (re-dispatch) is obtained. After solving the congestion problems, the simulator evaluates LMP. The paper presents a case study based on the the 118 IEEE bus test network.

Ant colony system based approach to single machine scheduling problems: weighted tardiness scheduling problem

The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.

Self-managing agents for dynamic scheduling in manufacturing

The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using cooperative negotiation. Scheduling resolution requires the intervention of highly skilled human problem-solvers. This is a very hard and challenging domain because current systems are becoming more and more complex, distributed, interconnected and subject to rapidly changing. A natural Autonomic Computing (AC) evolution in relation to Current Computing is to provide systems with Self-Managing ability with a minimum human interference.

Certificação de um troço de via alvo de ataque mecânico pesado

Qualidade é a palavra de ordem pelo qual se regem todos os processos e intervenções da REFER (Rede Ferroviária Nacional). Com a evolução de requisitos exigidos pelo transporte em caminho de ferro, há que procurar sempre as últimas inovações, para que a circulação se faça sempre com maior segurança e comodidade, dando aos utilizadores deste tipo transporte uma qualidade extrema. Nos últimos anos esses requisitos tornaram-se cada vez mais exigentes, pois as condições de circulação aumentam tais como a prática de maiores velocidades, tonelagem e frequência das composições, o que leva a um maior rigor nos processos construtivos e conservativos das vias. A REFER, depois de grandes investimentos em novas infraestruturas ferroviárias, detém agora um decisivo e importante papel na resolução das problemáticas que emergem, apostando sempre em tecnologia de ponta para que possa desenvolver um trabalho de conservação que satisfaça todas as necessidades exigidas. Este trabalho desenvolver-se-á nesta ótica de conservação e manutenção, acompanhando todo um processo específico de ataque mecânico pesado, até à sua certificação. A análise dos vários processos caracterizará a exigência referida na manutenção, principalmente da via moderna, onde a fasquia de requisitos é mais elevada.

Ontologies for reusing data cleaning knowledge

The emergence of new business models, namely, the establishment of partnerships between organizations, the chance that companies have of adding existing data on the web, especially in the semantic web, to their information, led to the emphasis on some problems existing in databases, particularly related to data quality. Poor data can result in loss of competitiveness of the organizations holding these data, and may even lead to their disappearance, since many of their decision-making processes are based on these data. For this reason, data cleaning is essential. Current approaches to solve these problems are closely linked to database schemas and specific domains. In order that data cleaning can be used in different repositories, it is necessary for computer systems to understand these data, i.e., an associated semantic is needed. The solution presented in this paper includes the use of ontologies: (i) for the specification of data cleaning operations and, (ii) as a way of solving the semantic heterogeneity problems of data stored in different sources. With data cleaning operations defined at a conceptual level and existing mappings between domain ontologies and an ontology that results from a database, they may be instantiated and proposed to the expert/specialist to be executed over that database, thus enabling their interoperability.

Solving a signalized traffic intersection problem with an hyperbolic penalty function

Mathematical Program with Complementarity Constraints (MPCC) finds many applications in fields such as engineering design, economic equilibrium and mathematical programming theory itself. A queueing system model resulting from a single signalized intersection regulated by pre-timed control in traffic network is considered. The model is formulated as an MPCC problem. A MATLAB implementation based on an hyperbolic penalty function is used to solve this practical problem, computing the total average waiting time of the vehicles in all queues and the green split allocation. The problem was codified in AMPL.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Derivative-free nonlinear optimization filter simplex

The filter method is a technique for solving nonlinear programming problems. The filter algorithm has two phases in each iteration. The first one reduces a measure of infeasibility, while in the second the objective function value is reduced. In real optimization problems, usually the objective function is not differentiable or its derivatives are unknown. In these cases it becomes essential to use optimization methods where the calculation of the derivatives or the verification of their existence is not necessary: direct search methods or derivative-free methods are examples of such techniques. In this work we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of simplex and filter methods. This method neither computes nor approximates derivatives, penalty constants or Lagrange multipliers.