检索结果-内蒙古大学图书馆

DTI changes of thalamic subregions in genetic frontotemporal dementia: findings from the GENFI cohort

学校读者我要写书评

暂无评论

Alzheimer's & Dementia 2023年第S24期19卷

作者： Sonja Soskic Henry F. J. Tregidgo Emily G. Todd Arabella Bouzigues David M Cash Lucy L. Russell David L Thomas Ian B Malone John C. van Swieten Lize C. Jiskoot Harro Seelaar Barbara Borroni Daniela Galimberti Raquel Sanchez-Valle Robert Laforce Jr. Fermin Moreno Matthis Synofzik Caroline Graff Mario Masellis Carmela Tartaglia James B. Rowe Rik Vandenberghe Elizabeth Finger Fabrizio Tagliavini Alexandre Mendonca Isabel Santana Christopher R. Butler Simon Ducharme Alexander Gerhard Johannes Levin Markus Otto Sandro Sorbi Isabelle Le Ber Florence Pasquier Daniel C Alexander Juan Eugenio Iglesias Jonathan D. Rohrer Martina Bocchetta the GENetic Frontotemporal dementia Initiative (GENFI) Centre for Medical Image Computing University College London London United Kingdom SonjaSoskic Centre for Medical Image Computing University College London London United Kingdom. Dementia Research Centre Department of Neurodegenerative Disease UCL Queen Square Institute of Neurology University College London London United Kingdom UCL Centre for Medical Image Computing London United Kingdom Neuroradiological Academic Unit Department of Brain Repair and Rehabilitation UCL Queen Square Institute of Neurology University College London London United Kingdom Department of Neurology and Alzheimer Center Erasmus Medical Center Rotterdam Netherlands Centre for Neurodegenerative Disorders Neurology Unit Department of Clinical and Experimental Sciences University of Brescia Brescia Italy Department of Biomedical Surgical and Dental Sciences University of Milan Milan Italy Fondazione IRCCS Ca’ Granda Ospedale Maggiore Policlinico Milan Italy Neurology Department Hospital Clinic Institut d'Investigacions Biomediques Barcelona Spain Clinique Interdisciplinaire de Mémoire Département des Sciences Neurologiques CHU de Québec and Faculté de Médecine Université Laval Quebec City QC Canada Hospital Universitario Donostia San Sebastian Spain Division Translational Genomics of Neurodegenerative Diseases Hertie Institute for Clinical Brain Research (HIH) University of Tübingen Tübingen Germany German Center for Neurodegenerative Diseases (DZNE) Tübingen Germany Karolinska Institutet Department NVS Division of Neurogeriatrics Stockholm Sweden Unit for Hereditary Dementia Theme Inflammation and Aging Karolinska University Hospital-Solna Stockholm Sweden Campbell Cognitive Neurology Research Unit Sunnybrook Research Institute Toronto ON Canada Toronto Western Hospital Tanz Centre for Research in Neurodegenerative Disease Toronto ON Canada Department of Clinical Neurosciences and Cambridge University Hospitals NHS Trust and Medical Research Council Cognition and Brain Sci

Background Atrophy of thalamic subregions has been observed across the spectrum of frontotemporal dementia (FTD). To gain better insight into underlying tissue changes, we investigated how thalamic subregional fractional anisotropy (FA) and mean diffusivity (MD) derived from diffusion tensor imaging (DTI) are altered in genetic FTD. Method We used our newly developed thalamus segmentation tool, which jointly combines structural and diffusion input MRI data, to segment thalami and extract thalamic subregional FA and MD values for 163 genetic mutation carriers and 126 non-carriers with suitable 3T MRI data from the GENetic FTD Initiative (GENFI). Mutation carriers were divided according to their genetic diagnosis and CDR®+NACC FTLD global scores into presymptomatic/prodromal (≤0.5: 41 C9orf72 , 59 GRN , 34 MAPT ) and symptomatic (≥1: 8 C9orf72 , 11 GRN , 10 MAPT ) groups. Mean FA and MD values for thalamic subregions were obtained using diffusion tensors interpolated in the log domain and weighted by segmentation posterior probabilities. Thalamic subregional FA and MD values for presymptomatic and symptomatic mutation carriers within each genetic group were compared with non-carriers using analysis of covariance with bootstrapping, where age, scanner type, and sex were covariates. We corrected for multiple comparisons and calculated percentage changes in adjusted FA and MD mean values for mutation carriers relative to non-carriers. Result The only significant change at the presymptomatic stage was found for C9orf72 expansion carriers, who showed FA reduction in the intralaminar subregion (5%) (Figure 1, Table 1). In symptomatic C9orf72 expansion carriers, FA was reduced in the laterodorsal (21%), lateral posterior (13%), anteroventral (13%) and intralaminar (11%) subregions. Symptomatic MAPT mutation carriers also showed FA reduction in the laterodorsal (15%) and anteroventral (11%) subregions. No significant FA reductions were found for GRN mutation carriers and no s

关键词：

Random asynchronous iterations in distributed coordination algorithms

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Chen, Yao Xia, Weiguo Cao, Ming Lü, Jinhu Department of Computer Science Southwestern University of Finance and Economics Chengdu611130 China School of Control Science and Engineering Dalian University of Technology Dalian116024 China Faculty of Science and Engineering ENTEG University of Groningen Groningen9747 AG Netherlands School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

Distributed coordination algorithms (DCA) carry out information processing processes among a group of networked agents without centralized information fusion. Though it is well known that DCA characterized by an SIA (stochastic, indecomposable, aperiodic) matrix generate consensus asymptotically via synchronous iterations, the dynamics of DCA with asynchronous iterations have not been studied extensively, especially when viewed as stochastic processes. This paper aims to show that for any given irreducible stochastic matrix, even non-SIA, the corresponding DCA lead to consensus successfully via random asynchronous iterations under a wide range of conditions on the transition probability. Particularly, the transition probability is neither required to be independent and identically distributed, nor characterized by a Markov chain. Copyright © 2018, The Authors. All rights reserved.

关键词： Stochastic systems

Crowdsourcing with tullock contests: A new perspective

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Luo, Tie Kanhere, Salil S. Tan, Hwee-Pink Wu, Fan Wu, Hongyi Institute for Infocomm Research A*STAR Singapore School of Computer Science and Engineering University of New South Wales Australia Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China Center for Advanced Computer Studies University of Louisiana Lafayette United States

Incentive mechanisms for crowdsourcing have been extensively studied under the framework of all-pay auctions. Along a distinct line, this paper proposes to use Tullock contests as an alternative tool to design incentive mechanisms for crowdsourcing. We are inspired by the conduciveness of Tullock contests to attracting user entry (yet not necessarily a higher revenue) in other domains. In this paper, we explore a new dimension in optimal Tullock contest design, by superseding the contest prize-which is fixed in conventional Tullock contests-with a prize function that is dependent on the (unknown) winner's contribution, in order to maximize the crowdsourcer's utility. We show that this approach leads to attractive practical advantages: (a) it is well-suited for rapid prototyping in fully distributed web agents and smartphone apps;(b) it overcomes the disincentive to participate caused by players' antagonism to an increasing number of rivals. Furthermore, we optimize conventional, fixed-prize Tullock contests to construct the most superior benchmark to compare against our mechanism. Through extensive evaluations, we show that our mechanism significantly outperforms the optimal benchmark, by over three folds on the crowdsourcer's utility cum profit and up to nine folds on the players' social welfare. Copyright © 2017, The Authors. All rights reserved.

关键词： Crowdsourcing

Joint product numerical range and geometry of reduced density matrices

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 9-17页

作者： Jianxin Chen Cheng Guo Zhengfeng Ji Yiu-Tung Poon Nengkun YU Bei Zeng Jie Zhou Joint Center for Quantum Information and Computer Science University of Maryland College Park 20740 USA Institute for Advanced Study Tsinghua University Beijing 100084 China Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science.Institute of Software Chinese Academy of Sciences Beijing 100084 China Department of Mathematics Iowa State University Ames 50011-2140 USA Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2 W1 Canada Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada

The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection is convex in R3. The boundary of may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces： symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti＇s theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range II of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that a ruled surface emerges naturally when taking a convex hull of ∏. We show that, a ruled surface on sitting in ∏ has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of , with two boundary pieces of symmetry breaking origin separated by two gapless lines.

关键词： reduced density matrices quantum tomography numerical range quantum information oloid ruled surface

Fake news propagate differently from real news even at early stages of spreading

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Zhao, Zilong Zhao, Jichang Sano, Yukie Levy, Orr Takayasu, Hideki Takayasu, Misako Li, Daqing Wu, Junjie Havlin, Shlomo School of Reliability and Systems Engineering Beihang University Beijing100191 China Science and Technology on Reliability and Environmental Engineering Laboratory Beijing100191 China School of Economics and Management Beihang University Beijing100191 China Faculty of Engineering Information and Systems University of Tsukuba Tennodai Tsukuba Ibaraki305-8573 Japan Department of Physics Bar-Ilan University Ramat Gan5290002 Israel Sony Computer Science Laboratories 3-14-13 Higashi-Gotanda Tokyo141-0022 Japan Institute of Innovative Research Tokyo Institute of Technology Yokohama226-8502 Japan Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China

Social media can be a double-edged sword for society, either as a convenient channel exchanging ideas or as an unexpected conduit circulating fake news through a large population. While existing studies of fake news focus on theoretical modeling of propagation or identification methods based on machine learning, it is important to understand the realistic mechanisms between theoretical models and black-box methods. Here we track large databases of fake news and real news in both, Weibo in China and Twitter in Japan from different culture, which include their complete traces of re-postings. We find in both online social networks that fake news spreads distinctively from real news even at early stages of propagation, e.g. five hours after the first re-postings. Our finding demonstrates collective structural signals that help to understand the different propagation evolution of fake news and real news. Different from earlier studies, identifying the topological properties of the information propagation at early stages may offer novel features for early detection of fake news in social media. Copyright © 2018, The Authors. All rights reserved.

关键词： Social networking (online)

Deep learning for multi-messenger astrophysics a gateway for discovery in the big data era

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Allen, Gabrielle Andreoni, Igor Bachelet, Etienne Bruce Berriman, G. Bianco, Federica B. Biswas, Rahul Kind, Matias Carrasco Chard, Kyle Cho, Minsik Cowperthwaite, Philip S. Etienne, Zachariah B. George, Daniel Gibbs, Tom Graham, Matthew Gropp, William Gupta, Anushri Haas, Roland Huerta, E.A. Jennings, Elise Katz, Daniel S. Khan, Asad Kindratenko, Volodymyr Kramer, William T.C. Liu, Xin Mahabal, Ashish McHenry, Kenton Miller, J.M. Neubauer, M.S. Oberlin, Steve Olivas, Alexander R. Rosofsky, Shawn Ruiz, Milton Saxton, Aaron Schutz, Bernard Schwing, Alex Seidel, Ed Shapiro, Stuart L. Shen, Hongyu Shen, Yue Sipocz, Brigitta M. Sun, Lunan Towns, John Tsokaros, Antonios Wei, Wei Wells, Jack Williams, Timothy J. Xiong, Jinjun Zhao, Zhizhen NCSA University of Illinois at Urbana-Champaign UrbanaIL61801 United States Department of Astronomy University of Illinois at Urbana-Champaign UrbanaIL61801 United States California Institute of Technology 1200 E California Blvd PasadenaCA91125 United States Las Cumbres Observatory 6740 Cortona Drive Suite 102 GoletaCA93117 United States Caltech/IPAC-NExScI 1200 E California Blvd PasadenaCA91125 United States Department of Physics and Astronomy University of Delaware NewarkDE19716 United States Joseph R. Biden Jr . School of Public Policy and Administration University of Delaware NewarkDE19716 United States Data Science Institute University of Delaware NewarkDE19716 United States Center for Urban Science and Progress New York University 370 Jay St BrooklynNY11201 United States The Oskar Klein Centre for Cosmoparticle Physics Stockholm University AlbaNova StockholmSE-106 91 Sweden University of Chicago ChicagoIL60605 United States IBM Systems AustinTX78717 United States Observatories of the Carnegie Institution for Science 813 Santa Barbara St. PasadenaCA91101 United States Department of Mathematics West Virginia University MorgantownWV26506 United States Center for Gravitational Waves and Cosmology West Virginia University Chestnut Ridge Research Building MorgantownWV26505 United States NVIDIA 2788 San Tomas Expressway Santa ClaraCA95050 United States Center for Data Driven Discovery Caltech PasadenaCA91125 United States Department of Computer Science University of Illinois at Urbana-Champaign UrbanaIL61801 United States Argonne National Laboratory Leadership Computing Facility LemontIL60439 United States Department of Electrical & Computer Engineering University of Illinois at Urbana-Champaign UrbanaIL61801 United States School of Information Sciences University of Illinois at Urbana-Champaign UrbanaIL61801 United States Department of Physics University of Illinois at Urbana-Champaign UrbanaIL61801 Unit

This report provides an overview of recent work that harnesses the Big Data Revolution and Large Scale computing to address grand computational challenges in Multi-Messenger Astrophysics, with a particular emphasis on real-time discovery campaigns. Acknowledging the transdisciplinary nature of Multi-Messenger Astrophysics, this document has been prepared by members of the physics, astronomy, computer science, data science, software and cyberinfrastructure communities who attended the NSF-, DOE- and NVIDIA-funded "Deep Learning for Multi-Messenger Astrophysics: Real-time Discovery at Scale" workshop, hosted at the National center for Supercomputing Applications, October 17-19, 2018. Highlights of this report include unanimous agreement that it is critical to accelerate the development and deployment of novel, signal-processing algorithms that use the synergy between artificial intelligence (AI) and high performance computing to maximize the potential for scientific discovery with Multi-Messenger Astrophysics. We discuss key aspects to realize this endeavor, namely (i) the design and exploitation of scalable and computationally efficient AI algorithms for Multi-Messenger Astrophysics;(ii) cyberinfrastructure requirements to numerically simulate astrophysical sources, and to process and interpret Multi-Messenger Astrophysics data;(iii) management of gravitational wave detections and triggers to enable electromagnetic and astro-particle follow-ups;(iv) a vision to harness future developments of machine and deep learning and cyberinfrastructure resources to cope with the scale of discovery in the Big Data Era;(v) and the need to build a community that brings domain experts together with data scientists on equal footing to maximize and accelerate discovery in the nascent field of Multi-Messenger Astrophysics. Copyright © 2019, The Authors. All rights reserved.

关键词： Big data

Metacognition for a Common Model of Cognition

学校读者我要写书评

暂无评论

Procedia computer Science 2018年 145卷 730-739页

作者： Jerald D. Kralik Jee Hang Lee Paul S. Rosenbloom Philip C. Jackson Susan L. Epstein Oscar J. Romero Ricardo Sanz Othalia Larue Hedda R. Schmidtke Sang Wan Lee Keith McGreggor Department of Bio and Brain Engineering Korea Advanced Institute of Science and Technology (KAIST) Daejeon 34141 South Korea KI for Health Science and Technology Korea Advanced Institute of Science and Technology (KAIST) Daejeon 34141 South Korea Institute for Creative Technologies & Department of Computer Science University of Southern California Los Angeles CA USA TalaMind LLC PMB #363 55 E. Long Lake Rd. Troy MI USA Department of Computer Science Hunter College and The Graduate Center of the City University of New York New York NY USA Department of Machine Learning Carnegie Mellon University Pittsburgh PA USA Autonomous Systems Laboratory Universidad Politécnica de Madrid Spain Department of Psychology Wright State University Dayton Ohio USA Department of Geography University of Oregon Eugene OR USA College of Computing Georgia Institute of Technology Atlanta Georgia USA

This paper provides a starting point for the development of metacognition in a common model of cognition. It identifies significant theoretical work on metacognition from multiple disciplines that the authors believe worthy of consideration. After first defining cognition and metacognition, we outline three general categories of metacognition, provide an initial list of its main components, consider the more difficult problem of consciousness, and present examples of prominent artificial systems that have implemented metacognitive components. Finally, we identify pressing design issues for the future.

关键词： Metacognition Common model Cognition Cognitive architecture

***: Dissemination platform for deep learning models

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Hosny, Ahmed Schwier, Michael Berger, Christoph Örnek, Evin P. Turan, Mehmet Tran, Phi V. Weninger, Leon Isensee, Fabian Maier-Hein, Klaus H. McKinley, Richard Lu, Michael T. Hoffmann, Udo Menze, Bjoern Bakas, Spyridon Fedorov, Andriy Aerts, Hugo J.W.L. Program Brigham and Women's Hospital Harvard Medical School BostonMA United States Department of Radiation Oncology Dana-Farber Cancer Institute Harvard Medical School BostonMA United States Department of Radiology Brigham and Women's Hospital Dana-Farber Cancer Institute Harvard Medical School BostonMA United States Harvard Medical School BostonMA United States Institute for Advanced Study Department of Informatics Technical University of Munich Munich Germany Max Planck Institute for Intelligent Systems Stuttgart Germany Booz Allen Hamilton McLeanVA United States Institute of Imaging & Computer Vision RWTH Aachen University Aachen Germany Heidelberg Germany Support Centre for Advanced Neuroimaging University Institute of Diagnostic Interventional Neuroradiology Inselspital Bern University Hospital Bern Switzerland Cardiovascular Imaging Research Center Massachusetts General Hospital Harvard Medical School Boston United States Cardiac MR PET CT Program Department of Radiology Massachusetts General Hospital BostonMA United States Center for Biomedical Image Computing and Analytics University of Pennsylvania PhiladelphiaPA United States Radiology & Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Radiology and Nuclear Medicine GROW CARIM Maastricht University Maastricht Netherlands

Recent advances in artificial intelligence research have led to a profusion of studies that apply deep learning to problems in image analysis and natural language processing among others. Additionally, the availability of open-source computational frameworks has lowered the barriers to implementing state-of-the-art methods across multiple domains. Albeit leading to major performance breakthroughs in some tasks, effective dissemination of deep learning algorithms remains challenging, inhibiting reproducibility and benchmarking studies, impeding further validation, and ultimately hindering their effectiveness in the cumulative scientific progress. In developing a platform for sharing research outputs, we present *** (***), a community-driven container-based software engine and platform for the structured dissemination of deep learning models. For contributors, the engine controls data flow throughout the inference cycle, while the contributor-facing standard template exposes model-specific functions including inference, as well as pre- and post-processing. Python and RESTful Application programming interfaces (APIs) enable users to interact with models hosted on *** and allows both researchers and developers to utilize models out-of-the-box. *** is domain-, data-, and framework-agnostic, catering to different workflows and contributors' preferences. Copyright © 2019, The Authors. All rights reserved.

关键词： Containers

Union of Intersections (UoI) for interpretable data driven discovery and prediction

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Bouchard, Kristofer E. Bujan, Alejandro F. Roosta-Khorasani, Farbod Ubaru, Shashanka Prabhat Snijders, Antoine M. Mao, Jian-Hua Chang, Edward F. Mahoney, Michael W. Bhattacharyya, Sharmodeep Biological Systems and Engineering Division Lawrence Berkeley National Laboratory Computational Research Division Lawrence Berkeley National Laboratory Redwood Center for Theoretical Neuroscience University of California at Berkeley Kavli Institute for Fundamental Neuroscience University of California at San Francisco Redwood Center for Theoretical Neuroscience University of California at Berkeley International Computer Science Institute Department of Statistics University of California at Berkeley Department of Computer Science and Engineering University of Minnesota-Twin Cities National Energy Research Super Computing Lawrence Berkeley National Laboratory Biological Systems and Engineering Division Lawrence Berkeley National Laboratory Biological Systems and Engineering Division Lawrence Berkeley National Laboratory UCSF Epilepsy Center University of California at San Francisco Department of Neurological Surgery University of California at San Francisco International Computer Science Institute Department of Statistics University of California at Berkeley Department of Statistics Oregon State University

The increasing size and complexity of scientific data could dramatically enhance discovery and prediction for basic scientific applications. Realizing this potential, however, requires novel statistical analysis methods that are both interpretable and predictive. We introduce Union of Intersections (UoI), a flexible, modular, and scalable framework for enhanced model selection and estimation. Methods based on UoI perform model selection and model estimation through intersection and union operations, respectively. We show that UoI-based methods achieve low-variance and nearly unbiased estimation of a small number of interpretable features, while maintaining high-quality prediction accuracy. We perform extensive numerical investigation to evaluate a UoI algorithm (UoILasso) on synthetic and real data. In doing so, we demonstrate the extraction of interpretable functional networks from human electrophysiology recordings as well as accurate prediction of phenotypes from genotype-phenotype data with reduced features. We also show (with the UoIL1Logistic and UoICUR variants of the basic framework) improved prediction parsimony for classification and matrix factorization on several benchmark biomedical data sets. These results suggest that methods based on the UoI framework could improve interpretation and prediction in data-driven discovery across scientific fields. Copyright © 2017, The Authors. All rights reserved.

关键词： Forecasting