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

arXiv 2017年

作者： He, Kun Li, Liang Liu, Xingwu Wang, Yuyi Xia, Mingji Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China Department of Artificial Intelligence Ant Financial Services Group China Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China Disco Group ETH Zürich Switzerland State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China

A tight criterion under which the abstract version Lovász Local Lemma (abstract-LLL) holds was given by Shearer [43] decades ago. However, little is known about that of the variable version LLL (variable-LLL) where events are generated by independent random variables, though this model of events is applicable to almost all applications of LLL. We introduce a necessary and sufficient criterion for variable-LLL, in terms of the probabilities of the events and the event-variable graph specifying the dependency among the events. Based on this new criterion, we obtain boundaries for two families of event-variable graphs, namely, cyclic and treelike bigraphs. These are the first two non-trivial cases where the variable-LLL boundary is fully determined. As a byproduct, we also provide a universal constructive method to find a set of events whose union has the maximum probability, given the probability vector and the event-variable graph. Though it is #P-hard in general to determine variable-LLL boundaries, we can to some extent decide whether a gap exists between a variable-LLL boundary and the corresponding abstract-LLL boundary. In particular, we show that the gap existence can be decided without solving Shearer's conditions or checking our variable-LLL criterion. Equipped with this powerful theorem, we show that there is no gap if the base graph of the event-variable graph is a tree, while gap appears if the base graph has an induced cycle of length at least 4. The problem is almost completely solved except when the base graph has only 3-cliques, in which case we also get partial solutions. A set of reduction rules are established that facilitate to infer gap existence of an event-variable graph from known ones. As an application, various event-variable graphs, in particular combinatorial ones, are shown to be gapful/gapless. Copyright © 2017, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Deciphering colorectal cancer genetics through multi-omic analysis of 100,204 cases and 154,587 controls of European and east Asian ancestries (vol 55, pg 89, 2023)

引用

NATURE GENETICS 2023年第3期55卷 519-520页

作者： Fernandez-Rozadilla, Ceres Timofeeva, Maria Chen, Zhishan Law, Philip Thomas, Minta Schmit, Stephanie Diez-Obrero, Virginia Hsu, Li Fernandez-Tajes, Juan Palles, Claire Sherwood, Kitty Briggs, Sarah Svinti, Victoria Donnelly, Kevin Farrington, Susan Blackmur, James Vaughan-Shaw, Peter Shu, Xiao-ou Long, Jirong Cai, Qiuyin Guo, Xingyi Lu, Yingchang Broderick, Peter Studd, James Huyghe, Jeroen Harrison, Tabitha Conti, David Dampier, Christopher Devall, Mathew Schumacher, Fredrick Melas, Marilena Rennert, Gad Obon-Santacana, Mireia Martin-Sanchez, Vicente Moratalla-Navarro, Ferran Oh, Jae Hwan Kim, Jeongseon Jee, Sun Ha Jung, Keum Ji Kweon, Sun-Seog Shin, Min-Ho Shin, Aesun Ahn, Yoon-Ok Kim, Dong-Hyun Oze, Isao Wen, Wanqing Matsuo, Keitaro Matsuda, Koichi Tanikawa, Chizu Ren, Zefang Gao, Yu-Tang Jia, Wei-Hua Hopper, John Jenkins, Mark Win, Aung Ko Pai, Rish Figueiredo, Jane Haile, Robert Gallinger, Steven Woods, Michael Newcomb, Polly Duggan, David Cheadle, Jeremy Kaplan, Richard Maughan, Timothy Kerr, Rachel Kerr, David Kirac, Iva Bohm, Jan Mecklin, Lukka-Pekka Jousilahti, Pekka Knekt, Paul Aaltonen, Lauri Rissanen, Harri Pukkala, Eero Eriksson, Johan Cajuso, Tatiana Hanninen, Ulrika Kondelin, Johanna Palin, Kimmo Tanskanen, Tomas Renkonen-Sinisalo, Laura Zanke, Brent Mannisto, Satu Albanes, Demetrius Weinstein, Stephanie Ruiz-Narvaez, Edward Palmer, Julie Buchanan, Daniel Platz, Elizabeth Visvanathan, Kala Ulrich, Cornelia Siegel, Erin Brezina, Stefanie Gsur, Andrea Campbell, Peter Chang-Claude, Jenny Hoffmeister, Michael Brenner, Hermann Slattery, Martha Potter, John Tsilidis, Konstantinos Schulze, Matthias Gunter, Marc Murphy, Neil Castells, Antoni Castellvi-Bel, Sergi Moreira, Leticia Arndt, Volker Shcherbina, Anna Stern, Mariana Pardamean, Bens Bishop, Timothy Giles, Graham Southey, Melissa Idos, Gregory McDonnell, Kevin Abu-Ful, Zomoroda Greenson, Joel Shulman, Katerina Lejbkowicz, Flavio Offit, Kenneth Su, Yu-Ru Steinfelder, Robert Keku, Temitope van Guelpen, Bethany Hudson, Thomas Hampel, Heather Pearlman, Edinburgh Cancer Research Centre Institute of Genomics and Cancer University of Edinburgh Edinburgh UK Genomic Medicine Group Instituto de Investigacion Sanitaria de Santiago Santiago de Compostela Spain Colon Cancer Genetics Group Medical Research Council Human Genetics Unit Institute of Genetics and Cancer University of Edinburgh Edinburgh UK Danish Institute for Advanced Study Department of Public Health University of Southern Denmark Odense Denmark Division of Epidemiology Department of Medicine Vanderbilt-Ingram Cancer Center Vanderbilt Epidemiology Center Vanderbilt University Medical Center Nashville TN USA Division of Genetics and Epidemiology Institute of Cancer Research London UK Public Health Sciences Division Fred Hutchinson Cancer Research Center Seattle WA USA Genomic Medicine Institute Cleveland Clinic Cleveland OH USA Population and Cancer Prevention Program Case Comprehensive Cancer Center Cleveland OH USA Colorectal Cancer Group ONCOBELL Program Bellvitge Biomedical Research Institute Barcelona Spain Oncology Data Analytics Program Catalan Institute of Oncology Barcelona Spain Consortium for Biomedical Research in Epidemiology and Public Health Madrid Madrid Spain Department of Clinical Sciences Faculty of Medicine University of Barcelona Barcelona Spain Department of Biostatistics School of Public Health University of Washington Seattle WA USA Institute of Cancer and Genomic Sciences College of Medical and Dental Sciences University of Birmingham Birmingham UK Department of Public Health Richard Doll Building University of Oxford Oxford UK Department of Biomedical Informatics Vanderbilt University School of Medicine Nashville TN USA Department of Preventive Medicine USC Norris Comprehensive Cancer Center Keck School of Medicine University of Southern California Los Angeles CA USA Center for Public Health Genomics Department of Public Health Sciences University of Virginia Charlottesville VA USA Department of Populat

Colorectal cancer (CRC) is a leading cause of mortality worldwide. We conducted a genome-wide association study meta-analysis of 100,204 CRC cases and 154,587 controls of European and east Asian ancestry, identifying 205 independent risk associations, of which 50 were unreported. We performed integrative genomic, transcriptomic and methylomic analyses across large bowel mucosa and other tissues. Transcriptome- and methylome-wide association studies revealed an additional 53 risk associations. We identified 155 high-confidence effector genes functionally linked to CRC risk, many of which had no previously established role in CRC. These have multiple different functions and specifically indicate that variation in normal colorectal homeostasis, proliferation, cell adhesion, migration, immunity and microbial interactions determines CRC risk. Crosstissue analyses indicated that over a third of effector genes most probably act outside the colonic mucosa. Our findings provide insights into colorectal oncogenesis and highlight potential targets across tissues for new CRC treatment and chemoprevention strategies.

关键词： Colorectal cancer Epigenomics Genome-wide association studies Transcriptomics

来源：评论

学校读者我要写书评

暂无评论

Location technology of Indoor Robot Based on Laser Sensor

Location Technology of Indoor Robot Based on Laser Sensor

引用

2016 IEEE 7th International Conference on Software Engineering and Service Science

作者： Yu Zhao Fenglian Liu Riwei Wang Key Laboratory of Computer Vision and System (Tianjin University of Technology) Department of Education Key Laboratory of Intelligence Computing and Novel Software TechnologyTianjin University of Technology

In order to solve existed accumulative error and SLAM problem for dead reckoning,this paper was proposed a positioning method combining with the known structured environment based on Extended Kalman Filter algorithm(EKF).This method quickly extracts the information of border and *** to the feature mapping relationships between world coordinate system and local coordinate system,calculate the robot's position and orientation space in the scene by matching the modeled environmental *** method that we proposed achieved a better accuracy,timeliness and correctness.

关键词： Location EKF indoor robot point matching method

来源：评论

学校读者我要写书评

暂无评论

Recent developments in the PySCF program package

arXiv

引用

arXiv 2020年

作者： Sun, Qiming Zhang, Xing Banerjee, Samragni Bao, Peng Barbry, Marc Blunt, Nick S. Bogdanov, Nikolay A. Booth, George H. Chen, Jia Cui, Zhi-Hao Eriksen, Janus Juul Gao, Yang Guo, Sheng Hermann, Jan Hermes, Matthew R. Koh, Kevin Koval, Peter Lehtola, Susi Li, Zhendong Liu, Junzi Mardirossian, Narbe McClain, James D. Motta, Mario Mussard, Bastien Pham, Hung Q. Pulkin, Artem Purwanto, Wirawan Robinson, Paul J. Ronca, Enrico Sayfutyarova, Elvira Scheurer, Maximilian Schurkus, Henry F. Smith, James E.T. Sun, Chong Sun, Shi-Ning Upadhyay, Shiv Wagner, Lucas K. Wang, Xiao White, Alec Whitfield, James Daniel Williamson, Mark J. Wouters, Sebastian Yang, Jun Yu, Jason M. Zhu, Tianyu Berkelbach, Timothy C. Sharma, Sandeep Sokolov, Alexander Yu. Chan, Garnet Kin-Lic AxiomQuant Investment Management LLC Shanghai200120 China Division of Chemistry and Chemical Engineering California Institute of Technology PasadenaCA91125 United States Department of Chemistry and Biochemistry The Ohio State University ColumbusOH43210 United States Beijing National Laboratory for Molecular Sciences State Key Laboratory for Structural Chemistry of Unstable and Stable Species Institute of Chemistry Chinese Academy of Sciences Beijing100190 China Simbeyond B.V. P.O. Box 513 EindhovenNL-5600 MB Netherlands Department of Chemistry Lensfield Road CambridgeCB2 1EW United Kingdom Max Planck Institute for Solid State Research Heisenbergstraße 1 Stuttgart70569 Germany Department of Physics King's College London Strand LondonWC2R 2LS United Kingdom Department of Physics University of Florida GainesvilleFL32611 United States Quantum Theory Project University of Florida GainesvilleFL32611 United States School of Chemistry University of Bristol Cantock's Close BristolBS8 1TS United Kingdom Division of Engineering and Applied Science California Institute of Technology PasadenaCA91125 United States Google Inc. Mountain ViewCA94043 United States FU Berlin Department of Mathematics and Computer Science Arnimallee 6 Berlin14195 Germany TU Berlin Machine Learning Group Marchstr. 23 Berlin10587 Germany Department of Chemistry Chemical Theory Center Supercomputing Institute University of Minnesota 207 Pleasant Street SE MinneapolisMN55455 United States Department of Chemistry and Biochemistry The University of Notre Dame du Lac 251 Nieuwland Science Hall Notre DameIN46556 United States Simune Atomistics S.L. Avenida Tolosa 76 Donostia-San Sebastian Spain HelsinkiFI-00014 Finland Key Laboratory of Theoretical and Computational Photochemistry Ministry of Education College of Chemistry Beijing Normal University Beijing100875 China Department of Chemistry The Johns Hopkins University BaltimoreMD21218 United States AMGEN

PYSCF is a Python-based general-purpose electronic structure platform that both supports first-principles simulations of molecules and solids, as well as accelerates the development of new methodology and complex computational workflows. The present paper explains the design and philosophy behind PYSCF that enables it to meet these twin objectives. With several case studies, we show how users can easily implement their own methods using PYSCF as a development environment. We then summarize the capabilities of PYSCF for molecular and solid-state simulations. Finally, we describe the growing ecosystem of projects that use PYSCF across the domains of quantum chemistry, materials science, machine learning and quantum information science. Copyright © 2020, The Authors. All rights reserved.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

A global survey on the use of the international classification of diseases codes for metabolic dysfunction-associated fatty liver disease

引用

Hepatology international 2024年第4期18卷 1178-1201页

作者： Huai Zhang Giovanni Targher Christopher D Byrne Seung Up Kim Vincent Wai-Sun Wong Luca Valenti Myer Glickman Jaime Ponce Christos S Mantzoros Javier Crespo Henning Gronbaek Wah Yang Mohammed Eslam Robert J Wong Mariana Verdelho Machado Ming-Lung Yu Omar M Ghanem Takeshi Okanoue Jun-Feng Liu Yong-Ho Lee Xiao-Yuan Xu Qiuwei Pan Meili Sui Amedeo Lonardo Yusuf Yilmaz Li-Yong Zhu Christophe Moreno Luca Miele Monica Lupsor-Platon Lei Zhao Teresa LeAnn LaMasters Robert G Gish Huijie Zhang Marius Nedelcu Wah Kheong Chan Ming-Feng Xia Fernando Bril Jun-Ping Shi Christian Datz Stefano Romeo Jian Sun Dan Liu Silvia Sookoian Yi-Min Mao Nahum Méndez-Sánchez Xiao-Yan Wang Nikolaos T Pyrsopoulos Jian-Gao Fan Yasser Fouad Dan-Qin Sun Cosimo Giannini Jin Chai Ze-Feng Xia Dae Won Jun Guo-Jing Li Sombat Treeprasertsuk Ying-Xu Li Tan To Cheung Faming Zhang George Boon-Bee Goh Masato Furuhashi Wai-Kay Seto Hui Huang Anna Di Sessa Qing-Hong Li Evangelos Cholongitas Le Zhang Themis Reverbel Silveira Giada Sebastiani Leon A Adams Wei Chen Xiaolong Qi Ivan Rankovic Victor De Ledinghen Wen-Jie Lv Masahide Hamaguchi Radwan Kassir Dirk Müller-Wieland Manuel Romero-Gomez Ying Xu Yi-Cong Xu Shi-Yao Chen Mohammad Kermansaravi Mohammad Shafi Kuchay Sander Lefere Chetan Parmar Gregory Y H Lip Chun-Jen Liu Fredrik Åberg George Lau Jacob George Shiv Kumar Sarin Jing-Ya Zhou Ming-Hua Zheng Department of Medical Record the First Affiliated Hospital of Wenzhou Medical University Wenzhou China. Metabolic Diseases Research Unit IRCCS Sacro Cuore - Don Calabria Hospital Negrar di Valpolicella Italy. Southampton National Institute for Health and Care Research Biomedical Research Centre University Hospital Southampton and University of Southampton Southampton General Hospital Southampton UK. Department of Internal Medicine Yonsei University Seoul Korea. Department of Medicine and Therapeutics The Chinese University of Hong Kong Hong Kong China. Department of Pathophysiology and Transplantation University of Milan Milan Italy. Precision Medicine Biological Resource Center Fondazione IRCCS Ca' Granda Ospedale Maggiore Policlinico Milan Italy. Health Analysis and Pandemic Insight Division Office for National Statistics London UK. Department Bariatric Surgery CHI Memorial Hospital Chattanooga TN USA. Beth Israel Deaconess Medical Center and Boston VA Healthcare System Harvard Medical School Boston MA USA. Gastroenterology and Hepatology Department Clinical and Traslational Research in Digestive Diseases Valdecilla Research Institute (IDIVAL) Marqués de Valdecilla University Hospital Santander Spain. Department of Hepatology and Gastroenterology Aarhus University Hospital 8200 Aarhus N Denmark. Department of Metabolic and Bariatric Surgery The First Affiliated Hospital of Jinan University Guangzhou China. Storr Liver Centre Westmead Institute for Medical Research Westmead Hospital and University of Sydney Sydney NSW Australia. Division of Gastroenterology and Hepatology Stanford University School of Medicine Veterans Affairs Palo Alto Healthcare System Palo Alto USA. Department of Gastroenterology Hospital de Vila Franca de Xira Vila Franca de Xira Portugal. School of Medicine and Doctoral Program of Clinical and Experimental Medicine College of Medicine and Center of Excellence for Metabolic Associated Fatty Liver Disease National Sun Yat-sen Univers

BACKGROUND:With the implementation of the 11th edition of the International Classification of Diseases (ICD-11) and the publication of the metabolic dysfunction-associated fatty liver disease (MAFLD) nomenclature in 2020, it is important to establish consensus for the coding of MAFLD in ICD-11. This will inform subsequent revisions of ICD-11. METHODS:Using the Qualtrics XM and WJX platforms, questionnaires were sent online to MAFLD-ICD-11 coding collaborators, authors of papers, and relevant association members. RESULTS:A total of 890 international experts in various fields from 61 countries responded to the survey. We also achieved full coverage of provincial-level administrative regions in China. 77.1% of respondents agreed that MAFLD should be represented in ICD-11 by updating NAFLD, with no significant regional differences (77.3% in Asia and 76.6% in non-Asia, p = 0.819). Over 80% of respondents agreed or somewhat agreed with the need to assign specific codes for progressive stages of MAFLD (i.e. steatohepatitis) (92.2%), MAFLD combined with comorbidities (84.1%), or MAFLD subtypes (i.e., lean, overweight/obese, and diabetic) (86.1%). CONCLUSIONS:This global survey by a collaborative panel of clinical, coding, health management and policy experts, indicates agreement that MAFLD should be coded in ICD-11. The data serves as a foundation for corresponding adjustments in the ICD-11 revision.

关键词： Global survey ICD-11 MAFLD

来源：评论

学校读者我要写书评

暂无评论

GWTC-3: Compact Binary Coalescences Observed by LIGO and Virgo during the Second Part of the Third Observing Run

引用

Physical Review X 2023年第4期13卷 041039-041039页

作者： R. Abbott T. D. Abbott F. Acernese K. Ackley C. Adams N. Adhikari R. X. Adhikari V. B. Adya C. Affeldt D. Agarwal M. Agathos K. Agatsuma N. Aggarwal O. D. Aguiar L. Aiello A. Ain P. Ajith S. Akcay T. Akutsu S. Albanesi A. Allocca P. A. Altin A. Amato C. Anand S. Anand A. Ananyeva S. B. Anderson W. G. Anderson M. Ando T. Andrade N. Andres T. Andrić S. V. Angelova S. Ansoldi J. M. Antelis S. Antier S. Appert Koji Arai Koya Arai Y. Arai S. Araki A. Araya M. C. Araya J. S. Areeda M. Arène N. Aritomi N. Arnaud M. Arogeti S. M. Aronson K. G. Arun H. Asada Y. Asali G. Ashton Y. Aso M. Assiduo S. M. Aston P. Astone F. Aubin C. Austin S. Babak F. Badaracco M. K. M. Bader C. Badger S. Bae Y. Bae A. M. Baer S. Bagnasco Y. Bai L. Baiotti J. Baird R. Bajpai M. Ball G. Ballardin S. W. Ballmer A. Balsamo G. Baltus S. Banagiri D. Bankar J. C. Barayoga C. Barbieri B. C. Barish D. Barker P. Barneo F. Barone B. Barr L. Barsotti M. Barsuglia D. Barta J. Bartlett M. A. Barton I. Bartos R. Bassiri A. Basti M. Bawaj J. C. Bayley A. C. Baylor M. Bazzan B. Bécsy V. M. Bedakihale M. Bejger I. Belahcene V. Benedetto D. Beniwal T. F. Bennett J. D. Bentley M. BenYaala F. Bergamin B. K. Berger S. Bernuzzi C. P. L. Berry D. Bersanetti A. Bertolini J. Betzwieser D. Beveridge R. Bhandare U. Bhardwaj D. Bhattacharjee S. Bhaumik I. A. Bilenko G. Billingsley S. Bini R. Birney O. Birnholtz S. Biscans M. Bischi S. Biscoveanu A. Bisht B. Biswas M. Bitossi M.-A. Bizouard J. K. Blackburn C. D. Blair D. G. Blair R. M. Blair F. Bobba N. Bode M. Boer G. Bogaert M. Boldrini L. D. Bonavena F. Bondu E. Bonilla R. Bonnand P. Booker B. A. Boom R. Bork V. Boschi N. Bose S. Bose V. Bossilkov V. Boudart Y. Bouffanais A. Bozzi C. Bradaschia P. R. Brady A. Bramley A. Branch M. Branchesi J. Brandt J. E. Brau M. Breschi T. Briant J. H. Briggs A. Brillet M. Brinkmann P. Brockill A. F. Brooks J. Brooks D. D. Brown S. Brunett G. Bruno R. Bruntz J. Bryant T. Bulik H. J. Bulten A. Buonanno R. Buscicchio D. Buskulic C. Buy R. L. Byer G. S. Cabourn Davies L. Cadonati G. Cagn LIGO Laboratory California Institute of Technology Pasadena California 91125 USA Louisiana State University Baton Rouge Louisiana 70803 USA Dipartimento di Farmacia Università di Salerno I-84084 Fisciano Salerno Italy INFN Sezione di Napoli Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy OzGrav School of Physics & Astronomy Monash University Clayton 3800 Victoria Australia LIGO Livingston Observatory Livingston Louisiana 70754 USA University of Wisconsin-Milwaukee Milwaukee Wisconsin 53201 USA OzGrav Australian National University Canberra Australian Capital Territory 0200 Australia Max Planck Institute for Gravitational Physics (Albert Einstein Institute) D-30167 Hannover Germany Leibniz Universität Hannover D-30167 Hannover Germany Inter-University Centre for Astronomy and Astrophysics Pune 411007 India University of Cambridge Cambridge CB2 1TN United Kingdom Theoretisch-Physikalisches Institut Friedrich-Schiller-Universität Jena D-07743 Jena Germany University of Birmingham Birmingham B15 2TT United Kingdom Center for Interdisciplinary Exploration and Research in Astrophysics (CIERA) Northwestern University Evanston Illinois 60208 USA Instituto Nacional de Pesquisas Espaciais 12227-010 São José dos Campos São Paulo Brazil Gravity Exploration Institute Cardiff University Cardiff CF24 3AA United Kingdom INFN Sezione di Pisa I-56127 Pisa Italy International Centre for Theoretical Sciences Tata Institute of Fundamental Research Bengaluru 560089 India University College Dublin Dublin 4 Ireland Gravitational Wave Science Project National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan INFN Sezione di Torino I-10125 Torino Italy Università di Napoli “Federico II” Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy Université de Lyon Université Claude Bernard Lyon 1 CNRS Institut L

The third Gravitational-Wave Transient Catalog (GWTC-3) describes signals detected with Advanced LIGO and Advanced Virgo up to the end of their third observing run. Updating the previous GWTC-2.1, we present candidate gravitational waves from compact binary coalescences during the second half of the third observing run (O3b) between 1 November 2019, 15∶00 Coordinated Universal Time (UTC) and 27 March 2020, 17∶00 UTC. There are 35 compact binary coalescence candidates identified by at least one of our search algorithms with a probability of astrophysical origin pastro>0.5. Of these, 18 were previously reported as low-latency public alerts, and 17 are reported here for the first time. Based upon estimates for the component masses, our O3b candidates with pastro>0.5 are consistent with gravitational-wave signals from binary black holes or neutron-star–black-hole binaries, and we identify none from binary neutron stars. However, from the gravitational-wave data alone, we are not able to measure matter effects that distinguish whether the binary components are neutron stars or black holes. The range of inferred component masses is similar to that found with previous catalogs, but the O3b candidates include the first confident observations of neutron-star–black-hole binaries. Including the 35 candidates from O3b in addition to those from GWTC-2.1, GWTC-3 contains 90 candidates found by our analysis with pastro>0.5 across the first three observing runs. These observations of compact binary coalescences present an unprecedented view of the properties of black holes and neutron stars.

关键词： Gravitational waves

来源：评论

学校读者我要写书评

暂无评论

Joint power allocation and beamforming for non-orthogonal multiple access (NOMA) in 5G millimeter-wave communications

arXiv

引用

arXiv 2017年

作者： Xiao, Zhenyu Zhu, Lipeng Choi, Jinho Xia, Pengfei Xia, Xiang-Gen School of Electronic and Information Engineering Beihang University Beijing100191 China Beijing Key Laboratory for Network-Based Cooperative Air Traffic Management Beijing Laboratory for General Aviation Technology Beijing100191 China Collaborative Innovation Center of Geospatial Technology Wuhan430079 China Korea Republic of School of Electronics and Information Engineering Key Laboratory of Embedded System and Service Computing Tongji University Shanghai200092 China College of Information Engineering Shenzhen University Shenzhen China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

In this paper we explore non-orthogonal multiple access (NOMA) in millimeter-wave (mmWave) communications (mmWave-NOMA). In particular, we consider a typical problem, i.e., maximization of the sum rate of a 2-user mmWave-NOMA system. In this problem, we need to find the beamforming vector to steer towards the two users simultaneously subject to an analog beamforming structure, while allocating appropriate power to them. As the problem is non-convex and may not be converted to a convex problem with simple manipulations, we propose a suboptimal solution to this problem. The basic idea is to decompose the original joint beamforming and power allocation problem into two sub-problems which are relatively easy to solve: one is a power and beam gain allocation problem, and the other is a beamforming problem under a constant-modulus constraint. Extension of the proposed solution from 2-user mmWave-NOMA to more-user mmWave-NOMA is also discussed. Extensive performance evaluations are conducted to verify the rational of the proposed solution, and the results also show that the proposed sub-optimal solution achieve close-to-bound sum-rate performance, which is significantly better than that of time-division multiple access (TDMA). Copyright © 2017, The Authors. All rights reserved.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource scheduling in cloud radio access network with mobile cloud computing

Dynamic resource scheduling in cloud radio access network wi...

引用

International Workshop on Quality of Service

作者： Xinhou Wang Kezhi Wang Song Wu Sheng Di Kun Yang Hai Jin Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan China University of Essex UK Argonne National Laboratory USA

Nowadays, by integrating the cloud radio access network (C-RAN) with the mobile cloud computing (MCC) technology, mobile service provider (MSP) can efficiently handle the increasing mobile traffic and enhance the capabilities of mobile users' devices to provide better quality of service (QoS). But the power consumption has become skyrocketing for MSP as it gravely affects the profit of MSP. Previous work often studied the power consumption in C-RAN and MCC separately while less work had considered the integration of C-RAN with MCC. In this paper, we present a unifying framework for optimizing the power-performance tradeoff of MSP by jointly scheduling network resources in C-RAN and computation resources in MCC to minimize the power consumption of MSP while still guaranteeing the QoS for mobile users. Our objective is to maximize the profit of MSP. To achieve this objective, we first formulate the resource scheduling issue as a stochastic problem and then propose a Resource onlIne sCHeduling (RICH) algorithm using Lyapunov optimization technique to approach a time average profit that is close to the optimum with a diminishing gap (1/V) for MSP while still maintaining strong system stability and low congestion to guarantee the QoS for mobile users. With extensive simulations, we demonstrate that the profit of RICH algorithm is 3.3× (18.4×) higher than that of active (random) algorithm.

关键词： Mobile communication Servers Power demand Cloud computing Mobile computing Quality of service Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Finite-time Cluster Synchronization of Complex Networks With Time-Varying Delays

Finite-time Cluster Synchronization of Complex Networks With...

引用

第28届中国控制与决策会议

作者： Xiwei Liu Shaohua Li Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education

ISBN: (纸本)9781467397155

In this paper,we study the finite-time cluster synchronization of complex networks with time *** are two different types of time-varying delays in the network:the internal time delay and the coupling ***'s more,we assume that coupling time-varying delays exist only between nodes in different clusters,while no delay happens between nodes in the same cluster,which is more consistent with the real *** on the Lyapunov stability theorem,sufficient conditions are derived to guarantee the realization of the finite-time cluster ***,numerical simulations are provided to support the obtained theoretical results.

关键词： Complex network Cluster synchronization Finite-time Time-varying delays

来源：评论

学校读者我要写书评

暂无评论

On the Achievable Throughput of Cooperative Vehicular Networks

On the Achievable Throughput of Cooperative Vehicular Networ...

引用

Ad-Hoc and Sensor Networks Symposium

作者： Jieqiong Chen Ammar Zafar Guoqiang Mao Changle Li School of Computing and Communication The University of Technology Sydney State Key Laboratory of Integrated Services Networks Xidian University

ISBN: (纸本)9781479966653

Due to the time-varying channel conditions and dynamic topology of vehicular networks attributable to the high mobility of vehicles, data dissemination in vehicular networks, especially for content of large-size, is challenging. In this paper, we propose a cooperative communication strategy for vehicular networks suitable for dissemination of large-size content and investigate its achievable throughput. The proposed strategy exploits the cooperation of vehicle-to-infrastructure (V2I) communications, vehicle-to-vehicle (V2V) communications and the mobility of vehicles to facilitate the transmission. Detailed analysis is provided to characterize the data dissemination process using this strategy and a closed-form result is obtained on its achievable throughput, which reveals the relationship between major performance-impacting parameters such as distance between infrastructure, radio ranges of infrastructure and vehicles, transmission rates of V2I and V2V communications and vehicular density. Simulation and numerical results show that the proposed strategy significantly increases the throughput of vehicular networks even when the traffic density is low. The result also gives insight into the optimum deployment of vehicular network infrastructure to maximize throughput.

关键词： Data dissemination Cooperative communication Throughput Vehicular networks Vehicle-to-infrastructure Vehicle-to-vehicle

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：