云南高校图书馆联盟文献共享服务平台- SUBTREE

SUBTREE: 作品数：11被引量：0H指数：0; 导出分析报告; 相关领域：自动化与计算机技术更多>>; 相关作者：张明理更多>>; 相关机构：中国科学院植物研究所墨尔本大学更多>>; 相关期刊：《Acta Mathematicae Applicatae Sinica》《Chinese Journal of Electronics》《Frontiers of Information Technology & Electronic Engineering》《Computers, Materials & Continua》更多>>; 相关基金：国家自然科学基金中国科学院知识创新工程更多>>

Burning Numbers of Barbells: 《Acta Mathematicae Applicatae Sinica》2024年第2期526-538,共13页Hui-qing LIU Rui-ting ZHANG Xiao-lan HU; supported by the National Natural Science Foundation of China(Nos.11971158,12371345,11971196).; Motivated by a discrete-time process intended to measure the speed of the spread of contagion in a graph,the burning number b(G)of a graph G,is defined as the smallest integer k for which there are vertices x1,…xk su...; 关键词：burning number short/long barbell isometric subtree CYCLE

Historical relationships of the Mesoamerican highlands,with emphasis on tropical montane cloud forests:a temporal cladistic biogeographical analysis: 《Journal of Mountain Science》2023年第1期129-140,共12页CASTRO-TORREBLANCA Marisol ESPINOSA David BUENO-HERNANDEZ Alfredo LUNA-VEGA Isolda; the CONACyT 478077;partially financed by DGAPA-PAPIIT 220621。; The historical relationships of nine areas of endemism of the tropical montane cloud forests(TMCFs)were analysed based on a temporal cladistic biogeographical approach.Three cladistic biogeographical analyses were con...; 关键词：Dispersal Evolutionary biogeography Paralogy free subtree analysis VICARIANCE

SBOOSP for Massive Devices in 5G WSNs Using Conformable Chaotic Maps: 《Computers, Materials & Continua》2022年第6期4591-4608,共18页Chandrashekhar Meshram Agbotiname Lucky Imoize Sajjad Shaukat Jamal Amer Aljaedi Adel R.Alharbi; We extend our gratitude to the Deanship of Scientific Research at King Khalid University for funding this work through the research groups programunder grant number R.G.P.1/72/42;The work of Agbotiname Lucky Imoize is supported by the Nigerian Petroleum Technology Development Fund(PTDF)and the German Academic Exchange Service(DAAD)through the Nigerian-German Postgraduate Program under Grant 57473408.; The commercialization of the fifth-generation(5G)wireless network has begun.Massive devices are being integrated into 5G-enabled wireless sensor networks(5GWSNs)to deliver a variety of valuable services to network use...; 关键词：Subtree-based online/offline signature procedure(SBOOSP) 5G WSNs provably secure scheme massive devices conformable chaotic maps

MTMO： an efficient network-centric algorithm for subtree counting and enumeration: 《Frontiers of Electrical and Electronic Engineering in China》2018年第2期142-154,共13页Guanghui Li Jiawei Luo Zheng Xiao Cheng Liang; This work was supported by the National Natural Science Foundation of China （No. 61572180） and Scientific and Technological Research Project of Education Department in Jiangxi Province （No. GJJ170383）,; Background： The frequency of small subtrees in biological, social, and other types of networks could shed light into the structure, function, and evolution of such networks. However, counting all possible subtrees of...; 关键词：complex network evolutionary systems biology network motif discovery subtree counting subtreeisomorphism

Structure Polynomials and Subgraphs of Rooted Regular Trees: 《Algebra Colloquium》2018年第1期45-70,共26页Daniele D'Angeli Alfredo Donno; We introduce an algebraic structure allowing us to describe subgraphs of a regular rooted tree. Its elements are called structure polynomials, and they are in a one- to-one correspondence with the set of all subgraphs...; 关键词：rooted tree structure polynomial rooted subtree automorphism group of a tree Gelfand pair

The Pos/neg-weighted 2-medians in Balanced Trees with Subtree-shaped Customers: 《Acta Mathematicae Applicatae Sinica》2016年第4期891-898,共8页Chun-song BAI Li-ying KANG; Supported by the National Nature Science Foundation of China(Nos.11471210,11571222); This paper deals with the pos/neg-weighted p-median problem on tree graphs where all customers are modeled as subtrees. We present a polynomial algorithm for the 2-median problem on an arbitrary tree. Then we improve ...; 关键词：Location problems subtree-shaped customers obnoxious facilities

A subtree-based approach to failure detection and protection for multicast in SDN: 《Frontiers of Information Technology & Electronic Engineering》2016年第7期682-700,共19页Vignesh RENGANATHAN RAJA Chung-Horng LUNG Abhishek PANDEY Guo-ming WEI Anand SRINIVASAN; Software-defined networking(SDN) has received tremendous attention from both industry and academia.The centralized control plane in SDN has a global view of the network and can be used to provide more effective soluti...; 关键词：Software-defined networks(SDNs) Open Flow Multicast tree PROTECTION POX controller Mininet Multiprotocol label switching(MPLS)

Efficient subtree results computation for XML keyword queries: 《Frontiers of Computer Science》2015年第2期253-264,共12页Ziyang CHEN; This work was partially supported by the National Natural Science Foundation of China （Grant Nos. 61272124, 61103139, 61472339 and 61303040）.; In this paper, we focus on efficient construction of restricted subtree （RSubtree） results for XML keyword queries on a multicore system. We firstly show that the perfor- mance bottlenecks for existing methods lie i...; 关键词：XML SLCA/ELCA RSubtree RKNs PARALLEL

Distances Between Phylogenetic Trees: A Survey: 《Tsinghua Science and Technology》2013年第5期490-499,共10页Feng Shi Qilong Feng Jianer Chen Lusheng Wang Jianxin Wang; supported by the National Natural Science Foundation of China (Nos.61103033,61173051, 61232001,and 70921001); Phylogenetic trees have been widely used in the study of evolutionary biology for representing the tree-like evolution of a collection of species. However, different data sets and different methods often lead to the c...; 关键词：phylogenetic tree tree bisection and reconnection subtree prune and regraft fixed-parameter algorithm approximation algorithm

A Hybrid Optimization Algorithm for the CMST Problem: 《Chinese Journal of Electronics》2011年第4期583-589,共7页HAN Jun FANG Qingan MAO Liyong HUANG Yaling; This work is supported by the National Natural Science Foundation of China （No.90818028）, National Science and Technology Major Research Plan of China （No.2009ZX01043-002-004, No.2008ZX07528-004-01） and State Key Laboratory of Software Development Environment （No.SKLSDE-2010ZX-08）.; The Capacitated minimum spanning tree （CMST） problem is one of the most fundamental and significant problems in the optimal design of networks. It is also a classical combinatorial optimization problem which has bee...; 关键词：Capacitated minimum spanning tree （CMST） Neighbourhood structure Tabu search Rooted subtree.

SUBTREE