226,539 research outputs found
La "porta nord" della città antica e la direttrice Flaminia
No full textpubblicazione di progetto architettonico per "l'asse Flaminio- la porta nord di Roma" elaborato in occasione del workshop internazionale "Roma 3° millennio - le identità possibili", gruppo di lavoro del Daac "Città-museo", coord. prof. R. Panella, con gli archh. F. De Luca, R. De Santis, M. Raitano.publication of the architectural design for "" axis Flaminio port north of Rome, "" prepared on the occasion of the international workshop "" Rome 3rd millennium - the possible identities "," working group Daac "" City Museum "" , coord. prof. R. Panella, with the Archh. F. De Luca, R. De Santis, M. Raitano
A note on “Double-diffusive Soret convection phenomenon in porous media: effect of Vadasz inertia term”
No full textIn this short paper, some analytical results found in “Double-diffusive Soret convection phenomenon in porous media: effect of Vadasz inertia term” by F. Capone, R. De Luca, M. Vitiello, Ricerche Mat. 68, 581–595 (2019), are recalled in order to better explore the dynamic of thermosolutal convection in a horizontal porous layer with the influence of Vadasz and Soret terms
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
Luca Comerio
No full textBreve descrizione dell'attività di Luca Comerio, pioniere milanese del cinema italiano, dal 1900 al 1911
Il Cookbook di ESP-r. Strategie per lo sviluppo di rappresentazioni virtuali dell’Ambiente Costruito (traduzione)
No full textTraduzione di Gian Luca Brunetti del testo in formato elettronico: Jon Hand, "THE ESP-r Cookbook. Strategies for Deploying Virtual Representations of the Build Environment", Energy Systems Research Unit, Department of Mechanical Engineering, University of Strathclyde, Glasgow, UK, 2008-2010.
Prima edizione della traduzione: 31 gennaio 2010. Seconda edizione: 6 marzo 2012. Copyright: University of Strathclyde, Glasgow, UK. 350 pp
Luca Ronconi e il meraviglioso nell'opera: il caso Monteverdi
No full textLuca Ronconi staged Monteverdi's Orfeo in Florence, at Goldoni Theater in 1998. The present article discusses this production in the context of Ronconi's activity as opera director; the Baroque idea of "meraviglia" is also taken into account
Heart rate variability and target organ damage in hypertensive patients
No full textBackground:
We evaluated the association between linear standard Heart Rate Variability (HRV) measures and vascular, renal and cardiac target organ damage (TOD).
Methods:
A retrospective analysis was performed including 200 patients registered in the Regione Campania network (aged 62.4 ± 12, male 64%). HRV analysis was performed by 24-h holter ECG. Renal damage was assessed by estimated glomerular filtration rate (eGFR), vascular damage by carotid intima-media thickness (IMT), and cardiac damage by left ventricular mass index.
Results:
Significantly lower values of the ratio of low to high frequency power (LF/HF) were found in the patients with moderate or severe eGFR (p-value < 0.001). Similarly, depressed values of indexes of the overall autonomic modulation on heart were found in patients with plaque compared to those with a normal IMT (p-value <0.05). These associations remained significant after adjustment for other factors known to contribute to the development of target organ damage, such as age. Moreover, depressed LF/HF was found also in patients with left ventricular hypertrophy but this association was not significant after adjustment for other factors.
Conclusions:
Depressed HRV appeared to be associated with vascular and renal TOD, suggesting the involvement of autonomic imbalance in the TOD. However, as the mechanisms by which abnormal autonomic balance may lead to TOD, and, particularly, to renal organ damage are not clearly known, further prospective studies with longitudinal design are needed to determine the association between HRV and the development of TOD
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
The physiology of LUCA.
No full textSummary of the main interactions of LUCA with its environment, reprinted with permission from [78] (supporting trees in S1 Appendix). Components listed at the lower right are present in LUCA. The figure does not make a statement regarding the source of CO in primordial metabolism, symbolized by [CO]. LUCA indisputably possessed genes because it had a genetic code. Transition metal clusters are symbolized. CH3-R, methyl groups; CODH/ACS, carbon monoxide dehydrogenase/acetyl–CoA synthase; GS, glutamine synthetase; HS-R, organic thiols; LUCA, last universal common ancestor; Mrp, MrP type Na+/H+ antiporter; Nif, nitrogenase; SAM, S-adenosyl methionine.</p
Discrete choice modelling with application to route and departure time choice
No full textThis chapter introduces a general framework for disaggregate travel behaviour modelling. The main focus is on the theoretical paradigm of Random Utility Theory and on its application to route and departure time choices. Main methodological issues on model’s specification and validation are addressed, furthermore modelling solutions for the different route choice dimensions are investigated: pre-trip, en-route, holding choice contexts, switching choice contexts. Together with the Random Utility Theory two alternative modelling approaches are also introduced: Fuzzy Utility Models and Artificial Neural Networks models
- …
