251,666 research outputs found

    Why Reform Europe's Universities?

    Get PDF
    Based on a survey of European universities, this policy brief states that despite the good performance of some countries, Europe as a whole trails the US by a wide margin. The reason is two-fold. First, Europe invests too little in higher education. Second, European universities suffer from poor governance, insufficient autonomy and often perverse incentives. If Europe is to be a leader in the global knowledge economy, comprehensive reform of higher education is the order of the day. Most countries should invest an extra one percent in higher education each year, and universities should be given more autonomy in budgets, hiring and remuneration.

    Why blame?

    Get PDF
    We provide experimental evidence that subjects blame others based on events they are not responsible for. In our experiment an agent chooses between a lottery and a safe asset; payment from the chosen option goes to a principal who then decides how much to allocate between the agent and a third party. We observe widespread blame: regardless of their choice, agents are blamed by principals for the outcome of the lottery, an event they are not responsible for. We provide an explanation of this apparently irrational behavior with a delegated-expertise principal-agent model, the subjects’ salient perturbation of the environment

    Why Delannoy numbers?

    Full text link
    This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works. This answers to the question raised in the title, as these works are related to lattice paths enumeration, to the so-called Delannoy numbers, and were the first general way to solve Ballot-like problems. These numbers appear in probabilistic game theory, alignments of DNA sequences, tiling problems, temporal representation models, analysis of algorithms and combinatorial structures.Comment: Presented to the conference "Lattice Paths Combinatorics and Discrete Distributions" (Athens, June 5-7, 2002) and to appear in the Journal of Statistical Planning and Inference

    Why Chromatic Imaging Matters

    Full text link
    During the last two decades, the first generation of beam combiners at the Very Large Telescope Interferometer has proved the importance of optical interferometry for high-angular resolution astrophysical studies in the near- and mid-infrared. With the advent of 4-beam combiners at the VLTI, the u-v coverage per pointing increases significantly, providing an opportunity to use reconstructed images as powerful scientific tools. Therefore, interferometric imaging is already a key feature of the new generation of VLTI instruments, as well as for other interferometric facilities like CHARA and JWST. It is thus imperative to account for the current image reconstruction capabilities and their expected evolutions in the coming years. Here, we present a general overview of the current situation of optical interferometric image reconstruction with a focus on new wavelength-dependent information, highlighting its main advantages and limitations. As an Appendix we include several cookbooks describing the usage and installation of several state-of-the art image reconstruction packages. To illustrate the current capabilities of the software available to the community, we recovered chromatic images, from simulated MATISSE data, using the MCMC software SQUEEZE. With these images, we aim at showing the importance of selecting good regularization functions and their impact on the reconstruction.Comment: Accepted for publication in Experimental Astronomy as part of the topical collection: Future of Optical-infrared Interferometry in Europ

    Why Extension-Based Proofs Fail

    Full text link
    We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k > 1 processes in a wait-free manner in certain asynchronous models. However, it was unknown whether proofs based on simpler techniques were possible. We show that this impossibility result cannot be obtained for one of these models by an extension-based proof and, hence, extension-based proofs are limited in power.Comment: This version of the paper is for the NIS model. Previous versions of the paper are for the NIIS mode

    Why Stare Decisis?

    Get PDF
    corecore