886 research outputs found
Cassiano Ricardo e Menotti Del Picchia: trajetórias intelectuais, projetos políticos e função social da inteligência
No full textDissertação (mestrado) - Universidade Federal de Santa Catarina, Centro de Filosofia e Ciências Humanas, Programa de Pós-Graduação em História, Florianópolis, 2014.Esse trabalho se propõe a analisar a atuação intelectual de Cassiano Ricardo e Menotti Del Picchia, bem como suas aproximações com os poderes políticos estabelecidos ou em potencial ao longo das décadas de 1920, 1930 e 1940. Além disso, busca-se compreender o que entendiam, em seus projetos corporativos de sociedade, como função social a ser desempenhada pelos intelectuais, de que modo atuaram nos debates de seus tempos, seja através de seus ensaios políticos e sociológicos ou da imprensa periódica e como elaboraram uma narrativa histórica que atribuía ao estado de São Paulo um espaço proeminente frente ao conjunto da nação, assim como a sua adaptação ao discurso ideológico do Estado Novo.Abstract : Abstract : This study proposes to analyze the intellectual activity of Cassiano Ricardo and Menotti Del Picchia and their approaches with the established political powers during the 1920s, 1930s and 1940s. Also, the objective of this research is to understand what they meant as the social function of intellectuals in their corporate projects about society. How acted in discussions of their times, from their political and sociological essays or periodical press and how elaborated a historical narrative which attributed to the state of São Paulo a prominent space in relation to the other states of the nation are de questions that this study will be discussed
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
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
Algorithms for Moving Objects Databases
No full text@article{DBLP:journals/cj/LemaFGNS03,
author = {Jos{'e} Antonio Cotelo Lema and
Luca Forlizzi and
Ralf Hartmut G{"u}ting and
Enrico Nardelli and
Markus Schneider},
title = {Algorithms for Moving Objects Databases.},
journal = {Comput. J.},
volume = {46},
number = {6},
year = {2003},
pages = {680-712},
ee = {http://www3.oup.co.uk/computer_journal/current/460680.sgm.abs.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
La veste di piume (hagoromo)
No full textZEAMI MOTOKIYO - HIDETOSHI NAGASAWA
La veste di piume, 2013
50x35/ 36 pag/ 75
cod B17
Esemplare testo del teatro Nō del XV secolo, nella versione originale e nella traduzione inedita di Luca Milasi. Composizione testi in italiano di Rodolfo Campi in Dante c 14, stampati su Amatruda puro cotone da 200 g da Tipoteca Italiana Fondazione. I primi 35 esemplari corredati da un multiplo su rame di Hidetoshi Nagasawa numerato e firmato dall'artista, realizzato con la collaborazione tecnica di Roberto Giudici e Tommaso Grillini. Legatura artigianale di Sandro Francescon.Hagoromo, a Noh play allegedly composed by the greatest Noh author and critic Zeami (fifteenth century) in both the original version and Italian translation. Limited edition (75 copies). The first 35 copies are accompanied by a multiple of copper by Hidetoshi Nagasawa numbered and signed by the artist, realized with the technical collaboration of Roberto Giudici and Thomas Grillini. Handmade binding executed by Sandro Francescon
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
The technological specialization of countries : an analysis of patent data
No full textNew methods of analysis of patent statistics allow assessing country profiles of technological specialization for the period 1990-2006. We witness a modest decrease in levels of specialization, which we show to be negatively influenced by country size and degree of internationalization of inventive activities
Palindromic richness
No full textIn this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. A characteristic property of the so-called rich words is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author together with Droubay and Pirillo in 2001 [X. Droubay, J. Justin, G. Pirillo, Episturmian words and some constructions of de Luca and Rauzy, Theoret. Comput. Sci. 255 (2001) 539-553]. Other examples of rich words have appeared in many different contexts. Here we present the first unified approach to the study of this intriguing family of words. Amongst our main results, we give an explicit description of the periodic rich infinite words and show that the recurrent balanced rich infinite words coincide with the balanced episturmian words. We also consider two wider classes of infinite words, namely weakly rich words and almost rich words (both strictly contain all rich words, but neither one is contained in the other). In particular, we classify all recurrent balanced weakly rich words. As a consequence, we show that any such word on at least three letters is necessarily episturmian; hence weakly rich words obey Fraenkel's conjecture. Likewise, we prove that a certain class of almost rich words obeys Fraenkel's conjecture by showing that the recurrent balanced ones are episturmian or contain at least two distinct letters with the same frequency. Lastly, we study the action of morphisms on (almost) rich words with particular interest in morphisms that preserve (almost) richness. Such morphisms belong to the class of P-morphisms that was introduced by Hof, Knill, and Simon in 1995 [A. Hof, O. Knill, B. Simon, Singular continuous spectrum for palindromic Schrödinger operators, Comm. Math. Phys. 174 (1995) 149-159]
Extension of holomorphic functions from one side of a hypersurface
No full textWe give a new proof of former results by G. Zampieri and the author on extension of holomorphic
functions from one side
of a real hypersurface M of Cn in the presence of an analytic disc
tangent to M, attached to ̄
but not to M. Our method enables us to weaken the regularity assumptions
both for the hypersurface and the disc
Correction to: Management of hepatitis B virus prophylaxis in patients treated with disease-modifying therapies for multiple sclerosis: a multicentric Italian retrospective study (Journal of Neurology, (2022), 269, 6, (3301-3307), 10.1007/s00415-022-11009-x)
No full textThe original version of this article unfortunately contained a mistake. The given and family names of authors were Interchanged and Dr. Spiezia has two given names (Antonio Luca). The author names should be Antonio Riccardo Buonomo, Giulio Viceconte, Massimiliano Calabrese, Giovanna De Luca, Valentina Tomassini, Paola Cavalla, Giorgia Teresa Maniscalco, Diana Ferraro, Viviana Nociti, Marta Radaelli, Maria Chiara Buscarinu, Damiano Paolicelli, Alberto Gajofatto, Pietro Annovazzi, Federica Pinardi, Massimiliano Di Filippo, Cinzia Cordioli, Emanuela Zappulo, Riccardo Scotto, Ivan Gentile, Antonio Luca Spiezia, Martina Petruzzo, Marcello De Angelis, Vincenzo Brescia Morra, Claudio Solaro, Claudio Gasperini, Eleonora Cocco, Marcello Moccia, Roberta Lanzillo The original article has been corrected
- …
