Anisotropic adaptive resolution of boundary layers for heat conduction problems

We deal with the numerical solution of heat conduction problems featuring steep gradients. In order to solve the associated partial differential equation a finite volume technique is used and unstructured grids are employed. A discrete maximum principle for triangulations of a Delaunay type is developed. To capture thin boundary layers incorporating steep gradients an anisotropic mesh adaptation technique is implemented. Computational tests are performed for an academic problem where the exact solution is known as well as for a real world problem of a computer simulation of the thermoregulation of premature infants.

Template-based quadrilateral meshing

Generating quadrilateral meshes is a highly non-trivial task, as design decisions are frequently driven by specific application demands. Automatic techniques can optimize objective quality metrics, such as mesh regularity, orthogonality, alignment and adaptivity; however, they cannot make subjective design decisions. There are a few quad meshing approaches that offer some mechanisms to include the user in the mesh generation process; however, these techniques either require a large amount of user interaction or do not provide necessary or easy to use inputs. Here, we propose a template-based approach for generating quad-only meshes from triangle surfaces. Our approach offers a flexible mechanism to allow external input, through the definition of alignment features that are respected during the mesh generation process. While allowing user inputs to support subjective design decisions, our approach also takes into account objective quality metrics to produce semi-regular, quad-only meshes that align well to desired surface features. Published by Elsevier Ltd.

As dimensões da sustentabilidade nas relações de poder: O Comércio Justo no setor alimentício brasileiro

A presente pesquisa tem por objetivo descrever e explicar como as dimensões econômica, social e ambiental interferem nas relações de poder setor alimentício brasileiro certificado Comércio Justo. A tese defendida é de que as dimensões da sustentabilidade – econômica, social e ambiental – interferem nas relações de poder entre organizações, tendo abrangência de impacto distintas. A base teórica de análise das relações de poder envolveu a conjunção entre as teorias de dependência de recursos, racionalidade limitada, custos de transação e a relação entre justiça e poder. O estudo demonstra como ocorrem interferências das dimensões elencadas, sendo a análise realizada a partir de: 1. conflitos ao longo da inserção d o Comércio Justo no Brasil; 2. estruturação das redes e parcerias; 4. uso de discursos; 5. papel de tecnologias e recursos; 6. preço; 7. entendimentos sobre justiça. O estudo é de cunho qualitativo, assumindo o caráter descritivo e interpretativo. A coleta de dados foi realizada por intermédio de: 1. pesquisa bibliográfica; 2. investigação documental e na internet – notadamente com auxílio da ferramenta alertas do google; 3. entrevistas; 4. pesquisa de campo. A amostra foi composta por dezenove representantes de organizações, inseridas no contexto dos produtores de alimentos certificados. A coleta teve o corte longitudinal. Realizou- se a análise discursiva, do conteúdo das entrevistas. A análise de dados resultou de leituras e triangulações diversas entre objetivos da pesquisa, referencial teórico e resultados da pesquisa. Como resultado do estudo, concluiu-se que há parcialidade nas relações, sendo afetadas predominantemente por interferências da dimensão econômica. A dependência em recursos proporciona relações assimétricas. Tecnologias e conhecimentos, por intermédio da dimensão social, servem de instrumentos para: 1. minorar as diferenças entre os atores; 2. proporcionar um diferencial efetivo, que não apoiado exclusivamente na certificação. A configuração de organizações, parcerias e redes é passível de redução de assimetrias, quando compreendidas necessidades de pessoas, conhecimentos específicos e, portanto, da relevância da dimensão social. A variável ambiental é relevante, sobretudo em termos de recursos e processos produtivos. Porém, o impacto da dimensão ambiental gera interferências superiores, quando há: 1. a conscientização sobre sua relevância; 2. demandas sociais e de mercado por adaptações em processos. Logo, interferências do meio ambiente nas relações de poder são originárias, principalmente, daquelas de caráter social e econômico. Conclui-se, portanto, que há validade na tese da existência de distinção no impacto e interferências das dimensões da sustentabilidade, nas relações de poder entre organizações.

A característica de Euler

Pós-graduação em Matemática em Rede Nacional - IBILCE

The meccano method for simultaneous volume parametrization and mesh generation of complex solids

[EN]The meccano method is a novel and promising mesh generation method for simultaneously creating adaptive tetrahedral meshes and volume parametrizations of a complex solid. We highlight the fact that the method requires minimum user intervention and has a low computational cost. The method builds a 3-D triangulation of the solid as a deformation of an appropriate tetrahedral mesh of the meccano. The new mesh generator combines an automatic parametrization of surface triangulations, a local refinement algorithm for 3-D nested triangulations and a simultaneous untangling and smoothing procedure. At present, the procedure is fully automatic for a genus-zero solid. In this case, the meccano can be a single cube. The efficiency of the proposed technique is shown with several applications...

Multithread parallelization of lepp-bisection algorithms

[EN]Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge...

Metaheuristic approaches for MWT and MWPT problems

It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of the Minimum Weight Pseudo-Triangulation problem is unknown, yet it is suspected to be also NP-hard. Therefore we focused on the development of approximate algorithms to find high quality triangulations and pseudo-triangulations of minimum weight. In this work we propose two metaheuristics to solve these problems: Ant Colony Optimization (ACO) and Simulated Annealing (SA). For the experimental study we have created a set of instances for MWT and MWPT problems, since no reference to benchmarks for these problems were found in the literature. Through experimental evaluation, we assess the applicability of the ACO and SA metaheuristics for MWT and MWPT problems. These results are compared with those obtained from the application of deterministic algorithms for the same problems (Delaunay Triangulation for MWT and a Greedy algorithm respectively for MWT and MWPT).

Improving shortest paths in the Delaunay triangulation

We study a problem about shortest paths in Delaunay triangulations. Given two nodes s; t in the Delaunay triangulation of a point set P, we look for a new point p that can be added, such that the shortest path from s to t in the Delaunay triangulation of P u{p} improves as much as possible. We study properties of the problem and give efficient algorithms to find such a point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed.

Using ACO metaheuristic for MWT problem

Globally optimal triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) problem of a given set of n points in the plane. This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality triangulations. For the experimental study we have created a set of instances for MWT problem since no reference to benchmarks for these problems were found in the literature. Through the experimental evaluation, we assess the applicability of the ACO metaheuristic for MWT problem.

Approximations on minimum weight pseudo-triangulation problem using ant colony optimization

In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. Globally optimal pseudo-triangulations with respect to the weight, as optimization criteria, are difficult to be found by deterministic methods, since no polynomial algorithm is known. We show how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality pseudo-triangulations of minimum weight. We present the experimental and statistical study based on our own set of instances since no reference to benchmarks for these problems were found in the literature. Throughout the experimental evaluation, we appraise the ACO metaheuristic performance for MWPT problem.

A neural network algorithm to simplify 2D meshes

In this paper we propose a neural network model to simplify and 2D meshes. This model is based on the Growing Neural Gas model and is able to simplify any mesh with different topologies and sizes. A triangulation process is included with the objective to reconstruct the mesh. This model is applied to some problems related to urban networks.

Approximation Classes for Adaptive Methods

* This work has been supported by the Office of Naval Research Contract Nr. N0014-91-J1343, the Army Research Office Contract Nr. DAAD 19-02-1-0028, the National Science Foundation grants DMS-0221642 and DMS-0200665, the Deutsche Forschungsgemeinschaft grant SFB 401, the IHP Network “Breaking Complexity” funded by the European Commission and the Alexan- der von Humboldt Foundation.

Unistructuralité des algèbres amassées de type Ã

Assem, Schiffler et Shramchenko ont émis comme conjecture que toute algèbre amassée est unistructurelle, c'est-à-dire que l'ensemble des variables amassées détermine uniquement la structure d'algèbre amassée. En d'autres mots, il existe une unique décomposition de l'ensemble des variables amassées en amas. Cette conjecture est prouvée dans le cas des algèbres amassées de type Dynkin ou de rang 2. Le but de ce mémoire de la prouver également dans le cas des algèbres amassées de type Ã. Nous utilisons les triangulations de couronnes et l'indépendance algébrique des amas pour prouver l'unistructuralité des algèbres provenant de couronnes, donc de type Ã. Nous prouvons également la conjecture des automorphismes pour les algèbres de type à comme conséquence immédiate.

Team performance according to ball possession characteristics : a social networks approach

Over the last few years, football entered in a period of accelerated access to large amount of match analysis data. Social networks have been adopted to reveal the structure and organization of the web of interactions, such as the players passing distribution tendencies. In this study we investigated the influence of ball possession characteristics in the competitive success of Spanish La Liga teams. The sample was composed by OPTA passing distribution raw data (n=269,055 passes) obtained from 380 matches involving all the 20 teams of the 2012/2013 season. Then, we generated 760 adjacency matrixes and their corresponding social networks using Node XL software. For each network we calculated three team performance measures to evaluate ball possession tendencies: graph density, average clustering and passing intensity. Three levels of competitive success were determined using two-step cluster analysis based on two input variables: the total points scored by each team and the scored per conceded goals ratio. Our analyses revealed significant differences between competitive performances on all the three team performance measures (p < .001). Bottom-ranked teams had less number of connected players (graph density) and triangulations (average clustering) than intermediate and top-ranked teams. However, all the three clusters diverged in terms of passing intensity, with top-ranked teams having higher number of passes per possession time, than intermediate and bottom-ranked teams. Finally, similarities and dissimilarities in team signatures of play between the 20 teams were displayed using Cohen’s effect size. In sum, findings suggest the competitive performance was influenced by the density and connectivity of the teams, mainly due to the way teams use their possession time to give intensity to their game.