10,963 research outputs found
Intra-party politics and coalition governments
This book originates from a series of paper presented at an ECPR Joint Session Workshop on "Intra-party politics and its effects on government formation and duration in parliamentary systems". The book includes twelve original essays written by specialists in the field of coalition theory such as M. Laver, K. Strom, W. Mueller, K. Benoit, T. Brauninger and T. Saalfeld. The essays examine intra-party politics and the process of government formation and duration at the local and at the national level. A final section explores intra-party politics at the EU level. The book includes an introductory chapter and a concluding chapter, both written by D. Giannetti and K. Benoit. D. Giannetti contributed to the book with another essay "Party cohesion, party discipline and party factions in Italy", coauthored with M. Laver
Intra-party politics and coalition governments: concluding remarks
This chapter offers a few concluding remarks on intra-party politics and indicates the most promising avenues for future research in this are
Intra-party politics and coalition governments in parliamentary democracies
This chapter outlines some of the key questions that have arisen in the analysis of intra-party politics in the comparative politics literature and within the rational choice approach to politics
Solving eigenvalue response matrix equations with nonlinear techniques
This paper presents new algorithms for use in the eigenvalue response matrix method (ERMM) for reactor eigenvalue problems. ERMM spatially decomposes a domain into independent nodes linked via boundary conditions approximated as truncated orthogonal expansions, the coefficients of which are response functions. In its simplest form, ERMM consists of a two-level eigenproblem: an outer Picard iteration updates the k-eigenvalue via balance, while the inner λ -eigenproblem imposes neutron balance between nodes. Efficient methods are developed for solving the inner λ-eigenvalue problem within the outer Picard iteration. Based on results from several diffusion and transport benchmark models, it was found that the Krylov-Schur method applied to the λ -eigenvalue problem reduces Picard solver times (excluding response generation) by a factor of 2–5. Furthermore, alternative methods, including Picard acceleration schemes, Steffensen’s method, and Newton’s method, are developed in this paper. These approaches often yield faster k-convergence and a need for fewer k-dependent response function evaluations, which is important because response generation is often the primary cost for problems using responses computed online (i.e., not from a precomputed database). Accelerated Picard iteration was found to reduce total computational times by 2–3 compared to the unaccelerated case for problems dominated by response generation. In addition, Newton’s method was found to provide nearly the same performance with improved robustness
Scaling up qualitative data: with Professor Ken Benoit
Professor Benoit is the Principal Investigator in an ERC funded project QUANTESS developing innovative methods for the quantitative analysis of textual data in the social sciences. He is the co-author with Paul Nulty of the R software package for text analysis “quanteda”, and working on a book Quantitative Text Analysis Using R covering methods for managing, processing, and analysing textual data using the R programming language. He has taught quantitative text analysis extensively and has published research in this area targeting both methodology and political science applications
Private James Simon Benoit
K-in-A ; see also 65-1917-30-5 and Sep. 21, 2016, p. 2, Soldier Series ; name listed as "Simon James Benoit" ; d. Sep. 15, 1916 ; Service no.: 80278 ; Units: 50th Battalion, 31st Battalio
Another Characterization of the Higher K-Trivials
In algorithmic randomness, the class of K-trivial sets has proved itself to be remarkable, due to its numerous different characterizations. We pursue in this paper some work already initiated on K-trivials in the context of higher randomness. In particular we give here another characterization of the non hyperarithmetic higher K-trivial sets
Armand Hatchuel et Benoit Weil La théorie C-K, un fondement formel aux théories de l'innovation
International audiencePrésentation des travaux d'Armand Hatchuel et Benoit Weil sur les théories de la conception - position de ces travaux pionniers par rapport à l'état de l'art dans les années 90, apports majeurs de la théorie C-K, conséquences et recherches ultérieures
Benoit Mandelbrot and the fractal geometry
summary:Obsahuje tyto části:
1. Benoit Mandelbrot vyznamenán za velký vědecký čin.
2. J. W. Cannon: recenze knihy B. B. Mandelbrota „Fraktální geometrie přírody‟.
3. David Preiss: Něco málo matematiky k fraktálúm
Armand Hatchuel et Benoit Weil La théorie C-K, un fondement formel aux théories de l'innovation
International audiencePrésentation des travaux d'Armand Hatchuel et Benoit Weil sur les théories de la conception - position de ces travaux pionniers par rapport à l'état de l'art dans les années 90, apports majeurs de la théorie C-K, conséquences et recherches ultérieures
- …
