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

MATROID: 作品数：40被引量：18H指数：4; 导出分析报告; 相关领域：理学电子电信更多>>; 相关作者：赵燕冰霍元极钱国栋霍丽芳程仕军更多>>; 相关机构：海南软件职业技术学院张家口职业技术学院河北北方学院海南大学更多>>; 相关期刊：《海南大学学报（自然科学版）》《应用数学学报》《华东师范大学学报（自然科学版）》《Frontiers of Mathematics in China》更多>>; 相关基金：国家自然科学基金海南省自然科学基金河北省高等学校自然科学研究项目湖北省自然科学基金更多>>

Identifiability and sloppiness of structured systems with a matrix fraction description using finite frequency responses: 《Science China(Information Sciences)》2025年第2期196-211,共16页Yunxiang MA Tong ZHOU; supported by National Natural Science Foundation of China(Grant Nos.62127809,62373212,61733008,52061635102)。; This paper investigates the identifiability of structured systems with a matrix fraction description and attacks practical difficulties in estimating parameters under finite frequency responses.The numerator and denom...; 关键词：IDENTIFIABILITY sloppiness structured system matrix fraction graph theory MATROID

Approximation Algorithms for Maximization of k-Submodular Function Under a Matroid Constraint: 《Tsinghua Science and Technology》2024年第6期1633-1641,共9页Yuezhu Liu Yunjing Sun Min Li; supported by the Natural Science Foundation of Shandong Province of China(No.ZR2020MA029).; In this paper,we design a deterministic 1/3-approximation algorithm for the problem of maximizing non-monotone k-submodular function under a matroid constraint.In order to reduce the complexity of this algorithm,we al...; 关键词：k-submodular matroid constraint deterministic algorithm randomized algorithm streaming algorithm

Two-Stage Submodular Maximization Under Knapsack Problem: 《Tsinghua Science and Technology》2024年第6期1703-1708,共6页Zhicheng Liu Jing Jin Donglei Du Xiaoyan Zhang; supported by the National Natural Science Foundation of China(Nos.12131003,12271259,11371001,11771386,and 11728104);the Natural Sciences and Engineering Research Council of Canada(NSERC)(No.06446);the Natural Science Foundation of Jiangsu Province(No.BK20200267);Qinglan Project.; Two-stage submodular maximization problem under cardinality constraint has been widely studied in machine learning and combinatorial optimization.In this paper,we consider knapsack constraint.In this problem,we give n...; 关键词：submodular function knapsack constraint MATROID

Quantum speedup and limitations on matroid property problems: 《Frontiers of Computer Science》2024年第4期189-196,共8页Xiaowei HUANG Jingquan LUO Lvzhou LI; National Natural Science Foundation of China(Grant Nos.62272492,61772565);Guangdong Basic and Applied Basic Research Foundation(No.2020B1515020050).; Matroid theory has been developed to be a mature branch of mathematics and has extensive applications in combinatorial optimization,algorithm design and so on.On the other hand,quantum computing has attracted much att...; 关键词：quantum computing MATROID quantum algorithm quantum query complexity

k-Submodular Maximization with a Knapsack Constraint and p Matroid Constraints: 《Tsinghua Science and Technology》2023年第5期896-905,共10页Qian Liu Kemin Yu Min Li Yang Zhou; supported by the Natural Science Foundation of Shandong Province of China(Nos.ZR2020MA029,ZR2021MA100);the National Natural Science Foundation of China(No.12001335).; A k-submodular function is a generalization of a submodular function,its definition domain is extended from the collection of single subsets to the collection of k disjoint subsets.The k-submodular maximization proble...; 关键词：k-submodularity knapsack constraint matroid constraint approximation algorithm

The Log-Concavity of Kazhdan-Lusztig Polynomials of Uniform Matroids: 《Journal of Systems Science & Complexity》2023年第1期117-128,共12页XIE Matthew H Y ZHANG Philip B; supported by the National Natural Science Foundation of China under Grant Nos.11901431 and 12171362.; Elias,et al.(2016)conjectured that the Kazhdan-Lusztig polynomial of any matroid is logconcave.Inspired by a computer proof of Moll’s log-concavity conjecture given by Kauers and Paule,the authors use a computer alge...; 关键词：HolonomicFunctions Kazhdan-Lusztig polynomial LOG-CONCAVITY uniform matroid

Eulerian and Bipartite Binary Delta-matroids: 《Acta Mathematicae Applicatae Sinica》2022年第4期813-821,共9页Qi YAN Xian-an JIN; supported by the National Natural Science Foundation of China(Nos.12171402,12101600);by the Fundamental Research Funds for the Central Universities(No.2021QN1037)。; Delta-matroid theory is often thought of as a generalization of topological graph theory.It is well-known that an orientable embedded graph is bipartite if and only if its Petrie dual is orientable.In this paper,we fi...; 关键词：MATROID delta-matroid BINARY BIPARTITE EULERIAN

关于卡方复形的强shellable性质: 《海南大学学报（自然科学版）》2021年第4期313-317,共5页郑露郭锦; 国家自然科学基金(11961017);海南省自然科学基金(119MS002);海南省科协青年科技英才学术创新计划项目(QCXM201806)。; 研究了卡方复形上的与强shellable相关的一些性质,证明了对任意一个复形Δ,若χ是使基础集上每个点都染不同颜色的一个染色,那么Δ_(χ)是一个强shellable复形;若Δ是一个TA复形,那么对Δ的任意一个染色χ,Δ_(χ)是一个强shellable复形...; 关键词：单纯复形染色强shellable MATROID

A Note on Submodularity Preserved Involving the Rank Functions: 《Journal of the Operations Research Society of China》2019年第3期399-407,共9页Min Li Dong-Lei Du Da-Chuan Xu Zhen-Ning Zhang; supported by Higher Educational Science and Technology Program of Shandong Province(No.J17KA171);Natural Science and Engineering Research Council of Canada(No.06446);the National Natural Science Foundation of China(No.11871081);Science and Technology Program of Beijing Education Commission(No.KM201810005006).; In many kinds of games with economic significance,it is very important to study the submodularity of functions.In this paper,wemainly study the problem of maximizing a concave function over an intersection of two matr...; 关键词：MATROID Submodular function Rank function Convexclosure GAME

Relationships among Matroids Induced by Covering-Based Upper Approximation Operators: 《Journal of Mathematical Research with Applications》2018年第4期351-365,共15页Lirun SU; Supported by the Research Foundation for Middle-aged and Young Scientist of Fujian Province(Grant No.JAT170731); Covering-based rough sets,as a technique of granular computing,can be a useful tool for dealing with inexact,uncertain or vague knowledge in information systems.Matroids generalize linear independence in vector spaces...; 关键词：COVERING MATROID rough set upper approximation operator indiscernible neigh-borhood NEIGHBORHOOD close friend

MATROID