995 resultados para Self-Optimization
Resumo:
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.
Resumo:
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.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
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.
Resumo:
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.
Resumo:
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).
Resumo:
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.
Resumo:
Self-incompatibility (SI), a reproductive system broadly present in plants, chordates, fungi, and protists, might be controlled by one or several multiallelic loci. How a transition in the number of SI loci can occur and the consequences of such events for the population's genetics and dynamics have not been studied theoretically. Here, we provide analytical descriptions of two transition mechanisms: linkage of the two SI loci (scenario 1) and the loss of function of one incompatibility gene within a mating type of a population with two SI loci (scenario 2). We show that invasion of populations by the new mating type form depends on whether the fitness of the new type is lowered, and on the allelic diversity of the SI loci and the recombination between the two SI loci in the starting population. Moreover, under scenario 1, it also depends on the frequency of the SI alleles that became linked. We demonstrate that, following invasion, complete transitions in the reproductive system occurs under scenario 2 and is predicted only for small populations under scenario 1. Interestingly, such events are associated with a drastic reduction in mating type number.
Resumo:
The reliance in experimental psychology on testing undergraduate populations with relatively little life experience, and/or ambiguously valenced stimuli with varying degrees of self-relevance, may have contributed to inconsistent findings in the literature on the valence hypothesis. To control for these potential limitations, the current study assessed lateralised lexical decisions for positive and negative attachment words in 40 middle-aged male and female participants. Self-relevance was manipulated in two ways: by testing currently married compared with previously married individuals and by assessing self-relevance ratings individually for each word. Results replicated a left hemisphere advantage for lexical decisions and a processing advantage of emotional over neutral words but did not support the valence hypothesis. Positive attachment words yielded a processing advantage over neutral words in the right hemisphere, while emotional words (irrespective of valence) yielded a processing advantage over neutral words in the left hemisphere. Both self-relevance manipulations were unrelated to lateralised performance. The role of participant sex and age in emotion processing are discussed as potential modulators of the present findings.
Resumo:
In the mouse, over the last 20 years, a set of cell-surface markers and activities have been identified, enabling the isolation of bone marrow (BM) populations highly enriched in hematopoietic stem cells (HSCs). These HSCs have the ability to generate multiple lineages and are capable of long-term self-renewal activity such that they are able to reconstitute and maintain a functional hematopoietic system after transplantation into lethally irradiated recipients. Using single-cell reconstitution assays, various marker combinations can be used to achieve a functional HSC purity of almost 50%. Here we have used the differential expression of six of these markers (Sca1, c-Kit, CD135, CD48, CD150, and CD34) on lineage-depleted BM to refine cell hierarchies within the HSC population. At the top of the hierarchy, we propose a dormant HSC population (Lin(-)Sca1(+)c-Kit(+) CD48(-)CD150(+)CD34(-)) that gives rise to an active self-renewing CD34(+) HSC population. HSC dormancy, as well as the balance between self-renewal and differentiation activity, is at least, in part, controlled by the stem cell niches individual HSCs are attached to. Here we review the current knowledge about HSC niches and propose that dormant HSCs are located in niches at the endosteum, whereas activated HSCs are in close contact to sinusoids of the BM microvasculature.
Resumo:
DNA in bacterial chromosomes and bacterial plasmids is supercoiled. DNA supercoiling is essential for DNA replication and gene regulation. However, the density of supercoiling in vivo is circa twice smaller than in deproteinized DNA molecules isolated from bacteria. What are then the specific advantages of reduced supercoiling density that is maintained in vivo? Using Brownian dynamics simulations and atomic force microscopy we show here that thanks to physiological DNA-DNA crowding DNA molecules with reduced supercoiling density are still sufficiently supercoiled to stimulate interaction between cis-regulatory elements. On the other hand, weak supercoiling permits DNA molecules to modulate their overall shape in response to physiological changes in DNA crowding. This plasticity of DNA shapes may have regulatory role and be important for the postreplicative spontaneous segregation of bacterial chromosomes.