Nettoyage perpétuel de réseaux

International audienceDans le cadre du nettoyage de graphes contaminés ( graph searching), des agents mobiles se déplacent successivement le long des arêtes du graphe afin de les nettoyer. Le but général est le nettoyage en utilisant le moins d'agents possible. Nous plaçons notre étude dans le modèle de calcul distribué CORDA minimaliste. Ce modèle est muni d'hypothèses très faibles : les nœuds du réseau et les agents sont anonymes, n'ont pas de mémoire du passé ni sens commun de l'orientation et agissent par cycles Voir-Calculer-Agir de manière asynchrone. Un intérêt de ce modèle vient du fait que si le nettoyage peut être fait à partir de positions arbitraires des agents (par exemple, après pannes ou recontamination), l'absence de mémoire implique un nettoyage perpétuel et donc fournit une première approche de nettoyage de graphe tolérant aux pannes. Les contraintes dues au modèle CORDA minimaliste nous amènent à définir une nouvelle variante de nettoyage de graphes - le nettoyage sans collision, autrement dit, plusieurs agents ne peuvent occuper simultanément un même sommet. Nous montrons que, dans un contexte centralisé, cette variante ne satisfait pas certaines propriétés classiques de nettoyage comme par exemple la monotonie. Nous montrons qu'interdire les ''collisions'' peut augmenter le nombre d'agents nécessaires d'un facteur au plus $\Delta$ le degré maximum du graphe et nous illustrons cette borne. De plus, nous caractérisons complètement le nettoyage sans collision dans les arbres. Dans le contexte distribué, la question qui se pose est la suivante. Existe-t-il un algorithme qui, étant donné un ensemble d'agents mobiles arbitrairement répartis sur des sommets distincts d'un réseau, permet aux agents de nettoyer perpétuellement le graphe ? Dans le cas des chemins, nous montrons que la réponse est négative si le nombre d'agents est pair dans un chemin d'ordre impair, ou si il y a au plus deux agents dans un chemin d'ordre au moins $3$. Nous proposons un algorithme qui nettoie les chemins dans tous les cas restants, ainsi qu'un algorithme pour nettoyer les arbres lorsqu'un nombre suffisant d'agents est disponible initialement

Brief Announcement: Distributed Exclusive and Perpetual Tree Searching

International audienceWe tackle a practical version of the well known {\it graph searching} problem, where a team of robots aims at capturing an intruder in a graph. The robots and the intruder move along the edges of the graph. The intruder is invisible, arbitrary fast, and omniscient. It is caught whenever it stands on a node occupied by a robot, and cannot escape to a neighboring node. We study graph searching in the CORDA model of mobile computing: robots are asynchronous, and they perform cycles of {\it Look-Compute-Move} actions. Moreover, motivated by physical constraints, we consider the \emph{exclusive} property, stating that no two or more robots can occupy the same node at the same time. In addition, we assume that the network and the robots are anonymous. Finally, robots are \emph{oblivious}, i.e., each robot performs its move actions based only on its current ''vision'' of the positions of the other robots. Our objective is to characterize, for a graph $G$, the set of integers $k$ such that graph searching can be achieved by a team of $k$ robots starting from \emph{any} $k$ distinct nodes in $G$. Our main result consists in a full characterization of this set, for any asymmetric tree. Towards providing a characterization for all trees, including trees with non-trivial automorphisms, we have also provides a set of positive and negative results, including a full characterization for any line. All our positive results are based on the design of algorithms enabling \emph{perpetual} graph searching to be achieved with the desired number of robots

À la redécouverte du capitalisme américain

La « nouvelle histoire du capitalisme » est sans doute l’avatar le plus dynamique, et médiatisé, de renouveau de l’intérêt des historien-ne-s pour les thématiques économiques aux États-Unis. Cet essai propose une analyse de la nature de ce mouvement historiographique, ni école ni sous-champ, mais opération de mobilisation de travaux éclectiques dans leurs sujets mais connexes dans leurs méthodes. Il offre également une évaluation d’étape de ce phénomène encore neuf, dans les promesses qu’il porte, les polémiques qu’il suscite, et les limites de son orientation actuelle.The “new history of capitalism” is a recent historiographical trend that might be the most dynamic and publicized avatar of the renewal of historians’ interest in the economy in the United States. This article offers a critical review of this movement, with an analysis of its nature as neither a school nor a subfield, but rather a move to gather under a common expansive umbrella a host of works on the history of economic life scattered in topics but close in method. It also proposes a first evaluation of a still-young phenomenon, with the promises it bears, the controversies it has triggered, and the limitations of its current course.Die „new history of capitalism“ ist ein aktueller historiographischer Trend, der möglicherweise die dynamischste und meist gepriesenste Ausprägung des neu erwachten Interesses der Historikerinnen und Historiker an der Wirtschaft der Vereinigten Staaten ist. Dieser Beitrag bietet eine Analyse dieser historiographische Strömung, die weder Schule noch Teilgebiet ist, sondern eher eine Bewegung, die eine Vielzahl von wirtschaftshistorischen Arbeiten zu verschiedenen Themen, aber unter Anwendung verwandter Methoden, vereint. Des Weiteren soll eine erste Einschätzung des noch jungen Phänomens wie seiner Versprechungen, Kontroversen und Grenzen geboten werden

Electroencephalography as a clinical tool for diagnosing and monitoring attention deficit hyperactivity disorder: a cross-sectional study.

To access publisher's full text version of this article, please click on the hyperlink in Additional Links field or click on the hyperlink at the top of the page marked Files. This article is open access.The aim of this study was to develop and test, for the first time, a multivariate diagnostic classifier of attention deficit hyperactivity disorder (ADHD) based on EEG coherence measures and chronological age.The participants were recruited in two specialised centres and three schools in Reykjavik.The data are from a large cross-sectional cohort of 310 patients with ADHD and 351 controls, covering an age range from 5.8 to 14 years. ADHD was diagnosed according to the Diagnostic and Statistical Manual of Mental Disorders fourth edition (DSM-IV) criteria using the K-SADS-PL semistructured interview. Participants in the control group were reported to be free of any mental or developmental disorders by their parents and had a score of less than 1.5 SDs above the age-appropriate norm on the ADHD Rating Scale-IV. Other than moderate or severe intellectual disability, no additional exclusion criteria were applied in order that the cohort reflected the typical cross section of patients with ADHD.Diagnostic classifiers were developed using statistical pattern recognition for the entire age range and for specific age ranges and were tested using cross-validation and by application to a separate cohort of recordings not used in the development process. The age-specific classification approach was more accurate (76% accuracy in the independent test cohort; 81% cross-validation accuracy) than the age-independent version (76%; 73%). Chronological age was found to be an important classification feature.The novel application of EEG-based classification methods presented here can offer significant benefit to the clinician by improving both the accuracy of initial diagnosis and ongoing monitoring of children and adolescents with ADHD. The most accurate possible diagnosis at a single point in time can be obtained by the age-specific classifiers, but the age-independent classifiers are also useful as they enable longitudinal monitoring of brain function.Icelandic Technology Development Fund 071201007 Landspitali University Hospital Research Fun

Atomic layer fluorination of 5 V class positive electrode material LiCoPO4 for enhanced electrochemical performance

EJK would like to thank the Alistore ERI for the award of a studentship. The authors thank EPSRC Capital for Great Technologies Grant EP/L017008/1. The authors want to thank the French Research Network on the Electrochemical Energy Storage (RS2E) for YCB’s PhD grant. MD and NL are indebted to the IR-RMN-THC FR3050 CNRS for the spectrometer time access and the financial support of the NMR experiments.The surface fluorination of lithium cobalt phosphate (LiCoPO4, LCP) using a one‐step, room temperature processable, easily up‐scalable and dry surface modification method with XeF2 as fluorine source was developed. After fluorination, fluorine‐rich nanoparticles were observed mainly on the particle surface, which facilitates the improvement of surface stability and electrochemical performance such as cycling stability and rate capability, as the fluorinated LCP can be protected against side reactions with electrolyte or by‐products of electrolyte decomposition at high voltage (5 V). More importantly, the direct surface fluorination proved more efficient than adding a fluorinated electrolyte additive (i. e., FEC). These results suggest that surface fluorination using XeF2 is of great promise for practical applications of high voltage positive materials for lithium‐ion batteries.PostprintPeer reviewe

Usefulness of molecular biology performed with formaldehyde-fixed paraffin embedded tissue for the diagnosis of combined pulmonary invasive mucormycosis and aspergillosis in an immunocompromised patient

Immunocompromised patients who develop invasive filamentous mycotic infections can be efficiently treated if rapid identification of the causative fungus is obtained. We report a case of fatal necrotic pneumonia caused by combined pulmonary invasive mucormycosis and aspergillosis in a 66 year-old renal transplant recipient. Aspergillus was first identified during the course of the disease by cytological examination and culture (A. fumigatus) of bronchoalveolar fluid. Hyphae of Mucorales (Rhizopus microsporus) were subsequently identified by culture of a tissue specimen taken from the left inferior pulmonary lobe, which was surgically resected two days before the patient died. Histological analysis of the lung parenchyma showed the association of two different filamentous mycoses for which the morphological features were evocative of aspergillosis and mucormycosis. However, the definitive identification of the associative infection was made by polymerase chain reaction (PCR) performed on deparaffinized tissue sections using specific primers for aspergillosis and mucormycosis. This case demonstrates that discrepancies between histological, cytological and mycological analyses can occur in cases of combined mycotic infection. In this regard, it shows that PCR on selected paraffin blocks is a very powerful method for making or confirming the association of different filamentous mycoses and that this method should be made available to pathology laboratories

Radioactivity control strategy for the JUNO detector

602siopenJUNO is a massive liquid scintillator detector with a primary scientific goal of determining the neutrino mass ordering by studying the oscillated anti-neutrino flux coming from two nuclear power plants at 53 km distance. The expected signal anti-neutrino interaction rate is only 60 counts per day (cpd), therefore a careful control of the background sources due to radioactivity is critical. In particular, natural radioactivity present in all materials and in the environment represents a serious issue that could impair the sensitivity of the experiment if appropriate countermeasures were not foreseen. In this paper we discuss the background reduction strategies undertaken by the JUNO collaboration to reduce at minimum the impact of natural radioactivity. We describe our efforts for an optimized experimental design, a careful material screening and accurate detector production handling, and a constant control of the expected results through a meticulous Monte Carlo simulation program. We show that all these actions should allow us to keep the background count rate safely below the target value of 10 Hz (i.e. ∼1 cpd accidental background) in the default fiducial volume, above an energy threshold of 0.7 MeV. [Figure not available: see fulltext.]openAbusleme A.; Adam T.; Ahmad S.; Ahmed R.; Aiello S.; Akram M.; An F.; An Q.; Andronico G.; Anfimov N.; Antonelli V.; Antoshkina T.; Asavapibhop B.; de Andre J.P.A.M.; Auguste D.; Babic A.; Baldini W.; Barresi A.; Basilico D.; Baussan E.; Bellato M.; Bergnoli A.; Birkenfeld T.; Blin S.; Blum D.; Blyth S.; Bolshakova A.; Bongrand M.; Bordereau C.; Breton D.; Brigatti A.; Brugnera R.; Bruno R.; Budano A.; Buscemi M.; Busto J.; Butorov I.; Cabrera A.; Cai H.; Cai X.; Cai Y.; Cai Z.; Cammi A.; Campeny A.; Cao C.; Cao G.; Cao J.; Caruso R.; Cerna C.; Chang J.; Chang Y.; Chen P.; Chen P.-A.; Chen S.; Chen X.; Chen Y.-W.; Chen Y.; Chen Y.; Chen Z.; Cheng J.; Cheng Y.; Chetverikov A.; Chiesa D.; Chimenti P.; Chukanov A.; Claverie G.; Clementi C.; Clerbaux B.; Conforti Di Lorenzo S.; Corti D.; Cremonesi O.; Dal Corso F.; Dalager O.; De La Taille C.; Deng J.; Deng Z.; Deng Z.; Depnering W.; Diaz M.; Ding X.; Ding Y.; Dirgantara B.; Dmitrievsky S.; Dohnal T.; Dolzhikov D.; Donchenko G.; Dong J.; Doroshkevich E.; Dracos M.; Druillole F.; Du S.; Dusini S.; Dvorak M.; Enqvist T.; Enzmann H.; Fabbri A.; Fajt L.; Fan D.; Fan L.; Fang J.; Fang W.; Fargetta M.; Fedoseev D.; Fekete V.; Feng L.-C.; Feng Q.; Ford R.; Formozov A.; Fournier A.; Gan H.; Gao F.; Garfagnini A.; Giammarchi M.; Giaz A.; Giudice N.; Gonchar M.; Gong G.; Gong H.; Gornushkin Y.; Gottel A.; Grassi M.; Grewing C.; Gromov V.; Gu M.; Gu X.; Gu Y.; Guan M.; Guardone N.; Gul M.; Guo C.; Guo J.; Guo W.; Guo X.; Guo Y.; Hackspacher P.; Hagner C.; Han R.; Han Y.; Hassan M.S.; He M.; He W.; Heinz T.; Hellmuth P.; Heng Y.; Herrera R.; Hor Y.K.; Hou S.; Hsiung Y.; Hu B.-Z.; Hu H.; Hu J.; Hu J.; Hu S.; Hu T.; Hu Z.; Huang C.; Huang G.; Huang H.; Huang W.; Huang X.; Huang X.; Huang Y.; Hui J.; Huo L.; Huo W.; Huss C.; Hussain S.; Ioannisian A.; Isocrate R.; Jelmini B.; Jen K.-L.; Jeria I.; Ji X.; Ji X.; Jia H.; Jia J.; Jian S.; Jiang D.; Jiang X.; Jin R.; Jing X.; Jollet C.; Joutsenvaara J.; Jungthawan S.; Kalousis L.; Kampmann P.; Kang L.; Karaparambil R.; Kazarian N.; Khan W.; Khosonthongkee K.; Korablev D.; Kouzakov K.; Krasnoperov A.; Kruth A.; Kutovskiy N.; Kuusiniemi P.; Lachenmaier T.; Landini C.; Leblanc S.; Lebrin V.; Lefevre F.; Lei R.; Leitner R.; Leung J.; Li D.; Li F.; Li F.; Li H.; Li H.; Li J.; Li M.; Li M.; Li N.; Li N.; Li Q.; Li R.; Li S.; Li T.; Li W.; Li W.; Li X.; Li X.; Li X.; Li Y.; Li Y.; Li Z.; Li Z.; Li Z.; Liang H.; Liang H.; Liao J.; Liebau D.; Limphirat A.; Limpijumnong S.; Lin G.-L.; Lin S.; Lin T.; Ling J.; Lippi I.; Liu F.; Liu H.; Liu H.; Liu H.; Liu H.; Liu H.; Liu J.; Liu J.; Liu M.; Liu Q.; Liu Q.; Liu R.; Liu S.; Liu S.; Liu S.; Liu X.; Liu X.; Liu Y.; Liu Y.; Lokhov A.; Lombardi P.; Lombardo C.; Loo K.; Lu C.; Lu H.; Lu J.; Lu J.; Lu S.; Lu X.; Lubsandorzhiev B.; Lubsandorzhiev S.; Ludhova L.; Luo F.; Luo G.; Luo P.; Luo S.; Luo W.; Lyashuk V.; Ma B.; Ma Q.; Ma S.; Ma X.; Ma X.; Maalmi J.; Malyshkin Y.; Mantovani F.; Manzali F.; Mao X.; Mao Y.; Mari S.M.; Marini F.; Marium S.; Martellini C.; Martin-Chassard G.; Martini A.; Mayer M.; Mayilyan D.; Mednieks I.; Meng Y.; Meregaglia A.; Meroni E.; Meyhofer D.; Mezzetto M.; Miller J.; Miramonti L.; Montini P.; Montuschi M.; Muller A.; Nastasi M.; Naumov D.V.; Naumova E.; Navas-Nicolas D.; Nemchenok I.; Nguyen Thi M.T.; Ning F.; Ning Z.; Nunokawa H.; Oberauer L.; Ochoa-Ricoux J.P.; Olshevskiy A.; Orestano D.; Ortica F.; Othegraven R.; Pan H.-R.; Paoloni A.; Parmeggiano S.; Pei Y.; Pelliccia N.; Peng A.; Peng H.; Perrot F.; Petitjean P.-A.; Petrucci F.; Pilarczyk O.; Pineres Rico L.F.; Popov A.; Poussot P.; Pratumwan W.; Previtali E.; Qi F.; Qi M.; Qian S.; Qian X.; Qian Z.; Qiao H.; Qin Z.; Qiu S.; Rajput M.U.; Ranucci G.; Raper N.; Re A.; Rebber H.; Rebii A.; Ren B.; Ren J.; Ricci B.; Robens M.; Roche M.; Rodphai N.; Romani A.; Roskovec B.; Roth C.; Ruan X.; Ruan X.; Rujirawat S.; Rybnikov A.; Sadovsky A.; Saggese P.; Sanfilippo S.; Sangka A.; Sanguansak N.; Sawangwit U.; Sawatzki J.; Sawy F.; Schever M.; Schwab C.; Schweizer K.; Selyunin A.; Serafini A.; Settanta G.; Settimo M.; Shao Z.; Sharov V.; Shaydurova A.; Shi J.; Shi Y.; Shutov V.; Sidorenkov A.; Simkovic F.; Sirignano C.; Siripak J.; Sisti M.; Slupecki M.; Smirnov M.; Smirnov O.; Sogo-Bezerra T.; Sokolov S.; Songwadhana J.; Soonthornthum B.; Sotnikov A.; Sramek O.; Sreethawong W.; Stahl A.; Stanco L.; Stankevich K.; Stefanik D.; Steiger H.; Steinmann J.; Sterr T.; Stock M.R.; Strati V.; Studenikin A.; Sun S.; Sun X.; Sun Y.; Sun Y.; Suwonjandee N.; Szelezniak M.; Tang J.; Tang Q.; Tang Q.; Tang X.; Tietzsch A.; Tkachev I.; Tmej T.; Treskov K.; Triossi A.; Troni G.; Trzaska W.; Tuve C.; Ushakov N.; van den Boom J.; van Waasen S.; Vanroyen G.; Vassilopoulos N.; Vedin V.; Verde G.; Vialkov M.; Viaud B.; Vollbrecht M.C.; Volpe C.; Vorobel V.; Voronin D.; Votano L.; Walker P.; Wang C.; Wang C.-H.; Wang E.; Wang G.; Wang J.; Wang J.; Wang K.; Wang L.; Wang M.; Wang M.; Wang M.; Wang R.; Wang S.; Wang W.; Wang W.; Wang W.; Wang X.; Wang X.; Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Z.; Wang Z.; Wang Z.; Wang Z.; Waqas M.; Watcharangkool A.; Wei L.; Wei W.; Wei W.; Wei Y.; Wen L.; Wiebusch C.; Wong S.C.-F.; Wonsak B.; Wu D.; Wu F.; Wu Q.; Wu Z.; Wurm M.; Wurtz J.; Wysotzki C.; Xi Y.; Xia D.; Xie X.; Xie Y.; Xie Z.; Xing Z.; Xu B.; Xu C.; Xu D.; Xu F.; Xu H.; Xu J.; Xu J.; Xu M.; Xu Y.; Xu Y.; Yan B.; Yan T.; Yan W.; Yan X.; Yan Y.; Yang A.; Yang C.; Yang C.; Yang H.; Yang J.; Yang L.; Yang X.; Yang Y.; Yang Y.; Yao H.; Yasin Z.; Ye J.; Ye M.; Ye Z.; Yegin U.; Yermia F.; Yi P.; Yin N.; Yin X.; You Z.; Yu B.; Yu C.; Yu C.; Yu H.; Yu M.; Yu X.; Yu Z.; Yu Z.; Yuan C.; Yuan Y.; Yuan Z.; Yuan Z.; Yue B.; Zafar N.; Zambanini A.; Zavadskyi V.; Zeng S.; Zeng T.; Zeng Y.; Zhan L.; Zhang A.; Zhang F.; Zhang G.; Zhang H.; Zhang H.; Zhang J.; Zhang J.; Zhang J.; Zhang J.; Zhang J.; Zhang P.; Zhang Q.; Zhang S.; Zhang S.; Zhang T.; Zhang X.; Zhang X.; Zhang X.; Zhang Y.; Zhang Y.; Zhang Y.; Zhang Y.; Zhang Y.; Zhang Y.; Zhang Z.; Zhang Z.; Zhao F.; Zhao J.; Zhao R.; Zhao S.; Zhao T.; Zheng D.; Zheng H.; Zheng M.; Zheng Y.; Zhong W.; Zhou J.; Zhou L.; Zhou N.; Zhou S.; Zhou T.; Zhou X.; Zhu J.; Zhu K.; Zhu K.; Zhu Z.; Zhuang B.; Zhuang H.; Zong L.; Zou J.Abusleme, A.; Adam, T.; Ahmad, S.; Ahmed, R.; Aiello, S.; Akram, M.; An, F.; An, Q.; Andronico, G.; Anfimov, N.; Antonelli, V.; Antoshkina, T.; Asavapibhop, B.; de Andre, J. P. A. M.; Auguste, D.; Babic, A.; Baldini, W.; Barresi, A.; Basilico, D.; Baussan, E.; Bellato, M.; Bergnoli, A.; Birkenfeld, T.; Blin, S.; Blum, D.; Blyth, S.; Bolshakova, A.; Bongrand, M.; Bordereau, C.; Breton, D.; Brigatti, A.; Brugnera, R.; Bruno, R.; Budano, A.; Buscemi, M.; Busto, J.; Butorov, I.; Cabrera, A.; Cai, H.; Cai, X.; Cai, Y.; Cai, Z.; Cammi, A.; Campeny, A.; Cao, C.; Cao, G.; Cao, J.; Caruso, R.; Cerna, C.; Chang, J.; Chang, Y.; Chen, P.; Chen, P. -A.; Chen, S.; Chen, X.; Chen, Y. -W.; Chen, Y.; Chen, Y.; Chen, Z.; Cheng, J.; Cheng, Y.; Chetverikov, A.; Chiesa, D.; Chimenti, P.; Chukanov, A.; Claverie, G.; Clementi, C.; Clerbaux, B.; Conforti Di Lorenzo, S.; Corti, D.; Cremonesi, O.; Dal Corso, F.; Dalager, O.; De La Taille, C.; Deng, J.; Deng, Z.; Deng, Z.; Depnering, W.; Diaz, M.; Ding, X.; Ding, Y.; Dirgantara, B.; Dmitrievsky, S.; Dohnal, T.; Dolzhikov, D.; Donchenko, G.; Dong, J.; Doroshkevich, E.; Dracos, M.; Druillole, F.; Du, S.; Dusini, S.; Dvorak, M.; Enqvist, T.; Enzmann, H.; Fabbri, A.; Fajt, L.; Fan, D.; Fan, L.; Fang, J.; Fang, W.; Fargetta, M.; Fedoseev, D.; Fekete, V.; Feng, L. -C.; Feng, Q.; Ford, R.; Formozov, A.; Fournier, A.; Gan, H.; Gao, F.; Garfagnini, A.; Giammarchi, M.; Giaz, A.; Giudice, N.; Gonchar, M.; Gong, G.; Gong, H.; Gornushkin, Y.; Gottel, A.; Grassi, M.; Grewing, C.; Gromov, V.; Gu, M.; Gu, X.; Gu, Y.; Guan, M.; Guardone, N.; Gul, M.; Guo, C.; Guo, J.; Guo, W.; Guo, X.; Guo, Y.; Hackspacher, P.; Hagner, C.; Han, R.; Han, Y.; Hassan, M. S.; He, M.; He, W.; Heinz, T.; Hellmuth, P.; Heng, Y.; Herrera, R.; Hor, Y. K.; Hou, S.; Hsiung, Y.; Hu, B. -Z.; Hu, H.; Hu, J.; Hu, J.; Hu, S.; Hu, T.; Hu, Z.; Huang, C.; Huang, G.; Huang, H.; Huang, W.; Huang, X.; Huang, X.; Huang, Y.; Hui, J.; Huo, L.; Huo, W.; Huss, C.; Hussain, S.; Ioannisian, A.; Isocrate, R.; Jelmini, B.; Jen, K. -L.; Jeria, I.; Ji, X.; Ji, X.; Jia, H.; Jia, J.; Jian, S.; Jiang, D.; Jiang, X.; Jin, R.; Jing, X.; Jollet, C.; Joutsenvaara, J.; Jungthawan, S.; Kalousis, L.; Kampmann, P.; Kang, L.; Karaparambil, R.; Kazarian, N.; Khan, W.; Khosonthongkee, K.; Korablev, D.; Kouzakov, K.; Krasnoperov, A.; Kruth, A.; Kutovskiy, N.; Kuusiniemi, P.; Lachenmaier, T.; Landini, C.; Leblanc, S.; Lebrin, V.; Lefevre, F.; Lei, R.; Leitner, R.; Leung, J.; Li, D.; Li, F.; Li, F.; Li, H.; Li, H.; Li, J.; Li, M.; Li, M.; Li, N.; Li, N.; Li, Q.; Li, R.; Li, S.; Li, T.; Li, W.; Li, W.; Li, X.; Li, X.; Li, X.; Li, Y.; Li, Y.; Li, Z.; Li, Z.; Li, Z.; Liang, H.; Liang, H.; Liao, J.; Liebau, D.; Limphirat, A.; Limpijumnong, S.; Lin, G. -L.; Lin, S.; Lin, T.; Ling, J.; Lippi, I.; Liu, F.; Liu, H.; Liu, H.; Liu, H.; Liu, H.; Liu, H.; Liu, J.; Liu, J.; Liu, M.; Liu, Q.; Liu, Q.; Liu, R.; Liu, S.; Liu, S.; Liu, S.; Liu, X.; Liu, X.; Liu, Y.; Liu, Y.; Lokhov, A.; Lombardi, P.; Lombardo, C.; Loo, K.; Lu, C.; Lu, H.; Lu, J.; Lu, J.; Lu, S.; Lu, X.; Lubsandorzhiev, B.; Lubsandorzhiev, S.; Ludhova, L.; Luo, F.; Luo, G.; Luo, P.; Luo, S.; Luo, W.; Lyashuk, V.; Ma, B.; Ma, Q.; Ma, S.; Ma, X.; Ma, X.; Maalmi, J.; Malyshkin, Y.; Mantovani, F.; Manzali, F.; Mao, X.; Mao, Y.; Mari, S. M.; Marini, F.; Marium, S.; Martellini, C.; Martin-Chassard, G.; Martini, A.; Mayer, M.; Mayilyan, D.; Mednieks, I.; Meng, Y.; Meregaglia, A.; Meroni, E.; Meyhofer, D.; Mezzetto, M.; Miller, J.; Miramonti, L.; Montini, P.; Montuschi, M.; Muller, A.; Nastasi, M.; Naumov, D. V.; Naumova, E.; Navas-Nicolas, D.; Nemchenok, I.; Nguyen Thi, M. T.; Ning, F.; Ning, Z.; Nunokawa, H.; Oberauer, L.; Ochoa-Ricoux, J. P.; Olshevskiy, A.; Orestano, D.; Ortica, F.; Othegraven, R.; Pan, H. -R.; Paoloni, A.; Parmeggiano, S.; Pei, Y.; Pelliccia, N.; Peng, A.; Peng, H.; Perrot, F.; Petitjean, P. -A.; Petrucci, F.; Pilarczyk, O.; Pineres Rico, L. F.; Popov, A.; Poussot, P.; Pratumwan, W.; Previtali, E.; Qi, F.; Qi, M.; Qian, S.; Qian, X.; Qian, Z.; Qiao, H.; Qin, Z.; Qiu, S.; Rajput, M. U.; Ranucci, G.; Raper, N.; Re, A.; Rebber, H.; Rebii, A.; Ren, B.; Ren, J.; Ricci, B.; Robens, M.; Roche, M.; Rodphai, N.; Romani, A.; Roskovec, B.; Roth, C.; Ruan, X.; Ruan, X.; Rujirawat, S.; Rybnikov, A.; Sadovsky, A.; Saggese, P.; Sanfilippo, S.; Sangka, A.; Sanguansak, N.; Sawangwit, U.; Sawatzki, J.; Sawy, F.; Schever, M.; Schwab, C.; Schweizer, K.; Selyunin, A.; Serafini, A.; Settanta, G.; Settimo, M.; Shao, Z.; Sharov, V.; Shaydurova, A.; Shi, J.; Shi, Y.; Shutov, V.; Sidorenkov, A.; Simkovic, F.; Sirignano, C.; Siripak, J.; Sisti, M.; Slupecki, M.; Smirnov, M.; Smirnov, O.; Sogo-Bezerra, T.; Sokolov, S.; Songwadhana, J.; Soonthornthum, B.; Sotnikov, A.; Sramek, O.; Sreethawong, W.; Stahl, A.; Stanco, L.; Stankevich, K.; Stefanik, D.; Steiger, H.; Steinmann, J.; Sterr, T.; Stock, M. R.; Strati, V.; Studenikin, A.; Sun, S.; Sun, X.; Sun, Y.; Sun, Y.; Suwonjandee, N.; Szelezniak, M.; Tang, J.; Tang, Q.; Tang, Q.; Tang, X.; Tietzsch, A.; Tkachev, I.; Tmej, T.; Treskov, K.; Triossi, A.; Troni, G.; Trzaska, W.; Tuve, C.; Ushakov, N.; van den Boom, J.; van Waasen, S.; Vanroyen, G.; Vassilopoulos, N.; Vedin, V.; Verde, G.; Vialkov, M.; Viaud, B.; Vollbrecht, M. C.; Volpe, C.; Vorobel, V.; Voronin, D.; Votano, L.; Walker, P.; Wang, C.; Wang, C. -H.; Wang, E.; Wang, G.; Wang, J.; Wang, J.; Wang, K.; Wang, L.; Wang, M.; Wang, M.; Wang, M.; Wang, R.; Wang, S.; Wang, W.; Wang, W.; Wang, W.; Wang, X.; Wang, X.; Wang, Y.; Wang, Y.; Wang, Y.; Wang, Y.; Wang, Y.; Wang, Y.; Wang, Y.; Wang, Z.; Wang, Z.; Wang, Z.; Wang, Z.; Waqas, M.; Watcharangkool, A.; Wei, L.; Wei, W.; Wei, W.; Wei, Y.; Wen, L.; Wiebusch, C.; Wong, S. C. -F.; Wonsak, B.; Wu, D.; Wu, F.; Wu, Q.; Wu, Z.; Wurm, M.; Wurtz, J.; Wysotzki, C.; Xi, Y.; Xia, D.; Xie, X.; Xie, Y.; Xie, Z.; Xing, Z.; Xu, B.; Xu, C.; Xu, D.; Xu, F.; Xu, H.; Xu, J.; Xu, J.; Xu, M.; Xu, Y.; Xu, Y.; Yan, B.; Yan, T.; Yan, W.; Yan, X.; Yan, Y.; Yang, A.; Yang, C.; Yang, C.; Yang, H.; Yang, J.; Yang, L.; Yang, X.; Yang, Y.; Yang, Y.; Yao, H.; Yasin, Z.; Ye, J.; Ye, M.; Ye, Z.; Yegin, U.; Yermia, F.; Yi, P.; Yin, N.; Yin, X.; You, Z.; Yu, B.; Yu, C.; Yu, C.; Yu, H.; Yu, M.; Yu, X.; Yu, Z.; Yu, Z.; Yuan, C.; Yuan, Y.; Yuan, Z.; Yuan, Z.; Yue, B.; Zafar, N.; Zambanini, A.; Zavadskyi, V.; Zeng, S.; Zeng, T.; Zeng, Y.; Zhan, L.; Zhang, A.; Zhang, F.; Zhang, G.; Zhang, H.; Zhang, H.; Zhang, J.; Zhang, J.; Zhang, J.; Zhang, J.; Zhang, J.; Zhang, P.; Zhang, Q.; Zhang, S.; Zhang, S.; Zhang, T.; Zhang, X.; Zhang, X.; Zhang, X.; Zhang, Y.; Zhang, Y.; Zhang, Y.; Zhang, Y.; Zhang, Y.; Zhang, Y.; Zhang, Z.; Zhang, Z.; Zhao, F.; Zhao, J.; Zhao, R.; Zhao, S.; Zhao, T.; Zheng, D.; Zheng, H.; Zheng, M.; Zheng, Y.; Zhong, W.; Zhou, J.; Zhou, L.; Zhou, N.; Zhou, S.; Zhou, T.; Zhou, X.; Zhu, J.; Zhu, K.; Zhu, K.; Zhu, Z.; Zhuang, B.; Zhuang, H.; Zong, L.; Zou, J