Line search multilevel optimization as computational methods for dense optical flow

We evaluate the performance of different optimization techniques developed in the context of optical flowcomputation with different variational models. In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we develop the use of efficient multilevel schemes for computing the optical flow. More precisely, we evaluate the performance of a standard unidirectional multilevel algorithm - called multiresolution optimization (MR/OPT), to a bidrectional multilevel algorithm - called full multigrid optimization (FMG/OPT). The FMG/OPT algorithm treats the coarse grid correction as an optimization search direction and eventually scales it using a line search. Experimental results on different image sequences using four models of optical flow computation show that the FMG/OPT algorithm outperforms both the TN and MR/OPT algorithms in terms of the computational work and the quality of the optical flow estimation.

Restriction site-associated DNA sequencing, genotyping error estimation and de novo assembly optimization for population genetic inference.

Restriction site-associated DNA sequencing (RADseq) provides researchers with the ability to record genetic polymorphism across thousands of loci for nonmodel organisms, potentially revolutionizing the field of molecular ecology. However, as with other genotyping methods, RADseq is prone to a number of sources of error that may have consequential effects for population genetic inferences, and these have received only limited attention in terms of the estimation and reporting of genotyping error rates. Here we use individual sample replicates, under the expectation of identical genotypes, to quantify genotyping error in the absence of a reference genome. We then use sample replicates to (i) optimize de novo assembly parameters within the program Stacks, by minimizing error and maximizing the retrieval of informative loci; and (ii) quantify error rates for loci, alleles and single-nucleotide polymorphisms. As an empirical example, we use a double-digest RAD data set of a nonmodel plant species, Berberis alpina, collected from high-altitude mountains in Mexico.

An algorithm for semi-infinite polynomial optimization

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

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics

This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful method that can be successfully applied in a variety of cases.

On the stability of the optimal value and the optimal set in optimization problems

The paper develops a stability theory for the optimal value and the optimal set mapping of optimization problems posed in a Banach space. The problems considered in this paper have an arbitrary number of inequality constraints involving lower semicontinuous (not necessarily convex) functions and one closed abstract constraint set. The considered perturbations lead to problems of the same type as the nominal one (with the same space of variables and the same number of constraints), where the abstract constraint set can also be perturbed. The spaces of functions involved in the problems (objective and constraints) are equipped with the metric of the uniform convergence on the bounded sets, meanwhile in the space of closed sets we consider, coherently, the Attouch-Wets topology. The paper examines, in a unified way, the lower and upper semicontinuity of the optimal value function, and the closedness, lower and upper semicontinuity (in the sense of Berge) of the optimal set mapping. This paper can be seen as a second part of the stability theory presented in [17], where we studied the stability of the feasible set mapping (completed here with the analysis of the Lipschitz-like property).

Artificial Snow Optimization in Winter Sport Destinations Using a Multi-agent Simulation

This paper presents the Juste-Neige system for predicting the snow height on the ski runs of a resort using a multi-agent simulation software. Its aim is to facilitate snow cover management in order to i) reduce the production cost of artificial snow and to improve the profit margin for the companies managing the ski resorts; and ii) to reduce the water and energy consumption, and thus to reduce the environmental impact, by producing only the snow needed for a good skiing experience. The software provides maps with the predicted snow heights for up to 13 days. On these maps, the areas most exposed to snow erosion are highlighted. The software proceeds in three steps: i) interpolation of snow height measurements with a neural network; ii) local meteorological forecasts for every ski resort; iii) simulation of the impact caused by skiers using a multi-agent system. The software has been evaluated in the Swiss ski resort of Verbier and provides useful predictions.

Haar wavelets-based approach for quantifying credit portfolio losses

This paper proposes a new methodology to compute Value at Risk (VaR) for quantifying losses in credit portfolios. We approximate the cumulative distribution of the loss function by a finite combination of Haar wavelet basis functions and calculate the coefficients of the approximation by inverting its Laplace transform. The Wavelet Approximation (WA) method is specially suitable for non-smooth distributions, often arising in small or concentrated portfolios, when the hypothesis of the Basel II formulas are violated. To test the methodology we consider the Vasicek one-factor portfolio credit loss model as our model framework. WA is an accurate, robust and fast method, allowing to estimate VaR much more quickly than with a Monte Carlo (MC) method at the same level of accuracy and reliability.

Same wording, distinct concepts? Testing differences between expectancies and motives in a mediation model of alcohol outcomes.

Per definition, alcohol expectancies (after alcohol I expect X), and drinking motives (I drink to achieve X) are conceptually distinct constructs. Theorists have argued that motives mediate the association between expectancies and drinking outcomes. Yet, given the use of different instruments, do these constructs remain distinct when assessment items are matched? The present study tested to what extent motives mediated the link between expectancies and alcohol outcomes when identical items were used, first as expectancies and then as motives. A linear structural equation model was estimated based on a national representative sample of 5,779 alcohol-using students in Switzerland (mean age = 15.2 years). The results showed that expectancies explained up to 38% of the variance in motives. Together with motives, they explained up to 48% of the variance in alcohol outcomes (volume, 5+ drinking, and problems). In 10 of 12 outcomes, there was a significant mediated effect that was often higher than the direct expectancy effect. For coping, the expectancy effect was close to zero, indicating the strongest form of mediation. In only one case (conformity and 5+ drinking), there was a direct expectancy effect but no mediation. To conclude, the study demonstrates that motives are distinct from expectancies even when identical items are used. Motives are more proximally related to different alcohol outcomes, often mediating the effects of expectancies. Consequently, the effectiveness of interventions, particularly those aimed at coping drinkers, should be improved through a shift in focus from expectancies to drinking motives.

A New open economy macroeconomic model with endogenous portfolio diversification and firms entry

This paper provides a new benchmark for the analysis of the international diversi…cation puzzle in a tractable new open economy macroeconomic model. Building on Cole and Obstfeld (1991) and Heathcote and Perri (2009), this model speci…es an equilibrium model of perfect risk sharing in incomplete markets, with endogenous portfolios and number of varieties. Equity home bias may not be a puzzle but a perfectly optimal allocation for hedging risk. In contrast to previous work, the model shows that: (i) optimal international portfolio diversi…cation is driven by home bias in capital goods, independently of home bias in consumption, and by the share of income accruing to labour. The model explains reasonably well the recent patterns of portfolio allocations in developed economies; and (ii) optimal portfolio shares are independent of market dynamics.

Survival, development and growth of larvae of the blue swimmer crab, Portunus pelagicus, cultured under different photoperiod conditions

The blue swimmer crab is a commercially important species of the tropical Indo-Pacific regions that shows substantial potential as a candidate species for aquaculture. Optimization of larval rearing conditions, including photoperiod, is therefore important to establish a method for the intensive hatchery culture of this species. Newly hatched larvae of Portunuspelagicus in first zoeal stage (ZI) were reared under five photoperiod regimes 0L: 24D, 6L: 18D, 12L: 12D, 18L: 6D, and 24L: 0D (5 replicates per treatment) till they metamorphosed to megalopae (ranged from 8.5 ± 0.3 days (18L: 6D) to 10.8 ± 1.8 days (0L: 24D) at 29 ± 1 °C). Daily, larvae of each treatment were fed an identical diet of mixed rotifer and Artemia nauplii, and the survival and molt to successive stages was monitored. Newly hatched ZI larvae of P. pelagicus could successfully develop to the megalopal stage under all tested photoperiod conditions, but we detected significant differences in survival among treatments (p & 0.05). The constant darkness treatment (0L: 24D) had the lowest (19.2 ± 7.2%, mean ± S.E.) cumulative survival from ZI to the megalopal stage, while the 18L: 6D treatment achieved the highest survival (51.2 ± 23.6%). Similarly, the photoperiod significantly affected zoeal development. Constant darkness led to the longest cumulative zoeal duration (10.8 ± 1.8 days), whereas the 18L: 6D treatment rendered the shortest larval development (8.5 ± 0.3 days). In addition, larvae reared under constant darkness resulted in the smallest megalopae (carapace length = 1.44 ± 0.09 mm) and the lowest dry weight (0.536 ± 0.188 mg). In conclusion, photoperiod significantly affected the survival, development, and growth of P. pelagicus zoeal larvae. Constant darkness led to the lowest larval survival and developmental rate, while a photoperiod regime of 18L: 6D appeared to be the most suitable condition for the rearing of zoeal larvae of P. pelagicus.

Seminar Report: Translating Research into Better Public Health: What Does it Mean for the CoE(NI)?

The workshop was attended by 13 people excluding facilitators. Most were from outside QUB (including Belfast City Council, NHSSB, BHSCT, Centre for Public Health, NICR, Institute of Agri-food and Land Use (QUB), etc).Programme was:Introductions Part 1: What’s “knowledge brokerage” all about?Presentation and Q&A (Kevin Balanda)Small group discussions Part 2: What the Centre of Excellence is doingPresentation and Q&A (Kevin Balanda)Small group discussions

Alcohol drinking and cardiovascular risk in a population with high mean alcohol consumption.

Moderate alcohol consumption has been associated with lower coronary artery disease (CAD) risk. However, data on the CAD risk associated with high alcohol consumption are conflicting. The aim of this study was to examine the impact of heavier drinking on 10-year CAD risk in a population with high mean alcohol consumption. In a population-based study of 5,769 adults (aged 35 to 75 years) without cardiovascular disease in Switzerland, 1-week alcohol consumption was categorized as 0, 1 to 6, 7 to 13, 14 to 20, 21 to 27, 28 to 34, and > or =35 drinks/week or as nondrinkers (0 drinks/week), moderate (1 to 13 drinks/week), high (14 to 34 drinks/week), and very high (> or =35 drinks/week). Blood pressure and lipids were measured, and 10-year CAD risk was calculated according to the Framingham risk score. Seventy-three percent (n = 4,214) of the participants consumed alcohol; 16% (n = 909) were high drinkers and 2% (n = 119) very high drinkers. In multivariate analysis, increasing alcohol consumption was associated with higher high-density lipoprotein cholesterol (from a mean +/- SE of 1.57 +/- 0.01 mmol/L in nondrinkers to 1.88 +/- 0.03 mmol/L in very high drinkers); triglycerides (1.17 +/- 1.01 to 1.32 +/- 1.05 mmol/L), and systolic and diastolic blood pressure (127.4 +/- 0.4 to 132.2 +/- 1.4 mm Hg and 78.7 +/- 0.3 to 81.7 +/- 0.9 mm Hg, respectively) (all p values for trend <0.001). Ten-year CAD risk increased from 4.31 +/- 0.10% to 4.90 +/- 0.37% (p = 0.03) with alcohol use, with a J-shaped relation. Increasing wine consumption was more related to high-density lipoprotein cholesterol levels, whereas beer and spirits were related to increased triglyceride levels. In conclusion, as measured by 10-year CAD risk, the protective effect of alcohol consumption disappears in very high drinkers, because the beneficial increase in high-density lipoprotein cholesterol is offset by the increases in blood pressure levels.

Acute Hospital Portfolio Year 3 Regional Summary (PDF 1153 KB)

February 2006 - report providing an overview of the performance of the Northern Ireland Trusts