But a walking shadow: designing, performing and learning on the virtual stage

Representing elements of reality within a medium, or taking aspects from one medium and placing them in another is an act of remediation. The process of this act, however, is largely taken for granted. Despite the fact that available information enables a qualitative assessment of the history of multimedia and their influences on different fields of knowledge, there are still some areas that require more focused research attention. For example, the relationship between media evolution and new developments in scenographic practice is currently under investigation. This article explores the issue of immediacy as a condition of modern theatre in the context of digital reality. It discusses the opportunities and challenges that recent technologies present to contemporary practitioners and theatre design educators, creating a lot of scope to break with conventions. Here, we present two case studies that look into technology-mediated learning about scenography through the employment of novel computer visualization techniques. The first case study is concerned with new ways of researching and learning about theatre through creative exploration of design artefacts. The second case study investigates the role of the Immersive Virtual World Second Life™ (SL) in effective teaching of scenography, and in creating and experiencing theatrical performances

Avaliacáo da energia gerada por um sistema fotovoltaico de 10 kwp com razáo de concentrado de 1000 sois interligado á rede elétrica

Este trabajo  busca analizar las características de operación  de un  Generador Foto  voltaico  de Alta Concentración (HCPV - High Concentration Photovoltaics) de 10 kWp con una concentración de 1000 soles instalado en el área externa del Departamento de Energía Nuclear de la Universidad Federal de Pemambuco. Después de la instalación del sistema fotovoltaico (FV), fueron colectados en conjunto los datos de la generación y del consumo de energía eléctrica del departamento. Fueron estimados los valores de la irradiancia directa incidente en el plano del generador hora a hora para el día más representativo  de cada mes, utilizando  correlaciones disponibles en  la literatura. A partir de los resultados experimentales y de las simulaciones realizadas fue posible establecer una relación entre la oferta y la demanda de energía, llegando  a la conclusión  que el generador FV, en  las mejores condiciones de funcionamiento, consigue suministrar aproximadamente 14% del consumo eléctrico del departamento, lo que es equivalente al gasto de iluminación de la edificación

On the structure of a smallest counterexample and a new class verifying the 2-Decomposition Conjecture

The 2-Decomposition Conjecture, equivalent to the 3-Decomposition Conjecture stated in 2011 by Hoffmann-Ostenhof, claims that every connected graph $G$ with vertices of degree 2 and 3, for which $G \setminus E(C)$ is disconnected for every cycle $C$, admits a decomposition into a spanning tree and a matching. In this work we present two main results focused on developing a strategy to prove the 2-Decomposition Conjecture. One of them is a list of structural properties of a minimum counterexample for this conjecture. Among those properties, we prove that a minimum counterexample has girth at least 5 and its vertices of degree 2 are at distance at least 3. Motivated by the class of smallest counterexamples, we show that the 2-Decomposition Conjecture holds for graphs whose vertices of degree 3 induce a collection of cacti in which each vertex belongs to a cycle. The core of the proof of this result may possibly be used in an inductive proof of the 2-Decomposition Conjecture based on a parameter that relates the number of vertices of degree 2 and 3 in a minimum counterexample

Biclique immersions in graphs with independence number 2

The analogue of Hadwiger’s conjecture for the immersion relation states that every graph G contains an immersion of Kχ(G) . For graphs with independence number 2, this is equivalent to stating that every such n-vertex graph contains an immersion of K⌈n/2⌉. We show that every n-vertex graph with independence number 2 contains every complete bipartite graph on ⌈n/2⌉ vertices as an immersion.Fil: Botler, F.. Universidade de Sao Paulo; BrasilFil: Jiménez, A.. Universidad de Valparaíso; ChileFil: Lintzmayer, C.N.. Universidade Federal Do Abc; BrasilFil: Pastine, Adrián Gabriel. Universidad Nacional de San Luis. Facultad de Ciencias Físico, Matemáticas y Naturales. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - San Luis. Instituto de Matemática Aplicada de San Luis "Prof. Ezio Marchi". Universidad Nacional de San Luis. Facultad de Ciencias Físico, Matemáticas y Naturales. Instituto de Matemática Aplicada de San Luis "Prof. Ezio Marchi"; ArgentinaFil: Quiroz, D.A.. Universidad de Valparaíso; ChileFil: Sambinelli, M.. Universidade Federal Do Abc; Brasi