ROSSI, Sabina
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 13.659
EU - Europa 5.554
AS - Asia 2.691
SA - Sud America 16
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 12
AF - Africa 4
Totale 21.949
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 13.511
CN - Cina 2.198
PL - Polonia 1.484
IT - Italia 1.112
UA - Ucraina 542
IE - Irlanda 448
GB - Regno Unito 429
SE - Svezia 414
DE - Germania 385
FI - Finlandia 310
RU - Federazione Russa 179
HK - Hong Kong 160
CA - Canada 144
TR - Turchia 135
SG - Singapore 75
FR - Francia 61
BE - Belgio 42
AT - Austria 32
VN - Vietnam 31
CH - Svizzera 24
GR - Grecia 15
NL - Olanda 15
KR - Corea 14
ES - Italia 12
IN - India 12
AU - Australia 11
IR - Iran 11
UZ - Uzbekistan 11
CL - Cile 10
EU - Europa 10
DK - Danimarca 9
LB - Libano 9
BA - Bosnia-Erzegovina 6
IL - Israele 6
JP - Giappone 6
RO - Romania 6
CZ - Repubblica Ceca 5
BD - Bangladesh 4
BG - Bulgaria 4
BR - Brasile 4
PK - Pakistan 4
PT - Portogallo 4
TW - Taiwan 4
HR - Croazia 3
NO - Norvegia 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AE - Emirati Arabi Uniti 2
EE - Estonia 2
HU - Ungheria 2
LA - Repubblica Popolare Democratica del Laos 2
MA - Marocco 2
MX - Messico 2
NZ - Nuova Zelanda 2
PA - Panama 2
AL - Albania 1
BJ - Benin 1
CO - Colombia 1
CY - Cipro 1
IQ - Iraq 1
LI - Liechtenstein 1
LU - Lussemburgo 1
ME - Montenegro 1
MM - Myanmar 1
MO - Macao, regione amministrativa speciale della Cina 1
MY - Malesia 1
PE - Perù 1
PH - Filippine 1
SI - Slovenia 1
SK - Slovacchia (Repubblica Slovacca) 1
TH - Thailandia 1
ZA - Sudafrica 1
Totale 21.949
Salva come PNG Salva come JPEG
Città #
Woodbridge 2.421
Fairfield 1.901
Warsaw 1.464
Chandler 1.116
Houston 963
Jacksonville 951
Ashburn 882
Ann Arbor 817
Seattle 778
Wilmington 626
Cambridge 618
Dublin 446
Mestre 271
Jinan 267
Nanjing 254
Shenyang 206
Beijing 198
New York 197
Dearborn 171
Venezia 156
San Mateo 154
Hong Kong 153
Izmir 132
Des Moines 125
Hebei 122
Boston 116
Tianjin 113
Guangzhou 111
Southend 109
Mülheim 107
Princeton 106
Andover 103
San Diego 90
Hangzhou 84
Boardman 83
Zhengzhou 79
Changsha 77
Toronto 77
Nanchang 74
Taiyuan 74
Ningbo 62
Jiaxing 61
Taizhou 60
Venice 59
Haikou 55
Ottawa 54
Fuzhou 51
Altamura 48
Saint Petersburg 48
Milan 44
Brussels 41
San Paolo di Civitate 37
London 34
Redwood City 31
Dong Ket 30
Hefei 28
Vienna 24
Kilburn 21
Norwalk 19
Washington 19
Kunming 17
Brooklyn 16
Verona 16
Udine 15
Phoenix 13
Polska 11
Puxian 10
Moscow 9
Auburn Hills 8
Bologna 8
Clearwater 8
Edinburgh 8
Fremont 8
Helsinki 8
Los Angeles 8
Orange 8
Latiano 7
Renton 7
Simi Valley 7
Treviso 7
Winnipeg 7
Zanjan 7
Amsterdam 6
Chicago 6
Hounslow 6
Kemerovo 6
Lanzhou 6
Novokuznetsk 6
Padova 6
Philadelphia 6
Riva 6
Sarajevo 6
Shanghai 6
Xiangfen 6
Dolo 5
Henderson 5
Marghera 5
San Francisco 5
Silea 5
Bari 4
Totale 17.932
Salva come PNG Salva come JPEG
Nome #
Connectivity and energy-aware preorders for mobile ad-hoc networks 540
Analysis of ECN/RED and SAP-LAW with simultaneous TCP and UDP traffic 511
Behavioural equivalences and interference metrics for mobile ad-hoc networks 499
A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs 499
null 439
On the relations between Markov chain lumpability and reversibility 421
Priority-based bandwidth allocation in wireless sensor networks 407
Performance evaluation of AQM techniques with heterogeneous traffic 404
Persistent Stochastic Non-Interference 404
Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations 403
Quantitative Analysis of Concurrent Reversible Computations 388
A Product-form Model for the Analysis of Systems with Aging Objects 362
Model Checking Adaptive Service Compositions 336
Biased processor sharing in fork-join queues 330
Guest editor's forewords: Special issue on Valuetools 2017 323
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses 322
A Framework for Throughput and Energy Efficiency in Mobile ad Hoc Networks 280
Product-forms for Probabilistic Input/Output Automata 277
Evaluating Resistance to Jamming and Casual Interception in Mobile Wireless Networks 276
Automatic Energy-aware Performance Analysis of Mobile Ad-hoc Networks 273
A Probabilistic Energy-Aware Model for Mobile Ad-Hoc Networks 264
A Process Algebraic Framework for Estimating the Energy Consumption in Ad-hoc Wireless Sensor Networks 254
On Modular Termination Proofs of General Logic Programs 249
Power control in saturated fork-join queueing systems 248
A Calculus for Power-aware Multicast Communications in Ad Hoc Networks 243
Fair workload distribution for multi-server systems with pulling strategies 241
Information Flow in Secure Contexts 235
Interference-sensitive Preorders for MANETs 231
Termination of Well-Typed Logic Programs 227
Declarative Semantics of Input Consuming Logic Programs 226
P-Congruences as Non-Interference for the pi-calculus 226
Automated Verification of Behavioural Properties of Prolog Programs 224
Sender- and Receiver-centered Interference in Wireless Ad Hoc Networks 220
Performance Analysis and Formal Verification of Cognitive Wireless Networks 215
Aggregation and Truncation of Reversible Markov Chains Modulo State Renaming 215
Information Flow Security for Stochastic Processes 215
Autoreversibility: exploiting symmetries in Markov chains 205
Information Flow Security and Recursive Systems 204
A Process Calculus for Energy-Aware Multicast Communications of Mobile Ad-Hoc Networks 203
On Discrete Time Reversibility modulo State Renaming and its Applications 203
Specialising Logic Programs with respect to Call/Post Specifications 200
Action Refinement in Process Algebra and Security Issues 200
A Proof System for Information Flow Security 199
Refinement Operators and Information Flow Security 199
Compliance Preorders for Web Services. 198
Properties of Input-Consuming Derivations 197
Unwinding Conditions for Security in Imperative Languages 196
Unwinding in Information Flow Security 194
Automated Verification of Prolog Programs 193
Semantics and Termination of Simply-moded Logic Programs with Dynamic Scheduling 192
Information Flow Security for Service Compositions. 192
Bisimulation and Unwinding for Verifying Possibilistic Security Properties 190
Reexecution-Based Analysis of Logic Programs with Delay Declarations. 190
Static vs Dynamic Typing for Access Control in Pi-Calculus 187
Modelling Downgrading in Information Flow Security 185
Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations 184
On the relations between Lumpability and Reversibility 180
Specification-based Automatic Verification of Prolog Programs 179
Compositional Information Flow Security for Concurrent Programs 178
A Theory of Adaptable Contract-based Service Composition. 176
Properties of Input-Consuming Derivations 174
Static Analysis of Prolog with Cut 173
A process algebra for (delimited) persistent stochastic non-interference 170
Transforming processes to check and ensure Information Flow Security 170
Static Analysis of Prolog with Cut 169
Sequence-based Abstract Interpretation of Prolog 169
Semantics of well-moded input-consuming logic programs 168
Non-Interference Proof Techniques for the Analysis of Cryptographic Protocols 167
Context-Sensitive Equivalences for Non-Interference based Protocol Analysis 166
Compositional information flow security for concurrent programs 166
Automated Behavioural Verification of Prolog Programs 163
An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut 162
Information Flow Security in Dynamic Contexts 162
Semantics of input-consuming programs 161
Secure Contexts for Confidential Data 159
Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses 159
A Security Property for Processes in Dynamic Contexts 157
Information Flow Security in Dynamic Contexts 157
Bridging Language-Based and Process Calculi Security 155
Verifying Persistent Security Properties. 153
A Theory of Noninterference for the pi-calculus 153
Call-Correct Specialisation of Logic Programs 152
Termination of Simply Moded Logic Programs with Dynamic Scheduling. 152
Theoretical and experimental evaluation of the two-level processor sharing discipline for TCP flows 152
PicNic - Pi-calculus Non-Interference checker 150
Model Checking Adaptive Multilevel Service Compositions 148
Proofs Methods for Bisimulation based Information Flow Security 146
CoPS - Checker of Persistent Security 145
A Queueing Model that Works Only on the Biggest Jobs 140
An Abstract Interpretation Framework for (almost) Full Prolog 132
Proportional Lumpability 128
Dynamic resource allocation in fork-join queues 122
Delimited persistent stochastic non-interference 117
Frequency scaling in multilevel queues 107
Fair Work Distribution on Permissioned Blockchains: a Mobile Window Based Approach 102
Contextual Lumpability 97
On the Use of Proof-of-Work in Permissioned Blockchains: Security and Fairness 92
Speed scaling in fork-join queues: A comparative study 89
Smart-RED: A novel congestion control mechanism for high throughput and low queuing delay 86
Controlling Information Release in the pi-calculus 83
Totale 21.824
Salva come PNG Salva come JPEG
Categoria #
all - tutte 60.851
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 60.851
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20191.281 0 0 0 0 0 0 0 0 0 214 427 640
2019/20205.275 491 324 403 1.113 345 454 347 560 442 402 248 146
2020/20214.397 279 208 354 182 586 372 448 229 230 454 660 395
2021/20223.698 438 585 273 464 292 53 125 109 91 345 648 275
2022/20232.992 210 276 53 354 363 793 139 242 293 18 210 41
2023/20241.032 73 74 66 42 146 294 82 82 158 15 0 0
Totale 22.420