A-optimality orthogonal forward regression algorithm using branch and bound

In this brief, we propose an orthogonal forward regression (OFR) algorithm based on the principles of the branch and bound (BB) and A-optimality experimental design. At each forward regression step, each candidate from a pool of candidate regressors, referred to as S, is evaluated in turn with three possible decisions: 1) one of these is selected and included into the model; 2) some of these remain in S for evaluation in the next forward regression step; and 3) the rest are permanently eliminated from S. Based on the BB principle in combination with an A-optimality composite cost function for model structure determination, a simple adaptive diagnostics test is proposed to determine the decision boundary between 2) and 3). As such the proposed algorithm can significantly reduce the computational cost in the A-optimality OFR algorithm. Numerical examples are used to demonstrate the effectiveness of the proposed algorithm.

Changes in water vapor transports of the ascending branch of the tropical circulation

Recent studies have found contradicting results on whether tropical atmospheric circulation (TAC) has intensified or weakened in recent decades. We here re-investigate recent changes in TAC derived from moisture transports into the tropics using high temporal and spatial resolution reanalyses from ERA-interim. We found a significant strengthening of both, the lower level inward transports and the mid level outward transports over the recent two decades. However the signal in the total budget is weak, because strengthening of the in and outflow neutralize each other, at least to some extent. We found atmospheric humidity to be relatively stable, so suggest that the intensification is mainly caused by an intensification of the wind related circulation strength. The exact quantitative values were found to heavily depend on whether the calculations are based on mean or instantaneous values. We highlight the importance for using the instantaneous ones for transport calculations, as they represent the coincidence of high wind speeds and high atmospheric humidity.

Modelling phosphorus dynamics in multi-branch river systems: A study of the Black River, Lake Simcoe, Ontario, Canada

High rates of nutrient loading from agricultural and urban development have resulted in surface water eutrophication and groundwater contamination in regions of Ontario. In Lake Simcoe (Ontario, Canada), anthropogenic nutrient contributions have contributed to increased algal growth, low hypolimnetic oxygen concentrations, and impaired fish reproduction. An ambitious programme has been initiated to reduce phosphorus loads to the lake, aiming to achieve at least a 40% reduction in phosphorus loads by 2045. Achievement of this target necessitates effective remediation strategies, which will rely upon an improved understanding of controls on nutrient export from tributaries of Lake Simcoe as well as improved understanding of the importance of phosphorus cycling within the lake. In this paper, we describe a new model structure for the integrated dynamic and process-based model INCA-P, which allows fully-distributed applications, suited to branched river networks. We demonstrate application of this model to the Black River, a tributary of Lake Simcoe, and use INCA-P to simulate the fluxes of P entering the lake system, apportion phosphorus among different sources in the catchment, and explore future scenarios of land-use change and nutrient management to identify high priority sites for implementation of watershed best management practises.

A parallel formulation for the simulation of a generic branch predictor

A parallel formulation for the simulation of a branch prediction algorithm is presented. This parallel formulation identifies independent tasks in the algorithm which can be executed concurrently. The parallel implementation is based on the multithreading model and two parallel programming platforms: pthreads and Cilk++. Improvement in execution performance by up to 7 times is observed for a generic 2-bit predictor in a 12-core multiprocessor system.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

Produktion, skador och grenegenskaper hos 10-årig tall i ett kombinerat förbands- och avkommeförsök : Volume production, damages and branch properties in a 10-year old combined spacing and progeny trial of Scots pine

A Scots pine (Pinus sylvestris) progeny trial was established in 1990, in the southwestern part of Sweden. The offspring was from 30 plus trees. The trial is located on abandoned agricultural land and has a single tree block design with a variation in spacing. The trial has been damaged by voles. At a tree age of ten years, growth, damages and branch properties were estimated. An analysis of variance on height, diameter and stem volume shows significant difference between spacing and progenies as well as interactions between these factors. As indicated by a better annual height increment and fewer and thinner branches at each whorl the densest spacing has the highest potential to produce quality logs.There were also differences between progenies in growth and quality traits. Some progenies combined good growth and branch characters with low mortality, straight stems and few damages. Other progenies had superior volume production.

A presidência brasileira e a separação dos poderes

Este relatório apresenta os resultados iniciais de uma pesquisa de longo prazo sobre a presidência Brasileira e os outros poderes da federação. Várias pesquisas realizadas separadamente enfatizam a crescente importância do executivo, legislativo, e judiciário na política Brasileira desde a Constituição de 1988. Este relatório argumenta que, tomadas como um todo, estas pesquisas mostram um processo decisório mais complexo mais contestado, e mais democrático. Uma resenha das bibliografias recentes sobre as relações entre os três poderes no Brasil e nos Estados Unidos mostra a necessidade de mais pesquisa comparada sobre a separação dos poderes nestes dois países. O relatório também comunica os passos iniciais na organização de um banco de dados sobre sobre tendências de gastos entre os poderes da união a partir de dados oficiais sobre o Orçamento federal de 1995-2002.

What kind of judiciary do we want?: the access to justice in Brazil

The goal of this paper is to discuss a key issue in the Democratic Rule of Law State: what are the role and main functions of the Judiciary in Brazil? Is the Judiciary mainly a public service provider, adjudicating disputes and guaranteeing individual rights? Or also as a state power, it should mainly control and guide the moral values of the society, changing the status quo and reducing social conflicts? In this sense, what are the conflicts that must be examined by the Judiciary? We will seek to answer these questions based on a discussion subsidized by courts official statistics and the results of surveys conducted with the Brazilian general population. The surveys measured how do citizens feel about their judicial system and what are the circumstances and the facts that determine the judicialization of conflicts. We work with the perceptions and attitudes of citizens relating to the Judiciary as it is today and discuss the Judiciary they want. Then, we compare how attitudes and perceptions relate to actual behavior and use of courts.

A branch-and-price approach to p-median location problems

This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is minimized. The traditional column generation process is compared with a stabilized approach that combines the column generation and Lagrangean/surrogate relaxation. The Lagrangean/surrogate multiplier modifies; the reduced cost criterion, providing the selection of new productive columns at the search tree. Computational experiments are conducted considering especially difficult instances to the traditional column generation and also with some large-scale instances. (C) 2004 Elsevier Ltd. All rights reserved.

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

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