Search results for "MSC"

Characterisation of circulating and infiltrating gamma-delta and regulatory T lymphocytes in NMSC

L'antagonismo immanente. Da Tronti a Gramsci

2022

Il presente saggio si pone il compito di tracciare una linea di continuità tra la produzione teorica di Mario Tronti e la scrittura carceraria di Antonio Gramsci in merito alla questione del rapporto, talvolta antinomico talaltra corrispondente, tra antagonismo e immanenza.

Letture operaiste di Gramsci. Il caso Negri

2020

This article aims to analyze the relationship between Antonio Negri and the political and philosophical categories of Antonio Gramsci. It is my intention to resume, from the Sixties of the last century to nowadays, the stragegical uses of Gramsci’s thought by Negri. According to me, we can divide four periods in the theoretical framework of Negri. In the first one, Gramsci is an author incompatible with the workerist strategy of class struggle. In the second one, there is a sort of use of Gramsci against Gramsci. Pointendly, Negri tries to subtract the author of the Prison Notebooks from the prerogatives of the Pci. After the arrest of Negri in the 1979, Gramsci’s figure became more ambiguo…

Dall'operaismo a Marx

2022

The volume is the result of an annual work of the Self-managed Power Library and Sapere di Palermo. It is a double “monographic” work that attempts to return to a painting I model some reflections on Italian workerism, on its impact on the social articulation, e finally on some themes deriving from the new critical edition of the works of Marx and Engels

Radio k-Labelings for Cartesian Products of Graphs

2005

International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two vertices x and y, where dG(x,y) is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian pro…

Robust dynamic cooperative games

2009

Classical cooperative game theory is no longer a suitable tool for those situations where the values of coalitions are not known with certainty. Recent works address situations where the values of coalitions are modelled by random variables. In this work we still consider the values of coalitions as uncertain, but model them as unknown but bounded disturbances. We do not focus on solving a specific game, but rather consider a family of games described by a polyhedron: each point in the polyhedron is a vector of coalitions’ values and corresponds to a specific game. We consider a dynamic context where while we know with certainty the average value of each coalition on the long run, at each t…

Fast Estimation of the Median Covariation Matrix with Application to Online Robust Principal Components Analysis

2017

International audience; The geometric median covariation matrix is a robust multivariate indicator of dispersion which can be extended without any difficulty to functional data. We define estimators, based on recursive algorithms, that can be simply updated at each new observation and are able to deal rapidly with large samples of high dimensional data without being obliged to store all the data in memory. Asymptotic convergence properties of the recursive algorithms are studied under weak conditions. The computation of the principal components can also be performed online and this approach can be useful for online outlier detection. A simulation study clearly shows that this robust indicat…

Quantitative ergodicity for some switched dynamical systems

2012

International audience; We provide quantitative bounds for the long time behavior of a class of Piecewise Deterministic Markov Processes with state space Rd × E where E is a finite set. The continuous component evolves according to a smooth vector field that switches at the jump times of the discrete coordinate. The jump rates may depend on the whole position of the process. Under regularity assumptions on the jump rates and stability conditions for the vector fields we provide explicit exponential upper bounds for the convergence to equilibrium in terms of Wasserstein distances. As an example, we obtain convergence results for a stochastic version of the Morris-Lecar model of neurobiology.

Random walk approximation of BSDEs with H{\"o}lder continuous terminal condition

2018

In this paper, we consider the random walk approximation of the solution of a Markovian BSDE whose terminal condition is a locally Hölder continuous function of the Brownian motion. We state the rate of the L2-convergence of the approximated solution to the true one. The proof relies in part on growth and smoothness properties of the solution u of the associated PDE. Here we improve existing results by showing some properties of the second derivative of u in space. peerReviewed

The Mean-Field Limit for Solid Particles in a Navier-Stokes Flow

2008

We propose a mathematical derivation of Brinkman's force for a cloud of particles immersed in an incompressible viscous fluid. Specifically, we consider the Stokes or steady Navier-Stokes equations in a bounded domain Omega subset of R-3 for the velocity field u of an incompressible fluid with kinematic viscosity v and density 1. Brinkman's force consists of a source term 6 pi rvj where j is the current density of the particles, and of a friction term 6 pi vpu where rho is the number density of particles. These additional terms in the motion equation for the fluid are obtained from the Stokes or steady Navier-Stokes equations set in Omega minus the disjoint union of N balls of radius epsilo…