1 |
A conjectura de Bateman-Horn e o Lambda-cálculo de Golomb / The Bateman-Horn conjecture and Golomb\'s Lambda-methodPontes, Pedro Henrique 02 July 2012 (has links)
A Conjectura de Bateman-Horn dá condições sobre uma família de polinômios com coeficientes inteiros $f_1(X),\\dots,f_k(X)$ para que hajam infinitos $n \\in \\N$ tais que $f_1(n),\\dots,f_k(n)$ sejam todos primos, e determina qual deve ser o comportamento assintótico de tais inteiros $n$. Neste texto, vamos estudar essa conjectura, assim como um método desenvolvido por Solomon W. Golomb que pode ser usado para demonstrá-la. Veremos que esse cálculo prova a Conjectura de Bateman-Horn a menos da troca de um limite com uma série infinita, que é o único passo ainda não provado desse método. Também estudaremos uma tentativa para solucionar esse problema por meio do uso de teoremas abelianos de regularidade, e provaremos que teoremas tão gerais não são suficientes para provar a troca do limite com a série. / Given a family of polynomials with integer coefficients $f_1(X),\\dots,f_k(X)$, one would like to answer the following question: does there exist infinitely many $n \\in \\N$ such that $f_1(n),\\dots,f_k(n)$ are all primes? Schinzel conjectured that if these polynomials satisfy certain simple conditions, then the answer to this question is affirmative. Assuming these conditions, Bateman and Horn proposed a formula for the asymptotic density of the integers $n \\in \\N$ such that $f_1(n),\\dots,f_k(n)$ are all primes. In this text, we shall study the Bateman-Horn Conjecture, as well as a method proposed by Solomon W. Golomb that may be used to prove this conjecture. We shall see that Golomb\'s $\\Lambda$-method would prove the Bateman-Horn Conjecture, except for a single unproved step, namely, the commutation of a limit with an infinite series.
|
2 |
A conjectura de Bateman-Horn e o Lambda-cálculo de Golomb / The Bateman-Horn conjecture and Golomb\'s Lambda-methodPedro Henrique Pontes 02 July 2012 (has links)
A Conjectura de Bateman-Horn dá condições sobre uma família de polinômios com coeficientes inteiros $f_1(X),\\dots,f_k(X)$ para que hajam infinitos $n \\in \\N$ tais que $f_1(n),\\dots,f_k(n)$ sejam todos primos, e determina qual deve ser o comportamento assintótico de tais inteiros $n$. Neste texto, vamos estudar essa conjectura, assim como um método desenvolvido por Solomon W. Golomb que pode ser usado para demonstrá-la. Veremos que esse cálculo prova a Conjectura de Bateman-Horn a menos da troca de um limite com uma série infinita, que é o único passo ainda não provado desse método. Também estudaremos uma tentativa para solucionar esse problema por meio do uso de teoremas abelianos de regularidade, e provaremos que teoremas tão gerais não são suficientes para provar a troca do limite com a série. / Given a family of polynomials with integer coefficients $f_1(X),\\dots,f_k(X)$, one would like to answer the following question: does there exist infinitely many $n \\in \\N$ such that $f_1(n),\\dots,f_k(n)$ are all primes? Schinzel conjectured that if these polynomials satisfy certain simple conditions, then the answer to this question is affirmative. Assuming these conditions, Bateman and Horn proposed a formula for the asymptotic density of the integers $n \\in \\N$ such that $f_1(n),\\dots,f_k(n)$ are all primes. In this text, we shall study the Bateman-Horn Conjecture, as well as a method proposed by Solomon W. Golomb that may be used to prove this conjecture. We shall see that Golomb\'s $\\Lambda$-method would prove the Bateman-Horn Conjecture, except for a single unproved step, namely, the commutation of a limit with an infinite series.
|
3 |
Contributions à la compression de donnéesPigeon, Steven January 2001 (has links)
Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal.
|
4 |
Desenvolvimento e implementação em FPGA de um compressor sem perdas de baixa complexidade para imagens de satéliteCosta, Yuri Gonzaga Gonçalves da 31 July 2012 (has links)
Made available in DSpace on 2015-05-14T12:36:33Z (GMT). No. of bitstreams: 1
Arquivototal.pdf: 3633724 bytes, checksum: f53669bf4f692585666fd625941bdbe0 (MD5)
Previous issue date: 2012-07-31 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The amount of data generated and transmitted by satellites to ground stations is always growing. As the technology advances, space imaging systems, especially those
present in Earth observing missions, use equipment of increasing resolutions. Hence, it is necessary to ensure that this great quantity of data arrives at their destination reliably. Among some techniques involved, data compression plays an important role to accomplish this requirement. A data compression system for this purpose must comply with some conditions, particularly regarding performance. In this context, hardware implementations based on prediction and Golomb-Rice coding has achieved excellent results considering hardware and compression performance in both lossless and lossy cases. This work proposes a digital hardware approach of a low complexity satellite image lossless compressor based on prediction and Golomb-Rice coding that is attuned to the balance between performance requirements and error propagation, a
common issue in space systems environment that is enhanced by data compression. In order to validate and analyze the compressor, a functional verification and FPGA prototyping methodology were followed. Given an image set from Brazilian's National Institute for Space Research (INPE, in the Portuguese acronym), CBERS-2B satellite, its results in FPGA show that this compressor achieves average compression ratio of 3.4, comparable value to related works in this area, and throughput of 28 MPixel/s (224
Mbit/s). Taking advantage of images nature, its compression can be parallelized through simultaneous multi-cores compressors. For example, using 5 cores, this work
is able to compress those images in a rate of 142 MPixel/s (1.1 Gbit/s). All these features make it useful and effective in a current remote sensing imaging system. / A quantidade de dados gerados e transmitidos pelos satélites para as estações na Terra é cada vez maiores. Com o passar do tempo e avanço da tecnologia, os sistemas de imageamento espaciais, particularmente as missões de observação da Terra, tem utilizado equipamentos com resoluções cada vez maiores. Por esse motivo, se faz necessário garantir que os dados cheguem ao destino de maneira confiável. Dentre algumas técnicas envolvidas, a compressão de dados é o meio mais viável de alcançar esse requisito. Um sistema de compressão de dados para esse fim deve obedecer algumas condições, principalmente quanto ao desempenho. Nesse contexto, implementações em hardware baseadas em predição e codificação de Golomb-Rice têm obtido excelentes resultados considerando desempenho do hardware e da compressão, tanto nos casos sem perdas como nos com perdas. O presente trabalho apresenta uma proposta de hardware digital de um compressor sem perdas para imagens de satélite baseado em predição e codificação Golomb-Rice que busca um balanceamento entre os requisitos de desempenho e a propagação de erros, um problema comum no âmbito de sistemas espaciais e que é potencializado no caso dos compressores de dados. Para validação e análise do compressor, é seguida uma metodologia de verificação funcional de hardware digital e o desenvolvimento de um
protótipo em FPGA. Dado um conjunto de imagens do satélite CBERS-2B disponibilizadas pelo Instituto Nacional de Pesquisas Espaciais, os resultados obtidos em FPGA mostram que esse compressor alcança razão de compressão média de 3,4,
valor comparável a trabalhos correlatos, e velocidade de 28 MPixel/s (224 Mbit/s). Considerando a natureza das imagens, a compressão pode ser paralelizada por meio de simultâneos núcleos compressores em uma abordagem multicore. Por exemplo, usando 5 núcleos, o sistema proposto é capaz de comprimir essas imagens em uma velocidade de 142 MPixel/s (1.1 Gbit/s). Todas essas características tornam-no útil e
efetivo para a aplicação em um sistema moderno de imageamento para sensoriamento remoto.
|
5 |
Evaluation and Hardware Implementation of Real-Time Color Compression AlgorithmsOjani, Amin, Caglar, Ahmet January 2008 (has links)
A major bottleneck, for performance as well as power consumption, for graphics hardware in mobile devices is the amount of data that needs to be transferred to and from memory. In, for example, hardware accelerated 3D graphics, a large part of the memory accesses are due to large and frequent color buffer data transfers. In a graphic hardware block color data is typically processed using RGB color format. For both 3D graphic rasterization and image composition several pixels needs to be read from and written to memory to generate a pixel in the frame buffer. This generates a lot of data traffic on the memory interfaces which impacts both performance and power consumption. Therefore it is important to minimize the amount of color buffer data. One way of reducing the memory bandwidth required is to compress the color data before writing it to memory and decompress it before using it in the graphics hardware block. This compression/decompression must be done “on-the-fly”, i.e. it has to be very fast so that the hardware accelerator does not have to wait for data. In this thesis, we investigated several exact (lossless) color compression algorithms from hardware implementation point of view to be used in high throughput hardware. Our study shows that compression/decompression datapath is well implementable even with stringent area and throughput constraints. However memory interfacing of these blocks is more critical and could be dominating.
|
6 |
Comparative Analysis of Static Recovery Schemes for Distributed Computing / Komparativ analys av statisk Recovery Program för Distributed ComputingHusain, Rashid, Kazmi, Syed Muhammad Husnain January 2008 (has links)
The primary objective of this thesis is to evaluate how grid computing works with their infrastructure. It also provides study to recognize the cases in which dynamic scheduler is preferable, how can the static recovery schemes play an effective role in large distributed system where load balancing is a key element and how can we get optimality in maximum number of crash computers using dynamic or static recovery schemes. This thesis consists of two parts: construction of Golomb and Trapezium modules, and performance comparison of Golomb and Trapezium recovery schemes with dynamic recovery scheme. In the first part we construct two modules that generate the recovery list of n computers, one for Golomb and one for Trapezium. In second part we make three schedulers, two for static recovery scheme and one for dynamic recovery scheme. In static recovery scheme we compare the performance of Golomb and Trapezium recovery scheme then we compare this performance with dynamic recovery scheme by using GridSim. / 0046735991980, 0046766503096
|
7 |
Implementace statistických kompresních metod / Implementation of Statistical Compression MethodsŠtys, Jiří January 2013 (has links)
This thesis describes Burrow-Wheeler compression algorithm. It focuses on each part of Burrow-Wheeler algorithm, most of all on and entropic coders. In section are described methods like move to front, inverse frequences, interval coding, etc. Among the described entropy coders are Huffman, arithmetic and Rice-Golomg coders. In conclusion there is testing of described methods of global structure transformation and entropic coders. Best combinations are compared with the most common compress algorithm.
|
Page generated in 0.0265 seconds