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

CEUR Workshop Proceedings 2022年 3304卷

作者： Jia, Weijia Yin, Jian Hu, Shaolin Peng, Shaoliang Niu, Shaozhang Srinivasa Rao, P.C. Lu, Yao Mirsaeidi, Sohrab Cao, Bin Wu, Yilin Wang, Xingbo Subramaniyam, Kannimuthu Boddu, Raja Sarath Kumar Li, Zhonghua Tao, Qian Zhang, Lei Li, Yi Ding, Deqing Wang, Dahan Zhang, Ziyan AlShawabkeh, Mahmoud Aslam, Muhammad Dib, Omar Sahibuddin, Shamsul Bin Wagh, Sanjeev J. Pardalos, Panos M. Al-Sammarraie, Najeeb Abbas Liu, Linfeng Kong, Jin-Heung Borrego, Carlos Tahir, Sabeen Wu, Zhiheng Li, Jiongcheng Xu, Yong Xie, Zhi Wang, Jiahai Cai, Hongmin Yang, Yuedong Qin, Xiaolin Beijing Normal University Zhuhai China Sun Yat-sen University China Guangdong University of Petrochemical Technology China Hunan University China Beijing University of Posts and Telecommunications China India Beijing Jiaotong University China Hebei University of Technology China Guangdong University of Education China Foshan University China Karpagam College of Engineering India Lenora College of Engineerin India Yat-sen University Guangdong High Performance Computing Society China South China University of Technology China Henan University China Wenzhou University China National University of Defense Technology China Xiamen University of Technology China Hainan Tropical Ocean University China Guangxi Normal University for Nationalities China Wuhan University China Wenzhou-Kean University China School of Software Engineering Universiti Teknologi Malaysia Information Technology Government College of Engineering Karad India Department of Industrial & Systems Engineering University of Florida United States Al-Madinah International University Faculty of Computer and Information Technology Malaysia School of Computer Science and Technology Nanjing University of Posts and Telecommunications China School of Computer and Information Engineering Kwangwoon University Korea Republic of Departament Enginyeria of Information Comunicacions Autonomous University of Barcelona Spain Information Technology Department King AbdulAziz University Jeddah Saudi Arabia Institute of Manufacturing GDAS China Guangdong Planning and Designing Institute of Telecommunications Co. Ltd China Guangzhou Institutes of Biomedicine and Health Chinese Academy of Sciences China Cheng Du Information Technology of Chinese Academy of Sciences Co. Ltd China

来源：评论

学校读者我要写书评

暂无评论

Brain morphometry analysis with surface foliation theory

arXiv

引用

arXiv 2018年

作者： Wen, Chengfeng Lei, Na Ma, Ming Qi, Xin Zhang, Wen Wang, Yalin Gu, David Xianfeng Department of Computer Science Stony Brook University Stony BrookNY11794 United States School of Software and Technology Dalian University of Technology Dalian116620 China School of Computing Informatics and Decision Systems Engineering Arizona State University TempeAZ85281 United States

Brain morphometry study plays a fundamental role in neuroimaging research. In this work, we propose a novel method for brain surface morphometry analysis based on surface foliation theory. Given brain cortical surfaces with automatically extracted landmark curves, we first construct finite foliations on surfaces. A set of admissible curves and a height parameter for each loop are provided by users. The admissible curves cut the surface into a set of pairs of pants. A pants decomposition graph is then constructed. Strebel differential is obtained by computing a unique harmonic map from surface to pants decomposition graph. The critical trajectories of Strebel differential decompose the surface into topological cylinders. After conformally mapping those topological cylinders to standard cylinders, parameters of standard cylinders (height, circumference) are intrinsic geometric features of the original cortical surfaces and thus can be used for morphometry analysis purpose. In this work, we propose a set of novel surface features rooted in surface foliation theory. To the best of our knowledge, this is the first work to make use of surface foliation theory for brain morphometry analysis. The features we computed are intrinsic and informative. The proposed method is rigorous, geometric, and automatic. Experimental results on classifying brain cortical surfaces between patients with Alzheimer's disease and healthy control subjects demonstrate the efficiency and efficacy of our method. Copyright © 2018, The Authors. All rights reserved.

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

A Direct Proof of Improved Biased Random Walk with Gastric Cancer Dataset

A Direct Proof of Improved Biased Random Walk with Gastric C...

引用

International Conference on Applied Mathematics & Computer Science

作者： Choon Sen Seah Shahreen Kasim Mohd Farhan Md Fudzee Mohd Saberi Mohamad Rd Rohmat Saedudin Deden Witarsyah Rohayanti Hassan Mohd Arfian Ismail Rodziah Atan Soft Computing and Data Mining Centre Faculty of Computer Sciences and Information Technology Universiti Tun Hussein Onn Malaysia Faculty of Creative Technology and Heritage Universiti Malaysia Kelantan School of Industrial Engineering Telkom University Laboratory of Biodiversity and Bioinformatics Universiti Teknologi Malaysia Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Department of Software Engineering & Information System Faculty of Computer Science and Information Technology University Putra Malaysia (UPM)

ISBN: (数字)9781728132587

ISBN: (纸本)9781728132594

The relationship between the weight of a single genes and the connection between the genes had been studied. Chemistry and physical sciences have proved the attraction between molecules. Molecules are attracted to each other by bond. This paper is presented to disclose the relationship between weight and connectivity of nodes with biased random walk. An equation of biased random walk which named as significant directed random walk is formed to enhance the connectivity of nodes in directed graph via weigh. To be completely biased to the random walk, references data is implement as directed graph. Weight of genes will be used as one of the parameter in the formula. While the adjacency matrix is further enhanced by Warshall's algorithm to increases the accessibility of nodes via vector. The evolution of random walk is disclosed in this paper as well. Significant directed random walk will be used to prove the importance of weight in this paper. Comparison of the result between biased random walk is presented to prove the enhancement of random walk.

关键词： Biased random walk Cancer classification Gene expression dataset Random walk cancer classification Biased Ganglia one-parameter Mentoring Physical science

来源：评论

学校读者我要写书评

暂无评论

Reverse Furthest Neighbors Query in Road Networks

引用

Journal of Computer Science & Technology 2017年第1期32卷 155-167页

作者： Xiao-Jun Xu Jin-Song Bao Bin Yao Jing-Yu Zhou Fei-Long Tang Min-Yi Guo Jian-Qiu Xu School of Software Beijing Institute of Technology Beijing 100081 China First Research Institute of Ministry of Public Security Beijing 100048 China College of Mechanical Engineering Donghua University Shanghai 200051 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China

Given a road network G = （V, E）, where V（E） denotes the set of vertices（edges） in G, a set of points of interest P and a query point q residing in G, the reverse furthest neighbors （RFNR） query in road networks fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in P ∪ {q}. This is the monochromatic RFNR （MRFNR） query. Another interesting version of RFNR query is the bichromatic reverse furthest neighbor （BRFNR） query. Given two sets of points P and Q, and a query point q ∈ Q, a BRFNR query fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in Q. This paper presents efficient algorithms for both MRFNR and BRFNR queries, which utilize landmarks and partitioning-based techniques. Experiments on real datasets confirm the efficiency and scalability of proposed algorithms.

关键词： reverse furthest neighbor road network landmark hierarchical partition

来源：评论

学校读者我要写书评

暂无评论

Cloud scalable multi-objective task scheduling algorithm for cloud computing using cat swarm optimization and simulated annealing 8

Cloud scalable multi-objective task scheduling algorithm for...

引用

8th International Conference on Information Technology, ICIT 2017

作者： Gabi, Danlami Ismail, Abdul Samad Zainal, Anazida Zakaria, Zalmiyah Al-Khasawneh, Ahmad Department of Computer Science Faculty of Computing Universiti Teknologi Malaysia Skudai Johor81310 Malaysia Department of Computer Science Kebbi State University of Science and Technology Aliero Nigeria Department of Software Engineering Faculty of Computing Universiti Teknologi Malaysia Skudai Johor81310 Malaysia Computer and Information Systems Faculty of Prince Al-Hussein Bin Abdullah II of Information Technology Hashemite University Zarqa Jordan

ISBN: (纸本)9781509063321

In cloud computing, customers-desired Quality of Service (QoS) expectations are quite superficial due to lack of scalable task scheduling solutions that can adjust to long-time changes. Researchers in the literature have put forward several task scheduling algorithms to account for customers' QoS expectations. Unfortunately, most of these algorithms need improvements to ensure the provisioning of better consumers' QoS expectation. In this study, a Multi-Objective QoS model to address customers' expectation based on execution time and execution cost criteria is presented. A Cloud Scalable Multi-Objective Cat Swarm Optimization (CSO) based Simulated Annealing (SA) (CSM-CSOSA) algorithm is then proposed to solve the model. In this method, the Taguchi Orthogonal approach is used to enhanced the SA and incorporated into the local search of the proposed algorithm for enhancing it exploration capability. Implementation of the algorithm is carried out on CloudSim tool and evaluated using one dataset (Normal distributed) and one Parallel Workload (High-Performance computing Center North(HPC2N)). Quantitative analysis of the algorithm performance is taken based on metrics of execution time, execution cost, QoS and percentage improvement. Result obtained is compared with that of Multi-Objective Genetic Algorithm (MOGA), Multi-Objective Ant Colony (MOSACO) and Multi-Objective Particle Swarm Optimization (MOPSO), where proposed method is able to return substantial performance with improved QoS. © 2017 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Digital health technologies in the accelerating medicines Partnership® Schizophrenia Program

引用

Schizophrenia (Heidelberg, Germany) 2025年第1期11卷 83页

作者： Johanna T W Wigman Ann Ee Ching Yoonho Chung Habiballah Rahimi Eichi Erlend Lane Carsten Langholm Aditya Vaidyam Andrew Jin Soo Byun Anastasia Haidar Jessica Hartmann Angela Nunez Dominic Dwyer Adibah Amani Nasarudin Owen Borders Isabelle Scott Zailyn Tamayo Priya Matneja Kang-Ik Cho Jean Addington Luis K Alameda Celso Arango Nicholas J K Breitborde Matthew R Broome Kristin S Cadenhead Monica E Calkins Eric Yu Hai Chen Jimmy Choi Philippe Conus Cheryl M Corcoran Barbara A Cornblatt Covadonga M Diaz-Caneja Lauren M Ellman Paolo Fusar-Poli Pablo A Gaspar Carla Gerber Louise Birkedal Glenthøj Leslie E Horton Christy Lai Ming Hui Joseph Kambeitz Lana Kambeitz-Ilankovic Matcheri S Keshavan Sung-Wan Kim Nikolaos Koutsouleris Kerstin Langbein Daniel Mamah Daniel H Mathalon Vijay A Mittal Merete Nordentoft Godfrey D Pearlson Jesus Perez Diana O Perkins Albert R Powers Jack Rogers Fred W Sabb Jason Schiffman Jai L Shah Steven M Silverstein Stefan Smesny Walid Yassin William S Stone Gregory P Strauss Judy L Thompson Rachel Upthegrove Swapna Verma Jijun Wang Daniel H Wolf Phillip Wolff Laura M Rowland Simon D'Alfonso Ofer Pasternak Sylvain Bouix Patrick D McGorry Rene S Kahn John M Kane Carrie E Bearden Scott W Woods Martha E Shenton Barnaby Nelson Justin T Baker John Torous University of Groningen University Medical Center Groningen Department of Psychiatry Interdisciplinary Centre of Psychopathology and Emotion regulation Groningen The Netherlands. Centre for Youth Mental Health The University of Melbourne Parkville VIC Australia. Orygen Parkville VIC Australia. McLean Hospital Belmont MA USA. Harvard Medical School Boston MA USA. Beth Israel Deaconess Medical Center Harvard Medical School Boston MA USA. Brigham and Women's Hospital Harvard Medical School Boston MA USA. Yale University New Haven CT USA. Northwell Health Glen Oaks NY USA. Department of Psychiatry Hotchkiss Brain Institute University of Calgary Calgary AB Canada. Service de Psychiatrie Générale Dép. de Psychiatrie CHUV Lausanne Lausanne Switzerland. Department of Child and Adolescent Psychiatry Institute of Psychiatry and Mental Health Hospital General Universitario Gregorio Marañón Instituto de Investigación Sanitaria Gregorio Marañón (IiSGM) CIBERSAM ISCIII School of Medicine Universidad Complutense Madrid Spain. Department of Psychiatry and Behavioral Health Ohio State University Columbus OH USA. Department of Psychology Ohio State University Columbus OH USA. Institute for Mental Health School of Psychology University of Birmingham Birmingham UK. Birmingham Women's and Children's NHS Foundation Trust Birmingham UK. University of California San Diego CA USA. Department of Psychiatry Perelman School of Medicine University of Pennsylvania Philadelphia PA USA. Department of Psychiatry School of Clinical Medicine Li Ka Shing Faculty of Medicine University of Hong Kong Hong Kong Hong Kong. Olin Neuropsychiatry Research Center Hartford HealthCare Behavioral Health Network Hartford CT USA. Department of Psychiatry Icahn School of Medicine at Mount Sinai New York NY USA. Department of Psychiatry Donald and Barbara Zucker School of Medicine Hempstead NY USA. Feinstein Institute for Medical Research Manhasset NY USA. Department of Psych

Although meta-analytic studies have shown that 25-33% of those at Clinical High Risk (CHR) for psychosis transition to a first episode of psychosis within three years, less is known about estimating the risk of transition at an individual level. Digital phenotyping offers a novel approach to explore the nature of CHR and may help to improve personalized risk prediction. Specifically, digital data enable detailed mapping of experiences, moods and behaviors during longer periods of time (e.g., weeks, months) and offer more insight into patterns over time at the individual level across their routine daily life. However, while novel digital health technologies open up many new avenues of research, they also come with specific challenges, including replicability of results and the adherence of participants. This paper outlines the design of the digital component of the Accelerating Medicines Partnership® Schizophrenia Program (AMP SCZ) project, a large international collaborative project that follows individuals at CHR for psychosis over a period of two years. The digital component comprises one-year smartphone-based digital phenotyping and actigraphy. Smartphone-based digital phenotyping includes 30-item short daily self-report surveys and voice diaries as well as passive data capture (geolocation, on/off screen state, and accelerometer). Actigraphy data are collected via an Axivity wristwatch. The aim of this paper is to describe the design and the three goals of the digital measures used in AMP SCZ to: (i) better understand the symptoms, real-life experiences, and behaviors of those at CHR for psychosis, (ii) improve the prediction of transition to psychosis and other health outcomes in this population based on digital phenotyping and, (iii) serve as an example for replicable and ethical research across geographically diverse regions and cultures. Accordingly, we describe the rationale, protocol and implementation of these digital components of the AMP SCZ project. **

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rapid, quantitative therapeutic screening for alzheimer's enzymes enabled by optimal signal transduction with transistors

arXiv

引用

arXiv 2019年

作者： Le, Son T. Morris, Michelle A. Cardone, Antonio Guros, Nicholas B. Klauda, Jeffery B. Sperling, Brent A. Richter, Curt A. Pant, Harish C. Balijepalli, Arvind Alternative Computing Group Nanoscale Device Characterization Division National Institute of Standards and Technology GaithersburgMD20899 United States Theiss Research La JollaCA92037 United States Biophysics Group Microsystems and Nanotechnology Division National Institute of Standards and Technology GaithersburgMD20899 United States Information Systems Group Software and Systems Division National Institute of Standards and Technology GaithersburgMD20899 United States University of Maryland Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States Department of Chemical and Biomolecular Engineering University of Maryland College ParkMD20742 United States Chemical Process and Nuclear Measurements Group Chemical Sciences Division National Institute of Standards and Technology GaithersburgMD20899 United States National Institute of Neurological Disorders and Stroke National Institutes of Health BethesdaMD20892 United States

We show that simple, commercially sourced n-channel silicon field-effect transistors (nFETs) operating under closed loop control exhibit an;«3-fold improvement in pH readout resolution to (7.2±0.3)×10-3at a bandwidth of 10 Hz when compared with the open loop operation commonly employed by integrated ion-sensitive field-effect transistors (ISFETs). We leveraged the improved nFET performance to measure the change in solution pH arising from the activity of a pathological form of the kinase Cdk5, an enzyme implicated in Alzheimer's disease, and showed quantitative agreement with previous measurements. The improved pH resolution was realized while the devices were operated in a remote sensing configuration with the pH sensing element off-chip and connected electrically to the FET gate terminal. We compared these results with those measured by using a custom-built dual-gate 2D field-effect transistor (dg2DFET) fabricated with 2D semi-conducting MoS2 channels and a moderate device gain, a=8. Under identical solution conditions the pH resolution of the nFETs was only 2-fold worse than the dg2DFETs pH resolution of (3.9±0.7)×10-3. Finally, using the nFETs, we demonstrated the effectiveness of a custom polypeptide, p5, as a therapeutic agent in restoring the function of Cdk5. We expect that the straight-forward modifications to commercially sourced nFETs demonstrated here will lower the barrier to widespread adoption of these remote-gate devices and enable sensitive bioanalytical measurements for high throughput screening in drug discovery and precision medicine applications. Copyright © 2019, The Authors. All rights reserved.

关键词： Metals

来源：评论

学校读者我要写书评

暂无评论

A fine-grained data set and analysis of tangling in bug fixing commits

arXiv

引用

arXiv 2020年

作者： Herbold, Steffen Trautsch, Alexander Ledel, Benjamin Aghamohammadi, Alireza Ghaleb, Taher Ahmed Chahal, Kuljit Kaur Bossenmaier, Tim Nagaria, Bhaveet Makedonski, Philip Ahmadabadi, Matin Nili Szabados, Kristof Spieker, Helge Madeja, Matej Hoy, Nathaniel G. Lenarduzzi, Valentina Wang, Shangwen Rodríguez-Pérez, Gema Colomo-Palacios, Ricardo Verdecchia, Roberto Singh, Paramvir Qin, Yihao Chakroborti, Debasish Davis, Willard Walunj, Vijay Wu, Hongjun Marcilio, Diego Alam, Omar Aldaeej, Abdullah Amit, Idan Turhan, Burak Eismann, Simon Wickert, Anna-Katharina Malavolta, Ivano Sulír, Matúš Fard, Fatemeh Henley, Austin Z. Kourtzanidis, Stratos Tuzun, Eray Treude, Christoph Shamasbi, Simin Maleki Pashchenko, Ivan Wyrich, Marvin Davis, James C. Serebrenik, Alexander Albrecht, Ella Aktas, Ethem Utku Strüber, Daniel Erbel, Johannes Institute for Software and Systems Engineering TU Clausthal Clausthal-Zellefeld Germany Institute of Computer Science University of Goettingen Goettingen Germany Department of Computer Engineering Sharif University of Technology Tehran Iran School of Computing Queen's University Kingston Canada Department of Computer Science Guru Nanak Dev University Amritsar India Karlsruhe Germany Brunel University London Uxbridge United Kingdom Institute of Computer Science University of Goettingen Germany University of Tehran Tehran Iran Ericsson Hungary Ltd. Budapest Hungary Simula Research Laboratory Fornebu Norway Technical University of Košice Košice Slovakia LUT University Finland National University of Defense Technology Changsha China University of British Columbia Kelowna Canada Østfold University College Halden Norway Vrije Universiteit Amsterdam Amsterdam Netherlands University of Auckland Auckland New Zealand University of Saskatchewan Saskatoon Canada IBM Boulder United States University of Missouri-Kansas City Kansas City United States Università della Svizzera italiana Lugano Switzerland Trent University Peterborough Canada University of Maryland Baltimore County United States Imam Abdulrahman Bin Faisal University Saudi Arabia The Hebrew University Acumen Jerusalem Israel University of Oulu Oulu Finland Monash University Melbourne Australia University of Würzburg Würzburg Germany Technische Universität Darmstadt Darmstadt Germany University of Tennessee Knoxville United States University of Macedonia Thessaloniki Greece Department of Computer Engineering Bilkent University Ankara Turkey University of Melbourne Melbourne Australia Independent Researcher Tehran Iran University of Trento Trento Italy University of Stuttgart Stuttgart Germany Purdue University West LafayetteIN United States Eindhoven University of Technology Eindhoven Netherlands Softtech Inc. Research and Development Center Istanbul34947 Turkey Radboud Universi

Context: Tangled commits are changes to software that address multiple concerns at once. For researchers interested in bugs, tangled commits mean that they actually study not only bugs, but also other concerns irrelevant for the study of bugs. Objective: We want to improve our understanding of the prevalence of tangling and the types of changes that are tangled within bug fixing commits. Methods: We use a crowd sourcing approach for manual labeling to validate which changes contribute to bug fixes for each line in bug fixing commits. Each line is labeled by four participants. If at least three participants agree on the same label, we have consensus. Results: We estimate that between 17% and 32% of all changes in bug fixing commits modify the source code to fix the underlying problem. However, when we only consider changes to the production code files this ratio increases to 66% to 87%. We find that about 11% of lines are hard to label leading to active disagreements between participants. Due to confirmed tangling and the uncertainty in our data, we estimate that 3% to 47% of data is noisy without manual untangling, depending on the use case. Conclusion: Tangled commits have a high prevalence in bug fixes and can lead to a large amount of noise in the data. Prior research indicates that this noise may alter results. As researchers, we should be skeptics and assume that unvalidated data is likely very noisy, until proven otherwise. Copyright © 2020, The Authors. All rights reserved.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Content-centric event-insensitive big data reduction in internet of things

Content-centric event-insensitive big data reduction in inte...

引用

2017 IEEE Global Communications Conference, GLOBECOM 2017

作者： Bhuiyan, Zakirul Alam Wang, Guojun Wang, Tian Rahman, Arafatur Wu, Jie Department of Computer and Information Sciences Fordham University New YorkNY10458 United States School of Computer Science and Educational Software Guangzhou University Guangzhou510006 China College of Computer Science and Technology Huaqiao University Xiamen361021 China Faculty of Computer Systems and Software Engineering University Malaysia Pahang26300 Malaysia Center for Networked Computing Temple University PhiladelphiaPA19122 United States

ISBN: (纸本)9781509050208;9781509050192

As more knowledge discovery functions or sensing units for event detection are added to sensor devices in the Internet of Things (IoT), devices acquire big data that is bigger than they are able to deliver using their radios in a given time window. As a result, energy consumption for big data acquisition and transmission and real-time data processing are great challenges. In this paper, we introduce BigReduce, a low- cost IoT framework for event detection that reduces a big amount of data at the time of data acquisition and before the data transmission across the network. BigReduce works on the analysis of the frequency content of signals as they are acquired and efficiently adapts the frequency rate based on the sensitivity to a respective event, such as fire event. Instead of transmitting the entire set of acquired data, BigReduce transmits only the signals that have a high event-sensitivity. We provide a detailed algorithm for fire event sensitivity indication based on the frequency consents. Results achieved through a lab testbed show that BigReduce is able to reduce energy consumption by at least 78% and data volume by 82% in comparison to other frameworks. © 2017 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Physical origins of ruled surfaces on the reduced density matrices geometry

引用

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

作者： Ji-Yao Chen Zhengfeng Ji Zheng-Xin Liu Xiaofei Qi Nengkun Yu Bei Zeng Duanlu Zhou State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Beijing 100084 China Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada 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 100190 China Department of Physics Renmin University of China Beijing 100872 China Department of Mathematics Shanxi University Taiyuan 030000 China Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2W1 Canada Institute of Physics Chinese Academy of Sciences Beijing 100190 China

The reduced density matrices （RDMs） of many-body quantum states form a convex set. The boundary of low dimensional projections of this convex set may exhibit nontrivial geometry such as ruled surfaces. In this paper, we study the physical origins of these ruled surfaces for bosonic systems. The emergence of ruled surfaces was recently proposed as signatures of symmetry- breaking phase. We show that, apart from being signatures of symmetry-brealdng, ruled surfaces can also be the consequence of gapless quantum systems by demonstrating an explicit example in terms of a two-mode Ising model. Our analysis was largely simplified by the quantum de Finetti＇s theorem--in the limit of large system size, these RDMs are the convex set of all the symmetric separable states. To distinguish ruled surfaces originated from gapless systems from those caused by symmetry- breaking, we propose to use the finite size scaling method for the corresponding geometry. This method is then applied to the two-mode XY model, successfully identifying a ruled surface as the consequence of gapless systems.

关键词： ruled surfaces reduced density matrices bosonic system geometry

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：