915 resultados para diallel crossing
Resumo:
Revista Lusófona de Ciências Sociais
Resumo:
In the last ten years, teen noir movies and series — such as Donnie Darko (2001), Brick (2005), or Veronica Mars (2004-2007) — have become increasingly popular among audiences, both in the USA and in Europe, and aroused the curiosity of critics. These teen noir adventures present darker themes and technical features that distinguish them from numerous productions aiming at young adults. Their narrative and aesthetic characteristics reinvent and subvert the tradition of classic noir movies of the forties and fifties, thus generating a sense of novelty. In this article, I focus my attention on Veronica Mars, a famous teen noir series, created by Rob Thomas, to examine: a) the teen noir themes; b) the new profile and role of the private investigator; c) the empowerment of girls/young women; d) razor-sharp dialogues; e) intertextual references to old- school noir movies. In order to do so, resort to the research of specialists in the field of neo noir, such as Mark Conrad, Foster Hirsch, or Roz Kaveney. My main goal is to prove that a new (sub)genre is slowly emerging and revivifying teen cinema.
Resumo:
As lectures, but above all, as Erasmus....
Resumo:
Stair nesting allows us to work with fewer observations than the most usual form of nesting, the balanced nesting. In the case of stair nesting the amount of information for the different factors is more evenly distributed. This new design leads to greater economy, because we can work with fewer observations. In this work we present the algebraic structure of the cross of balanced nested and stair nested designs, using binary operations on commutative Jordan algebras. This new cross requires fewer observations than the usual cross balanced nested designs and it is easy to carry out inference.
Resumo:
Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetic. The basic concept of GAs is designed to simulate processes in natural system necessary for evolution, specifically those that follow the principles first laid down by Charles Darwin of survival of the fittest. On the other hand, Particle swarm optimization (PSO) is a population based stochastic optimization technique inspired by social behavior of bird flocking or fish schooling. PSO shares many similarities with evolutionary computation techniques such as GAs. The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. PSO is attractive because there are few parameters to adjust. This paper presents hybridization between a GA algorithm and a PSO algorithm (crossing the two algorithms). The resulting algorithm is applied to the synthesis of combinational logic circuits. With this combination is possible to take advantage of the best features of each particular algorithm.
Resumo:
Balanced nesting is the most usual form of nesting and originates, when used singly or with crossing of such sub-models, orthogonal models. In balanced nesting we are forced to divide repeatedly the plots and we have few degrees of freedom for the first levels. If we apply stair nesting we will have plots all of the same size rendering the designs easier to apply. The stair nested designs are a valid alternative for the balanced nested designs because we can work with fewer observations, the amount of information for the different factors is more evenly distributed and we obtain good results. The inference for models with balanced nesting is already well studied. For models with stair nesting it is easy to carry out inference because it is very similar to that for balanced nesting. Furthermore stair nested designs being unbalanced have an orthogonal structure. Other alternative to the balanced nesting is the staggered nesting that is the most popular unbalanced nested design which also has the advantage of requiring fewer observations. However staggered nested designs are not orthogonal, unlike the stair nested designs. In this work we start with the algebraic structure of the balanced, the stair and the staggered nested designs and we finish with the structure of the cross between balanced and stair nested designs.
Resumo:
Stair nesting leads to very light models since the number of their treatments is additive on the numbers of observations in which only the level of one factor various. These groups of observations will be the steps of the design. In stair nested designs we work with fewer observations when compared with balanced nested designs and the amount of information for the different factors is more evenly distributed. We now integrate these models into a special class of models with orthogonal block structure for which there are interesting properties.
Resumo:
In this paper, we introduce an innovative course in the Portuguese Context, the Master's Course in “Integrated Didactics in Mother Tongue, Maths, Natural and Social Sciences”, taking place at the Lisbon School of Education and discussing in particular the results of the evaluation made by the students who attended the Curricular Unit - Integrated Didactics (CU-ID). This course was designed for in-service teachers of the first six years of schooling and intends to improve connections between different curriculum areas. In this paper, we start to present a few general ideas about curriculum development; to discuss the concept of integration; to present the principles and objectives of the course created as well as its structure; to describe the methodology used in the evaluation process of the above mentioned CU-ID. The results allow us to state that the students recognized, as positive features of the CU-ID, the presence in all sessions of two teachers simultaneously from different scientific areas, as well as invitations issued to specialists on the subject of integration and to other teachers that already promote forms of integration in schools. As negative features, students noted a lack of integrated purpose, applying simultaneously the four scientific areas of the course, and also indicated the need to be familiar with more models of integrated education. Consequently, the suggestions for improvement derived from these negative features. The students also considered that their evaluation process was correct, due to the fact that it was focused on the design of an integrated project for one of the school years already mentioned.
Resumo:
We intend to study the algebraic structure of the simple orthogonal models to use them, through binary operations as building blocks in the construction of more complex orthogonal models. We start by presenting some matrix results considering Commutative Jordan Algebras of symmetric matrices, CJAs. Next, we use these results to study the algebraic structure of orthogonal models, obtained by crossing and nesting simpler ones. Then, we study the normal models with OBS, which can also be orthogonal models. We intend to study normal models with OBS (Orthogonal Block Structure), NOBS (Normal Orthogonal Block Structure), obtaining condition for having complete and suffcient statistics, having UMVUE, is unbiased estimators with minimal covariance matrices whatever the variance components. Lastly, see ([Pereira et al. (2014)]), we study the algebraic structure of orthogonal models, mixed models whose variance covariance matrices are all positive semi definite, linear combinations of known orthogonal pairwise orthogonal projection matrices, OPOPM, and whose least square estimators, LSE, of estimable vectors are best linear unbiased estimator, BLUE, whatever the variance components, so they are uniformly BLUE, UBLUE. From the results of the algebraic structure we will get explicit expressions for the LSE of these models.
Resumo:
In this paper, we study the average crossing number of equilateral random walks and polygons. We show that the mean average crossing number ACN of all equilateral random walks of length n is of the form . A similar result holds for equilateral random polygons. These results are confirmed by our numerical studies. Furthermore, our numerical studies indicate that when random polygons of length n are divided into individual knot types, the for each knot type can be described by a function of the form where a, b and c are constants depending on and n0 is the minimal number of segments required to form . The profiles diverge from each other, with more complex knots showing higher than less complex knots. Moreover, the profiles intersect with the ACN profile of all closed walks. These points of intersection define the equilibrium length of , i.e., the chain length at which a statistical ensemble of configurations with given knot type -upon cutting, equilibration and reclosure to a new knot type -does not show a tendency to increase or decrease . This concept of equilibrium length seems to be universal, and applies also to other length-dependent observables for random knots, such as the mean radius of gyration Rg.
Resumo:
Triatoma brasiliensis is composed of at least four geographic populations (brasiliensis, melanica, macromelasoma, and juazeiro) that have distinct chromatic, morphologic, biologic and ecologic patterns, and genetic composition. Reciprocal crosses between all pairwise combinations were carried out in order to evaluate the genetic and reproductive compatibility of these four populations. The F1 individuals developed normally and the resulting adults were crossed again to test the F2 and F3 viability. Genetic incompatibility was found between melanica and brasiliensis populations.
Resumo:
In this paper, we study the average inter-crossing number between two random walks and two random polygons in the three-dimensional space. The random walks and polygons in this paper are the so-called equilateral random walks and polygons in which each segment of the walk or polygon is of unit length. We show that the mean average inter-crossing number ICN between two equilateral random walks of the same length n is approximately linear in terms of n and we were able to determine the prefactor of the linear term, which is a = (3 In 2)/(8) approximate to 0.2599. In the case of two random polygons of length n, the mean average inter-crossing number ICN is also linear, but the prefactor of the linear term is different from that of the random walks. These approximations apply when the starting points of the random walks and polygons are of a distance p apart and p is small compared to n. We propose a fitting model that would capture the theoretical asymptotic behaviour of the mean average ICN for large values of p. Our simulation result shows that the model in fact works very well for the entire range of p. We also study the mean ICN between two equilateral random walks and polygons of different lengths. An interesting result is that even if one random walk (polygon) has a fixed length, the mean average ICN between the two random walks (polygons) would still approach infinity if the length of the other random walk (polygon) approached infinity. The data provided by our simulations match our theoretical predictions very well.