11 resultados para benchmark
em Universidade do Minho
Resumo:
Dissertação de Mestrado em Engenharia Informática
Resumo:
In the present work the benefits of using graphics processing units (GPU) to aid the design of complex geometry profile extrusion dies, are studied. For that purpose, a3Dfinite volume based code that employs unstructured meshes to solve and couple the continuity, momentum and energy conservation equations governing the fluid flow, together with aconstitutive equation, was used. To evaluate the possibility of reducing the calculation time spent on the numerical calculations, the numerical code was parallelized in the GPU, using asimple programing approach without complex memory manipulations. For verificationpurposes, simulations were performed for three benchmark problems: Poiseuille flow, lid-driven cavity flow and flow around acylinder. Subsequently, the code was used on the design of two real life extrusion dies for the production of a medical catheter and a wood plastic composite decking profile. To evaluate the benefits, the results obtained with the GPU parallelized code were compared, in terms of speedup, with a serial implementation of the same code, that traditionally runs on the central processing unit (CPU). The results obtained show that, even with the simple parallelization approach employed, it was possible to obtain a significant reduction of the computation times.
Resumo:
The MAP-i Doctoral Program of the Universities of Minho, Aveiro and Porto.
Resumo:
Doutoramento em Estudos da Criança (área de especialização em Educação Especial).
Resumo:
A search for the decay of neutral, weakly interacting, long-lived particles using data collected by the ATLAS detector at the LHC is presented. This analysis uses the full dataset recorded in 2012: 20.3 fb−1 of proton--proton collision data at s√=8 TeV. The search employs techniques for reconstructing decay vertices of long-lived particles decaying to jets in the inner tracking detector and muon spectrometer. Signal events require at least two reconstructed vertices. No significant excess of events over the expected background is found, and limits as a function of proper lifetime are reported for the decay of the Higgs boson and other scalar bosons to long-lived particles and for Hidden Valley Z′ and Stealth SUSY benchmark models. The first search results for displaced decays in Z′ and Stealth SUSY models are presented. The upper bounds of the excluded proper lifetimes are the most stringent to date.
Resumo:
A search for new phenomena in LHC proton-proton collisions at a center-of-mass energy of s√=8 TeV was performed with the ATLAS detector using an integrated luminosity of 17.3 fb−1. The angular distributions are studied in events with at least two jets; the highest dijet mass observed is 5.5 TeV. All angular distributions are consistent with the predictions of the Standard Model. In a benchmark model of quark contact interactions, a compositeness scale below 8.1 TeV in a destructive interference scenario and 12.0 TeV in a constructive interference scenario is excluded at 95% CL; median expected limits are 8.9 TeV for the destructive interference scenario and 14.1 TeV for the constructive interference scenario.
Resumo:
The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.
Resumo:
The Electromagnetism-like (EM) algorithm is a population- based stochastic global optimization algorithm that uses an attraction- repulsion mechanism to move sample points towards the optimal. In this paper, an implementation of the EM algorithm in the Matlab en- vironment as a useful function for practitioners and for those who want to experiment a new global optimization solver is proposed. A set of benchmark problems are solved in order to evaluate the performance of the implemented method when compared with other stochastic methods available in the Matlab environment. The results con rm that our imple- mentation is a competitive alternative both in term of numerical results and performance. Finally, a case study based on a parameter estimation problem of a biology system shows that the EM implementation could be applied with promising results in the control optimization area.
Resumo:
Firefly Algorithm is a recent swarm intelligence method, inspired by the social behavior of fireflies, based on their flashing and attraction characteristics [1, 2]. In this paper, we analyze the implementation of a dynamic penalty approach combined with the Firefly algorithm for solving constrained global optimization problems. In order to assess the applicability and performance of the proposed method, some benchmark problems from engineering design optimization are considered.
Resumo:
A search for new particles that decay into top quark pairs is reported. The search is performed with the ATLAS experiment at the LHC using an integrated luminosity of 20.3 fb−1 of proton-proton collision data collected at a centre-of-mass energy of s√=8 TeV. The lepton-plus-jets final state is used, where the top pair decays to W+bW−b¯¯, with one W boson decaying leptonically and the other hadronically. The invariant mass spectrum of top quark pairs is examined for local excesses or deficits that are inconsistent with the Standard Model predictions. No evidence for a top quark pair resonance is found, and 95% confidence-level limits on the production rate are determined for massive states in benchmark models. The upper limits on the cross-section times branching ratio of a narrow Z′ boson decaying to top pairs range from 4.2 pb to 0.03 pb for resonance masses from 0.4 TeV to 3.0 TeV. A narrow leptophobic topcolour Z′ boson with mass below 1.8 TeV is excluded. Upper limits are set on the cross-section times branching ratio for a broad colour-octet resonance with Γ/m = 15% decaying to tt¯. These range from 4.8 pb to 0.03 pb for masses from 0.4 TeV to 3.0 TeV. A Kaluza-Klein excitation of the gluon in a Randall-Sundrum model is excluded for masses below 2.2 TeV.
Resumo:
Tese de Doutoramento em Engenharia Mecânica.