Zobrazeno 1 - 10
of 205
pro vyhledávání: '"DING Guoli"'
Autor:
CHAI Jing, HAN Zhicheng, LEI Wulin, ZHANG Dingding, MA Chenyang, SUN Kai, WENG Mingyue, ZHANG Youzhi, DING Guoli, ZHENG Zhongyou, ZHANG Yin, HAN Gang
Publikováno v:
Meitan kexue jishu, Vol 51, Iss 1, Pp 146-156 (2023)
With the deepening of coal mining and the upsizing of mining equipment, the floor heave of the mining roadway has become an important problem that restricts the efficient and safe mining of the working face. It is of great significance to reveal the
Externí odkaz:
https://doaj.org/article/6536aa1dda6b455b87bfe101808fb466
Autor:
Ding, Guoli, Qualls, Brittian
In this paper we prove that every sufficiently large 4-edge-connected graph contains the double cycle, $C_{2,r}$, as an immersion. In proving this, we develop a new tool we call a ring-decomposition. We also prove that linear edge-connectivity implie
Externí odkaz:
http://arxiv.org/abs/2410.04538
Study on reasonable offset of mining roadway under close distance coal seams goaf of rock burst mine
Publikováno v:
Meikuang Anquan, Vol 52, Iss 3, Pp 36-42 (2021)
Aiming at the situation that the top coal of the close distance coal seams is goaf and the remaining 30 m coal pillar, taking the 2-1 coal seam and 2-2 coal seam of Hulusu Coal Mine as the research background, the mechanical model of the upper coal g
Externí odkaz:
https://doaj.org/article/b8e3146424f240b99f0933d497c161a2
Let $G=(V,E)$ be a graph with four distinguished vertices, two sources $s_1, s_2$ and two sinks $t_1,t_2$, let $c:\, E \rightarrow \mathbb Z_+$ be a capacity function, and let ${\cal P}$ be the set of all simple paths in $G$ from $s_1$ to $t_1$ or fr
Externí odkaz:
http://arxiv.org/abs/2407.17821
In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. K\"{o}nig proved that every infinite graph contains either a ray or a vertex of infinite degree. In this paper,
Externí odkaz:
http://arxiv.org/abs/2211.06416
Autor:
Lewchalermvongs, Chanun, Ding, Guoli
Publikováno v:
In Advances in Applied Mathematics February 2025 163 Part A
Partitioning large matrices is an important problem in distributed linear algebra computing (used in ML among others). Briefly, our goal is to perform a sequence of matrix algebra operations in a distributed manner (whenever possible) on these large
Externí odkaz:
http://arxiv.org/abs/2106.15549
Autor:
Guo, Feng, Zhang, Nong, Feng, Xiaowei, Xie, Zhengzheng, Han, Changliang, Li, Yongle, Chen, Qinghua, Ding, Guoli
Publikováno v:
In Engineering Geology March 2024 331
Autor:
Ding, Guoli, Qin, Chengfu
The chain theorem of Tutte states that every 3-connected graph can be constructed from a wheel $W_n$ by repeatedly adding edges and splitting vertices. It is not difficult to prove the following strengthening of this theorem: every non-wheel 3-connec
Externí odkaz:
http://arxiv.org/abs/2012.13974
Ramsey proved that for every positive integer $n$, every sufficiently large graph contains an induced $K_n$ or $\overline{K}_n$. Among the many extensions of Ramsey's Theorem there is an analogue for connected graphs: for every positive integer $n$,
Externí odkaz:
http://arxiv.org/abs/2009.12503