咨询与建议

限定检索结果

文献类型

  • 32 篇 会议
  • 9 篇 期刊文献

馆藏范围

  • 41 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 32 篇 理学
    • 14 篇 数学
    • 11 篇 生物学
    • 9 篇 物理学
    • 6 篇 化学
    • 2 篇 地球物理学
    • 2 篇 统计学(可授理学、...
    • 1 篇 系统科学
  • 23 篇 工学
    • 13 篇 计算机科学与技术...
    • 13 篇 软件工程
    • 12 篇 生物医学工程(可授...
    • 11 篇 生物工程
    • 10 篇 信息与通信工程
    • 8 篇 核科学与技术
    • 7 篇 光学工程
    • 6 篇 化学工程与技术
    • 2 篇 控制科学与工程
    • 1 篇 机械工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
  • 9 篇 医学
    • 9 篇 基础医学(可授医学...
    • 9 篇 临床医学
    • 9 篇 药学(可授医学、理...
  • 9 篇 管理学
    • 8 篇 图书情报与档案管...
    • 1 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 2 篇 法学
    • 2 篇 社会学
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 6 篇 image classifica...
  • 4 篇 coloring
  • 3 篇 computer science
  • 3 篇 image segmentati...
  • 3 篇 convolutional ne...
  • 3 篇 color
  • 2 篇 nuclear medicine
  • 2 篇 single photon em...
  • 2 篇 diseases
  • 2 篇 bones
  • 1 篇 corona
  • 1 篇 lesions
  • 1 篇 collaborative fi...
  • 1 篇 degenerate coerc...
  • 1 篇 integral equatio...
  • 1 篇 random forest
  • 1 篇 spect imaging
  • 1 篇 svm
  • 1 篇 integrated circu...
  • 1 篇 diagnostic model

机构

  • 15 篇 key laboratory o...
  • 11 篇 school of mathem...
  • 7 篇 key laboratory o...
  • 5 篇 school of mathem...
  • 4 篇 key laboratory o...
  • 4 篇 school of mathem...
  • 3 篇 school of mathem...
  • 3 篇 school of mathem...
  • 3 篇 key laboratory o...
  • 3 篇 key laboratory o...
  • 3 篇 key laboratory o...
  • 3 篇 key laboratory o...
  • 3 篇 northwest for mi...
  • 2 篇 key laboratory o...
  • 2 篇 key laboratory o...
  • 2 篇 key laboratory o...
  • 2 篇 department of nu...
  • 2 篇 key laboratory o...
  • 2 篇 key laboratory o...
  • 1 篇 nonlinear analys...

作者

  • 12 篇 lin qiang
  • 9 篇 tian shuangliang
  • 8 篇 cao yongchun
  • 8 篇 man zhengxing
  • 6 篇 deng tao
  • 6 篇 qiang lin
  • 5 篇 huang mengge
  • 4 篇 zhengxing man
  • 4 篇 cao kai
  • 4 篇 yongchun cao
  • 4 篇 lu qiqi
  • 4 篇 tao deng
  • 4 篇 shuangliang tian
  • 4 篇 peng lizhen
  • 4 篇 zhang jingyi
  • 3 篇 chen xiaoyan
  • 3 篇 an zhuomo
  • 3 篇 cai jin
  • 3 篇 jingyi zhang
  • 3 篇 mengge huang

语言

  • 41 篇 英文
检索条件"机构=Key Laboratory of Streaming Data Computing Technologies and Applications"
41 条 记 录,以下是1-10 订阅
Acyclic coloring of two operations of graphs  8
Acyclic coloring of two operations of graphs
收藏 引用
2024 8th International Conference on Mechanics, Mathematics and Applied Physics, ICMMAP 2024
作者: Jin, Xinze Tian, Shuangliang School of Mathematics and Computer Science Northwest for Minzu University Lanzhou730030 China Key Laboratory of Streaming Data Computing Technologies and Applications Northwest for Minzu University Lanzhou730030 China
The coloring theory of graphs is a very important direction in graph theory. The graph coloring problem has a strong application background. Many practical problems such as timetabling problems, frequency allocation p... 详细信息
来源: 评论
Injective coloring of edge corona product of graphs  8
Injective coloring of edge corona product of graphs
收藏 引用
2024 8th International Conference on Mechanics, Mathematics and Applied Physics, ICMMAP 2024
作者: Zhao, Wenying Tian, Shuangliang School of Mathematics and Computer Science Northwest for Minzu University Lanzhou730030 China Key Laboratory of Streaming Data Computing Technologies and Applications Northwest for Minzu University Lanzhou730030 China
The injective chromatic number χi(G) of a graph G is the minimum number of colors needed to color the vertices of G such that different vertices with the same neighbor are colored differently. In this here, we get so... 详细信息
来源: 评论
Incidence Coloring of Product Graphs of Paths
Incidence Coloring of Product Graphs of Paths
收藏 引用
2021 International Conference on Big data Analysis and Computer Science, BDACS 2021
作者: Peng, Lizhen Tian, Shuangliang Lu, Qiqi School of Mathematics and Computer Science Northwest for Minzu University Key Laboratory of Streaming Data Computing Technologies and Applications Northwest Minzu University Lanzhou China
Incidence coloring of graph refers to coloring of its all incidences in which neighborly incidences are assigned different colors. The smallest number of colors in an incidence coloring is incidence coloring number of... 详细信息
来源: 评论
The acyclic coloring of the Direct product and Semi-strong product of special graphs
The acyclic coloring of the Direct product and Semi-strong p...
收藏 引用
2021 International Conference on Big data Analysis and Computer Science, BDACS 2021
作者: Lu, Qiqi Tian, Shuangliang Peng, Lizhen Northwest for Minzu University Key Laboratory of Streaming Data Computing Technologies and Applications Northwest Minzu University School of Mathematics and Computer Science Lanzhou China
An acyclic coloring of a graph is a proper vertex coloring without dichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic coloring of a graph G. We st... 详细信息
来源: 评论
Proper lucky number of product graph of path
Proper lucky number of product graph of path
收藏 引用
2021 International Conference on Big data Analysis and Computer Science, BDACS 2021
作者: An, Zhuomo Tian, Shuangliang Jin, Cai Northwest for Minzu University Key Laboratory of Streaming Data Computing Technologies and Applications Northwest Minzu University School of Mathematics and Computer Science Lanzhou China
The proper lucky label is based on the lucky label to make the color sum of any two adjacent vertices are different. In this paper we determined the proper lucky number of cartesian product, direct product and semi-pr... 详细信息
来源: 评论
The acyclic coloring of the Corona product and Edge corona product of special graphs
The acyclic coloring of the Corona product and Edge corona p...
收藏 引用
2020 International Conference on Computer Science and Management Technology, ICCSMT 2020
作者: Lu, Qiqi Tian, Shuangliang Peng, Lizhen Northwest for Minzu University Key Laboratory of Streaming Data Computing Technologies and Applications Northwest Minzu University School of Mathematics and Computer Science Lanzhou China
An acyclic coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic coloring of a... 详细信息
来源: 评论
Adjacent vertex distinguishing incidence coloring of semi-strong product of paths
Adjacent vertex distinguishing incidence coloring of semi-st...
收藏 引用
2020 International Conference on Computer Science and Management Technology, ICCSMT 2020
作者: Peng, Lizhen Tian, Shuangliang Lu, Qiqi Northwest Minzu University School of Mathematics and Computer Science Northwest for Minzu University Key Laboratory of Streaming Data Computing Technologies and Applications Lanzhou China
Adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring that satisfies that adjacent vertices have different color sets, and the minimum color number is called the adjacent vertex disting... 详细信息
来源: 评论
Star coloring for a special class of graphs G1, d
Star coloring for a special class of graphs G1, d
收藏 引用
2021 International Conference on Big data Analysis and Computer Science, BDACS 2021
作者: Cai, Jin Tian, ShuangLiang An, ZhuoMo School of Mathematics and Computer Science Northwest for Minzu University Key Laboratory of Streaming Data Computing Technologies and Applications Northwest for Minzu University Lanzhou China
In this paper we study the star coloring for a special class of graphs whose degree is either 1 or d. They are graphs obtained by generalized corona products of path, circle, star, complete graph complete bipartite gr... 详细信息
来源: 评论
On Star Coloring of Several Corona Graphs  2
On Star Coloring of Several Corona Graphs
收藏 引用
2020 2nd International Conference on Electronics and Communication, Network and Computer Technology, ECNCT 2020
作者: Cai, Jin Tian, Shuangliang An, Zhuomo School of Mathematics and Computer Science Northwest for Minzu University Lanzhou730030 China Key Laboratory of Streaming Data Computing Technologies and Applications Northwest Minzu University Lanzhou730030 China
Let G be a simple graph with vertex set V(G) and edge set E(G). A vertex coloring of G is called a star coloring of G if any of the paths of 4 order are bicolored. The minimum number of colors required for a star colo... 详细信息
来源: 评论
Partial, composite fractional operators, and their properties and applications  3
Partial, composite fractional operators, and their propertie...
收藏 引用
3rd International Conference on Mechanical, Electronic and Information Technology Engineering, ICMITE 2017
作者: Deng, Kaiying Deng, Jingwei Li, Suduo College of Mathematics and Computer Science Northwest Minzu University Lanzhou730124 China Key Lab of Streaming Data Computing Technologies and Applications Lanzhou730030 China
The paper discusses the properties of the partial fractional integrals, the partial fractional derivatives, and the composite fractional integrals and derivatives. Some basic formulas are derived;and the relations bet... 详细信息
来源: 评论