964 resultados para rank order tournaments
Resumo:
Data on intergroup-interactions (I-I) were collected in 5 seasonally provisioned groups (A, B, D, D-1, and E) of Tibetan macaques (Macaca Thibetana) at Mt. Emei in three 70-day periods between 1991 April-June (P1), September-November (P2), December-1992 February (P3). The I-I were categorized as forewarning made by high-ranking males (including Branch Shaking and/or Loud Calls), long-distance interactions in space (specified by changes in their foraging movements), and close encounters (with Affinitive Behavior, Male's Herding Female, Sexual Interaction, Severe Conflict, Adult Male-male Conflict, Opportunistic Advance and Retreat, etc. performed by different age-sex classes). From periods Fl to P3, the I-I rate decreased with reduction in population density as a positive correlate of food clumpedness or the number of potential feeders along a pedestrian trail. On the other hand, from the birth season (BS, represented by P1 and P3) to the mating season (MS, represented by P2) the dominance relation between groups, which produced a winner and a loser in the encounters, became obscure; the proportion of close encounters in the I-I increased; the asymmetry (local groups over intruders) of forewarning signals disappeared; the rate of branch shaking decreased; and sometimes intergroup cohesion appeared. Considering that sexual interactions also occurred between the encountering groups, above changes in intergroup behaviors may be explained with a model of the way in which the competition for food (exclusion) and the sexual attractiveness between opposite sexes were in a dynamic equilibrium among the groups, with the former outweighing the latter in the BS, and conversely in the MS. Females made 93% of severe conflicts, which occurred in 18% of close encounters. Groups fissioned in the recent past shared the same home range, and showed the highest hostility to each other by females. In conspicuous contrast with females' great interest in intergroup food/range competition, adult male-male conflicts that were normally without body contact occurred in 66% bf close encounters; high-ranking male herding of females, which is typical in baboons, appeared in 83% of close encounters, and showed no changes with season and sexual weight-dimorphism; peripheral juvenile and subadult males were the main performers of the affinitive behaviors, opportunistic advance and retreat, and guarding at the border. In brief, all males appeared to "sit on the fence" at the border, likely holding out hope of gaining the favor of females both within and outside the group. Thus, females and males attempted to maximize reproductive values in different ways, just as expected by Darwin-Trivers' theory of sexual selection. In addition, group fission was observed in the largest and highest-ranking group for two times (both in the MS) when its size increased to a certain level, and the mother group kept their dominant position in size and rank among the groups that might encounter, suggesting that fission takes a way of discarding the "superfluous part" in order to balance the cost of competition for food and mates within a group, and the benefit of cooperation to access the resources for animals in the mother group. (C) 1997 Wiley-Liss, Inc.
Resumo:
In this article, we detail the methodology developed to construct arbitrarily high order schemes - linear and WENO - on 3D mixed-element unstructured meshes made up of general convex polyhedral elements. The approach is tailored specifically for the solution of scalar level set equations for application to incompressible two-phase flow problems. The construction of WENO schemes on 3D unstructured meshes is notoriously difficult, as it involves a much higher level of complexity than 2D approaches. This due to the multiplicity of geometrical considerations introduced by the extra dimension, especially on mixed-element meshes. Therefore, we have specifically developed a number of algorithms to handle mixed-element meshes composed of convex polyhedra with convex polygonal faces. The contribution of this work concerns several areas of interest: the formulation of an improved methodology in 3D, the minimisation of computational runtime in the implementation through the maximum use of pre-processing operations, the generation of novel methods to handle complex 3D mixed-element meshes and finally the application of the method to the transport of a scalar level set. © 2012 Global-Science Press.
Resumo:
The interaction between unsteady heat release and acoustic pressure oscillations in gas turbines results in self-excited combustion oscillations which can potentially be strong enough to cause significant structural damage to the combustor. Correctly predicting the interaction of these processes, and anticipating the onset of these oscillations can be difficult. In recent years much research effort has focused on the response of premixed flames to velocity and equivalence ratio perturbations. In this paper, we develop a flame model based on the socalled G-Equation, which captures the kinematic evolution of the flame surfaces, under the assumptions of axisymmetry, and ignoring vorticity and compressibility. This builds on previous work by Dowling [1], Schuller et al. [2], Cho & Lieuwen [3], among many others, and extends the model to a realistic geometry, with two intersecting flame surfaces within a non-uniform velocity field. The inputs to the model are the free-stream velocity perturbations, and the associated equivalence ratio perturbations. The model also proposes a time-delay calculation wherein the time delay for the fuel convection varies both spatially and temporally. The flame response from this model was compared with experiments conducted by Balachandran [4, 5], and found to show promising agreement with experimental forced case. To address the primary industrial interest of predicting self-excited limit cycles, the model has then been linked with an acoustic network model to simulate the closed-loop interaction between the combustion and acoustic processes. This has been done both linearly and nonlinearly. The nonlinear analysis is achieved by applying a describing function analysis in the frequency domain to predict the limit cycle, and also through a time domain simulation. In the latter case, the acoustic field is assumed to remain linear, with the nonlinearity in the response of the combustion to flow and equivalence ratio perturbations. A transfer function from unsteady heat release to unsteady pressure is obtained from a linear acoustic network model, and the corresponding Green function is used to provide the input to the flame model as it evolves in the time domain. The predicted unstable frequency and limit cycle are in good agreement with experiment, demonstrating the potential of this approach to predict instabilities, and as a test bench for developing control strategies. Copyright © 2011 by ASME.
Resumo:
The pressure oscillation within combustion chambers of aeroengines and industrial gas turbines is a major technical challenge to the development of high-performance and low-emission propulsion systems. In this paper, an approach integrating computational fluid dynamics and one-dimensional linear stability analysis is developed to predict the modes of oscillation in a combustor and their frequencies and growth rates. Linear acoustic theory was used to describe the acoustic waves propagating upstream and downstream of the combustion zone, which enables the computational fluid dynamics calculation to be efficiently concentrated on the combustion zone. A combustion oscillation was found to occur with its predicted frequency in agreement with experimental measurements. Furthermore, results from the computational fluid dynamics calculation provide the flame transfer function to describe unsteady heat release rate. Departures from ideal one-dimensional flows are described by shape factors. Combined with this information, low-order models can work out the possible oscillation modes and their initial growth rates. The approach developed here can be used in more general situations for the analysis of combustion oscillations. Copyright © 2012 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.
Resumo:
Semi-implicit, second order temporal and spatial finite volume computations of the flow in a differentially heated rotating annulus are presented. For the regime considered, three cyclones and anticyclones separated by a relatively fast moving jet of fluid or "jet stream" are predicted. Two second order methods are compared with, first order spatial predictions, and experimental measurements. Velocity vector plots are used to illustrate the predicted flow structure. Computations made using second order central differences are shown to agree best with experimental measurements, and to be stable for integrations over long time periods (> 1000s). No periodic smoothing is required to prevent divergence.
Resumo:
Hybrid numerical large eddy simulation (NLES) and detached eddy simulation (DES) methods are assessed on a labyrinth seal geometry. A high sixth order discretization scheme is used and is validated using a test case of a two dimensional vortex. The hybrid approach adopts a new blending function and along with DES is initially validated using a simple cavity flow. The NLES method is also validated outside of RANS zones. It is found that there is very little resolved turbulence in the cavity for the DES simulation. For the labyrinth seal calculations the DES approach is problematic giving virtually no resolved turbulence content. It is seen that over the tooth tips the extent of the LES region is small and is likely to be a strong contributor to excessive flow damping in these regions. On the other hand the zonal Hamilton-Jacobi approach did not suffer from this trait. In both cases the meshes used are considered to be hybrid RANS-LES adequate. Fortunately (or perhaps unfortunately) the DES profiles are in agreement with the time mean experimental measurements. It is concluded that for an inexperienced CFD practitioner this could have wider implications particularly if transient results such as unsteady loading are desired. Copyright © 2012 by the American Institute of Aeronautics and Astronautics, Inc.
Resumo:
The ability to use environmental stimuli to predict impending harm is critical for survival. Such predictions should be available as early as they are reliable. In pavlovian conditioning, chains of successively earlier predictors are studied in terms of higher-order relationships, and have inspired computational theories such as temporal difference learning. However, there is at present no adequate neurobiological account of how this learning occurs. Here, in a functional magnetic resonance imaging (fMRI) study of higher-order aversive conditioning, we describe a key computational strategy that humans use to learn predictions about pain. We show that neural activity in the ventral striatum and the anterior insula displays a marked correspondence to the signals for sequential learning predicted by temporal difference models. This result reveals a flexible aversive learning process ideally suited to the changing and uncertain nature of real-world environments. Taken with existing data on reward learning, our results suggest a critical role for the ventral striatum in integrating complex appetitive and aversive predictions to coordinate behaviour.
Resumo:
The generalization of the geometric mean of positive scalars to positive definite matrices has attracted considerable attention since the seminal work of Ando. The paper generalizes this framework of matrix means by proposing the definition of a rank-preserving mean for two or an arbitrary number of positive semi-definite matrices of fixed rank. The proposed mean is shown to be geometric in that it satisfies all the expected properties of a rank-preserving geometric mean. The work is motivated by operations on low-rank approximations of positive definite matrices in high-dimensional spaces.© 2012 Elsevier Inc. All rights reserved.
Resumo:
This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.
Resumo:
In this paper, we tackle the problem of learning a linear regression model whose parameter is a fixed-rank matrix. We study the Riemannian manifold geometry of the set of fixed-rank matrices and develop efficient line-search algorithms. The proposed algorithms have many applications, scale to high-dimensional problems, enjoy local convergence properties and confer a geometric basis to recent contributions on learning fixed-rank matrices. Numerical experiments on benchmarks suggest that the proposed algorithms compete with the state-of-the-art, and that manifold optimization offers a versatile framework for the design of rank-constrained machine learning algorithms. Copyright 2011 by the author(s)/owner(s).
Resumo:
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems. The mathematical developments rely on the theory of gradient descent algorithms adapted to the Riemannian geometry that underlies the set of fixedrank positive semidefinite matrices. In contrast with previous contributions in the literature, no restrictions are imposed on the range space of the learned matrix. The resulting algorithms maintain a linear complexity in the problem size and enjoy important invariance properties. We apply the proposed algorithms to the problem of learning a distance function parameterized by a positive semidefinite matrix. Good performance is observed on classical benchmarks. © 2011 Gilles Meyer, Silvere Bonnabel and Rodolphe Sepulchre.
Resumo:
This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invariant with respect to all transformations that preserve angles (orthogonal transformations, scalings, and pseudoinversion). A meaningful approximation of the associated Riemannian distance is proposed, that can be efficiently numerically computed via a simple algorithm based on SVD. The induced mean preserves the rank, possesses the most desirable characteristics of a geometric mean, and is easy to compute. © 2009 Society for Industrial and Applied Mathematics.