Submitted by Renata Lopes (renatasil82@gmail.com) on 2016-07-20T13:53:44Z No. of bitstreams: 1 rafaelbrunodasilvabrandi.pdf: 3504861 bytes, checksum: 82d36b1bf645c59e92876390b55e996b (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2016-07-22T15:19:11Z (GMT) No. of bitstreams: 1 rafaelbrunodasilvabrandi.pdf: 3504861 bytes, checksum: 82d36b1bf645c59e92876390b55e996b (MD5) / Made available in DSpace on 2016-07-22T15:19:11Z (GMT). No. of bitstreams: 1 rafaelbrunodasilvabrandi.pdf: 3504861 bytes, checksum: 82d36b1bf645c59e92876390b55e996b (MD5) Previous issue date: 2011-03-30 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / O Sistema Elétrico Brasileiro (SEB) apresenta características peculiares devido às grandes dimensões do país e pelo fato da geração elétrica ser proveniente predominantemente de usinashidráulicasqueproporcionamaosistemaacapacidadedeumaregularizaçãoplurianualdos seusreservatórios. Asafluênciasnestasusinassãoestocásticasemuitasvezesapresentamcomportamentos complementares entre as diversas regiões do país, o que incentiva a existência de grandes intercâmbios energéticos entre os subsistemas através do Sistema Interligado Nacional (SIN). O planejamento da operação no horizonte de médio/longo prazo no país (que compreende a um período de 5 a 10 anos à frente com discretização mensal) é realizado por uma cadeia de modelos computacionais validados pelos principais agentes que atuam no SEB (comercialização, geração, transmissão e distribuição de energia). O principal modelo desta cadeia, a qual é desenvolvida pelo Centro de Pesquisas de Energia Elétrica/ELETROBRÁS, é o modelo NEWAVE que baseia-se na técnica de Programação Dinâmica Dual Estocástica (PDDE) para a determinação da política eletroenergética de médio prazo. O objetivo deste trabalho é implementar um modelo computacional para o planejamento da operação de médio prazo utilizando a metodologia de Programação Dinâmica Estocástica conjuntamente ao algoritmo de fechos convexos (PDE-ConvexHull) de uma forma computacionalmente eficiente (Fast-PDE-ConvexHull). Isto porque observou-se que quando utiliza-se a técnicadaPDE-ConvexHull,umnúmeroelevadodehiperplanossãoobtidosnacomposiçãodas funçõesdecustofuturoe,comisto,osdiversosproblemasdeprogramaçãolinearaseremresolvidos durante o processo iterativo podem tornar-se maiores, aumentando consideravelmente o tempodaexecuçãodocálculodapolíticaoperativa. Sendoassim,aprincipalcontribuiçãodeste trabalho é apresentar uma nova metodologia para a representação da função de custo futuro no problema de programação linear na qual o tempo computacional se torne menos sensível ao númerodehiperplanosobtidospeloalgoritmodefechosconvexos. Ressalta-sequetambémsão utilizadas técnicas de computação paralela com o objetivo de tornar o processo mais eficiente. A metodologia foi utilizada para o cálculo do planejamento de médio prazo do SEB, baseando-se em subsistemas equivalentes de energia. A metodologia Fast-PDE-ConvexHull foi incorporada a uma plataforma computacional, desenvolvida em C++/Java, capaz de considerar o mesmo conjunto de dados utilizado pelos modelos oficiais do SEB, compondo assim um modelo robusto para a resolução do problema. Primeiramente, para fins de validação da metodologia proposta, comparou-se os resultados obtidos pela metodologia da Fast-PDE-ConvexHull com os resultados obtidos pela utilização da técnica da PDE-ConvexHull com o objetivo verificar o ganho computacional e a aderência dos resultados. Por fim, como a plataforma computacional desenvolvida é capaz de utilizar o conjunto de dados oficiais disponibilizados para o SIN, fez-se o uso do Programa Mensal de Operação (PMO) de janeiro de 2011, disponibilizado pelo Operador Nacional do Sistema (ONS), como caso de estudo para comparação dos resultados obtidos pela metodologia proposta com os resultados obtidos pelo modelo NEWAVE. / The Brazilian National Grid (BNG) presents peculiar characteristics due to the huge territory dimensions and by the fact that the electricity generation is predominantly originated from hydraulic plants that provide for the system the capacity of a pluriannual regularization of the reservoirs. The water inflows to these plants are stochastic and often present complementary behavior among the regions of the country, stimulating the existence of big amounts of energy exchanges between the subsystems through the national grid. The long term operation planning problem (that includes a period of 5 to 10 years ahead with monthly discretization) is made by a chain of computational models that are validated by the main agents that act on BNG (commercialization, generation, transmition and distribution of energy). The primary model of this chain, which is developed by Electric Energy Research Center/ELETROBRÁS, is the NEWAVE model, which is based on the Stochastic Dual Dynamic Programming (SDDP) for electroenergetic policy determination on a long term horizon. Thisworkhastheobjectiveofimplementacomputationalmodelforthemid/longtermoperation planning using the Stochastic Dynamic Programming (SDP) together with the Convex Hull algorithm (PDE-ConvexHull) in a computationally efficient way (Fast-PDE-ConvexHull). This is because it was observed that when utilizing the PDE-ConvexHull technique, an elevated amount of hyperplanes are obtained for the composition of the cost-to-go function. So, the different linear programming problems to be solved during the iterative process can be turned larger, increasing the execution time for the operational policy calculus in a considerably manner. Thus, the main contribution of this work is to present a new methodology (FastPDE-ConvexHull) for the representation of the cost-to-go function on the linear programming problems where the computational time become less sensible to the number of hyperplanes obtained from the Convex Hull algorithm. It is highlighted that techniques of parallel computing was employed in order to turn the process more efficient. The methodology was utilized for the BNG’s long term planning calculus, based on the equivalent subsystems of energy. The methodology Fast-PDE-ConvexHull was incorporated to a computational platform, developed in C++/Java programming language, that is able to consider the same data set used by the official models acting on the BNG, compounding a robust model for the resolution of the problem. Firstly, in order to validate the proposed methodology, the results obtained from the FastPDE-ConvexHullarecomparedwiththoseobtainedfromtheutilizationofthePDE-ConvexHull technique aiming to verify the computational gain and the adherence between both results. Finally, as the elaborated computational platform is capable to use the official data set availablefortheNG,itwaspossibletheutilizationoftheMonthlyOperationalProgram(MOP) of January 2011, released by the Independent System Operator (ISO), as the study case for comparingtheresultsobtainedbytheproposedmethodologywiththeresultsobtainedfromthe NEWAVE model.

En informatique, les images sont numériques et donc composées de pixels en 2D et de voxels en 3D. Dans une scène virtuelle 3D, il est impossible de manipuler directement les objets comme des ensembles de voxels en raison du trop gros volume de données. Les objets sont alors polyédrisés, c’est-à-dire remplacés par une collection de facettes. Pour ce faire, il est primordial de savoir décider si un sous-ensemble de voxels peut être transformé en une facette dans la représentation polyédrique. Ce problème est appelé reconnaissance de plans discrets. Pour le résoudre, nous mettons en place un nouvel algorithme spécialement adapté pour les ensembles de voxels denses dans une boite englobante. Notre méthode atteint une complexité quasi-linéaire dans ce cas et s’avère efficace en pratique. En parallèle, nous nous intéressons à un problème algorithmique annexe intervenant dans notre méthode de reconnaissance de plans discrets. Il s’agit de calculer les deux enveloppes convexes des points de Z2 contenus dans un domaine vertical borné et situés de part et d’autre d’une droite quelconque. Nous proposons une méthode de complexité optimale et adaptative pour calculer ces enveloppes convexes. Nous présentons le problème de manière détournée : déterminer le nombre rationnel à dénominateur borné qui approxime au mieux un nombre réel donné. Nous établissons le lien entre ce problème numérique et son interprétation géométrique dans le plan. Enfin, nous proposons indépendamment un nouvel algorithme pour calculer l’épaisseur d’un ensemble de points dans le réseau Zd. Notre méthode est optimale en 2D et gloutonne mais efficace en dimension supérieure / In computer science, pictures are digital and so, they are composed of pixels in 2D or of voxels in 3D. In 3D virtual scenes, we cannot directly manipulate objects as sets of voxels because the data are too huge. As a result, the objects are transformed into polyhedra, i.e. collections of facets. For this, we must be able to decide if a subset of voxels can be replaced by a facet in the polyhedrisation. This problem is called digital plane recognition. To solve it, we design a new algorithm especially adapted for sets of voxels which are dense in a bounding box. Our method achieves a quasi-linear worst-case time complexity in this case and it is efficient in practice. In parallel, we study another algorithmic problem which occures in our digital plane recognition algorithm. It is computing the two convex hulls of grid points lying in a bounded vertical domain and located on either side of a straight line. We propose an optimal time complexity method to compute these convex hulls and which is also output sensitive. We present the problem in a different way : find the rational number of bounded denominator that best approximates a given real number. We establish the link between this numerical problem and geometry. Finally, we independently propose a new algorithm to compute the lattice width of a set of points in Zd. Our method is optimal in 2D and is greedy but efficent in higher dimension

No description available.

This study examines the claim that individuals misinterpret the mean of a dataset (displayed as a scatterplot) more when the convex hull of the dataset is less representative of the data. In addition, this study also tests whether outliers in the data can predict the magnitude of error that individuals make in interpreting the mean of the dataset. Lastly, the study investigates whether individuals’ interpretations are predicted better by the mean of the convex hull than by the full dataset’s mean. The method used to conduct these investigations is through a survey, followed by several linear regression analyses. Applications of this study include improving the communication of data in economic policy and business contexts, along with broader applications in extending models that heavily rely on agents’ interpretations of information: especially bounded rationality and social norm-based models. The results show that convex hull unrepresentativeness correlates positively with error in mean interpretation; however, that the convex hull mean is not predictive of the interpretations’ direction. Overall, the study contributes to the field of visual information interpretation by investigating the effect of data structure on its interpretation – an unexplored area of research. This is done while initiating the concretization of bounded rationality in economics, by exploring the idea that individuals perceive a general shape of the information presented to them rather than a detailed, full picture. This can lead to misinterpretations whenever the general shape (convex hull) is not representative of the dataset.

Splines are a common mixed-initiative technique for road generation. A designer draws the shape of the curve but the mesh can be procedurally generated along the spline. This relationship improves the workflow of building roads in virtual environments and video games without taking away all of the control of the designer. Whilst this technique is useful when building single roads such as race tracks, it unfortunately struggles when dealing with more complex road networks that feature intersections. These intersections struggle with overlapping meshes and flickering textures without a straightforward solution. This problem significantly limits the usefulness of spline tools when generating roads. This paper aims to solve part of this problem by suggesting a method for detecting intersections in splines that support procedural mesh generation.

No description available.

No description available.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2015-12-16T11:02:24Z No. of bitstreams: 1 talespulinhoramos.pdf: 6134665 bytes, checksum: 349537ae72f568271488022944942fb6 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2015-12-16T11:20:33Z (GMT) No. of bitstreams: 1 talespulinhoramos.pdf: 6134665 bytes, checksum: 349537ae72f568271488022944942fb6 (MD5) / Made available in DSpace on 2015-12-16T11:20:33Z (GMT). No. of bitstreams: 1 talespulinhoramos.pdf: 6134665 bytes, checksum: 349537ae72f568271488022944942fb6 (MD5) Previous issue date: 2015-02-23 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / O Sistema Interligado Nacional (SIN) apresenta cerca de 150 usinas hidráulicas e o planejamento de médio prazo contempla entre 5 e 10 anos de estudo, a representação do sistema à usinas individualizadas faz com que a resolução do problema seja muito custoso computacionalmente. Para isso, o sistema é representado a partir de sistemas equivalentes de energia. Existe um trabalho anterior onde foi realizado a flexibilização da modelagem do sistema, denominada modelagem híbrida, em que parte do sistema é representado através de sistemas equivalentes de energia e outra é representada à usinas individualizadas com a produtibilidade constante. Desta forma, consegue-se um maior detalhamento nos estudos de médio prazo mantendo a complexidade do sistema em um nível adequado computacionalmente. Este trabalho apresenta a modelagem híbrida entre sistemas equivalentes de energia e à usinas individualizadas, porém, considerando as não linearidades das usinas hidráulicas. As não linearidades das usinas basicamente se dão em relação a variação do nível do reservatório e da vazão defluente (vazão turbinada acrescida da vazão vertida), o que implica diretamente na geração hidráulica. A proposta consiste em modelar a geração hidráulica das usinas (Função de Produção Hidráulica - FPH), que é uma função analítica não linear e não convexa, por uma função linear por partes convexa que represente adequadamente a função de produção hidráulica analítica. Há um trabalho anterior onde a FPH é aproximada por uma função linear por partes em duas etapas, inicialmente a função é aproximada nas dimensões do armazenamento e do turbinamento e, em uma segunda etapa, é adicionado a contribuição do vertimento. Já neste trabalho, a FPH é aproximada por uma função linear por partes obtida em apenas uma etapa para as três dimensões a partir do algoritmo Convex Hull. Assim, é possível resolver o problema de médio prazo considerando parte do sistema representado de forma equivalente e outra parte de forma individualizada considerando a variação da geração hidráulica em função do volume armazenado, vazão turbinada e vertida (se houver influência no canal de fuga). / The National Interconnected Power System (NIPS) presents around 150 hydraulic plants and the medium term planning contemplates between 5 to 10 years of study, the representation of the system to individualized plants makes the problem impracticable in computing; then the system is represented from equivalent systems of energy. There is an alternative of modeling flexibility of the system named hybrid modeling, in which part of the system is represented through equivalent systems of energy and the other is represented to individualized plants with constant productivity. As a consequence, it is obtained greater detail in the long term studies, maintaining the complexity of the system in an adequate level in computing. This paper presents the hybrid modeling between equivalent systems of energy and individualized plants. However, it considers non-linearities on generation of hydraulic plants. The non-linear characteristic on generation function basically comes from the influence of the reservoir level (head term) and the release term (turbinated outflow added to spilled outflow). The suggestion is to model the hydraulic generation of the plants (Hydraulic Production Function - HPF), which is a non-linear and non-convex analytical function, into a convex piecewise linear function that represents appropriately the function of the analytical hydraulic production. It will be described in detail in this paper the technique used to obtain this piecewise linear function by applying the Convex Hull algorithm to guarantee the convexity of this function. To conclude, it is possible to solve the problem of long term considering part of the system represented by equivalent form and the other part in individualized manner considering the variation of the hydraulic generation in relation to the volume stored, turbaned and spilled outflow.

The minimally invasive approach of arthroscopy means less pain and faster recovery time for patients compared to open surgery. However, it implies a high difficulty of performance. Therefore, surgeon should remain at a high level of technical and professional expertise to perform such operations. Surgeon’s skills are being developed over years of surgical training on animals, cadavers and patients. Nowadays, cadavers and animal specimens present an ethical problem also the practice on real humans is usually risky. For surgeons to reach a high level, new and alternative ways of performing surgical training are required. Virtual reality technology has opened new realms in the practice of medicine. Today, virtual reality simulators have become one of the most important training methods in the medical field. These simulators allow medical students to examine and study organs or any structure of the human body in ways that were not possible few years earlier. Similarly, the surgeon as well as the medical student can gain a valuable experience by performing a particular surgery with an anatomical accuracy and realism as it is actually performed in the real world. Thus, they can practice on virtual operation before they proceed and operate on real patients. In this thesis, a virtual reality training simulator for wrist arthroscopy is introduced. Two main issues are addressed: the 3-D reconstruction process and the 3-D interaction. Based on a sequence of CT images a realistic representation of the wrist joint is obtained suitable for the computer simulation. Two main components of the computer-based system interface are illustrated: the 3-D interaction to guide the surgical instruments and the user interface for haptic feedback. In this context, algorithms that model objects using the convex hull approaches and simulate real time exact collision detection between virtual objects are presented. A force feedback device, coupled with a haptic algorithm, is used as a haptic interface with the computer simulation system. This leads in the development of a low cost system with the same benefits as professional devices. In this regard, the wrist arthroscopy can be simulated and medical students can learn the basic skills required with safety, flexibility and less cost / La chirurgie arthroscopique présente actuellement un essor très important pour le bénéfice du plus grand nombre des patients. Cependant, cette technique possède un certain nombre d’inconvénients et il est donc nécessaire pour le médecin de s’entrainer et répéter ses gestes afin de pouvoir exécuter ce type d’opération d’une façon efficace et certaine. En effet, les méthodes traditionnelles d’enseignement de la chirurgie sont basées sur l’autopsie des cadavres et l’entrainement sur des animaux. Avec l’évolution de notre société, ces deux pratiques deviennent de plus en plus critiquées et font l’objet de réglementations très restrictives. Afin d’atteindre un niveau plus élevé, de nouveaux moyens d’apprentissage sont nécessaires pour les chirurgiens. Récemment, la réalité virtuelle commence d’être de plus en plus utilisée dans la médecine et surtout la chirurgie. Les simulateurs chirurgicaux sont devenus une des matières les plus récentes dans la recherche de la réalité virtuelle. Ils sont également devenus une méthode de formation et un outil d’entrainement valable pour les chirurgiens aussi bien que les étudiants en médecine. Dans ce travail, un simulateur de réalité virtuelle pour l’enseignement de la chirurgie arthroscopique, surtout la chirurgie du poignet, a été préesenté. Deux questions principales sont abordées : la reconstruction et l’interaction 3-D. Une séquence d’images CT a été traitée afin de générer un modèle 3-D du poignet. Les deux principales composantes de l’interface du système sont illustrées : l’interaction 3-D pour guider les instruments chirurgicaux et l’interface de l’utilisateur pour le retour d’effort. Dans ce contexte, les algorithmes qui modélisent les objets en utilisant les approches de “Convex Hull” et qui simulent la détection de collision entre les objets virtuels en temps réel, sont présentés. En outre, un dispositif de retour d’effort est utilisé comme une interface haptique avec le système. Cela conduit au développement d’un système à faible coût, avec les mêmes avantages que les appareils professionnels. A cet égard, l’arthroscopie du poignet peut être simulée et les étudiants en médecine peuvent facilement utiliser le système et peuvent apprendre les compétences de base requises en sécurité, flexibilité et moindre coût

Submitted by Fabricia Fialho Reginato (fabriciar) on 2015-07-08T01:19:32Z No. of bitstreams: 1 VladimirGuerreiro.pdf: 5547701 bytes, checksum: b807e1f8091b49a5ee1e0b36e2ae4286 (MD5) / Made available in DSpace on 2015-07-08T01:19:32Z (GMT). No. of bitstreams: 1 VladimirGuerreiro.pdf: 5547701 bytes, checksum: b807e1f8091b49a5ee1e0b36e2ae4286 (MD5) Previous issue date: 2014 / Nenhuma / Em ambientes paralelos, uma das alternativas para tratar o dinamismo, tanto em nível de infraestrutura quanto de aplicação é o uso de migração, principalmente em aplicações que executam em fases utilizando BSP (Bulk Synchronous Parallel). Neste contexto, o modelo de reescalonamento MigBSP foi desenvolvido para tratar da realocação de processos em aplica- ções paralelas. Assim como o modelo BSP, ele considera as três fases de execução de uma superetapa: (i) computação local, (ii) comunicação global e (iii) uma barreira de sincroniza- ção; coletando dados localmente durante a computação para efetuar o cálculo do Potencial de Migração (PM) do processo. Com o PM e parâmetros adicionais fornecidos no inicio da execução da aplicação, o MigBSP tem condições de escolher processos candidatos a migração em uma aplicação paralela executando em um ambiente distribuído. Entretanto, as duas heurísticas possíveis de serem utilizadas hoje, dependem de informações fornecidas pelo usuário e/ou podem não selecionar uma quantidade eficiente de processos no momento do reescalonamento, podendo ser necessário várias chamadas para balancear o ambiente. Desta forma, esta disserta- ção apresenta duas novas heurísticas, MigCube e MigHull. Elas utilizam o MigBSP e efetuam a seleção automática de processos candidatos à migração sem a interferência do programador. As informações fornecidas pelo MigBSP são utilizadas nas heurísticas, a combinação das três métricas mensurados, posicionadas em um plano tridimensional, define cada processo como um ponto no espaço que possui as coordenadas x, y e z, onde cada eixo representa uma mé- trica para tomada de decisão. A heurística MigCube monta um cubo a partir das médias das distâncias entre os pontos, utilizando o processo com o maior PM como centro do cubo. A heurística MigHull segue a definição da Envoltória Convexa, tentando envolver todos os pontos, porém utilizando duas adaptações que se fazem necessárias para a aplicação neste trabalho. O MigBSP foi desenvolvido no simulador SimGrid, e este segue sendo utilizado para a criação das duas heurísticas apresentadas nesta dissertação. Nos testes realizados neste simulador, foi possível verificar um ganho de até 45% no tempo de execução da aplicação utilizando a heurística MigHull, e até 42% utilizando a MigCube, quando comparado a aplicação sem o modelo de migração. Porém, em simulações com um maior número de processos, este ganho tende a cair, já que um dos maiores problemas do BSP e aplicações que executam em grades é o tempo de sincronização de tarefas, ou seja, quanto mais processos, maior a necessidade de sincronização, e mesmo o balanceamento dos processos acaba tendo um resultado prejudicado. / In a parallel environment, one of the alternatives to address the dynamism, both at the infrastructure and application levels, is the use of migration, mostly with applications that execute in steps using BSP (Bulk Synchronous Parallel). In this context, the rescheduling model MigBSP was developed to deal with processes reallocation in parallel applications. As BSP model, MigBSP uses the three steps of a superstep: (i) computation, (ii) communication and (iii) a synchronization barrier; collecting local data during the computation step, to compute the processes’ Potential of Migration (PM). With the PM and additional parameters provided in the beginning of the application’s execution, MigBSP have conditions to choose the processes candidate to migrate in a parallel application running in a distributed system. However, the two heuristics possible to be used today depend of information provided by the user and/or may not select the proper quantity of processes in the rescheduling moment, being necessary many executions to balance the environment. This way, this dissertation present two new heuristics, MigCube and MigHull. They make use of MigBSP, and automatically will choose the processes to migrate without user interference. The information provided by MigBSP are used in the heuristics, the combination of the three measured metrics, positioned in a three-dimensional space, defines each process as a point in space and has the coordinates x, y e z, where each axis represents a metric for decision making. The MigCube heuristic build a cube from the average of the distances between points, using the process with the highest PM as the center of the cube. The MigHull follows the definition of a Convex Hull, trying to involve all points, but using two adaptations that are necessary to implement this work. The MigBSP was developed using SimGrid simulator, and it keeps being used to creation of the two heuristics presented in this dissertation. In the conducted tests in this simulator, was possible to achieve a gain of until 45% on application execution time using MigHull, and until 42% using MigCube, when compared with the application without the migration model. However, simulations with a bigger number of processes, this gain tends to fall, since one of the bigger problems of BSP and applications that run in grid is the time of tasks synchronization, that is, as more processes, more need of synchronization, and even the processes balancing ends up having an impaired outcome.