Università della Svizzera italiana

Quantum EXPRESSO is an integrated suite of open-source computer codes for quantum simulations of materials using state-of-the-art electronic-structure techniques, based on density-functional theory, density-functional perturbation theory, and many-body perturbation theory, within the plane-wave pseudopotential and projector-augmented-wave approaches. Quantum EXPRESSO owes its popularity to the wide variety of properties and processes it allows to simulate, to its performance on an increasingly broad array of hardware architectures, and to a community of researchers that rely on its capabilities as a core open-source development platform to implement their ideas. In this paper we describe recent extensions and improvements, covering new methodologies and property calculators, improved parallelization, code modularization, and extended interoperability both within the distribution and with external software.

Several variants of the long short-term memory (LSTM) architecture for recurrent neural networks have been proposed since its inception in 1995. In recent years, these networks have become the state-of-the-art models for a variety of machine learning problems. This has led to a renewed interest in understanding the role and utility of various computational components of typical LSTM variants. In this paper, we present the first large-scale analysis of eight LSTM variants on three representative tasks: speech recognition, handwriting recognition, and polyphonic music modeling. The hyperparameters of all LSTM variants for each task were optimized separately using random search, and their importance was assessed using the powerful functional ANalysis Of VAriance framework. In total, we summarize the results of 5400 experimental runs ( ≈ 15 years of CPU time), which makes our study the largest of its kind on LSTM networks. Our results show that none of the variants can improve upon the standard LSTM architecture significantly, and demonstrate the forget gate and the output activation function to be its most critical components. We further observe that the studied hyperparameters are virtually independent and derive guidelines for their efficient adjustment.

Point clouds provide a flexible geometric representation suitable for countless applications in computer graphics; they also comprise the raw output of most 3D data acquisition devices. While hand-designed features on point clouds have long been proposed in graphics and vision, however, the recent overwhelming success of convolutional neural networks (CNNs) for image analysis suggests the value of adapting insight from CNN to the point cloud world. Point clouds inherently lack topological information, so designing a model to recover topology can enrich the representation power of point clouds. To this end, we propose a new neural network module dubbed EdgeConv suitable for CNN-based high-level tasks on point clouds, including classification and segmentation. EdgeConv acts on graphs dynamically computed in each layer of the network. It is differentiable and can be plugged into existing architectures. Compared to existing modules operating in extrinsic space or treating each point independently, EdgeConv has several appealing properties: It incorporates local neighborhood information; it can be stacked applied to learn global shape properties; and in multi-layer systems affinity in feature space captures semantic characteristics over potentially long distances in the original embedding. We show the performance of our model on standard benchmarks, including ModelNet40, ShapeNetPart, and S3DIS.

AUTORES: Daniel J Klionsky1745,1749*, Kotb Abdelmohsen840, Akihisa Abe1237, Md Joynal Abedin1762, Hagai Abeliovich425,
\nAbraham Acevedo Arozena789, Hiroaki Adachi1800, Christopher M Adams1669, Peter D Adams57, Khosrow Adeli1981,
\nPeter J Adhihetty1625, Sharon G Adler700, Galila Agam67, Rajesh Agarwal1587, Manish K Aghi1537, Maria Agnello1826,
\nPatrizia Agostinis664, Patricia V Aguilar1960, Julio Aguirre-Ghiso784,786, Edoardo M Airoldi89,422, Slimane Ait-Si-Ali1376,
\nTakahiko Akematsu2010, Emmanuel T Akporiaye1097, Mohamed Al-Rubeai1394, Guillermo M Albaiceta1294,
\nChris Albanese363, Diego Albani561, Matthew L Albert517, Jesus Aldudo128, Hana Alg€ul1164, Mehrdad Alirezaei1198,
\nIraide Alloza642,888, Alexandru Almasan206, Maylin Almonte-Beceril524, Emad S Alnemri1212, Covadonga Alonso544,
\nNihal Altan-Bonnet848, Dario C Altieri1205, Silvia Alvarez1497, Lydia Alvarez-Erviti1395, Sandro Alves107,
\nGiuseppina Amadoro860, Atsuo Amano930, Consuelo Amantini1554, Santiago Ambrosio1458, Ivano Amelio756,
\nAmal O Amer918, Mohamed Amessou2089, Angelika Amon726, Zhenyi An1538, Frank A Anania291, Stig U Andersen6,
\nUsha P Andley2079, Catherine K Andreadi1690, Nathalie Andrieu-Abadie502, Alberto Anel2027, David K Ann58,
\nShailendra Anoopkumar-Dukie388, Manuela Antonioli832,858, Hiroshi Aoki1791, Nadezda Apostolova2007,
\nSaveria Aquila1500, Katia Aquilano1876, Koichi Araki292, Eli Arama2098, Agustin Aranda456, Jun Araya591,
\nAlexandre Arcaro1472, Esperanza Arias26, Hirokazu Arimoto1225, Aileen R Ariosa1749, Jane L Armstrong1930,
\nThierry Arnould1773, Ivica Arsov2120, Katsuhiko Asanuma675, Valerie Askanas1924, Eric Asselin1867, Ryuichiro Atarashi794,
\nSally S Atherton369, Julie D Atkin713, Laura D Attardi1131, Patrick Auberger1787, Georg Auburger379, Laure Aurelian1727,
\nRiccardo Autelli1992, Laura Avagliano1029,1755, Maria Laura Avantaggiati364, Limor Avrahami1166, Suresh Awale1986,
\nNeelam Azad404, Tiziana Bachetti568, Jonathan M Backer28, Dong-Hun Bae1933, Jae-sung Bae677, Ok-Nam Bae409,
\nSoo Han Bae2117, Eric H Baehrecke1729, Seung-Hoon Baek17, Stephen Baghdiguian1368,
\nAgnieszka Bagniewska-Zadworna2, Hua Bai90, Jie Bai667, Xue-Yuan Bai1133, Yannick Bailly884,
\nKithiganahalli Narayanaswamy Balaji473, Walter Balduini2002, Andrea Ballabio316, Rena Balzan1711, Rajkumar Banerjee239,
\nG abor B anhegyi1052, Haijun Bao2109, Benoit Barbeau1363, Maria D Barrachina2007, Esther Barreiro467, Bonnie Bartel997,
\nAlberto Bartolom e222, Diane C Bassham550, Maria Teresa Bassi1046, Robert C Bast Jr1273, Alakananda Basu1798,
\nMaria Teresa Batista1578, Henri Batoko1336, Maurizio Battino970, Kyle Bauckman2085, Bradley L Baumgarner1909,
\nK Ulrich Bayer1594, Rupert Beale1553, Jean-Fran¸cois Beaulieu1360, George R. Beck Jr48,294, Christoph Becker336,
\nJ David Beckham1595, Pierre-Andr e B edard749, Patrick J Bednarski301, Thomas J Begley1135, Christian Behl1419,
\nChristian Behrends757, Georg MN Behrens406, Kevin E Behrns1627, Eloy Bejarano26, Amine Belaid490,
\nFrancesca Belleudi1041, Giovanni B enard497, Guy Berchem706, Daniele Bergamaschi983, Matteo Bergami1401,
\nBen Berkhout1441, Laura Berliocchi714, Am elie Bernard1749, Monique Bernard1354, Francesca Bernassola1880,
\nAnne Bertolotti791, Amanda S Bess272, S ebastien Besteiro1351, Saverio Bettuzzi1828, Savita Bhalla913,
\nShalmoli Bhattacharyya973, Sujit K Bhutia838, Caroline Biagosch1159, Michele Wolfe Bianchi520,1378,1381,
\nMartine Biard-Piechaczyk210, Viktor Billes298, Claudia Bincoletto1314, Baris Bingol350, Sara W Bird1128, Marc Bitoun1112,
\nIvana Bjedov1258, Craig Blackstone843, Lionel Blanc1183, Guillermo A Blanco1496, Heidi Kiil Blomhoff1812,
\nEmilio Boada-Romero1297, Stefan B€ockler1464, Marianne Boes1423, Kathleen Boesze-Battaglia1835, Lawrence H Boise286,287,
\nAlessandra Bolino2063, Andrea Boman693, Paolo Bonaldo1823, Matteo Bordi897, J€urgen Bosch608, Luis M Botana1308,
\nJoelle Botti1375, German Bou1405, Marina Bouch e1038, Marion Bouchecareilh1331, Marie-Jos ee Boucher1901,
\nMichael E Boulton481, Sebastien G Bouret1926, Patricia Boya133, Micha€el Boyer-Guittaut1345, Peter V Bozhkov1141,
\nNathan Brady374, Vania MM Braga469, Claudio Brancolini1997, Gerhard H Braus353, Jos e M Bravo-San Pedro299,393,508,1374,
\nLisa A Brennan322, Emery H Bresnick2022, Patrick Brest490, Dave Bridges1939, Marie-Agn es Bringer124, Marisa Brini1822,
\nGlauber C Brito1311, Bertha Brodin631, Paul S Brookes1872, Eric J Brown352, Karen Brown1690, Hal E Broxmeyer480,
\nAlain Bruhat486,1339, Patricia Chakur Brum1893, John H Brumell446, Nicola Brunetti-Pierri315,1171,
\nRobert J Bryson-Richardson781, Shilpa Buch1777, Alastair M Buchan1819, Hikmet Budak1022, Dmitry V Bulavin118,505,1789,
\nScott J Bultman1792, Geert Bultynck665, Vladimir Bumbasirevic1470, Yan Burelle1356, Robert E Burke216,217,
\nMargit Burmeister1750, Peter B€utikofer1473, Laura Caberlotto1987, Ken Cadwell896, Monika Cahova112, Dongsheng Cai24,
\nJingjing Cai2099, Qian Cai1018, Sara Calatayud2007, Nadine Camougrand1343, Michelangelo Campanella1700,
\nGrant R Campbell1525, Matthew Campbell1249, Silvia Campello556,1876, Robin Candau1769, Isabella Caniggia1983,
\nLavinia Cantoni560, Lizhi Cao116, Allan B Caplan1656, Michele Caraglia1051, Claudio Cardinali1043, Sandra Morais Cardoso1579, Jennifer S Carew208, Laura A Carleton874, Cathleen R Carlin101, Silvia Carloni2002,
\nSven R Carlsson1267, Didac Carmona-Gutierrez1643, Leticia AM Carneiro312, Oliana Carnevali971, Serena Carra1318,
\nAlice Carrier120, Bernadette Carroll900, Caty Casas1324, Josefina Casas1116, Giuliana Cassinelli324, Perrine Castets1462,
\nSusana Castro-Obregon214, Gabriella Cavallini1841, Isabella Ceccherini568, Francesco Cecconi253,555,1884,
\nArthur I Cederbaum459, Valent ın Ce~na199,1281, Simone Cenci1323,2064, Claudia Cerella444, Davide Cervia1996,
\nSilvia Cetrullo1478, Hassan Chaachouay2028, Han-Jung Chae187, Andrei S Chagin634, Chee-Yin Chai626,628,
\nGopal Chakrabarti1502, Georgios Chamilos1601, Edmond YW Chan1142, Matthew TV Chan181, Dhyan Chandra1003,
\nPallavi Chandra548, Chih-Peng Chang818, Raymond Chuen-Chung Chang1653, Ta Yuan Chang345, John C Chatham1434,
\nSaurabh Chatterjee1910, Santosh Chauhan527, Yongsheng Che62, Michael E Cheetham1263, Rajkumar Cheluvappa1783,
\nChun-Jung Chen1153, Gang Chen598,1676, Guang-Chao Chen9, Guoqiang Chen1078, Hongzhuan Chen1077, Jeff W Chen1514,
\nJian-Kang Chen370,371, Min Chen249, Mingzhou Chen2104, Peiwen Chen1823, Qi Chen1674, Quan Chen172,
\nShang-Der Chen138, Si Chen325, Steve S-L Chen10, Wei Chen2125, Wei-Jung Chen829, Wen Qiang Chen979, Wenli Chen1113,
\nXiangmei Chen1133, Yau-Hung Chen1157, Ye-Guang Chen1250, Yin Chen1447, Yingyu Chen953,955, Yongshun Chen2135,
\nYu-Jen Chen712, Yue-Qin Chen1145, Yujie Chen1208, Zhen Chen339, Zhong Chen2123, Alan Cheng1702,
\nChristopher HK Cheng184, Hua Cheng1728, Heesun Cheong814, Sara Cherry1836, Jason Chesney1703,
\nChun Hei Antonio Cheung817, Eric Chevet1359, Hsiang Cheng Chi140, Sung-Gil Chi656, Fulvio Chiacchiera308,
\nHui-Ling Chiang958, Roberto Chiarelli1826, Mario Chiariello235,567,577, Marcello Chieppa835, Lih-Shen Chin290,
\nMario Chiong1285, Gigi NC Chiu878, Dong-Hyung Cho676, Ssang-Goo Cho650, William C Cho982, Yong-Yeon Cho105,
\nYoung-Seok Cho1064, Augustine MK Choi2095, Eui-Ju Choi656, Eun-Kyoung Choi387,400,685, Jayoung Choi1563,
\nMary E Choi2093, Seung-Il Choi2116, Tsui-Fen Chou412, Salem Chouaib395, Divaker Choubey1574, Vinay Choubey1936,
\nKuan-Chih Chow822, Kamal Chowdhury730, Charleen T Chu1856, Tsung-Hsien Chuang827, Taehoon Chun657,
\nHyewon Chung652, Taijoon Chung978, Yuen-Li Chung1194, Yong-Joon Chwae18, Valentina Cianfanelli254,
\nRoberto Ciarcia1775, Iwona A Ciechomska886, Maria Rosa Ciriolo1876, Mara Cirone1042, Sofie Claerhout1694,
\nMichael J Clague1698, Joan Cl aria1457, Peter GH Clarke1687, Robert Clarke361, Emilio Clementi1045,1398, C edric Cleyrat1781,
\nMiriam Cnop1366, Eliana M Coccia574, Tiziana Cocco1459, Patrice Codogno1375, J€orn Coers271, Ezra EW Cohen1533,
\nDavid Colecchia235,567,577, Luisa Coletto25, N uria S Coll123, Emma Colucci-Guyon516, Sergio Comincini1829,
\nMaria Condello578, Katherine L Cook2073, Graham H Coombs1929, Cynthia D Cooper2076, J Mark Cooper1395,
\nIsabelle Coppens601, Maria Tiziana Corasaniti1387, Marco Corazzari485,1884, Ramon Corbalan1566,
\nElisabeth Corcelle-Termeau251, Mario D Cordero1899, Cristina Corral-Ramos1289, Olga Corti507,1109, Andrea Cossarizza1767,
\nPaola Costelli1993, Safia Costes1518, Susan L Cotman721, Ana Coto-Montes946, Sandra Cottet566,1688, Eduardo Couve1301,
\nLori R Covey1015, L Ashley Cowart762, Jeffery S Cox1536, Fraser P Coxon1427, Carolyn B Coyne1846, Mark S Cragg1919,
\nRolf J Craven1679, Tiziana Crepaldi1995, Jose L Crespo1300, Alfredo Criollo1285, Valeria Crippa558, Maria Teresa Cruz1576,
\nAna Maria Cuervo26, Jose M Cuezva1277, Taixing Cui1907, Pedro R Cutillas987, Mark J Czaja27, Maria F Czyzyk-Krzeska1572,
\nRuben K Dagda2068, Uta Dahmen1404, Chunsun Dai800, Wenjie Dai1187, Yun Dai2059, Kevin N Dalby1940,
\nLuisa Dalla Valle1822, Guillaume Dalmasso1340, Marcello D’Amelio557, Markus Damme188, Arlette Darfeuille-Michaud1340,
\nCatherine Dargemont950, Victor M Darley-Usmar1433, Srinivasan Dasarathy205, Biplab Dasgupta202, Srikanta Dash1254,
\nCrispin R Dass242, Hazel Marie Davey8, Lester M Davids1560, David D avila227, Roger J Davis1731, Ted M Dawson604,
\nValina L Dawson606, Paula Daza1898, Jackie de Belleroche470, Paul de Figueiredo1180,1182,
\nRegina Celia Bressan Queiroz de Figueiredo135, Jos e de la Fuente1023, Luisa De Martino1775,
\nAntonella De Matteis1171, Guido RY De Meyer1443, Angelo De Milito631, Mauro De Santi2002,

Geometric deep learning is an umbrella term for emerging techniques attempting to generalize (structured) deep neural models to non-Euclidean domains, such as graphs and manifolds. The purpose of this article is to overview different examples of geometric deep-learning problems and present available solutions, key difficulties, applications, and future research directions in this nascent field.

autophagic responses. Here, we critically discuss current methods of assessing autophagy and the information they can, or cannot, provide. Our ultimate goal is to encourage intellectual and technical innovation in the field.

Link prediction for knowledge graphs is the task of predicting missing relationships between entities. Previous work on link prediction has focused on shallow, fast models which can scale to large knowledge graphs. However, these models learn less expressive features than deep, multi-layer models — which potentially limits performance. In this work we introduce ConvE, a multi-layer convolutional network model for link prediction, and report state-of-the-art results for several established datasets. We also show that the model is highly parameter efficient, yielding the same performance as DistMult and R-GCN with 8x and 17x fewer parameters. Analysis of our model suggests that it is particularly effective at modelling nodes with high indegree — which are common in highly-connected, complex knowledge graphs such as Freebase and YAGO3. In addition, it has been noted that the WN18 and FB15k datasets suffer from test set leakage, due to inverse relations from the training set being present in the test set — however, the extent of this issue has so far not been quantified. We find this problem to be severe: a simple rule-based model can achieve state-of-the-art results on both WN18 and FB15k. To ensure that models are evaluated on datasets where simply exploiting inverse relations cannot yield competitive results, we investigate and validate several commonly used datasets — deriving robust variants where necessary. We then perform experiments on these robust datasets for our own and several previously proposed models, and find that ConvE achieves state-of-the-art Mean Reciprocal Rank across all datasets.

Based on literature from the domains of organization science, marketing, accounting, and management information systems, this review article examines the theoretical basis of the information overload discourse and presents an overview of the main definitions, situations, causes, effects, and countermeasures. It analyzes the contributions from the last 30 years to consolidate the existing research in a conceptual framework and to identify future research directions.

Deep learning has achieved a remarkable performance breakthrough in several fields, most notably in speech recognition, natural language processing, and computer vision. In particular, convolutional neural network (CNN) architectures currently produce state-of-the-art performance on a variety of image analysis tasks such as object detection and recognition. Most of deep learning research has so far focused on dealing with 1D, 2D, or 3D Euclidean-structured data such as acoustic signals, images, or videos. Recently, there has been an increasing interest in geometric deep learning, attempting to generalize deep learning methods to non-Euclidean structured data such as graphs and manifolds, with a variety of applications from the domains of network analysis, computational social science, or computer graphics. In this paper, we propose a unified framework allowing to generalize CNN architectures to non-Euclidean domains (graphs and manifolds) and learn local, stationary, and compositional task-specific features. We show that various non-Euclidean CNN methods previously proposed in the literature can be considered as particular instances of our framework. We test the proposed method on standard tasks from the realms of image-, graph-and 3D shape analysis and show that it consistently outperforms previous approaches.

Neutralizing antibodies elicited by prior infection or vaccination are likely to be key for future protection of individuals and populations against SARS-CoV-2. Moreover, passively administered antibodies are among the most promising therapeutic and prophylactic anti-SARS-CoV-2 agents. However, the degree to which SARS-CoV-2 will adapt to evade neutralizing antibodies is unclear. Using a recombinant chimeric VSV/SARS-CoV-2 reporter virus, we show that functional SARS-CoV-2 S protein variants with mutations in the receptor-binding domain (RBD) and N-terminal domain that confer resistance to monoclonal antibodies or convalescent plasma can be readily selected. Notably, SARS-CoV-2 S variants that resist commonly elicited neutralizing antibodies are now present at low frequencies in circulating SARS-CoV-2 populations. Finally, the emergence of antibody-resistant SARS-CoV-2 variants that might limit the therapeutic usefulness of monoclonal antibodies can be mitigated by the use of antibody combinations that target distinct neutralizing epitopes.

Since the publication of the Revised European-American Classification of Lymphoid Neoplasms in 1994, subsequent updates of the classification of lymphoid neoplasms have been generated through iterative international efforts to achieve broad consensus among hematopathologists, geneticists, molecular scientists, and clinicians. Significant progress has recently been made in the characterization of malignancies of the immune system, with many new insights provided by genomic studies. They have led to this proposal. We have followed the same process that was successfully used for the third and fourth editions of the World Health Organization Classification of Hematologic Neoplasms. The definition, recommended studies, and criteria for the diagnosis of many entities have been extensively refined. Some categories considered provisional have now been upgraded to definite entities. Terminology for some diseases has been revised to adapt nomenclature to the current knowledge of their biology, but these modifications have been restricted to well-justified situations. Major findings from recent genomic studies have impacted the conceptual framework and diagnostic criteria for many disease entities. These changes will have an impact on optimal clinical management. The conclusions of this work are summarized in this report as the proposed International Consensus Classification of mature lymphoid, histiocytic, and dendritic cell tumors.

Cellular senescence is a permanent state of cell cycle arrest that occurs in proliferating cells subjected to different stresses. Senescence is, therefore, a cellular defense mechanism that prevents the cells to acquire an unnecessary damage. The senescent state is accompanied by a failure to re-enter the cell cycle in response to mitogenic stimuli, an enhanced secretory phenotype and resistance to cell death. Senescence takes place in several tissues during different physiological and pathological processes such as tissue remodeling, injury, cancer, and aging. Although senescence is one of the causative processes of aging and it is responsible of aging-related disorders, senescent cells can also play a positive role. In embryogenesis and tissue remodeling, senescent cells are required for the proper development of the embryo and tissue repair. In cancer, senescence works as a potent barrier to prevent tumorigenesis. Therefore, the identification and characterization of key features of senescence, the induction of senescence in cancer cells, or the elimination of senescent cells by pharmacological interventions in aging tissues is gaining consideration in several fields of research. Here, we describe the known key features of senescence, the cell-autonomous, and noncell-autonomous regulators of senescence, and we attempt to discuss the functional role of this fundamental process in different contexts in light of the development of novel therapeutic targets.

Good old online backpropagation for plain multilayer perceptrons yields a very low 0.35% error rate on the MNIST handwritten digits benchmark. All we need to achieve this best result so far are many hidden layers, many neurons per layer, numerous deformed training images to avoid overfitting, and graphics cards to greatly speed up learning.

BACKGROUND: The aging of the population is an inexorable change that challenges governments and societies in every developed country. Based on clinical and empirical data, social isolation is found to be prevalent among elderly people, and it has negative consequences on the elderly's psychological and physical health. Targeting social isolation has become a focus area for policy and practice. Evidence indicates that contemporary information and communication technologies (ICT) have the potential to prevent or reduce the social isolation of elderly people via various mechanisms. OBJECTIVE: This systematic review explored the effects of ICT interventions on reducing social isolation of the elderly. METHODS: Relevant electronic databases (PsycINFO, PubMed, MEDLINE, EBSCO, SSCI, Communication Studies: a SAGE Full-Text Collection, Communication & Mass Media Complete, Association for Computing Machinery (ACM) Digital Library, and IEEE Xplore) were systematically searched using a unified strategy to identify quantitative and qualitative studies on the effectiveness of ICT-mediated social isolation interventions for elderly people published in English between 2002 and 2015. Narrative synthesis was performed to interpret the results of the identified studies, and their quality was also appraised. RESULTS: Twenty-five publications were included in the review. Four of them were evaluated as rigorous research. Most studies measured the effectiveness of ICT by measuring specific dimensions rather than social isolation in general. ICT use was consistently found to affect social support, social connectedness, and social isolation in general positively. The results for loneliness were inconclusive. Even though most were positive, some studies found a nonsignificant or negative impact. More importantly, the positive effect of ICT use on social connectedness and social support seemed to be short-term and did not last for more than six months after the intervention. The results for self-esteem and control over one's life were consistent but generally nonsignificant. ICT was found to alleviate the elderly's social isolation through four mechanisms: connecting to the outside world, gaining social support, engaging in activities of interests, and boosting self-confidence. CONCLUSIONS: More well-designed studies that contain a minimum risk of research bias are needed to draw conclusions on the effectiveness of ICT interventions for elderly people in reducing their perceived social isolation as a multidimensional concept. The results of this review suggest that ICT could be an effective tool to tackle social isolation among the elderly. However, it is not suitable for every senior alike. Future research should identify who among elderly people can most benefit from ICT use in reducing social isolation. Research on other types of ICT (eg, mobile phone-based instant messaging apps) should be conducted to promote understanding and practice of ICT-based social-isolation interventions for elderly people.

Recent technology trends in the Web Services (WS) domain indicate that a solution eliminating the presumed complexity of the WS-* standards may be in sight: advocates of REpresentational State Transfer (REST) have come to believe that their ideas explaining why the World Wide Web works are just as applicable to solve enterprise application integration problems and to simplify the plumbing required to build service-oriented architectures. In this paper we objectify the WS-* vs. REST debate by giving a quantitative technical comparison based on architectural principles and decisions. We show that the two approaches differ in the number of architectural decisions that must be made and in the number of available alternatives. This discrepancy between freedom-from-choice and freedom-of-choice explains the complexity difference perceived. However, we also show that there are significant differences in the consequences of certain decisions in terms of resulting development and maintenance costs. Our comparison helps technical decision makers to assess the two integration styles and technologies more objectively and select the one that best fits their needs: REST is well suited for basic, ad hoc integration scenarios, WS-* is more flexible and addresses advanced quality of service requirements commonly occurring in enterprise computing.

The computer vision and pattern recognition communities have recently witnessed a surge of feature-based methods in object recognition and image retrieval applications. These methods allow representing images as collections of “visual words” and treat them using text search approaches following the “bag of features” paradigm. In this article, we explore analogous approaches in the 3D world applied to the problem of nonrigid shape retrieval in large databases. Using multiscale diffusion heat kernels as “geometric words,” we construct compact and informative shape descriptors by means of the “bag of features” approach. We also show that considering pairs of “geometric words” (“geometric expressions”) allows creating spatially sensitive bags of features with better discriminative power. Finally, adopting metric learning approaches, we show that shapes can be efficiently represented as binary codes. Our approach achieves state-of-the-art results on the SHREC 2010 large-scale shape retrieval benchmark.

Considerable research effort has been made worldwide to decipher the immune response triggered upon severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) infections, identify the drivers of severe and fatal COVID-19, and understand what leads to the prolongation of symptoms after disease resolution. We review the results of almost 2 years of COVID-19 immunology research and discuss definitive findings and remaining questions regarding our understanding of COVID-19 pathophysiology. We discuss emerging understanding of differences in immune responses seen in those with and without Long Covid syndrome, also known as post-acute sequelae of SARS-CoV-2. We hope that the knowledge gained from this COVID-19 research will be applied in studies of inflammatory processes involved in critical and chronic illnesses, which remain a major unmet need.

Zika virus (ZIKV), a mosquito-borne flavivirus with homology to Dengue virus (DENV), has become a public health emergency. By characterizing memory lymphocytes from ZIKV-infected patients, we dissected ZIKV-specific and DENV-cross-reactive immune responses. Antibodies to nonstructural protein 1 (NS1) were largely ZIKV-specific and were used to develop a serological diagnostic tool. In contrast, antibodies against E protein domain I/II (EDI/II) were cross-reactive and, although poorly neutralizing, potently enhanced ZIKV and DENV infection in vitro and lethally enhanced DENV disease in mice. Memory T cells against NS1 or E proteins were poorly cross-reactive, even in donors preexposed to DENV. The most potent neutralizing antibodies were ZIKV-specific and targeted EDIII or quaternary epitopes on infectious virus. An EDIII-specific antibody protected mice from lethal ZIKV infection, illustrating the potential for antibody-based therapy.

The simple, but general formal theory of fun and intrinsic motivation and creativity (1990-2010) is based on the concept of maximizing intrinsic reward for the active creation or discovery of novel, surprising patterns allowing for improved prediction or data compression. It generalizes the traditional field of active learning, and is related to old, but less formal ideas in aesthetics theory and developmental psychology. It has been argued that the theory explains many essential aspects of intelligence including autonomous development, science, art, music, and humor. This overview first describes theoretically optimal (but not necessarily practical) ways of implementing the basic computational principles on exploratory, intrinsically motivated agents or robots, encouraging them to provoke event sequences exhibiting previously unknown, but learnable algorithmic regularities. Emphasis is put on the importance of limited computational resources for online prediction and compression. Discrete and continuous time formulations are given. Previous practical, but nonoptimal implementations (1991, 1995, and 1997-2002) are reviewed, as well as several recent variants by others (2005-2010). A simplified typology addresses current confusion concerning the precise nature of intrinsic motivation.

Blockchain is an emerging technology for decentralised and transactional data sharing across a large network of untrusted participants. It enables new forms of distributed software architectures, where agreement on shared states can be established without trusting a central integration point. A major difficulty for architects designing applications based on blockchain is that the technology has many configurations and variants. Since blockchains are at an early stage, there is little product data or reliable technology evaluation available to compare different blockchains. In this paper, we propose how to classify and compare blockchains and blockchain-based systems to assist with the design and assessment of their impact on software architectures. Our taxonomy captures major architectural characteristics of blockchains and the impact of their principal design decisions. This taxonomy is intended to help with important architectural considerations about the performance and quality attributes of blockchain-based systems.