O modelo cam-clay modificado foi aplicado aos resultados experimentais obtidos para um solo arenoso típico da cidade de São Carlos. Os ensaios de compressão triaxial foram conduzidos em equipamento moderno, com instrumentação interna, segundo distintas trajetórias de carregamento. Verificou-se que os resultados obtidos em termos de modelagem foram satisfatórios, principalmente quando a tensão octaédrica (p\') foi diminuida durante os carregamentos. Nesse caso, tanto em termos de modelagem como de resultados experimentais, houve expansão de volume do solo. Com o aumento da tensão octaédrica, verificou-se a ocorrência de compressão volumétrica do solo. Observou-se que o modelo apresenta uma previsão de deformações axiais maiores do que as observadas experimentalmente nas trajetórias de -30, -50, 30, 40, 50, 60, 120 graus e no ensaio triaxial convencional com \'sigma\' 3 = 100 kPa. Além disso, determinou-se a superfície inicial de plastificação do solo utilizando-se dois critérios que tenderam a fornecer valores de tensão de cedência aproximadamente iguais, notando-se que a condição de fluxo associado não é obedecida. / The modified cam-clay model was used to model experimental results of a sandy soil from São Carlos - SP. Triaxial compression tests were performed using Bishop - Wesley cell with internal transducers to measure axial and radial strains. It was observed that the model fairly fitted experimental results, specially when medium effective stress (p\') is reduced during loading. In this case, both the model and the experimental results, showed volume increase. When (p\') increases the model and the tests showed a tendency to give volumetric compression, although the values were differents. The model yielded strains larger than that measured in the tests when the stress-paths were of -30, -50, 30, 40, 50, 60, 120 degrees and in axial compression test with 100 kPa of confining pressure. Besides that, initial yield surface of soil was calculated from test results using two different criteria which gave about the same yield stress and it is show that normality rule was not satisfied in this soil.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2016-03-02T13:26:26Z No. of bitstreams: 1 analuziacaixeiro.pdf: 3299896 bytes, checksum: 3619e3fa331f347bd57b661a0a5d5a70 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2016-03-03T14:50:47Z (GMT) No. of bitstreams: 1 analuziacaixeiro.pdf: 3299896 bytes, checksum: 3619e3fa331f347bd57b661a0a5d5a70 (MD5) / Made available in DSpace on 2016-03-03T14:50:47Z (GMT). No. of bitstreams: 1 analuziacaixeiro.pdf: 3299896 bytes, checksum: 3619e3fa331f347bd57b661a0a5d5a70 (MD5) Previous issue date: 2013-04-29 / Este trabalho tem como foco o estudo da Fraternidade Cósmica Universal, um grupo sediado na cidade de Petrópolis, Rio de Janeiro, Brasil. O grupo realiza encontros entre segmentos religiosos e não religiosos, promovendo o conhecimento, a interação e o diálogo entre as diversas tradições. O objetivo desta pesquisa foi compreender essa dinâmica. Para sua execução foram realizadas visitas ao grupo, observações, participações em suas atividades e entrevistas com seus membros efetivos e visitantes. O resultado encontra-se organizado em três capítulos. No primeiro capítulo serão abordados o diálogo inter-religioso no atual contexto do pluralismo, a questão da identidade, da busca pelo sentido e as novas configurações religiosas. No segundo capítulo serão apresentados a criação e o histórico do grupo, as atividades desenvolvidas pela casa, a dinâmica dos encontros e os espaços físicos onde ocorrem. O terceiro capítulo apresentará os personagens envolvidos nesse processo, suas trajetórias até o grupo e as funções que desempenham na construção de um espaço para o exercício do diálogo inter-religioso e na formação de uma identidade para o grupo. A análise final apresentará os elementos desta dinâmica do diálogo inter-religioso que ocorre na Fraternidade Cósmica Universal. / This research focuses on the study of the Fraternidade Cósmica Universal, a group headquartered in the city of Petropolis, Rio de Janeiro, Brazil. The group set up meetings between religious and non-religious segments, promoting knowledge, interaction and dialogue between different traditions. The purpose of this work was to understand this dynamics. For its implementation, visits were done to the group, observations, participation in activities and interviews with its members and visitors. The result of this research is organized into three chapters. In the first chapter will be addressed interfaith dialogue in the current context of pluralism, the question of identity, the search for meaning and new religious settings. In the second chapter will be presented the creation and history of the group, the activities of the home, the dynamics of the meetings and the physical spaces in which they occur. The third chapter introduces the characters involved in this process, their trajectories to the group and the roles they play in the construction of a space for the exercise of interfaith dialogue and the formation of an identity for the group. The final analysis will present the elements of the dynamics of interfaith dialogue that occurs in Fraternidade Cósmica Universal.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-05-31T17:34:37Z No. of bitstreams: 1 thiagoboubeecardozo.pdf: 664105 bytes, checksum: c76b7de470f214d95d3054d0ac7b8232 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-06-01T11:40:26Z (GMT) No. of bitstreams: 1 thiagoboubeecardozo.pdf: 664105 bytes, checksum: c76b7de470f214d95d3054d0ac7b8232 (MD5) / Made available in DSpace on 2017-06-01T11:40:26Z (GMT). No. of bitstreams: 1 thiagoboubeecardozo.pdf: 664105 bytes, checksum: c76b7de470f214d95d3054d0ac7b8232 (MD5) Previous issue date: 2013-05-27 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / A Internet é um sistema em contínua evolução. Nesta dissertação, é caracterizada e analisada a recente evolução da conectividade fim-a-fim da Internet, comparando métricas importantes ao desempenho fim-a-fim de dois períodos distintos separados por 5 anos. Os resultados mostram que a distribuição do tamanho médio dos caminhos se mantém pouco alterada de 2006 para 2011, mas a distribuição do atraso acabou piorando, com um aumento de 45% no atraso dos caminhos de 2006 para 2011. Isso afeta diretamente o desempenho e degrada a experiência do usuário. Além disso, é mostrado que a diversidade de caminhos diminuiu e, com isso, os caminhos distintos ficaram um pouco mais similares. Esse resultado tem um impacto direto nos algoritmos de roteamento que tentam explorar a diversidade de caminhos para uma maior tolerância a falhas. Depois foi estudado mais a fundo o fenômeno conhecido como bufferbloat, que é uma das possíveis causas do aparente aumento da latência. Os resultados mostraram que filas muito grandes podem impactar fortemente no desempenho da rede, mas também indicaram que provavelmente o problema não irá ocorrer em máquinas Unix Like com as configurações padrão. / The Internet is a system under continuous evolution. In this dissertation, it is characte rized and analyzed the recent end-to-end connectivity evolution of the Internet, comparing key end-to-end performance metrics from two distinct periods separated by five years. The findings show that the average path length distribution remains virtually unchanged from 2006 to 2011, but the delay distribution actually became worse, with a 45% increase in path delay from 2006 to 2011. This directly affects network performance and degrades user experience. Furthermore, it is shown that path diversity decreased, and accordingly, distinct paths became slightly more similar. This result has a direct impact on routing algorithms that try to explore path diversity to become more fault-tolerant. Later it was studied more deeply the phenomenon known as bufferbloat, which is one of the possible causes of the apparent increase of latency. The results show that large buffers can strongly degrade the network performance, but they also show that the problem is not likely to occur in Unix Like machines with default settings.

Les chantiers de construction contiennent plusieurs installations. Celles-ci sont susceptibles d’être endommagées par des incidents liés aux risques naturels ou technologiques comme les incendies, les explosions, les ondes de souffles, etc. Ces incidents peuvent avoir des conséquences néfastes sur l’ensemble du processus de construction, ce qui pourrait entrainer des accidents graves ayant un impact majeur sur la productivité des employés, le temps global du projet, sa qualité et son budget. Par conséquent les gestionnaires et les planificateurs du projet doivent adopter et développer des approches novatrices capables de faire face aux risques naturels potentiels, de minimiser leurs conséquences et de faciliter l’évacuation du site en cas de danger. Une de ces approches consiste à optimiser l’aménagement des chantiers de construction. En général, la réduction des dommages résultants de risques naturels ou technologiques est encore un défi scientifique.Dans cette thèse, deux modèles (déterministe et probabiliste) sont développés pour minimiser les risques au sein d’un chantier. La méthode adoptée pour le développement de ces deux modèles consiste en :• La modélisation des éléments du chantier, par exemple : le générateur électrique, les bureaux et les entrepôts de matériaux, sont modélisés en 2D, pour agir en tant que source d’aléa et/ou cible vulnérable potentielle.• La modélisation de l’aléa : elle montre l’interaction des aléas entre les composants du chantier.• La modélisation de la vulnérabilité : elle représente la faiblesse potentielle des cibles sur l’aléa généré par chaque source.• La définition de la fonction d’utilité : elle vise à offrir une disposition optimisée avec un minimum de risque total sur le chantier. L’algorithme à évolution différentielle est adopté pour exécuter le processus d’optimisation.D’une part, dans le modèle déterministe, nous utilisons le principe de la syntaxe spatiale pour étudier l’impact des configurations spatiales dans l’évaluation du risque sur le chantier. Par conséquent, comme le processus d’évacuation est pris en compte dans l’estimation du risque, le risque réel est amplifié en utilisant le facteur de pénalité appelé « profondeur moyenne ». L’algorithme de Dijkstra est appliqué sur un modèle déterministe afin de trouver les chemins les plus sûrs (chemins de moindre risque) pour évacuer les sites à partir de chaque position sur le chantier vers les lieux sûrs afin de diminuer les pertes humaines et matérielles.D’autre part, le modèle probabiliste suppose que le risque est composé de la défaillance individuelle de chaque installation sur le chantier de construction. La simulation numérique est utilisée pour trouver la distribution de probabilités des défaillances pour l’ensemble du site.Les fonctionnalités d’un SIG (Système d’Information Géographique) ont été utilisées pour présenter les données sous forme de cartes, pour produire des cartes spatiales de risque sur le chantier de construction, pour mettre en œuvre l’algorithme de Dijkastra et pour l’analyse du coût le plus faible.A titre indicatif, les modèles proposés sont utilisés dans un cas d’étude comprenant plusieurs installations. Dans le modèle déterministe, toutes ces installations agissent comme des sources d’aléa et des cibles vulnérables, en même temps, dans le modèle probabiliste, quelques-unes de ces installations agissent comme des sources d’aléa et toutes comme des cibles vulnérables. Les résultats obtenus montrent que les modèles proposés sont efficaces en raison de leur capacité à générer une disposition optimale du site avec un environnement de travail plus sûr. En outre, les modèles obtenus sont capables de mettre en évidence les zones les plus risquées d’un chantier, de générer les chemins d’évacuation les moins risqués, ce qui permettra de minimiser les blessures graves et les victimes en cas d’urgence / Construction sites contain several supporting facilities that are required to complete construction activities. These facilities are susceptible to damage due to the occurrence of natural or technological hazards such as fire, explosion, blast wave, and so on. These may cause adverse consequences for the whole construction process, which in turn lead to fatal accidents that have a major impact on worker and employee productivity, project completion time, project quality and project budget. Therefore, project planners must adopt and develop innovative approaches able to face the occurrence of potential hazards, minimize their consequences, and facilitate the evacuation of the site in case of their occurrence. One of these approaches is optimizing construction site layout. In general, generating construction site layout able minimizing risk resulting from natural or technological hazards is still a scientific challenge.In the present research, two proposed model (deterministic and probabilistic) are developed to minimize the risks within a construction site. The common methodology adopted to develop these two models consists of:• Modeling construction site components, for instance; electric generator, offices and material storages, in a 2D layout, to act as either hazardous source or potential target or both at the same time.• Modeling hazard: it shows the hazard interaction among site components and the attenuation of hazard.• Modeling vulnerability: it represents the potential weakness of whole targets to the hazard generated from each source.• Defining the utility function: it aims to afford an optimized site layout with minimum total risk in the construction site. The differential evolution algorithm is adopted to run optimization process.Particularly, in the deterministic model, we use space syntax principle in order to realize the impact of space configurations in evaluating the risk in the construction site. Therefore, as the evacuation process is considered in estimating the risk, the actual risk is amplified by utilizing penalty factor called mean depth. Furthermore, Dijkstra’s algorithm is run on deterministic model to find the safest paths (least risk paths) for evacuating sites from any position on the construction site towards the safe places in order to diminish losses and fatalities. On the other hand, the framework utilized to develop a probabilistic model assumed that the risk is combined of the individual failure of each facility within a construction site. Moreover, the numerical simulation is performed to find the probabilistic distribution of failure for the whole site.Geographic information system (GIS) capabilities were exploited, in this research, to present data in maps format, generate the spatial risk map in the construction site, and implement the Dijkstra’s algorithm and least-cost path analysis.For illustration purposes, the proposed models are employed in a case study consisting of several facilities. In the deterministic model, all of these facilities act as hazardous sources and potential targets, at the same time, while, in a probabilistic model, only three of these facilities act as fire hazardous sources, whereas, all of them are potential targets. The results revealed that the proposed models are efficient due to their capability of generating site layout with the safer work environment. In addition, the model is capable of highlighting the riskiest areas within a construction site. Moreover, the proposed models are able to generate paths through least-risk zones, which will minimize the serious injuries and victims in cases of emergencies

No description available.

Les graphes sont des objets couramment utilisés pour modéliser de nombreuses situations réelles comme des réseaux routiers, informatiques ou encore électriques. Ils permettent de résoudre des problèmes sur ces réseaux comme le routage (aller d'un sommet à un autre en suivant les arêtes du graphe) ou encore leur exploration (obtenir une carte du graphe étudié). Les réseaux étudiés, et donc les graphes qui les modélisent, peuvent être grands, c'est-à-dire avoir un très grand nombre de sommets. Dans ce cas, comme dans le cas de l'étude de grandes données en général, nous pouvons utiliser le paradigme << Diviser pour mieux régner >> pour répondre aux questions posées. En effet, en travaillant sur des petites parties du graphe et en fusionnant les résultats obtenus sur ces petites parties, on peut obtenir le résultat sur le graphe global. Dans ce document, nous présenterons une manière de décomposer les graphes en utilisant des plus courts chemins comme séparateurs. Cette décomposition permet d'obtenir, par exemple, un routage efficace, un étiquetage compacte pour pouvoir estimer les distances entre les sommets d'un graphe ou encore une navigation efficace dans les graphes<< petit monde >>. Cette méthode va nous permettre de définir de nouvelles classes de graphes. / Graphs are widely used to MODELISER a lot of real situations like road networks, computers networks or electricity ones. Using them, we can solve problems on these networks like routing (go from a vertex ti another one) or explore them (to have a map of studied graph).Studied networks, and so graphs which MODELISER them, can be large (i.e. have a lot of vertices). In this case, we can use the paradigm "Divide and conquer" to answer the questions. Indeed, working on small parts of graphs and merging the results on these small parts, we can obtain the result on the whole graph.In this document, we present a way to separate graphs using shortest paths like separators. This decomposition let to obtain a compact routing, a compact labeling to estimate the distance between vertices of the graph. This method let us to define new class of graphs.

Dans la présente thèse nous étudions l'extraction d'arbres dans des graphes arêtes-coloriés.Nous nous concentrons sur la recherche d'arbres couvrants proprement arête-coloriés et faiblement arête-coloriés, notée PST et WST. Nous montrons que les versions d'optimisation de ces problèmes sont NP-Complete dans le cas général des graphes arêtes-coloriés, et nous proposons des algorithmes pour trouver ces arbres dans le cas des graphes arêtes-coloriés sans cycles proprement arêtes-coloriés.Nous donnons également quelques limites de nonapproximabilité. Nous proposons des conditions suffisantes pour l'existence de la PST dans des graphes arêtes-coloriés (pas forcément propre), en fonction de différents paramètres de graphes, tels que : nombre total de couleurs, la connectivité et le nombre d'arêtes incidentes dedifférentes couleurs pour un sommet. Nous nous intéressons aux chemins hamiltoniens proprement arêtes-coloriés dans le casdes multigraphes arêtes-coloriés. Ils présentent de l'intérêt pour notre étude, car ce sontégalement des arbres couvrants proprement arêtes-coloriés. Nous établissons des conditions suffisantes pour qu'un multigraphe contienne un chemin hamiltonien proprement arêtes-coloriés, en fonction de plusieurs paramètres tels que le nombre d'arêtes, le degré d'arêtes, etc. Puisque l'une des conditions suffisantes pour l'existence des arbres couvrants proprement arêtes-coloriés est la connectivité, nous prouvons plusieurs bornes supérieures pour le plus petit nombre de couleurs nécessaires pour la k-connectivité-propre. Nous énonçons plusieurs conjectures pour les graphes généraux et bipartis, et on arrive à les prouver pour k = 1. / In this thesis, we investigate the extraction of trees from edge-colored graphs. We focus on finding trees with properties based on coloring. Namely, we deal with proper and weak proper spanning trees, denoted PST and WST.- We show the optimization versions of these problems to be NP-hard in the general case of edge-colored graphs and we provide algorithms to find these trees in the case of edge-colored graphs without properly edge-colored cycles. We also provide some nonapproximability bounds.- We investigate the existence of a PST in the case of edge-colored graphs under certain conditions on the graph, both structural and related to the coloration. We consider sufficient conditions that guarantee the existence of a PST in edge-colored (not necessarily proper) graphs with any number of colors. The conditions we consider are combinations ofvarious parameters such as : total number of colors, number of vertices, connectivity and the number of incident edges of different colors to the vertices.- We then consider properly edge-colored Hamiltonian paths in the edge-colored multigraphs, which are relevant to our study since they are also PST. We establish sufficient conditions for a multigraph to contain a proper edge-colored Hamiltonian path, depending on several parameters such as the number of edges, the degree of edges, etc.- Since one of the sufficient conditions for the existence of proper spanning trees is connectivity, we prove several upper bounds for the smallest number of colors needed to color a graph such that it is k-proper-connected. We state several conjectures for general and bipartite graphs, and we prove them for k = 1.

Neste trabalho consideramos um problema da Antropologia. A modelagem de sociedades e casamentos de indivíduos é feita com grafos mistos e encontrar caminhos disjuntos é uma questão central no problema. O problema é NP-completo e, quando visto como um problema parametrizado, ele é W[1]-difícil. Alguns subproblemas que surgem durante o processo de obter uma solução para o problema, envolvem caminhos disjuntos e podem ser resolvidos em tempo polinomial. Implementamos algoritmos polinomiais que são usados em uma ferramenta desenvolvida para solucionar o problema na Antropologia considerado. Nossa solução funcionou bem para as sociedades fornecidas pelos nossos parceiros. / In this work we consider a problem from the Anthropology. The model of the societies and the marriages of individuals is done with mixed graphs and to find disjoint paths is a central question in the problem. The problem is NP-complete and W[1]-hard when it is considered a parameterized problem. Some subproblems that arise during the process to obtain a solution for the problem, involve disjoint paths and can be solved in polynomial time. We implemented some polynomial algorithms that are used in a tool developed to solve the problem in the Anthropology considered. Our solution worked well for the societies provided by our partners.

O Problema dos K Menores Caminhos é uma generalização do Problema do Menor Caminho, em que desejamos encontrar os K caminhos de menor custo entre dois vértices de um grafo. Estudamos e implementamos algoritmos que resolvem esse problema em grafos dirigidos, com peso nos arcos e que permitem apenas caminhos sem repetição de vértices na resposta. Comparamos seus desempenhos utilizando grafos do 9th DIMACS Implementation Challenge. Identificamos os pontos fortes e fracos de cada algoritmo, e propusemos uma variante híbrida dos algoritmos de Feng e de Pascoal. Essa variante proposta obteve desempenho superior aos algoritmos base em alguns grafos, e resultado superior a pelo menos um deles na grande maioria dos testes. / The K-Shortest Path Problem is a generalization of the Shortest Path Problem, in which we must find the K paths between two vertices in a graph that have the lowest costs. We study some K-Shortest Path Problem algorithms applied to weighted directed graphs, allowing only paths with no repeated vertices. We compare empirically implementation of some algorithms, using instance graphs from the 9th DIMACS Implementation Challenge. We identify the strengths and weaknesses of each algorithm, and we propose a hybrid version of Feng\'s and Pascoal\'s algorithms. This proposed variant achieve better perfomance compared to both base algorithms in some graphs, and it is better than at least one of them in most cases.

O modelo cam-clay modificado foi aplicado aos resultados experimentais obtidos para um solo arenoso típico da cidade de São Carlos. Os ensaios de compressão triaxial foram conduzidos em equipamento moderno, com instrumentação interna, segundo distintas trajetórias de carregamento. Verificou-se que os resultados obtidos em termos de modelagem foram satisfatórios, principalmente quando a tensão octaédrica (p\') foi diminuida durante os carregamentos. Nesse caso, tanto em termos de modelagem como de resultados experimentais, houve expansão de volume do solo. Com o aumento da tensão octaédrica, verificou-se a ocorrência de compressão volumétrica do solo. Observou-se que o modelo apresenta uma previsão de deformações axiais maiores do que as observadas experimentalmente nas trajetórias de -30, -50, 30, 40, 50, 60, 120 graus e no ensaio triaxial convencional com \'sigma\' 3 = 100 kPa. Além disso, determinou-se a superfície inicial de plastificação do solo utilizando-se dois critérios que tenderam a fornecer valores de tensão de cedência aproximadamente iguais, notando-se que a condição de fluxo associado não é obedecida. / The modified cam-clay model was used to model experimental results of a sandy soil from São Carlos - SP. Triaxial compression tests were performed using Bishop - Wesley cell with internal transducers to measure axial and radial strains. It was observed that the model fairly fitted experimental results, specially when medium effective stress (p\') is reduced during loading. In this case, both the model and the experimental results, showed volume increase. When (p\') increases the model and the tests showed a tendency to give volumetric compression, although the values were differents. The model yielded strains larger than that measured in the tests when the stress-paths were of -30, -50, 30, 40, 50, 60, 120 degrees and in axial compression test with 100 kPa of confining pressure. Besides that, initial yield surface of soil was calculated from test results using two different criteria which gave about the same yield stress and it is show that normality rule was not satisfied in this soil.