scispace - formally typeset
Search or ask a question
Institution

Polytechnic University of Turin

EducationTurin, Piemonte, Italy
About: Polytechnic University of Turin is a education organization based out in Turin, Piemonte, Italy. It is known for research contribution in the topics: Finite element method & Nonlinear system. The organization has 11553 authors who have published 41395 publications receiving 789320 citations. The organization is also known as: POLITO & Politecnico di Torino.


Papers
More filters
Journal ArticleDOI
TL;DR: A computational platform that integrates the analysis of copy number variations and somatic mutations and unravels the landscape of in-frame gene fusions in glioblastoma provides insights into the pathogenesis of gliOBlastoma and highlights new targets for therapeutic intervention.
Abstract: Glioblastoma is one of the most challenging forms of cancer to treat. Here we describe a computational platform that integrates the analysis of copy number variations and somatic mutations and unravels the landscape of in-frame gene fusions in glioblastoma. We found mutations with loss of heterozygosity in LZTR1, encoding an adaptor of CUL3-containing E3 ligase complexes. Mutations and deletions disrupt LZTR1 function, which restrains the self renewal and growth of glioma spheres that retain stem cell features. Loss-of-function mutations in CTNND2 target a neural-specific gene and are associated with the transformation of glioma cells along the very aggressive mesenchymal phenotype. We also report recurrent translocations that fuse the coding sequence of EGFR to several partners, with EGFR-SEPT14 being the most frequent functional gene fusion in human glioblastoma. EGFR-SEPT14 fusions activate STAT3 signaling and confer mitogen independence and sensitivity to EGFR inhibition. These results provide insights into the pathogenesis of glioblastoma and highlight new targets for therapeutic intervention.

454 citations

Journal ArticleDOI
TL;DR: In this paper, a comprehensive model to quantify disaster resilience of systems that is defined as the capability to sustain functionality and recover from losses generated by extreme events is presented. And the model combines loss estimation and recovery models and can be applied to critical facilities (e.g. hospitals, military buildings, etc.).
Abstract: This paper presents a comprehensive model to quantify disaster resilience of systems that is defined as the capability to sustain functionality and recover from losses generated by extreme events. The model combines loss estimation and recovery models and can be applied to critical facilities (e.g. hospitals, military buildings, etc.), as well as utility lifelines (e.g. electric power systems, transportation networks, water systems etc.) that are crucial to the response of recovery processes, decisions and policies. Current research trend leads toward the definition of complex recovery models that are able to describe the process over time and the spatial definition of recovery (e.g. meta-models for the case of health care facilities). The model has been applied to a network of hospitals in Memphis, Tennessee. The resilience framework can be used as a decision support tool to increase the resilience index of systems, such as health care facilities, and reduce disaster vulnerability and consequences.

453 citations

Journal ArticleDOI
TL;DR: In this article, the authors reviewed the current knowledge on flood regime changes in European rivers that has traditionally been obtained through two alternative research approaches: data-based detection of changes in observed flood events and modelled scenarios of future floods.
Abstract: There is growing concern that flooding is becoming more frequent and severe in Europe. A better understanding of flood regime changes and their drivers is therefore needed. The paper reviews the current knowledge on flood regime changes in European rivers that has traditionally been obtained through two alternative research approaches. The first approach is the data-based detection of changes in observed flood events. Current methods are reviewed together with their challenges and opportunities. For example, observation biases, the merging of different data sources and accounting for nonlinear drivers and responses. The second approach consists of modelled scenarios of future floods. Challenges and opportunities associated with flood change scenarios are discussed such as fully accounting for uncertainties in the modelling cascade and feedbacks. To make progress in flood change research, we suggest that a synthesis of these two approaches is needed. This can be achieved by focusing on long duration records and flood-rich and flood-poor periods rather than on short duration flood trends only, by formally attributing causes of observed flood changes, by validating scenarios against observed flood regime dynamics, and by developing low-dimensional models of flood changes and feedbacks. The paper finishes with a call for a joint European flood change research network.

450 citations

Journal ArticleDOI
TL;DR: TCP Westwood is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless networks where throughput improvements of up to 550% are observed.
Abstract: TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless networks. The improvement is most significant in wireless networks with lossy links. In fact, TCPW performance is not very sensitive to random errors, while TCP Reno is equally sensitive to random loss and congestion loss and cannot discriminate between them. Hence, the tendency of TCP Reno to overreact to errors. An important distinguishing feature of TCP Westwood with respect to previous wireless TCP "extensions" is that it does not require inspection and/or interception of TCP packets at intermediate (proxy) nodes. Rather, TCPW fully complies with the end-to-end TCP design principle. The key innovative idea is to continuously measure at the TCP sender side the bandwidth used by the connection via monitoring the rate of returning ACKs. The estimate is then used to compute congestion window and slow start threshold after a congestion episode, that is, after three duplicate acknowledgments or after a timeout. The rationale of this strategy is simple: in contrast with TCP Reno which "blindly" halves the congestion window after three duplicate ACKs, TCP Westwood attempts to select a slow start threshold and a congestion window which are consistent with the effective bandwidth used at the time congestion is experienced. We call this mechanism faster recovery. The proposed mechanism is particularly effective over wireless links where sporadic losses due to radio channel problems are often misinterpreted as a symptom of congestion by current TCP schemes and thus lead to an unnecessary window reduction. Experimental studies reveal improvements in throughput performance, as well as in fairness. In addition, friendliness with TCP Reno was observed in a set of experiments showing that TCP Reno connections are not starved by TCPW connections. Most importantly, TCPW is extremely effective in mixed wired and wireless networks where throughput improvements of up to 550% are observed. Finally, TCPW performs almost as well as localized link layer approaches such as the popular Snoop scheme, without incurring the overhead of a specialized link layer protocol.

450 citations

Journal ArticleDOI
TL;DR: The results show that the proposed designs accomplish significant reductions in power dissipation, delay and transistor count compared to an exact design; moreover, two of the proposed multiplier designs provide excellent capabilities for image multiplication with respect to average normalized error distance and peak signal-to-noise ratio.
Abstract: Inexact (or approximate) computing is an attractive paradigm for digital processing at nanometric scales. Inexact computing is particularly interesting for computer arithmetic designs. This paper deals with the analysis and design of two new approximate 4-2 compressors for utilization in a multiplier. These designs rely on different features of compression, such that imprecision in computation (as measured by the error rate and the so-called normalized error distance) can meet with respect to circuit-based figures of merit of a design (number of transistors, delay and power consumption). Four different schemes for utilizing the proposed approximate compressors are proposed and analyzed for a Dadda multiplier. Extensive simulation results are provided and an application of the approximate multipliers to image processing is presented. The results show that the proposed designs accomplish significant reductions in power dissipation, delay and transistor count compared to an exact design; moreover, two of the proposed multiplier designs provide excellent capabilities for image multiplication with respect to average normalized error distance and peak signal-to-noise ratio (more than 50 dB for the considered image examples).

447 citations


Authors

Showing all 11854 results

NameH-indexPapersCitations
Rodney S. Ruoff164666194902
Silvia Bordiga10749841413
Sergio Ferrara10572644507
Enrico Rossi10360641255
Stefano Passerini10277139119
James Barber10264242397
Markus J. Buehler9560933054
Dario Farina9483232786
Gabriel G. Katul9150634088
M. De Laurentis8427554727
Giuseppe Caire8282540344
Christophe Fraser7626429250
Erasmo Carrera7582923981
Andrea Califano7530531348
Massimo Inguscio7442721507
Network Information
Related Institutions (5)
Royal Institute of Technology
68.4K papers, 1.9M citations

95% related

Delft University of Technology
94.4K papers, 2.7M citations

94% related

École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

93% related

Georgia Institute of Technology
119K papers, 4.6M citations

93% related

Karlsruhe Institute of Technology
82.1K papers, 2.1M citations

92% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023210
2022487
20212,789
20202,969
20192,779
20182,509