Smart visible sets para ambientes de rede

A visualização em tempo real de cenas complexas através de ambientes de rede é um dos desafios na computação gráfica. O uso da visibilidade pré-computada associada a regiões do espaço, tal como a abordagem dos Potentially Visible Sets (PVS), pode reduzir a quantidade de dados enviados através da rede. Entretanto, o PVS para algumas regiões pode ainda ser bastante complexo, e portanto uma estratégia diferente para diminuir a quantidade de informações é necessária. Neste trabalho é introduzido o conceito de Smart Visible Set (SVS), que corresponde a uma partição das informações contidas no PVS segundo o ângulo de visão do observador e as distâncias entre as regiões. Dessa forma, o conceito de “visível” ou de “não-visível” encontrado nos PVS é estendido. A informação referente ao conjunto “visível” é ampliada para “dentro do campo de visão” ou “fora do campo de visão” e “longe” ou “perto”. Desta forma a informação referente ao conjunto “visível” é subdividida, permitindo um maior controle sobre cortes ou ajustes nos dados que devem ser feitos para adequar a quantidade de dados a ser transmitida aos limites impostos pela rede. O armazenamento dos SVS como matrizes de bits permite ainda uma interação entre diferentes SVS. Outros SVS podem ser adicionados ou subtraídos entre si com um custo computacional muito pequeno permitindo uma rápida alteração no resultado final. Transmitir apenas a informação dentro de campo de visão do usuário ou não transmitir a informação muito distante são exemplos dos tipos de ajustes que podem ser realizados para se diminuir a quantidade de informações enviadas. Como o cálculo do SVS depende da existência de informação de visibilidade entre regiões foi implementado o algoritmo conhecido como “Dual Ray Space”, que por sua vez depende do particionamento da cena em regiões. Para o particionamento da cena em uma BSP-Tree, foi modificada a aplicação QBSP3. Depois de calculada, a visibilidade é particionada em diferentes conjuntos através da aplicação SVS. Finalmente, diferentes tipos de SVS puderam ser testados em uma aplicação de navegação por um cenário 3D chamada BSPViewer. Essa aplicação também permite comparações entre diferentes tipos de SVS e PVS. Os resultados obtidos apontam o SVS como uma forma de redução da quantidade de polígonos que devem ser renderizados em uma cena, diminuindo a quantidade de informação que deve ser enviada aos usuários. O SVS particionado pela distância entre as regiões permite um corte rápido na informação muito distante do usuário. Outra vantagem do uso dos SVS é que pode ser realizado um ordenamento das informações segundo sua importância para o usuário, desde que uma métrica de importância visual tenha sido definida previamente.

Endogenous debt constraints in collateralized economies with default penalties

In infinite horizon financial markets economies, competitive equilibria fail to exist if one does not impose restrictions on agents' trades that rule out Ponzi schemes. When there is limited commitment and collateral repossession is the unique default punishment, Araujo, Páscoa and Torres-Martínez (2002) proved that Ponzi schemes are ruled out without imposing any exogenous/endogenous debt constraints on agents' trades. Recently Páscoa and Seghir (2009) have shown that this positive result is not robust to the presence of additional default punishments. They provide several examples showing that, in the absence of debt constraints, harsh default penalties may induce agents to run Ponzi schemes that jeopardize equilibrium existence. The objective of this paper is to close a theoretical gap in the literature by identifying endogenous borrowing constraints that rule out Ponzi schemes and ensure existence of equilibria in a model with limited commitment and (possible) default. We appropriately modify the definition of finitely effective debt constraints, introduced by Levine and Zame (1996) (see also Levine and Zame (2002)), to encompass models with limited commitment, default penalties and collateral. Along this line, we introduce in the setting of Araujo, Páscoa and Torres-Martínez (2002), Kubler and Schmedders (2003) and Páscoa and Seghir (2009) the concept of actions with finite equivalent payoffs. We show that, independently of the level of default penalties, restricting plans to have finite equivalent payoffs rules out Ponzi schemes and guarantees the existence of an equilibrium that is compatible with the minimal ability to borrow and lend that we expect in our model. An interesting feature of our debt constraints is that they give rise to budget sets that coincide with the standard budget sets of economies having a collateral structure but no penalties (as defined in Araujo, Páscoa and Torres-Martínez (2002)). This illustrates the hidden relation between finitely effective debt constraints and collateral requirements.

Approximate recursive equilibrium with minimal state space

This paper shows existence of approximate recursive equilibrium with minimal state space in an environment of incomplete markets. We prove that the approximate recursive equilibrium implements an approximate sequential equilibrium which is always close to a Magill and Quinzii equilibrium without short sales for arbitrarily small errors. This implies that the competitive equilibrium can be implemented by using forecast statistics with minimal state space provided that agents will reduce errors in their estimates in the long run. We have also developed an alternative algorithm to compute the approximate recursive equilibrium with incomplete markets and heterogeneous agents through a procedure of iterating functional equations and without using the rst order conditions of optimality.

Extreme poverty and development: the role of state in the assurance of minimal existence conditions

This paper follows the idea of Amartya Sen, Nobel Prize of economic, about the role of State in the assurance of minimal existence condition, and aim to answer how countries of Latin America (specifically Brazil) and countries of Europe (specifically United Kingdom) deal with the assurance of this minimal existence conditions. According to Amartya Sen’s view, development must be seen as a process of expanding substantive freedoms, such expansion being the primary purpose of each society and the main mean of development. Substantive freedoms can be considered as basic capabilities allocated to individuals whereby they are entitled to be architects of their own lives, providing them conditions to “live as they wish”. These basic capabilities are divided by Amartya Sen in 5 (five) kinds of substantive freedoms, but for this article’s purpose, we will consider just one of this 5 (five) kinds, specifically the Protective Safety capability. Protective Safety capability may be defined as the assurance of basic means of survival for individuals who are in extreme poverty, at risk of starvation or hypothermia, or even impending famine. Among the means available that could be used to avoid such situations are the possibility of supplemental income to the needy, distributing food and clothing to the needy, supply of energy and water, among others. But how countries deal whit this protective safety? Aiming to answer this question, we selected the problem of “fuel poverty” and how Brazil and United Kingdom solve it (if they solve), in order to assess how the solution found impacts development. The analysis and the comparison between these countries will allow an answer to the question proposed.

World Cup sets US live streaming record

The world cup has become the most streamed live sporting event in the US, as Americans tune in to this year´s tournament on their smartphones, tablets and computers in record numbers.

Sheaves, local homeomorphisms and local sets as Hilbert locale modules

We give a thorough account of the various equivalent notions for \sheaf" on a locale, namely the separated and complete presheaves, the local home- omorphisms, and the local sets, and to provide a new approach based on quantale modules whereby we see that sheaves can be identi¯ed with certain Hilbert modules in the sense of Paseka. This formulation provides us with an interesting category that has immediate meaningful relations to those of sheaves, local homeomorphisms and local sets. The concept of B-set (local set over the locale B) present in [3] is seen as a simetric idempotent matrix with entries on B, and a map of B-sets as de¯ned in [8] is shown to be also a matrix satisfying some conditions. This gives us useful tools that permit the algebraic manipulation of B-sets. The main result is to show that the existing notions of \sheaf" on a locale B are also equivalent to a new concept what we call a Hilbert module with an Hilbert base. These modules are the projective modules since they are the image of a free module by a idempotent automorphism On the ¯rst chapter, we recall some well known results about partially ordered sets and lattices. On chapter two we introduce the category of Sup-lattices, and the cate- gory of locales, Loc. We describe the adjunction between this category and the category Top of topological spaces whose restriction to spacial locales give us a duality between this category and the category of sober spaces. We ¯nish this chapter with the de¯nitions of module over a quantale and Hilbert Module. Chapter three concerns with various equivalent notions namely: sheaves of sets, local homeomorphisms and local sets (projection matrices with entries on a locale). We ¯nish giving a direct algebraic proof that each local set is isomorphic to a complete local set, whose rows correspond to the singletons. On chapter four we de¯ne B-locale, study open maps and local homeo- morphims. The main new result is on the ¯fth chapter where we de¯ne the Hilbert modules and Hilbert modules with an Hilbert and show this latter concept is equivalent to the previous notions of sheaf over a locale.

Natureza morta...edifício com vida: uma arquitetura sustentável para o Serviço de Verificação de Óbitos

Sustainability in buildings, while reducing the impact on the environment, contributes to the promotion of social welfare, to increase the health and productivity of occupants. The search for a way of build that meets the aspirations and development of humanity without, however, represent degradation of the environment, has become the great challenge of contemporary architecture. It is considered that the incorporation of principles that provide a sustainable building with careful choices of design solutions contribute to a better economic and thermal performance of the building, as well as functional and psychological comfort to its users. Based on this general understanding, this paper presents an architecture project aimed to health care whose the solutions adopted follow carefully the relevant legislation and sets his sights on the theme of sustainability. The methodology began with studies on the themes of verification service of deaths, sustainability and those application in construction developed through research in academic studies and analysis of architectural projects, using them like reference for the solutions adopted. Within the project analysis was performed a visit to the verification service of deaths in the city of Palmas in Tocantins, subsidizing information that, plus the relevant legislation, led to functional programming and pre-dimensional of the building to be designed. The result of this programming environments were individual records with information from environmental restrictions, space required for the development of activities, desirable flow and sustainability strategies, that can be considered as the first product of relevance of the professional master's degree. Finally we have outlined the basic design architecture of a Verification Service of Death SVO/RN (in portuguese), whose process of projecting defined as a guiding line of work four points: the use of bioclimatic architecture as the main feature projectual, the use of resources would provide minimal harm to the environment, the use of modulation and structure to the building as a form of rationalization and finally the search for solutions that ensure environmental and psychological comfort to users. Importantly to highlight that, besides owning a rare theme in literature that refers to architectural projects, the whole project was drawn up with foundations in projective criteria that contribute to environmental sustainability, with emphasis on thermal performance, energy efficiency and reuse of rainwater

Uma metodologia para modelagem e avaliação da dependabilidade de redes industriais sem fio

Ensuring the dependability requirements is essential for the industrial applications since faults may cause failures whose consequences result in economic losses, environmental damage or hurting people. Therefore, faced from the relevance of topic, this thesis proposes a methodology for the dependability evaluation of industrial wireless networks (WirelessHART, ISA100.11a, WIA-PA) on early design phase. However, the proposal can be easily adapted to maintenance and expansion stages of network. The proposal uses graph theory and fault tree formalism to create automatically an analytical model from a given wireless industrial network topology, where the dependability can be evaluated. The evaluation metrics supported are the reliability, availability, MTTF (mean time to failure), importance measures of devices, redundancy aspects and common cause failures. It must be emphasized that the proposal is independent of any tool to evaluate quantitatively the target metrics. However, due to validation issues it was used a tool widely accepted on academy for this purpose (SHARPE). In addition, an algorithm to generate the minimal cut sets, originally applied on graph theory, was adapted to fault tree formalism to guarantee the scalability of methodology in wireless industrial network environments (< 100 devices). Finally, the proposed methodology was validate from typical scenarios found in industrial environments, as star, line, cluster and mesh topologies. It was also evaluated scenarios with common cause failures and best practices to guide the design of an industrial wireless network. For guarantee scalability requirements, it was analyzed the performance of methodology in different scenarios where the results shown the applicability of proposal for networks typically found in industrial environments

Projections Onto Convex Sets through Particle Swarm Optimization and its application for remote sensing image restoration

Image restoration attempts to enhance images corrupted by noise and blurring effects. Iterative approaches can better control the restoration algorithm in order to find a compromise of restoring high details in smoothed regions without increasing the noise. Techniques based on Projections Onto Convex Sets (POCS) have been extensively used in the context of image restoration by projecting the solution onto hyperspaces until some convergence criteria be reached. It is expected that an enhanced image can be obtained at the final of an unknown number of projections. The number of convex sets and its combinations allow designing several image restoration algorithms based on POCS. Here, we address two convex sets: Row-Action Projections (RAP) and Limited Amplitude (LA). Although RAP and LA have already been used in image restoration domain, the former has a relaxation parameter (A) that strongly depends on the characteristics of the image that will be restored, i.e., wrong values of A can lead to poorly restoration results. In this paper, we proposed a hybrid Particle Swarm Optimization (PS0)-POCS image restoration algorithm, in which the A value is obtained by PSO to be further used to restore images by POCS approach. Results showed that the proposed PSO-based restoration algorithm outperformed the widely used Wiener and Richardson-Lucy image restoration algorithms. (C) 2010 Elsevier B.V. All rights reserved.

Prolapse-free relativistic Gaussian basis sets for the superheavy elements up to Uuo (Z=118) and Lr (Z=103)

Prolapse-free basis sets suitable for four-component relativistic quantum chemical calculations are presented for the superheavy elements UP to (118)Uuo ((104)Rf, (105)Db, (106)Sg, (107)Bh, (108)Hs, (109)Mt, (110)Ds, (111)Rg, (112)Uub, (113)Uut, (114)Uuq, (115)Uup, (116)Uuh, (117)Uus, (118)Uuo) and Lr-103. These basis sets were optimized by minimizing the absolute values of the energy difference between the Dirac-Fock-Roothaan total energy and the corresponding numerical value at a milli-Hartree order of magnitude, resulting in a good balance between cost and accuracy. Parameters for generating exponents and new numerical data for some superheavy elements are also presented. (c) 2007 Elsevier B.V. All rights reserved.

A neural system to robust Nonlinear optimization subject to disjoint and constrained sets

The ability of neural networks to realize some complex nonlinear function makes them attractive for system identification. This paper describes a novel method using artificial neural networks to solve robust parameter estimation problems for nonlinear models with unknown-but-bounded errors and uncertainties. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the network convergence to the equilibrium points. A solution for the robust estimation problem with unknown-but-bounded error corresponds to an equilibrium point of the network. Simulation results are presented as an illustration of the proposed approach.