Evaluating the existence of structural change in the brazilian term structure of interest: evidence based on cointegration models with structural break

This paper investigates whether there is evidence of structural change in the Brazilian term structure of interest rates. Multivariate cointegration techniques are used to verify this evidence. Two econometrics models are estimated. The rst one is a Vector Autoregressive Model with Error Correction Mechanism (VECM) with smooth transition in the deterministic coe¢ cients (Ripatti and Saikkonen [25]). The second one is a VECM with abrupt structural change formulated by Hansen [13]. Two datasets were analysed. The rst one contains a nominal interest rate with maturity up to three years. The second data set focuses on maturity up to one year. The rst data set focuses on a sample period from 1995 to 2010 and the second from 1998 to 2010. The frequency is monthly. The estimated models suggest the existence of structural change in the Brazilian term structure. It was possible to document the existence of multiple regimes using both techniques for both databases. The risk premium for di¤erent spreads varied considerably during the earliest period of both samples and seemed to converge to stable and lower values at the end of the sample period. Long-term risk premiums seemed to converge to inter-national standards, although the Brazilian term structure is still subject to liquidity problems for longer maturities.

The role of profits in wage determination: evidence from US manufacturing

We estimate the effect of firms' profitability on wage determination for the American economy. Two standard bargaining models are used to illustrate the problems caused by the endogeneity of profits-per-worker in a real wage equation. The profit-sharing parameter can be identified with instruments which shift demando Using information from the input-output table, we create demand-shift variables for 63 4-digit sectors of the US manufacturing sector. The LV. estimates show that profit-sharing is a relevant and widespread phenomenon. The elasticity of wages with respect to profits-per-worker is seven times as large as OLS estimates here and in previous papers. Sensitivity analysis of the profit-sharing parameter controlling for the extent of unionization and product market concentration reinforces our results.

Multiple large shareholders in corporate governance

Large shareholders of firms with majority bIocks are often at the heIm of their companies and do not necessarily have the same interests as minority shareholders. We show that bargaining problems Ied by the presence of muItipIe controlling shareholders protect minority shareholders. The same bargaining problems, however, prevent efficient decisions. By solving this trade-off we find that i) muItipIe controlling shareholders should be present in firms with Iarge costs of diIuting minority shareholders and in firms with Iarge financing requirements, ii) an optimal ownership structure requires the presence of a dass of shareholders - the minority shareholders - with no control over corporate decisions. Evidence on the ownership structure of dose corporations in the V.S. is consistent with our model.

The market of academic journals : empirical evidence from data on French libraries

This paper analyzes the demand and cost structure of the French market of academic journals, taking into account its intermediary role between researchers, who are both producers and consumers of knowledge. This two sidedness feature will echoes similar problems already observed in electronic markets – payment card systems, video game console etc - such as the chicken and egg problem, where readers won’t buy a journal if they do not expect its articles to be academically relevant and researchers, that live under the mantra “Publish or Perish”, will not submit to a journal with either limited public reach or weak reputation. After the merging of several databases, we estimate the aggregated nested logit demand system combined simultaneously with a cost function. We identify the structural parameters of this market and find that price elasticities of demand are quite large and margins relatively low, indicating that this industry experiences competitive constraints.

Evidence on the relationship between incentives and exogenous risk

Theoretical models on moral hazard provide competing predictions on the incentive-risk relationship. These predictions are derived under the assumptions of homogeneous agents and exogenous risk. However, the existing empirical evidence does not account for risk-aversion heterogeneity and risk endogeneity. This paper uses a well-built database on tenancy contracts to address these issues. Detailed information on cropping activities is used to measure the exogenous risk. Risk-aversion heterogeneity and other self-selection problems are addressed through a portfolio schedule and a subsample of farmers who simultaneously own and sharecrop different farms. This controlled exercise finds a direct relation between incentives and exogenous risk.

Graphical constraints: a graphical user interface for constraint problems

A constraint satisfaction problem is a classical artificial intelligence paradigm characterized by a set of variables (each variable with an associated domain of possible values), and a set of constraints that specify relations among subsets of these variables. Solutions are assignments of values to all variables that satisfy all the constraints. Many real world problems may be modelled by means of constraints. The range of problems that can use this representation is very diverse and embraces areas like resource allocation, scheduling, timetabling or vehicle routing. Constraint programming is a form of declarative programming in the sense that instead of specifying a sequence of steps to execute, it relies on properties of the solutions to be found, which are explicitly defined by constraints. The idea of constraint programming is to solve problems by stating constraints which must be satisfied by the solutions. Constraint programming is based on specialized constraint solvers that take advantage of constraints to search for solutions. The success and popularity of complex problem solving tools can be greatly enhanced by the availability of friendly user interfaces. User interfaces cover two fundamental areas: receiving information from the user and communicating it to the system; and getting information from the system and deliver it to the user. Despite its potential impact, adequate user interfaces are uncommon in constraint programming in general. The main goal of this project is to develop a graphical user interface that allows to, intuitively, represent constraint satisfaction problems. The idea is to visually represent the variables of the problem, their domains and the problem constraints and enable the user to interact with an adequate constraint solver to process the constraints and compute the solutions. Moreover, the graphical interface should be capable of configure the solver’s parameters and present solutions in an appealing interactive way. As a proof of concept, the developed application – GraphicalConstraints – focus on continuous constraint programming, which deals with real valued variables and numerical constraints (equations and inequalities). RealPaver, a state-of-the-art solver in continuous domains, was used in the application. The graphical interface supports all stages of constraint processing, from the design of the constraint network to the presentation of the end feasible space solutions as 2D or 3D boxes.

Evidence for Reductive Genome Evolution and Lateral Acquisition of Virulence Functions in Two Corynebacterium pseudotuberculosis Strains

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Metodologia estatística na solução do problema do caixeiro viajante e na avaliação de algoritmos : um estudo aplicado à transgenética computacional

The problems of combinatory optimization have involved a large number of researchers in search of approximative solutions for them, since it is generally accepted that they are unsolvable in polynomial time. Initially, these solutions were focused on heuristics. Currently, metaheuristics are used more for this task, especially those based on evolutionary algorithms. The two main contributions of this work are: the creation of what is called an -Operon- heuristic, for the construction of the information chains necessary for the implementation of transgenetic (evolutionary) algorithms, mainly using statistical methodology - the Cluster Analysis and the Principal Component Analysis; and the utilization of statistical analyses that are adequate for the evaluation of the performance of the algorithms that are developed to solve these problems. The aim of the Operon is to construct good quality dynamic information chains to promote an -intelligent- search in the space of solutions. The Traveling Salesman Problem (TSP) is intended for applications based on a transgenetic algorithmic known as ProtoG. A strategy is also proposed for the renovation of part of the chromosome population indicated by adopting a minimum limit in the coefficient of variation of the adequation function of the individuals, with calculations based on the population. Statistical methodology is used for the evaluation of the performance of four algorithms, as follows: the proposed ProtoG, two memetic algorithms and a Simulated Annealing algorithm. Three performance analyses of these algorithms are proposed. The first is accomplished through the Logistic Regression, based on the probability of finding an optimal solution for a TSP instance by the algorithm being tested. The second is accomplished through Survival Analysis, based on a probability of the time observed for its execution until an optimal solution is achieved. The third is accomplished by means of a non-parametric Analysis of Variance, considering the Percent Error of the Solution (PES) obtained by the percentage in which the solution found exceeds the best solution available in the literature. Six experiments have been conducted applied to sixty-one instances of Euclidean TSP with sizes of up to 1,655 cities. The first two experiments deal with the adjustments of four parameters used in the ProtoG algorithm in an attempt to improve its performance. The last four have been undertaken to evaluate the performance of the ProtoG in comparison to the three algorithms adopted. For these sixty-one instances, it has been concluded on the grounds of statistical tests that there is evidence that the ProtoG performs better than these three algorithms in fifty instances. In addition, for the thirty-six instances considered in the last three trials in which the performance of the algorithms was evaluated through PES, it was observed that the PES average obtained with the ProtoG was less than 1% in almost half of these instances, having reached the greatest average for one instance of 1,173 cities, with an PES average equal to 3.52%. Therefore, the ProtoG can be considered a competitive algorithm for solving the TSP, since it is not rare in the literature find PESs averages greater than 10% to be reported for instances of this size.

A estratégia didática de resolução de problemas na formação de professores de química

In this work it is presented a research developed in the initial training of teachers of the chemistry graduation course at the Universidade Federal do Rio Grande do Norte (UFRN). The intervention was realized in two classes in the context of a discipline in the curricular structure with nineteen undergraduate students of chemistry. The study utilizes characteristics of the qualitative approach and uses observation, questionnaires, interviews and examination papers. The experiment involved a sequence of activities fundamented on the Problem Solving (PS) teaching strategy to approach chemical concepts. The proposal was planned and organized according to the theoretical presupposition of the work developed by the authors of the Science Education in PS, of teaching experience and from the initial hypotheses of the research. The goal was that the future teachers could experience the strategy and advance to the new meanings. The themes addressed in the activities were the difference between exercises and problems, exercises turning into problems, the steps of problem solving and some implications of the teaching strategy for the work of the teacher. The results showed evidence that through a process of collective reflection, and from the difficulties experienced in the strategy practice, the undergraduates are introduced to new perspectives of reflection and action of teaching practice, and understanding some benefits of innovative proposals for the teaching of chemistry. It also showed that, although this theme is approached, in some moments of the graduation, the future teachers don‟t know when or how to realize activities in this perspective. From the aspects that rose in research we highlighted the difficulties in the problem solving steps, the use of the strategy in school and the knowledge and skills of the teacher for planning activities in Problem Solving

A bounded upwinding scheme for computing convection-dominated transport problems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A continuously differentiable upwinding scheme for the simulation of fluid flow problems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A modified Primal-Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Major developments in conulariid research: problems of interpretation and future perspectives

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A common Tabu search algorithm for the global optimization of engineering problems

A novel common Tabu algorithm for global optimizations of engineering problems is presented. The robustness and efficiency of the presented method are evaluated by using standard mathematical functions and hy solving a practical engineering problem. The numerical results show that the proposed method is (i) superior to the conventional Tabu search algorithm in robustness, and (ii) superior to the simulated annealing algorithm in efficiency. (C) 2001 Elsevier B.V. B.V. All rights reserved.

C programs for solving the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)