3,043 research outputs found
Le traduzioni dei manuali di Luigi Cossa: uno studio bibliografico
No full textIl saggio ricostruisce i dati bibliografici e contestuali di tutte le traduzioni dei manuali di economia politica e scienza delle finanze composti da Luigi Cossa
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,
FRANCESCO FERRARA E LUIGI COSSA: OVVERO L’ANTISOCIALISMO PRIMA DEL MARGINALISMO
No full textIl saggio analizza l'antisocialismo come elemento comune del pensiero di due economisti del Risorgimento, Francesco Ferrara e Luigi Cossa, diversi sotto ogni altro punto di vista, teorico e non
Bradykinin stimulates prostaglandin E2 release in human skeletal muscular fibroblasts
No full textLocal mediator prostaglandins and bradykinin are involved in inflammation and pain. We explored bradykinin effects on prostaglandin E2 (PGE2) release from fibroblasts derived from human skeletal muscular biopsies. Bradykinin induced PGE2 release through bradykinin B2 receptors, since PGE2 release was blocked by the bradykinin B2 receptor selective antagonist FR173657 and B2 receptor agonist (Hyp3)-bradykinin showed effects comparable to bradykinin. Consistently, bradykinin induced both mRNA cyclooxygenase 2 (COX-2) and protein. Bradykinin also induced ERK1/2 and p38 phosphorylation and provoked the translocation from the cytosol to the nucleus of p65/NF-kB. The release of PGE2 by bradykinin could be blocked inhibiting COX-2 and p65/NF-kB, ERK1/2 or p38 activation. Both ERK1/2 and p38 were upstream to NF-kB inasmuch siRNAs significantly blocked the p65/NF-kB activation induced by bradykinin. Thus, bradykinin, acting via B2 receptors, induced PGE2 release through ERK1/2 and p38-dependent pathways and consequent p65/NF-kB translocation to nucleus. p65/NF-kB induced COX-2 transcription. The release of PGE2 provide a possible explanation for the role of bradykinin in inflammatory diseases
Purinergic receptors in a pleural mesotelioma cell line.
No full textWe here demonstrated the expression of 4 (P2Y1,4,6,11) purinoceptors mRNAs coupled to Gq protein. The extracellular ATP, UTP, ADP and UDP caused a transient [Ca2+]i peak followed by a sustained lower phase. Removal of extracellular Ca2+ decreased the initial transient and abolished the plateau phase. Ca2+ signal was blocked by the inhibitor of PLCβ, U73122. Through experiments of fluorescence quenching, it was seen that nucleotides increased plasmamembrane Ca2+ permeability. These results indicate that [Ca2+]i increase was due to activation of P2Y receptors exclusively and that Ca2+ is released from intracellular stores and also enters from the extracellular liquid. We also investigated the effects of purinoceptors on cell proliferation. UTP, ATP and UDP had no significant effects, while ADP causes a drastic cell proliferation decrease in a dose- and time-dependent manner. In conclusion, these results indicate that the expressed purinergic receptors act via PLC activation and that ADP may have a therapeutic potential in MM
Immunolocalization of the AT-1R Ang II Receptor in Human Kidney Cancer
No full textThis study aimed to evaluate AT1-R expression in normal and cancerous human kidneys, how these expressions are modified, and AT1-R functionality. AT-1R mRNA expression, determined by real-time PCR, was detected in all samples. AT-1R mRNA increased in well-differentiated cancer (G1, p < 0.01) and decreased 2.9-fold in undifferentiated cancer (G4, p < 0.001) compared with normal kidney tissues. Immunocytochemistry analysis showed that the AT-1R was expressed in the normal tubular epithelium. The glomerulus was also immunoreactive, and as expected, the smooth muscle cells of the vessel walls also expressed the receptor. A total of 35 out of 42 tumors were AT-1R positive, with the cell tumors showing varying numbers of immunoreactive cells, which were stained in a diffuse cytoplasmic and membranous pattern. Computer-assisted counting of the stained tumor cells showed that the number of AT-1R-positive cells increased in the well-differentiated cancers. The functionality of AT-1R was assessed in primary cultures of kidney epithelial cells obtained from three G3 kidney cancer tissues and corresponding histologically proven non-malignant tissue adjacent to the tumor. Indeed, Ang II stimulated, in a dose-dependent manner, the 24 h proliferation of normal kidney cells and cancer cells in the primary culture and phosphorylated extracellular regulated kinases 1 and 2. In conclusion, Ang II may be involved in the growth or function of neoplastic kidney tissue
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
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
- …
