949 resultados para Sparse arrays
Resumo:
We consider the evaporation of periodic arrays of initially equal droplets in two-dimensional systems with open (absorbing) boundaries. Our study is based on the numerical solution of the Cahn-Hilliard equation. We show that due to cooperative effects the droplets which are further from the boundary may evaporate earlier than those in the boundary¿s vicinity. The time evolution of the overall amount of matter in the system is also studied.
Resumo:
The propagation of a pulse in a nonlinear array of oscillators is influenced by the nature of the array and by its coupling to a thermal environment. For example, in some arrays a pulse can be speeded up while in others a pulse can be slowed down by raising the temperature. We begin by showing that an energy pulse (one dimension) or energy front (two dimensions) travels more rapidly and remains more localized over greater distances in an isolated array (microcanonical) of hard springs than in a harmonic array or in a soft-springed array. Increasing the pulse amplitude causes it to speed up in a hard chain, leaves the pulse speed unchanged in a harmonic system, and slows down the pulse in a soft chain. Connection of each site to a thermal environment (canonical) affects these results very differently in each type of array. In a hard chain the dissipative forces slow down the pulse while raising the temperature speeds it up. In a soft chain the opposite occurs: the dissipative forces actually speed up the pulse, while raising the temperature slows it down. In a harmonic chain neither dissipation nor temperature changes affect the pulse speed. These and other results are explained on the basis of the frequency vs energy relations in the various arrays
Resumo:
Breather stability and longevity in thermally relaxing nonlinear arrays depend sensitively on their interactions with other excitations. We review numerical results for the relaxation of breathers in Fermi¿Pasta¿Ulam arrays, with a specific focus on the different relaxation channels and their dependence on the interparticle interactions, dimensionality, initial condition, and system parameters
Resumo:
Background and Aims The frequency at which males can be maintained with hermaphrodites in androdioecious populations is predicted to depend on the selfing rate, because self-fertilization by hermaphrodites reduces prospective siring opportunities for males. In particular, high selfing rates by hermaphrodites are expected to exclude males from a population. Here, the first estimates are provided of the mating system from two wild hexaploid populations of the androdioecious European wind-pollinated plant M. annua with contrasting male frequencies.Methods Four diploid microsatellite loci were used to genotype 19-20 progeny arrays from two populations of M. annua, one with males and one without. Mating-system parameters were estimated using the program MLTR.Key Results Both populations had similar, intermediate outcrossing rates (t(m) = 0.64 and 0.52 for the population with and without males, respectively). The population without males showed a lower level of correlated paternity and biparental inbreeding and higher allelic richness and gene diversity than the population with males.Conclusions The results demonstrate the utility of new diploid microsatellite loci for mating system analysis in a hexaploid plant. It would appear that androdioecious M. annua has a mixed-mating system in the wild, an uncommon finding for wind-pollinated species. This study sets a foundation for future research to assess the relative importance of the sexual system, plant-density variation and stochastic processes for the regulation of male frequencies in M. annua over space and time.
Resumo:
BACKGROUND: Genotypes obtained with commercial SNP arrays have been extensively used in many large case-control or population-based cohorts for SNP-based genome-wide association studies for a multitude of traits. Yet, these genotypes capture only a small fraction of the variance of the studied traits. Genomic structural variants (GSV) such as Copy Number Variation (CNV) may account for part of the missing heritability, but their comprehensive detection requires either next-generation arrays or sequencing. Sophisticated algorithms that infer CNVs by combining the intensities from SNP-probes for the two alleles can already be used to extract a partial view of such GSV from existing data sets. RESULTS: Here we present several advances to facilitate the latter approach. First, we introduce a novel CNV detection method based on a Gaussian Mixture Model. Second, we propose a new algorithm, PCA merge, for combining copy-number profiles from many individuals into consensus regions. We applied both our new methods as well as existing ones to data from 5612 individuals from the CoLaus study who were genotyped on Affymetrix 500K arrays. We developed a number of procedures in order to evaluate the performance of the different methods. This includes comparison with previously published CNVs as well as using a replication sample of 239 individuals, genotyped with Illumina 550K arrays. We also established a new evaluation procedure that employs the fact that related individuals are expected to share their CNVs more frequently than randomly selected individuals. The ability to detect both rare and common CNVs provides a valuable resource that will facilitate association studies exploring potential phenotypic associations with CNVs. CONCLUSION: Our new methodologies for CNV detection and their evaluation will help in extracting additional information from the large amount of SNP-genotyping data on various cohorts and use this to explore structural variants and their impact on complex traits.
Resumo:
Abstract
Resumo:
We study the impact of sampling theorems on the fidelity of sparse image reconstruction on the sphere. We discuss how a reduction in the number of samples required to represent all information content of a band-limited signal acts to improve the fidelity of sparse image reconstruction, through both the dimensionality and sparsity of signals. To demonstrate this result, we consider a simple inpainting problem on the sphere and consider images sparse in the magnitude of their gradient. We develop a framework for total variation inpainting on the sphere, including fast methods to render the inpainting problem computationally feasible at high resolution. Recently a new sampling theorem on the sphere was developed, reducing the required number of samples by a factor of two for equiangular sampling schemes. Through numerical simulations, we verify the enhanced fidelity of sparse image reconstruction due to the more efficient sampling of the sphere provided by the new sampling theorem.
Resumo:
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solver for arrays in the context of the DPLL(T) approach to SMT. The main characteristics of our solver are: (i) no translation of writes into reads is needed, (ii) there is no axiom instantiation, and (iii) the T-solver interacts with the Boolean engine by asking to split on equality literals between indices. As far as we know, this is the first accurate description of an array solver integrated in a state-of-the-art SMT solver and, unlike most state-of-the-art solvers, it is not based on a lazy instantiation of the array axioms. Moreover, it is very competitive in practice, specially on problems that require heavy reasoning on array literals
Resumo:
Peer-reviewed
Resumo:
Nowadays problem of solving sparse linear systems over the field GF(2) remain as a challenge. The popular approach is to improve existing methods such as the block Lanczos method (the Montgomery method) and the Wiedemann-Coppersmith method. Both these methods are considered in the thesis in details: there are their modifications and computational estimation for each process. It demonstrates the most complicated parts of these methods and gives the idea how to improve computations in software point of view. The research provides the implementation of accelerated binary matrix operations computer library which helps to make the progress steps in the Montgomery and in the Wiedemann-Coppersmith methods faster.
Resumo:
Presently, conditions ensuring the validity of bootstrap methods for the sample mean of (possibly heterogeneous) near epoch dependent (NED) functions of mixing processes are unknown. Here we establish the validity of the bootstrap in this context, extending the applicability of bootstrap methods to a class of processes broadly relevant for applications in economics and finance. Our results apply to two block bootstrap methods: the moving blocks bootstrap of Künsch ( 989) and Liu and Singh ( 992), and the stationary bootstrap of Politis and Romano ( 994). In particular, the consistency of the bootstrap variance estimator for the sample mean is shown to be robust against heteroskedasticity and dependence of unknown form. The first order asymptotic validity of the bootstrap approximation to the actual distribution of the sample mean is also established in this heterogeneous NED context.
Resumo:
Two three-clement polarisation-agile active microstrip patch arrays have been developed . The radiating elements are square patches each with two transistors mounted on adjacent edges. The patches radiate orthogonal modes , the relative phase of which can be varied. Radiation patterns show good agreement with predictions from theory, in both linear and circular polarization, and no grating lobes were observed