3,066 research outputs found
sj-docx-1-psx-10.1177_00323217241229316 – Supplemental material for ‘No Participation Without Representation’: The Impact of Descriptive and Substantive Representation on the Age-Related Turnout Gap
No full textSupplemental material, sj-docx-1-psx-10.1177_00323217241229316 for ‘No Participation Without Representation’: The Impact of Descriptive and Substantive Representation on the Age-Related Turnout Gap by Davide Angelucci, Luca Carrieri and Marco Improta in Political Studies</p
Towards a Collaborative Filtering Framework for Recommendation in Museums: From Preference Elicitation to Group's Visits
No full textRecommendation systems based on collaborative filtering methods can be exploited in the context of providing personalized artworks tours within a museum. However, in order to be effectively used, several problems have to be addressed: user preferences are not expressed as rating, items to be suggested are located in a physical space, and users may be in a group. In this work, we present a general framework that, by using the Matrix Factorization (MF) approach and a graph representation of a museum, addresses the problem of generating and then recommending an artworks sequence for a group of visitors within a museum. To reach a high-quality initial personalization, the recommendation system uses a simple, but efficient, elicitation method that is inspired by the MF approach. Moreover, the proposed approach considers the individual or the aggregated artworks’ ratings to build up a solution that takes into account the physical location of the artworks
An assessment of the impact of possible CAP reform scenarios on Romanian agriculture
No full textUsing a simplified model, with key-variable the prices of two different possible scenarios of CAP reform after 2013 (moderate and radical), this paper present a comparison between the price effects of implementation of each reform scenario at 2015 horizon on Romanian agriculture. This short analysis shows that, under the presented hypotheses, the net welfare effect, due to the price changes, for the selected products, is positive in both reform scenarios, yet greater in the case of the radical reform. Integrated in the large context of Romanian development, it seems that the influence of CAP reform upon agriculture and rural areas will be most likely a gradual one: an interpenetration between the two scenarios is foreseeable, starting with the moderate reform that will dominate the period around 2013, the reform measures acquiring a more radical character afterwards.CAP reform, Romania, welfare effects, Agricultural and Food Policy,
Going technocratic? Diluting governing responsibility in electorally turbulent times
No full textTechnocracy has recently triggered growing scholarly interest, especially as an alternative form of ruling to both party government and populism. In the context of weakened parties-citizens links and increasing external constraints faced by Western European ruling parties, technocratic appointments might help deal with the responsibility-responsiveness dilemma highlighted by Peter Mair. However, research on the explanatory factors of technocratic appointments is still underdeveloped. This article argues that the recourse to technocracy is fuelled by electoral volatility. In contexts of high electoral turbulence - and even more when parties frequently enter or exit the party system - ruling parties turn to technocratic appointments to dilute responsibility. This expectation is tested through an original longitudinal multilevel dataset including 655 cabinets and 373 elections in 20 Western European countries from 1945 to 2021. The findings of this article contribute to the current debate on technocracy and shed new light on the general understanding behind political representation
Rich, Sturmian, and trapezoidal words
No full textIn this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite words characterized by having the maximal number of palindromic factors. Every finite Sturmian word is rich, but not conversely. Trapezoidal words were first introduced by the first author in studying the behavior of the subword complexity of finite Sturmian words. Unfortunately this property does not characterize finite Sturmian words. In this note we show that the only trapezoidal palindromes are Sturmian. More generally we show that Sturmian palindromes can be characterized either in terms of their subword complexity (the trapezoidal property) or in terms of their palindromic complexity. We also obtain a similar characterization of rich palindromes in terms of a relation between palindromic complexity and subword complexity
L'arte di fare (e disfare) i governi. Da De Gasperi a Renzi, 70 anni di politica italiana By Luigi Curini and Luca Pinto. Milano: Egea, 2017. 227p. 28
No full textDigital Innovation in Healthcare: A Device with A Method for Monitoring, Managing and Preventing the Risk of Chronic Polypathological Patients
No full textNew digital technologies can have a huge impact on the traditional healthcare sector, both from a clinical and economic perspective. Doctors and health specialists will increasingly need technology to improve the services they provide to their patients. Here a novel patented device for automatic processing of clinical data of chronic poly-pathological patients is presented. The invention consists of a reconfigurable equipment that allows the assessment of clinical risk severity indexes that can be customized for polypathological patients and which acts both as a decision support system for specialist doctors in the diagnosis and treatment phases, and as a monitoring system in the clinical environment
Characterization Results for the Poset Based Representation of Topological Relations - I: Introduction and Models
No full text@article{DBLP:journals/informaticaSI/ForlizziN99,
author = {Luca Forlizzi and
Enrico Nardelli},
title = {Characterization Results for the Poset Based Representation
of Topological Relations - I: Introduction and Models.},
journal = {Informatica (Slovenia)},
volume = {23},
number = {2},
year = {1999},
bibsource = {DBLP, http://dblp.uni-trier.de}
Characterization Results for the Poset Based Representation of Topological Relations - II: Intersection and Union
No full text@article{DBLP:journals/informaticaSI/ForlizziN00,
author = {Luca Forlizzi and
Enrico Nardelli},
title = {Characterization Results for the Poset Based Representation
of Topological Relations - II: Intersection and Union.},
journal = {Informatica (Slovenia)},
volume = {24},
number = {1},
year = {2000},
bibsource = {DBLP, http://dblp.uni-trier.de}
System-on-chip Computing and Interconnection Architectures for Telecommunications and Signal Processing
No full textThis dissertation proposes novel architectures and design techniques targeting SoC building blocks for telecommunications and signal processing applications.
Hardware implementation of Low-Density Parity-Check decoders is approached at both the algorithmic and the architecture level. Low-Density Parity-Check codes are a promising coding scheme for future communication standards due to their outstanding error correction performance.
This work proposes a methodology for analyzing effects of finite precision arithmetic on error correction performance and hardware complexity. The methodology is throughout employed for co-designing the decoder. First, a low-complexity check node based on the P-output decoding principle is designed and characterized on a CMOS standard-cells library. Results demonstrate implementation loss below 0.2 dB down to BER of 10^{-8} and a saving in complexity up to 59% with respect to other works in recent literature. High-throughput and low-latency issues are addressed with modified single-phase decoding schedules. A new "memory-aware" schedule is proposed requiring down to 20% of memory with respect to the traditional two-phase flooding decoding. Additionally, throughput is doubled and logic complexity reduced of 12%. These advantages are traded-off with error correction performance, thus making the solution attractive only for long codes, as those adopted in the DVB-S2 standard. The "layered decoding" principle is extended to those codes not specifically conceived for this technique. Proposed architectures exhibit complexity savings in the order of 40% for both area and power consumption figures, while implementation loss is smaller than 0.05 dB.
Most modern communication standards employ Orthogonal Frequency Division Multiplexing as part of their physical layer. The core of OFDM is the Fast Fourier Transform and its inverse in charge of symbols (de)modulation. Requirements on throughput and energy efficiency call for FFT hardware implementation, while ubiquity of FFT suggests the design of parametric, re-configurable and re-usable IP hardware macrocells. In this context, this thesis describes an FFT/IFFT core compiler particularly suited for implementation of OFDM communication systems. The tool employs an accuracy-driven configuration engine which automatically profiles the internal arithmetic and generates a core with minimum operands bit-width and thus minimum circuit complexity. The engine performs a closed-loop optimization over three different internal arithmetic models (fixed-point, block floating-point and convergent block floating-point) using the numerical accuracy budget given by the user as a reference point. The flexibility and re-usability of the proposed macrocell are illustrated through several case studies which encompass all current state-of-the-art OFDM communications standards (WLAN, WMAN, xDSL, DVB-T/H, DAB and UWB). Implementations results are presented for two deep sub-micron standard-cells libraries (65 and 90 nm) and commercially available FPGA devices. Compared with other FFT core compilers, the proposed environment produces macrocells with lower circuit complexity and same system level performance (throughput, transform size and numerical accuracy).
The final part of this dissertation focuses on the Network-on-Chip design paradigm whose goal is building scalable communication infrastructures connecting hundreds of core. A low-complexity link architecture for mesochronous on-chip communication is discussed. The link enables skew constraint looseness in the clock tree synthesis, frequency speed-up, power consumption reduction and faster back-end turnarounds. The proposed architecture reaches a maximum clock frequency of 1 GHz on 65 nm low-leakage CMOS standard-cells library. In a complex test case with a full-blown NoC infrastructure, the link overhead is only 3% of chip area and 0.5% of leakage power consumption.
Finally, a new methodology, named metacoding, is proposed. Metacoding generates correct-by-construction technology independent RTL codebases for NoC building blocks. The RTL coding phase is abstracted and modeled with an Object Oriented framework, integrated within a commercial tool for IP packaging (Synopsys CoreTools suite). Compared with traditional coding styles based on pre-processor directives, metacoding produces 65% smaller codebases and reduces the configurations to verify up to three orders of magnitude
- …
