A matrix iteration for dynamic network summaries

We propose a new algorithm for summarizing properties of large-scale time-evolving networks. This type of data, recording connections that come and go over time, is being generated in many modern applications, including telecommunications and on-line human social behavior. The algorithm computes a dynamic measure of how well pairs of nodes can communicate by taking account of routes through the network that respect the arrow of time. We take the conventional approach of downweighting for length (messages become corrupted as they are passed along) and add the novel feature of downweighting for age (messages go out of date). This allows us to generalize widely used Katz-style centrality measures that have proved popular in network science to the case of dynamic networks sampled at non-uniform points in time. We illustrate the new approach on synthetic and real data.

Spectral flow and iteration of closed semi-Riemannian geodesics

We introduce the notion of spectral flow along a periodic semi-Riemannian geodesic, as a suitable substitute of the Morse index in the Riemannian case. We study the growth of the spectral flow along a closed geodesic under iteration, determining its asymptotic behavior.

Iteration of closed geodesics in stationary Lorentzian manifolds

Following the lines of Bott in (Commun Pure Appl Math 9:171-206, 1956), we study the Morse index of the iterates of a closed geodesic in stationary Lorentzian manifolds, or, more generally, of a closed Lorentzian geodesic that admits a timelike periodic Jacobi field. Given one such closed geodesic gamma, we prove the existence of a locally constant integer valued map Lambda(gamma) on the unit circle with the property that the Morse index of the iterated gamma(N) is equal, up to a correction term epsilon(gamma) is an element of {0,1}, to the sum of the values of Lambda(gamma) at the N-th roots of unity. The discontinuities of Lambda(gamma) occur at a finite number of points of the unit circle, that are special eigenvalues of the linearized Poincare map of gamma. We discuss some applications of the theory.

A Boolean algebra and a Banach space obtained by push-out iteration

Under the assumption that c is a regular cardinal, we prove the existence and uniqueness of a Boolean algebra B of size c defined by sharing the main structural properties that P(omega)/fin has under CH and in the N(2)-Cohen model. We prove a similar result in the category of Banach spaces. (C) 2011 Elsevier B.V. All rights reserved.

Exploration of the idea of the horse in graphics and sculpture

The exploration of the idea of the horse is a very complex and open quest. Primarily it entails some conception of what the idea of the horse is. In choosing to title the project as such, I was attempting to indicate that what was of major interest to me was the representation of those qualities of the horse which are abstract and intangible as well as the physical qualities of the horse. Because of this interest, much of my work is concerned with movement, gesture, and the effects of structure, or lack thereof, on movement and gesture.

Música em Movimento: a linguagem Motion Graphics nos videoclipes brasileiros (1990-2010)

SOUZA, Luciano. Música em movimento: a linguagem Motion Graphics nos videoclipes brasileiros (1990 -2010). 100f. Dissertação (Mestrado em Comunicação)-Universidade Municipal de São Caetano do Sul, São Caetano do Sul, 2012.

On the iteration of Katsuno and Mendelzon update

In this dissertation we present a model for iteration of Katsuno and Mendelzon’s Update, inspired in the developments for iteration in AGM belief revision. We adapt Darwiche and Pearls’ postulates of iterated belief revision to update (as well as the independence postulate proposed in [BM06, JT07]) and show two families of such operators, based in natural [Bou96] and lexicographic revision [Nay94a, NPP03]. In all cases, we provide a possible worlds semantics of the models.

The use of software Mapavox for teaching graphics and games to blind and low vision students: a development through practices

Current policies on education to visually impaired point for a growing trend of including students with special educational needs in regular schools. However, most often this inclusion is not accompanied by an appropriate professional trained or infrastructure, which has been presented as a big problem for regular school teachers who have students with visual impairments in their classroom. Based on this situation, the Group of Extension in Tactile Cartography from UNESP - University of the State of São Paulo - Campus de Rio Claro - SP - Brazil has been developing educational material of geography and cartography to blind students at a special school. Among the materials developed in this study highlight the development of graphics and board games provided with sound capabilities through MAPAVOX, software developed in partnership with UFRJ - Federal University from Rio de Janeiro - RJ - Brazil. Through this software, sound capabilities can be inserted into built materials, giving them a multi-sensory character. In most cases the necessary conditions for building specific materials to students with visual impairments is expensive and beyond the reach of features from a regular school, so the survey sought to use easy access and low cost materials like Cork, leaf aluminum, material for fixing and others. The development of these materials was supported by preparation in laboratory and its subsequent test through practices involving blind students. The methodology used on the survey is based on qualitative research and non comparative analysis of the results. In other words, the material is built based on the special students perception and reality construction, not being mere adaptations of visual materials, but a construction focused on the reality of the visually impaired. The results proved were quite successful as the materials prepared were effective on mediating the learning process of students with disabilities. Geographical and cartographic concepts were seized by the students through the technology used, associated with the use of materials that took into account in its building process the perception of the students.

Uma abordagem para manipulação de informações geográficas utilizando Scalable Vectors Graphics

In this work, we propose a Geographical Information System that can be used as a tool for the treatment and study of problems related with environmental and city management issues. It is based on the Scalable Vector Graphics (SVG) standard for Web development of graphics. The project uses the concept of remate and real-time mar creation by database access through instructions executed by browsers on the Internet. As a way of proving the system effectiveness, we present two study cases;.the first on a region named Maracajaú Coral Reefs, located in Rio Grande do Norte coast, and the second in the Switzerland Northeast in which we intended to promote the substitution of MapServer by the system proposed here. We also show some results that demonstrate the larger geographical data capability achieved by the use of the standardized codes and open source tools, such as Extensible Markup Language (XML), Document Object Model (DOM), script languages ECMAScript/ JavaScript, Hypertext Preprocessor (PHP) and PostgreSQL and its extension, PostGIS

Utilizando mapas de conectividade fuzzy no desenvolvimento de algoritmos reparadores de imagens binárias 3D

A 3D binary image is considered well-composed if, and only if, the union of the faces shared by the foreground and background voxels of the image is a surface in R3. Wellcomposed images have some desirable topological properties, which allow us to simplify and optimize algorithms that are widely used in computer graphics, computer vision and image processing. These advantages have fostered the development of algorithms to repair bi-dimensional (2D) and three-dimensional (3D) images that are not well-composed. These algorithms are known as repairing algorithms. In this dissertation, we propose two repairing algorithms, one randomized and one deterministic. Both algorithms are capable of making topological repairs in 3D binary images, producing well-composed images similar to the original images. The key idea behind both algorithms is to iteratively change the assigned color of some points in the input image from 0 (background)to 1 (foreground) until the image becomes well-composed. The points whose colors are changed by the algorithms are chosen according to their values in the fuzzy connectivity map resulting from the image segmentation process. The use of the fuzzy connectivity map ensures that a subset of points chosen by the algorithm at any given iteration is the one with the least affinity with the background among all possible choices