44 resultados para Parallel numerical algorithms
Resumo:
The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver for multi-cores, which can be easily adapted to solve the SVP. In particular, it achieves super-linear speedups in some instances on up to 8 cores and almost linear speedups on 16 cores when solving the CVP on a 50-dimensional lattice. Our results show that enumeration-based CVP-solvers can be parallelized as effectively as enumeration-based solvers for the SVP, based on a comparison with a state of the art SVP-solver. In addition, we show that we can optimize the SVP variant of our solver in such a way that it becomes 35%-60% faster than the fastest enumeration-based SVP-solver to date.
Resumo:
This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as 'erf', is presented. In the N-M algorithm context, different strategies are proposed to enhance the quality of the solutions and improve the overall efficiency. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm.
Resumo:
Dissertação de mestrado em Engenharia Industrial
Resumo:
In this contribution, original limit analysis numerical results are presented dealing with some reinforced masonry arches tested at the University of Minho-UMinho, PT. Twelve in-scale circular masonry arches were considered, reinforced in various ways at the intrados or at the extrados. GFRP reinforcements were applied either on undamaged or on previously damaged elements, in order to assess the role of external reinforcements even in repairing interventions. The experimental results were critically discussed at the light of limit analysis predictions, based on a 3D FE heterogeneous upper bound approach. Satisfactory agreement was found between experimental evidences and the numerical results, in terms of failure mechanisms and peak load.
Resumo:
Dissertação de mestrado integrado em Engenharia Mecânica
Resumo:
This paper proposes a methodology for improvement of energy efficiency in buildings through the innovative simultaneous incorporation of three distinct phase change materials (here termed as hybrid PCM) in plastering mortars for façade walls. The thermal performance of a hybrid PCM mortar was experimentally evaluated by comparing the behaviour of a prototype test cell (including hybrid PCM plastering mortar) subjected to realistic daily temperature profiles, with the behaviour of a similar prototype test cell, in which no PCM was added. A numerical simulation model was employed (using ANSYS-FLUENT) to validate the capacity of simulating temperature evolution within the prototype containing hybrid PCM, as well as to understand the contribution of hybrid PCM to energy efficiency. Incorporation of hybrid PCM into plastering mortars was found to have the potential to significantly reduce heating/cooling temperature demands for maintaining the interior temperature within comfort levels when compared to normal mortars (without PCM), or even mortars comprising a single type of PCM.
Resumo:
Dissertação de mestrado integrado em Engenharia Civil
Resumo:
PhD thesis in Biomedical Engineering
Resumo:
Distributed data aggregation is an important task, allowing the de- centralized determination of meaningful global properties, that can then be used to direct the execution of other applications. The resulting val- ues result from the distributed computation of functions like count, sum and average. Some application examples can found to determine the network size, total storage capacity, average load, majorities and many others. In the last decade, many di erent approaches have been pro- posed, with di erent trade-o s in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of ag- gregation algorithms, it can be di cult and time consuming to determine which techniques will be more appropriate to use in speci c settings, jus- tifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally de nes the concept of aggrega- tion, characterizing the di erent types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.
Resumo:
Dissertação de mestrado integrado em Engenharia Civil
Resumo:
Documento submetido para revisão pelos pares. A publicar em Journal of Parallel and Distributed Computing. ISSN 0743-7315
Resumo:
"Series title: Springerbriefs in applied sciences and technology, ISSN 2191-530X"
Resumo:
"Series: Solid mechanics and its applications, vol. 226"
Resumo:
"A workshop within the 19th International Conference on Applications and Theory of Petri Nets - ICATPN’1998"