Institution
Polytechnic University of Turin
Education•Turin, 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 & Computer science. The organization has 11553 authors who have published 41395 publications receiving 789320 citations. The organization is also known as: POLITO & Politecnico di Torino.
Topics: Finite element method, Computer science, Nonlinear system, Context (language use), Population
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this paper, the relation between the relaxation of spontaneous fluctuations and the response to an external perturbation is discussed, and the connection of these works with large deviation theory is analyzed.
698 citations
••
Betty Abelev1, Luke David Hanratty2, M. Esposito3, Edmundo Javier Garcia-Solis4 +940 more•Institutions (90)
TL;DR: The ALICE experiment at the CERN Large Hadron Collider as mentioned in this paper continuously took data during the first physics campaign of the machine from fall 2009 until early 2013, using proton and lead-ion beams.
Abstract: ALICE is the heavy-ion experiment at the CERN Large Hadron Collider. The experiment continuously took data during the first physics campaign of the machine from fall 2009 until early 2013, using proton and lead-ion beams. In this paper we describe the running environment and the data handling procedures, and discuss the performance of the ALICE detectors and analysis methods for various physics observables.
691 citations
••
18 Dec 1995TL;DR: Model-checking algorithms for extensions of pCTL and p CTL* to systems in which the probabilistic behavior coexists with nondeterminism are presented, and it is shown that these algorithms have polynomial-time complexity in the size of the system.
Abstract: The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance. In this paper, we present model-checking algorithms for extensions of pCTL and pCTL* to systems in which the probabilistic behavior coexists with nondeterminism, and show that these algorithms have polynomial-time complexity in the size of the system. This provides a practical tool for reasoning on the reliability and performance of parallel systems.
683 citations
••
15 Jun 2019
TL;DR: This model learns the semantic labels in a supervised fashion, and broadens its understanding of the data by learning from self-supervised signals how to solve a jigsaw puzzle on the same images, which helps the network to learn the concepts of spatial correlation while acting as a regularizer for the classification task.
Abstract: Human adaptability relies crucially on the ability to learn and merge knowledge both from supervised and unsupervised learning: the parents point out few important concepts, but then the children fill in the gaps on their own. This is particularly effective, because supervised learning can never be exhaustive and thus learning autonomously allows to discover invariances and regularities that help to generalize. In this paper we propose to apply a similar approach to the task of object recognition across domains: our model learns the semantic labels in a supervised fashion, and broadens its understanding of the data by learning from self-supervised signals how to solve a jigsaw puzzle on the same images. This secondary task helps the network to learn the concepts of spatial correlation while acting as a regularizer for the classification task. Multiple experiments on the PACS, VLCS, Office-Home and digits datasets confirm our intuition and show that this simple method outperforms previous domain generalization and adaptation solutions. An ablation study further illustrates the inner workings of our approach.
678 citations
•
01 Oct 1997
TL;DR: This paper is intended to give a complete overview of the POLIS system including its formal and algorithmic aspects and will be of interest to embedded system designers (automotive electronics, consumer electronics and telecommunications), micro-controller designers, CAD developers and students.
Abstract: Embedded systems are informally defined as a collection of programmable parts surrounded by ASICs and other standard components, that interact continuously with an environment through sensors and actuators. The programmable parts include micro-controllers and Digital Signal Processors (DSPs). Embedded systems are often used in life-critical situations, where reliability and safety are more important criteria than performance. Today, embedded systems are designed with an ad hoc approach that is heavily based on earlier experience with similar products and on manual design. Use of higher-level languages such as C helps structure the design somewhat, but with increasing complexity it is not sufficient. Formal verification and automatic synthesis of implementations are the surest ways to guarantee safety. Thus, the POLIS system which is a co-design environment for embedded systems is based on a formal model of computation. POLIS was initiated in 1988 as a research project at the University of California at Berkeley and, over the years, grew into a full design methodology with a software system supporting it. Hardware-Software Co-Design of Embedded Systems: The POLIS Approach is intended to give a complete overview of the POLIS system including its formal and algorithmic aspects. Hardware-Software Co-Design of Embedded Systems: The POLIS Approach will be of interest to embedded system designers (automotive electronics, consumer electronics and telecommunications), micro-controller designers, CAD developers and students.
667 citations
Authors
Showing all 11854 results
Name | H-index | Papers | Citations |
---|---|---|---|
Rodney S. Ruoff | 164 | 666 | 194902 |
Silvia Bordiga | 107 | 498 | 41413 |
Sergio Ferrara | 105 | 726 | 44507 |
Enrico Rossi | 103 | 606 | 41255 |
Stefano Passerini | 102 | 771 | 39119 |
James Barber | 102 | 642 | 42397 |
Markus J. Buehler | 95 | 609 | 33054 |
Dario Farina | 94 | 832 | 32786 |
Gabriel G. Katul | 91 | 506 | 34088 |
M. De Laurentis | 84 | 275 | 54727 |
Giuseppe Caire | 82 | 825 | 40344 |
Christophe Fraser | 76 | 264 | 29250 |
Erasmo Carrera | 75 | 829 | 23981 |
Andrea Califano | 75 | 305 | 31348 |
Massimo Inguscio | 74 | 427 | 21507 |