894 resultados para automata intersection
Resumo:
Contemporary US sitcom is at an interesting crossroads: it has received an increasing amount of scholarly attention (e.g. Mills 2009; Butler 2010; Newman and Levine 2012; Vermeulen and Whitfield 2013), which largely understands it as shifting towards the aesthetically and narratively complex. At the same time, in the post-broadcasting era, US networks are particularly struggling for their audience share. With the days of blockbuster successes like Must See TV’s Friends (NBC 1994-2004) a distant dream, recent US sitcoms are instead turning towards smaller, engaged audiences. Here, a cult sensibility of intertextual in-jokes, temporal and narrational experimentation (e.g. flashbacks and alternate realities) and self-reflexive performance styles have marked shows including Community (NBC 2009-2015), How I Met Your Mother (CBS 2005-2014), New Girl (Fox 2011-present) and 30 Rock (NBC 2006-2013). However, not much critical attention has so far been paid to how these developments in textual sensibility in contemporary US sitcom may be influenced by, and influencing, the use of transmedia storytelling practices, an increasingly significant industrial concern and rising scholarly field of enquiry (e.g. Jenkins 2006; Mittell 2015; Richards 2010; Scott 2010; Jenkins, Ford and Green 2013). This chapter investigates this mutual influence between sitcom and transmedia by taking as its case studies two network shows that encourage invested viewership through their use of transtexts, namely How I Met Your Mother (hereafter HIMHM) and New Girl (hereafter NG). As such, it will pay particular attention to the most transtextually visible character/actor from each show: HIMYM’s Barney Stinson, played by Neil Patrick Harris, and NG’s Schmidt, played by Max Greenfield. This chapter argues that these sitcoms do not simply have their particular textual sensibility and also (happen to) engage with transmedia practices, but that the two are mutually informing and defining. This chapter explores the relationships and interplay between sitcom aesthetics, narratives and transmedia storytelling (or industrial transtexts), focusing on the use of multiple delivery channels in order to disperse “integral elements of a fiction” (Jenkins, 2006 95-6), by official entities such as the broadcasting channels. The chapter pays due attention to the specific production contexts of both shows and how these inform their approaches to transtexts. This chapter’s conceptual framework will be particularly concerned with how issues of texture, the reality envelope and accepted imaginative realism, as well as performance and the actor’s input inform and illuminate contemporary sitcoms and transtexts, and will be the first scholarly research to do so. It will seek out points of connections between two (thus far) separate strands of scholarship and will move discussions on transtexts beyond the usual genre studied (i.e. science-fiction and fantasy), as well as make a contribution to the growing scholarship on contemporary sitcom by approaching it from a new critical angle. On the basis that transmedia scholarship stands to benefit from widening its customary genre choice (i.e. telefantasy) for its case studies and from making more use of in-depth close analysis in its engagement with transtexts, the chapter argues that notions of texture, accepted imaginative realism and the reality envelope, as well as performance and the actor’s input deserve to be paid more attention to within transtext-related scholarship.
Resumo:
In this paper we present some formulae for topological invariants of projective complete intersection curves with isolated singularities in terms of the Milnor number, the Euler characteristic and the topological genus. We also present some conditions, involving the Milnor number and the degree of the curve, for the irreducibility of complete intersection curves.
Resumo:
In this paper the architecture of an experimental multiparadigmatic programming environment is sketched, showing how its parts combine together with application modules in order to perform the integration of program modules written in different programming languages and paradigms. Adaptive automata are special self-modifying formal state machines used as a design and implementation tool in the representation of complex systems. Adaptive automata have been proven to have the same formal power as Turing Machines. Therefore, at least in theory, arbitrarily complex systems may be modeled with adaptive automata. The present work briefly introduces such formal tool and presents case studies showing how to use them in two very different situations: the first one, in the name management module of a multi-paradigmatic and multi-language programming environment, and the second one, in an application program implementing an adaptive automaton that accepts a context-sensitive language.
Resumo:
We present algorithms for computing the differential geometry properties of intersection Curves of three implicit surfaces in R(4), using the implicit function theorem and generalizing the method of X. Ye and T. Maekawa for 4-dimension. We derive t, n, b(1), b(2) vectors and curvatures (k(1), k(2), k(3)) for transversal intersections of the intersection problem. (C) 2008 Elsevier B.V. All rights reserved.
Resumo:
When the food supply flnishes, or when the larvae of blowflies complete their development and migrate prior to the total removal of the larval substrate, they disperse to find adequate places for pupation, a process known as post-feeding larval dispersal. Based on experimental data of the Initial and final configuration of the dispersion, the reproduction of such spatio-temporal behavior is achieved here by means of the evolutionary search for cellular automata with a distinct transition rule associated with each cell, also known as a nonuniform cellular automata, and with two states per cell in the lattice. Two-dimensional regular lattices and multivalued states will be considered and a practical question is the necessity of discovering a proper set of transition rules. Given that the number of rules is related to the number of cells in the lattice, the search space is very large and an evolution strategy is then considered to optimize the parameters of the transition rules, with two transition rules per cell. As the parameters to be optimized admit a physical interpretation, the obtained computational model can be analyzed to raise some hypothetical explanation of the observed spatiotemporal behavior. © 2006 IEEE.
Resumo:
This study focused on representing spatio-temporal patterns of fungal dispersal using cellular automata. Square lattices were used, with each site representing a host for a hypothetical fungus population. Four possible host states were allowed: resistant, permissive, latent or infectious. In this model, the probability of infection for each of the healthy states (permissive or resistant) in a time step was determined as a function of the host's susceptibility, seasonality, and the number of infectious sites and the distance between them. It was also assumed that infected sites become infectious after a pre-specified latency period, and that recovery is not possible. Several scenarios were simulated to understand the contribution of the model's parameters and the spatial structure on the dynamic behaviour of the modelling system. The model showed good capability for representing the spatio-temporal pattern of fungus dispersal over planar surfaces. With a specific problem in mind, the model can be easily modified and used to describe field behaviour, which can contribute to the conservation and development of management strategies for both natural and agricultural systems. © 2012 Elsevier B.V.