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

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 some exact values of the injective chromatic number of the edge corona product of some graphs. © Published under licence by IOP Publishing Ltd.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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 problems, traffic arrangements, circuit design, and storage problems can be transformed into graph coloring problems. A substantial amount of scholarly work has been dedicated to the exploration of acyclic coloring, resulting in a plethora of significant findings that significantly contribute to the theoretical framework of vertex coloring in graphs. An acyclic coloring of a graph G refers to a proper vertex coloring where the subgraph resulting from any pair of color classes does not encompass any cycles. We analyze acyclic coloring in splitting graphs and Cartesian products of paths and cycles by using the method of structural coloring, reductive proof, and mathematical induction. Moreover, we present the precise acyclic chromatic numbers for splitting graphs of cycles and Cartesian products of paths and cycles. © Published under licence by IOP Publishing Ltd.

关键词： Integrated circuit design

来源：评论

学校读者我要写书评

暂无评论

Existence and Non-Existence of Solutions to Some Degenerate Coercivity Quasilinear Elliptic Equations with Measure data

引用

Journal of Mathematical Research with applications 2022年第2期42卷 173-188页

作者： Maoji RI Xiangrui LI Qiaoyu TIAN Shuibo HUANG School of Mathematics and Computer Science Northwest Minzu University Key Laboratory of Streaming Data Computing Technologies and Application Northwest Minzu University

In this article,we study the existence and non-existence of weak solutions to the following quasilinear elliptic problem with principal part having degenerate coercivity and nonlinear term involving gradie,■where??RN... 详细信息

关键词： elliptic equation degenerate coercivity measures data existence non-existence

来源：评论

学校读者我要写书评

暂无评论

Wi-Fi based non-invasive detection of indoor wandering using LSTM model

引用

Frontiers of Computer Science 2021年第6期15卷 109-119页

作者： Qiang LIN Yusheng HAO Caihong LIU School of mathematics and computer science Northwest Minzu UniversityLanzhou 730030China Key Laboratory of Streaming Data Computing and Application Northwest Minzu UniversityLanzhou 730124China

Wandering is a significant indicator in the clinical diagnosis of dementia and other related diseases for *** monitoring of long-term continuous movement in indoor setting for detection of wandering movement is challenging because most elders are prone to forget to carry or wear sensors that collect motion information daily due to their declining ***-Fi as an emerging sensing modality has been widely used to monitor human indoor movement in a noninvasive *** order to continuously monitor individuals’indoor motion and reliably identify wandering movement in a non-invasive manner,in this work,we develop a LSTMbased deep classification method that is able to differentiate the wandering-causedWi-Fi signal change from the ***,we first use the off-the-shelf Wi-Fi devices to capture a resident’s indoor motion information,enabling to collect a group ofWi-Fi signal streams,which will be split into variablesize ***,the deep network LSTM is adopted to develop wandering detection method that is able to classify every variable-size segment of Wi-Fi signals into categories according to the well-known wandering spatiotemporal ***,experimental evaluation conducted on a group of realworld Wi-Fi signal streams shows that our proposed LSTMbased detection method is workable and effective to identify indoor wandering behavior,obtaining an average value of 0.9286,0.9618,0.9634 and 0.9619 for accuracy,precision,recall and F-1 score,respectively.

关键词： wandering detection assisting living Wi-Fi signal deep learning LSTM

来源：评论

学校读者我要写书评

暂无评论

Automatic lesion segmentation of metastases in SPECT images using U-Net-based model 2

Automatic lesion segmentation of metastases in SPECT images ...

引用

2nd International Conference on Signal Image Processing and Communication, ICSIPC 2022

作者： Gao, Runxia Lin, Qiang Man, Zhengxing Cao, Yongchun Laboratory of Chinese National Language and Information Technology Ministry of Education Northwest Minzu University Gansu Lanzhou730030 China Laboratory of Streaming Data Computing and Applications Northwest Minzu University Gansu Lanzhou730030 China

ISBN: (纸本)9781510657694

SPECT image is a commonly used nuclear medicine imaging instrument and plays a very important role in the imaging diagnosis of bone metastasis disease. As lung cancer is one of the malignant tumors that endanger human life and health, early detection and treatment is the only way to delay the life cycle of this disease. To accurately segment lung cancer bone metastases from SPECT images, different segmentation models oriented to the reliable assessment of bone metastases were studied and constructed in this paper. First, data pre-processing, such as normalization, is performed on SPECT bone metastasis images. Then, improved image segmentation models are constructed based on the U-Net model, including the U-Net model that fuses the residual structure and the U-Net model that fuses both the residual structure and the attention mechanism;finally, experiments were conducted on a set of real clinical SPECT nuclear medicine data, and the multigroup experimental demonstration showed that the U-Net model incorporating residual structure and attention mechanism proposed in this paper could better segment the bone metastases in the thoracic region of SPECT images, and the obtained pixel accuracy PA, category average pixel accuracy MPA, and average cross-merge ratio MIoU were 0.9955, 0.7824, and 0.7291, respectively. © 2022 SPIE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

ISBN: (纸本)9781665425612

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 graph and complement of complete graph respectively. Vertex coloring theory of graphs is an important part of graph coloring theory. Star coloring is a special vertex coloring with limited conditions.. © 2021 IEEE.

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

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... 详细信息

ISBN: (纸本)9781665425612

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

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

ISBN: (纸本)9781665425612

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 study the acyclic coloring of the direct product, semi-strong product of paths and stars, and the corresponding acyclic chromatic number are determined. © 2021 IEEE.

关键词： Coloring

来源：评论

学校读者我要写书评

暂无评论

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

ISBN: (纸本)9781665425612

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 graph. In this paper, structural coloring method and disproof method are used. we study the incidence coloring of direct products, semi-strong products and strong products of paths of different orders, and obtain the exact values of the incidence coloring numbers. The incidence coloring number of the direct product and the strong product of a path is the maximunm degree plus one. © 2021 IEEE.

关键词： Coloring

来源：评论

学校读者我要写书评

暂无评论

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 coloring of G is denoted by ?s (G). The corona product of simple graphs G of order m and H of order n is graph G ° H with vertex set V(G ° H) = {vi |i = 1,2,?m}?{vij |i = 1,2,?m, j = 1,2,?n}, in which vi is adjacent to every vertex of Hi if and only if, vi ? V(G), vij ? V(Hi ). According to the existing graph dyeing literature, it has become a very important technical means to study the graph dyeing problem by using the graph structure operation. Therefore, it is of great significance to study the star coloring of graphs for studying the acyclic coloring and distance coloring of graphs, the study has strong application background and great theoretical value for computing graphs. In this paper, we find the upper bound of ?s (G ° H) and the exact values of ?s (G ° H) of the corona product G ° H of two graphs G and H as: ?s (G ° H) = ?s (G) + ?s (H);?s (Pm ° H) = ?s (H) + 2;?s (K 1,m ° H) = ?s (H) + 2;?s (Cn ° H) = ?s (H) + 2, where n ? 5. © 2020 Published under licence by IOP Publishing Ltd.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：