960 resultados para Valeur de Shapley
Resumo:
Bibliographical footnotes.
Resumo:
Vol.1: 4.éd.; v.2: 2.éd.
Resumo:
We present new results of our wide-field redshift survey of galaxies in a 182 square degree region of the Shapley Supercluster (SSC) based on observations with the FLAIR-II spectrograph on the UK Schmidt Telescope (UKST). In this paper we present new measurements to give a total sample of redshifts for 710 bright (R less than or equal to 16.6) galaxies, of which 464 are members of the SSC (8000 < υ < 18 000 km s(-1)). Our data reveal that the main plane of the SSC (upsilon approximate to 14 500 km s(-1)) extends further than previously realised, filling the whole extent of our survey region of 10 degrees by 20 degrees on the sky (35 Mpc by 70 Mpc, for H-0 = 75 km s(-1) Mpc(-1)). There is also a significant structure associated with the slightly nearer Abell 3571 cluster complex (upsilon approximate to 12 000 km s(-1)) with a caustic structure evident out to a radius of 6 Mpc. These galaxies seem to link two previously identified sheets of galaxies and establish a connection with a third one at (V) over bar = 15 000 km s(-1) near RA = 13(h). They also tend to fill the gap of galaxies between the foreground Hydra-Centaurus region and the more distant SSC. We calculate galaxy overdensities of 5.0+/-0.1 over the 182 square degree region surveyed and 3.3+.-0.1 in a 159 square degree region excluding rich clusters. Over the large region of our survey the inter-cluster galaxies make up 46 per cent of all galaxies in the SSC region and may contribute a similar amount of mass to the cluster galaxies.
Structure and dynamics of the Shapley Supercluster - Velocity catalogue, general morphology and mass
Resumo:
We present results of our wide-field redshift survey of galaxies in a 285 square degree region of the Shapley Supercluster (SSC), based on a set of 10 529 velocity measurements (including 1201 new ones) on 8632 galaxies obtained from various telescopes and from the literature. Our data reveal that the main plane of the SSC (v approximate to 14 500 km s(-1)) extends further than previous estimates, filling the whole extent of our survey region of 12 degrees by 30 degrees on the sky (30 x 75 h(-1) Mpc). There is also a connecting structure associated with the slightly nearer Abell 3571 cluster complex (v approximate to 12 000 km s(-1)). These galaxies seem to link two previously identified sheets of galaxies and establish a connection with a third one at v = 15 000 km s(-1) near RA = 13(h). They also tend to fill the gap of galaxies between the foreground Hydra-Centaurus region and the more distant SSC. In the velocity range of the Shapley Supercluster (9000 km s(-1) < cz < 18 000 km s(-1)), we found redshift-space overdensities with b(j) < 17.5 of similar or equal to 5.4 over the 225 square degree central region and similar or equal to 3.8 in a 192 square degree region excluding rich clusters. Over the large region of our survey, we find that the intercluster galaxies make up 48 per cent of the observed galaxies in the SSC region and, accounting for the different completeness, may contribute nearly twice as much mass as the cluster galaxies. In this paper, we discuss the completeness of the velocity catalogue, the morphology of the supercluster, the global overdensity, and some properties of the individual galaxy clusters in the Supercluster.
Resumo:
The dimension qualitative of arbitrary selection undefined anyone and any what is envisaged in this article. It provides a procedure to identify jobs which are demonstrating an interpretation qualitative despite changes to which this reading is submitted. Contexts that promote and discourage this interpretation undergo an examination detailed. This gives rise to the proposal based test review on some argumentatifs linkages. Tests and contexts operate with (in) compatibility with qualitative reads the causes are envisaged. The ability to dispose of the qualitative nature of an interpretation provides advanced identification procedure constitute a new result that represents a necessary condition for an explanatory of semantics the axiology.
Resumo:
Cet article explicite les différentes structures syntaxiques périphrastiques construites sur aller et sur venir. A partir de celles-ci sera exposée – de façon contrastive– la pluralité des effets de sens repérables en discours, plus précisément ceux déjà suffisamment stabilisés pour accéder à leur conscientisation, à leur (éventuelle) mention dans les grammaires, et à leur description par les linguistes. Lorsque c’est possible, les tours périphrastiques seront suivis d’une équivalence par un autre temps verbal, qui permet, parfois mais pas toujours, de bien distinguer lesdits effets de sens. Dans un second temps, on proposera pour chacune des deux formes une explicitation de sa valeur en langue, qui soit à même de rendre compte du pluriel des effets de sens produits en discours. Chacun des tours répertoriés mérite évidemment un développement bien plus conséquent que ce que nous lui accordons dans les cadres de cet article. On ne traitera pas ici notamment des restrictions sur l’aspect et les temps verbaux, l’agentivité du sujet, le type de procès qui suit l’auxiliaire, la négation. L’analyse sera conduite sur le français, avec quelques aperçus sur les autres langues romanes.
Resumo:
In this paper shortest path games are considered. The transportation of a good in a network has costs and benet too. The problem is to divide the prot of the transportation among the players. Fragnelli et al (2000) introduce the class of shortest path games, which coincides with the class of monotone games. They also give a characterization of the Shapley value on this class of games. In this paper we consider further four characterizations of the Shapley value (Shapley (1953)'s, Young (1985)'s, Chun (1989)'s, and van den Brink (2001)'s axiomatizations), and conclude that all the mentioned axiomatizations are valid for shortest path games. Fragnelli et al (2000)'s axioms are based on the graph behind the problem, in this paper we do not consider graph specic axioms, we take TU axioms only, that is, we consider all shortest path problems and we take the view of abstract decision maker who focuses rather on the abstract problem than on the concrete situations.
Resumo:
In this paper cost sharing problems are considered. We focus on problems given by rooted trees, we call these problems cost-tree problems, and on the induced transferable utility cooperative games, called irrigation games. A formal notion of irrigation games is introduced, and the characterization of the class of these games is provided. The well-known class of airport games Littlechild and Thompson (1977) is a subclass of irrigation games. The Shapley value Shapley (1953) is probably the most popular solution concept for transferable utility cooperative games. Dubey (1982) and Moulin and Shenker (1992) show respectively, that Shapley's Shapley (1953) and Young (1985)'s axiomatizations of the Shapley value are valid on the class of airport games. In this paper we show that Dubey (1982)'s and Moulin and Shenker (1992)'s results can be proved by applying Shapley (1953)'s and Young (1985)'s proofs, that is those results are direct consequences of Shapley (1953)'s and Young (1985)'s results. Furthermore, we extend Dubey (1982)'s and Moulin and Shenker (1992)'s results to the class of irrigation games, that is we provide two characterizations of the Shapley value for cost sharing problems given by rooted trees. We also note that for irrigation games the Shapley value is always stable, that is it is always in the core Gillies (1959).
Resumo:
In this paper shortest path games are considered. The transportation of a good in a network has costs and benet too. The problem is to divide the prot of the transportation among the players. Fragnelli et al (2000) introduce the class of shortest path games, which coincides with the class of monotone games. They also give a characterization of the Shapley value on this class of games. In this paper we consider further four characterizations of the Shapley value (Shapley (1953)'s, Young (1985)'s, Chun (1989)'s, and van den Brink (2001)'s axiomatizations), and conclude that all the mentioned axiomatizations are valid for shortest path games. Fragnelli et al (2000)'s axioms are based on the graph behind the problem, in this paper we do not consider graph specic axioms, we take TU axioms only, that is, we consider all shortest path problems and we take the view of abstract decision maker who focuses rather on the abstract problem than on the concrete situations.
Resumo:
We consider the problem of axiomatizing the Shapley value on the class of assignment games. We first show that several axiomatizations of the Shapley value on the class of all TU-games do not characterize this solution on the class of assignment games by providing alternative solutions that satisfy these axioms. However, when considering an assignment game as a communication graph game where the game is simply the assignment game and the graph is a corresponding bipartite graph buyers are connected with sellers only, we show that Myerson's component efficiency and fairness axioms do characterize the Shapley value on the class of assignment games. Moreover, these two axioms have a natural interpretation for assignment games. Component efficiency yields submarket efficiency stating that the sum of the payoffs of all players in a submarket equals the worth of that submarket, where a submarket is a set of buyers and sellers such that all buyers in this set have zero valuation for the goods offered by the sellers outside the set, and all buyers outside the set have zero valuations for the goods offered by sellers inside the set. Fairness of the graph game solution boils down to valuation fairness stating that only changing the valuation of one particular buyer for the good offered by a particular seller changes the payoffs of this buyer and seller by the same amount.
Resumo:
We give a new proof of Young's characterization of the Shapley value. Moreover, as applications of the new proof, we show that Young's axiomatization of the Shapley value is valid on various well-known subclasses of TU games.
Resumo:
Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal.
Resumo:
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
Resumo:
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
Resumo:
CD73 est un ecto-enzyme qui a été associé à la suppression de l'immunité anti-tumorale. Ses valeurs pronostiques et thérapeutiques ont été mises de l'avant dans plusieurs types de cancer. La première hypothèse du projet est que l'expression de CD73 dans la tumeur prédit le pronostic des patients atteints du cancer de la prostate. L'expression de CD73 a été étudiée par immunofluorescence dans des échantillons de tumeur. Puis, des analyses univariées et multivariées ont été conduites pour déterminer si l'expression de CD73 permet de prédire la récidive biochimique des patients. Nous avons déterminé que CD73 prédit indépendamment le pronostic des patients atteints du cancer de la prostate. De plus, nous avons déterminé que son expression dans le tissu normal adjacent ou dans la tumeur prédit différemment la survenue de la récidive biochimique. La deuxième hypothèse est que l'inhibition de CD73 permet d'améliorer l'efficacité d'un vaccin thérapeutique contre le cancer de la prostate. L'effet d'un vaccin de type GVAX a été étudié dans des souris CD73KO ou en combinaison avec un anticorps ciblant CD73. Nous avons observé que l'efficacité du vaccin était augmentée dans les souris où CD73 était absent. Cependant, la combinaison avec l'anti-CD73 n'a pas permis d'améliorer l'efficacité.