Régi és új tendenciák a büntetőjogban és a büntetőjog-tudományban : Gondolatok Nagy Ferenc monográfiájáról, illetve annak ürügyén

"Nagy Ferenc szegedi professzor új monográfiája áttekinti a büntetőjog tudományának fejlődését, külön figyelmet szentelve napjaink irányzataira. E hézagpótló könyv ismertetése mellett a recenzensnek módja van kifejtenie saját - a szerzőével nagyrészt azonos - álláspontját büntetőjogunk fejlődésének aktuális kérdéseiről, a hagyományos dogmatika mind szembetűnőbb eróziójáról.

Realization Theory for LPV State-Space Representations with Affine Dependence

In this paper we present a Kalman-style realization theory for linear parameter-varying state-space representations whose matrices depend on the scheduling variables in an affine way (abbreviated as LPV-SSA representations). We deal both with the discrete-time and the continuous-time cases. We show that such a LPV-SSA representation is a minimal (in the sense of having the least number of state-variables) representation of its input-output function, if and only if it is observable and span-reachable. We show that any two minimal LPV-SSA representations of the same input-output function are related by a linear isomorphism, and the isomorphism does not depend on the scheduling variable.We show that an input-output function can be represented by a LPV-SSA representation if and only if the Hankel-matrix of the input-output function has a finite rank. In fact, the rank of the Hankel-matrix gives the dimension of a minimal LPV-SSA representation. Moreover, we can formulate a counterpart of partial realization theory for LPV-SSA representation and prove correctness of the Kalman-Ho algorithm. These results thus represent the basis of systems theory for LPV-SSA representation.Comment: The main difference with respect to the previous version is as follows: typos have been fixe

A Few Remarks About the Criminal Corruption in Hungary

Whenever we type the word „corruption” in any of the internet-based search programs, it gives nearly 20 million results, and the fact is, that hundreds of international conferences focus on the so-called “today’s plague” phenomenon every year. Nowadays it is hard to say anything new about one of our greatest common enemy to date, that spreads across the globe, corruption. The roots of abuse and misuse carried out to reach individual goals, backed by rights delegated by the community, date back to thousands of years

Towards Efficient Maximum Likelihood Estimation of LPV-SS Models

How to efficiently identify multiple-input multiple-output (MIMO) linear parameter-varying (LPV) discrete-time state-space (SS) models with affine dependence on the scheduling variable still remains an open question, as identification methods proposed in the literature suffer heavily from the curse of dimensionality and/or depend on over-restrictive approximations of the measured signal behaviors. However, obtaining an SS model of the targeted system is crucial for many LPV control synthesis methods, as these synthesis tools are almost exclusively formulated for the aforementioned representation of the system dynamics. Therefore, in this paper, we tackle the problem by combining state-of-the-art LPV input-output (IO) identification methods with an LPV-IO to LPV-SS realization scheme and a maximum likelihood refinement step. The resulting modular LPV-SS identification approach achieves statical efficiency with a relatively low computational load. The method contains the following three steps: 1) estimation of the Markov coefficient sequence of the underlying system using correlation analysis or Bayesian impulse response estimation, then 2) LPV-SS realization of the estimated coefficients by using a basis reduced Ho-Kalman method, and 3) refinement of the LPV-SS model estimate from a maximum-likelihood point of view by a gradient-based or an expectation-maximization optimization methodology. The effectiveness of the full identification scheme is demonstrated by a Monte Carlo study where our proposed method is compared to existing schemes for identifying a MIMO LPV system

Corruption manual for beginners: "Corruption techniques" in public procurement with examples from Hungary

This paper develops 30 novel quantitative indicators of grand corruption that operationalize 20 distinct techniques of corruption in the context of public procurement. Each indicator rests on a thorough qualitative understanding of rent extraction from public contracts by corrupt networks as evidenced by academic literature, interviews and media content analysis. Feasibility and usefulness of the proposed indicators are demonstrated using micro-level public procurement data from Hungary in 2009-2012. While the prime value of this broad set of indicators is the possibility of combining them into a robust composite indicator of high-level corruption, the high degree of detail also reveals that many regulatory interventions have succeeded in changing the form of corruption, but not its overall incidence