Autor: Ping, Zhang - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: Preliminary studies on deformation characteristics and prediction of surface movement in loess gully region
Wstępne stadium prognozowania ruchów i deformacji powierzchni dla regionów żlebów lessowych
Autorzy:: Xue-yi, Yu
Ping, Zhang
Wen-gang, ShiHi
Tematy:: lessowy teren żlebowy
zapadowość lessu
deformacje nieciągłe
prognoza deformacji terenu
loess gully region
collapsible loess
discontinuous movement and deformation
subsidence prediction; Pokaż więcej
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:: https://bibliotekanauki.pl/articles/349246.pdf Link otwiera się w nowym oknie
Opis:: Based on lots of surface movement and deformation observation data in loess gully region mine, the characters of surface movement and deformation caused by running activity are studied. Surface subsidence was up to 97% of the total subsidence in active period. Surface was moving with great crack and discontinuous deformation failure. The surface deformation developed rapidly, displacement angle is large, subsidence factor and horizontal movement factor is high. The results of surveying show that collapsible loess with the gully terrain lead to surface cracks which are quickly developed in loess. Crack failure are further intensified by mountain body slip induced by weight force. Meanwhile, subsidence factor and horizontal movement factor is gradually higher. Finally, the prediction model of horizontal strain and horizontal deformation were preliminarily established according to analysis results.
W artykule przedstawiono charakterystykę ruchów i deformacji powierzchni terenów żlebów lessowych, spowodowanych działalnością górniczą. Osiadania powierzchni w okresie prowadzonej eksploatacji wynosiły około 97% osiadań całkowitych. Podczas ruchów powierzchni dochodziło do powstawania dużych szczelin i deformacji nieciągłych. Deformacje te zachodziły gwałtownie i charakteryzowały się dużym kątem zasięgu oraz wysokim współczynnikiem przemieszczeń poziomych. Wyniki przeprowadzonych pomiarów geodezyjnych pokazują, że zapadający się less w terenie żlebowym prowadzi do spękań powierzchni terenu, które szybko się powiększają. Spękania propagują jeszcze bardziej, gdy następują ruchy osuwiskowe skał i gruntów na skutek zaburzenia równowagi pomiędzy siłami ciężkości. W takim przypadku współczynniki przemieszczeń pionowych i poziomych rosną. Wyniki przeprowadzonej analizy pozwoliły na przedstawienie wstępnego modelu charakteryzującego poziome deformacje terenu.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: On k-Path Pancyclic Graphs
Autorzy:: Bi, Zhenming
Zhang, Ping
Tematy:: Hamiltonian
panconnected
pancyclic
path Hamiltonian
path pancyclic; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/31339488.pdf Link otwiera się w nowym oknie
Opis:: For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum degree of G, (b) the minimum degree-sum of nonadjacent vertices of G and (c) the size of G such that G is k-path pancyclic
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: On Closed Modular Colorings of Trees
Autorzy:: Phinezy, Bryan
Zhang, Ping
Tematy:: trees
closed modular k-coloring
closed modular chromatic number; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/30146543.pdf Link otwiera się w nowym oknie
Opis:: Two vertices $u$ and $v$ in a nontrivial connected graph $G$ are twins if $u$ and $v$ have the same neighbors in $V (G)$ − ${u, v}$. If $u$ and $v$ are adjacent, they are referred to as true twins; while if $u$ and $v$ are nonadjacent, they are false twins. For a positive integer $k$, let $c : V (G) \rightarrow \mathbb{Z}_k $ be a vertex coloring where adjacent vertices may be assigned the same color. The coloring $c$ induces another vertex coloring $ c^′ : V (G) \rightarrow \mathbb{Z}_k $ defined by $ c′(v) = \Sigma_{u \in N[v]} c(u) $ for each $ v \in V (G) $, where $N[v]$ is the closed neighborhood of $v$. Then $c$ is called a closed modular $k$-coloring if $c^′(u) \ne c′(v)$ in $ \mathbb{Z}_k$ for all pairs $u$, $v$ of adjacent vertices that are not true twins. The minimum $k$ for which $G$ has a closed modular $k$-coloring is the closed modular chromatic number $ \overline{mc}(G) $ of $G$. The closed modular chromatic number is investigated for trees and determined for several classes of trees. For each tree $T$ in these classes, it is shown that $ \overline{mc} (T) = 2$ or $ \overline{mc}(T) = 3 $. A closed modular $k$-coloring $c$ of a tree $T$ is called nowhere-zero if $c(x) \ne 0 $ for each vertex $x$ of $T$. It is shown that every tree of order 3 or more has a nowhere-zero closed modular 4-coloring.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Nowhere-zero modular edge-graceful graphs
Autorzy:: Jones, Ryan
Zhang, Ping
Tematy:: modular edge-graceful labelings and graphs
nowhere-zero labelings
modular edge-gracefulness; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/743248.pdf Link otwiera się w nowym oknie
Opis:: For a connected graph G of order n ≥ 3, let f: E(G) → ℤₙ be an edge labeling of G. The vertex labeling f': V(G) → ℤₙ induced by f is defined as $f'(u) = ∑_{v ∈ N(u)} f(uv)$, where the sum is computed in ℤₙ. If f' is one-to-one, then f is called a modular edge-graceful labeling and G is a modular edge-graceful graph. A modular edge-graceful labeling f of G is nowhere-zero if f(e) ≠ 0 for all e ∈ E(G) and in this case, G is a nowhere-zero modular edge-graceful graph. It is shown that a connected graph G of order n ≥ 3 is nowhere-zero modular edge-graceful if and only if n ≢ 2 mod 4, G ≠ K₃ and G is not a star of even order. For a connected graph G of order n ≥ 3, the smallest integer k ≥ n for which there exists an edge labeling f: E(G) → ℤₖ - {0} such that the induced vertex labeling f' is one-to-one is referred to as the nowhere-zero modular edge-gracefulness of G and this number is determined for every connected graph of order at least 3.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: Connected partition dimensions of graphs
Autorzy:: Saenpholphat, Varaporn
Zhang, Ping
Tematy:: distance
resolving partition
connected resolving partition; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/743364.pdf Link otwiera się w nowym oknie
Opis:: For a vertex v of a connected graph G and a subset S of V(G), the distance between v and S is d(v,S) = min{d(v,x)|x ∈ S}. For an ordered k-partition Π = {S₁,S₂,...,Sₖ} of V(G), the representation of v with respect to Π is the k-vector r(v|Π) = (d(v,S₁), d(v,S₂),..., d(v,Sₖ)). The k-partition Π is a resolving partition if the k-vectors r(v|Π), v ∈ V(G), are distinct. The minimum k for which there is a resolving k-partition of V(G) is the partition dimension pd(G) of G. A resolving partition Π = {S₁,S₂,...,Sₖ} of V(G) is connected if each subgraph $⟨S_i⟩$ induced by $S_i$ (1 ≤ i ≤ k) is connected in G. The minimum k for which there is a connected resolving k-partition of V(G) is the connected partition dimension cpd(G) of G. Thus 2 ≤ pd (G) ≤ cpd(G) ≤ n for every connected graph G of order n ≥ 2. The connected partition dimensions of several classes of well-known graphs are determined. It is shown that for every pair a, b of integers with 3 ≤ a ≤ b ≤ 2a-1, there is a connected graph G having pd(G) = a and cpd(G) = b. Connected graphs of order n ≥ 3 having connected partition dimension 2, n, or n-1 are characterized.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: On graphs with a unique minimum hull set
Autorzy:: Chartrand, Gary
Zhang, Ping
Tematy:: geodetic set
geodetic number
convex hull
hull set
hull number
hull graph; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/743417.pdf Link otwiera się w nowym oknie
Opis:: We show that for every integer k ≥ 2 and every k graphs G₁,G₂,...,Gₖ, there exists a hull graph with k hull vertices v₁,v₂,...,vₖ such that link $L(v_i) = G_i$ for 1 ≤ i ≤ k. Moreover, every pair a, b of integers with 2 ≤ a ≤ b is realizable as the hull number and geodetic number (or upper geodetic number) of a hull graph. We also show that every pair a,b of integers with a ≥ 2 and b ≥ 0 is realizable as the hull number and forcing geodetic number of a hull graph.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: On stratification and domination in graphs
Autorzy:: Gera, Ralucca
Zhang, Ping
Tematy:: stratified graph
F-domination
domination; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/743948.pdf Link otwiera się w nowym oknie
Opis:: A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class), where the vertices in one class are colored red and those in the other class are colored blue. Let F be a 2-stratified graph rooted at some blue vertex v. An F-coloring of a graph is a red-blue coloring of the vertices of G in which every blue vertex v belongs to a copy of F rooted at v. The F-domination number $γ_F(G)$ is the minimum number of red vertices in an F-coloring of G. In this paper, we study F-domination, where F is a 2-stratified red-blue-blue path of order 3 rooted at a blue end-vertex. We present characterizations of connected graphs of order n with F-domination number n or 1 and establish several realization results on F-domination number and other domination parameters.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: The forcing geodetic number of a graph
Autorzy:: Chartrand, Gary
Zhang, Ping
Tematy:: geodetic set
geodetic number
forcing geodetic number; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/744241.pdf Link otwiera się w nowym oknie
Opis:: For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u-v geodesic in G. If S is a set of vertices of G, then I(S) is the union of all sets I(u,v) for u, v ∈ S. A set S is a geodetic set if I(S) = V(G). A minimum geodetic set is a geodetic set of minimum cardinality and this cardinality is the geodetic number g(G). A subset T of a minimum geodetic set S is called a forcing subset for S if S is the unique minimum geodetic set containing T. The forcing geodetic number $f_G(S)$ of S is the minimum cardinality among the forcing subsets of S, and the forcing geodetic number f(G) of G is the minimum forcing geodetic number among all minimum geodetic sets of G. The forcing geodetic numbers of several classes of graphs are determined. For every graph G, f(G) ≤ g(G). It is shown that for all integers a, b with 0 ≤ a ≤ b, a connected graph G such that f(G) = a and g(G) = b exists if and only if (a,b) ∉ {(1,1),(2,2)}.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: Multicolor Ramsey numbers and star-critical Ramsey numbers involving fans
Autorzy:: Li, Yan
Zhang, Yahui
Zhang, Ping
Tematy:: multicolor Ramsey number
star-critical Ramsey number
fan
book; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/59945814.pdf Link otwiera się w nowym oknie
Opis:: For graphs $G$ and $H$, the multicolor Ramsey number $r_{k+1}(G;H)$ is defined as the minimum integer $N$ such that any edge-coloring of $K_N$ by $k+1$ colors contains either a monochromatic $G$ in the first $k$ colors or a monochromatic $H$ in the last color. We shall write two color Ramsey numbers as $r(G,H)$. For graphs $F$, $G$ and $H$, let $F\to (G,H)$ signify that any red/blue edge coloring of $F$ contains either a red $G$ or a blue $H$. Define the star-critical Ramsey number $r^\ast(G,H)$ as $\max\{s | K_r\setminus K_{1,s}\to (G,H)\}$ where $r=R(G,H)$. A fan $F_n$ is a graph that consists of $n$ copies of $K_3$ sharing a common vertex, and a book $B_n^{(p)}$ is a graph that consists of $n$ copies of $K_{p+1}$ sharing a common $K_p$. In this note, we shall show the upper bounds for $r_{k+1}(K_{t,s};F_{n})$, $r_{k+1}(K_{2,s};F_{n})$, $r_{k+1}(C_{2t};F_{n})$, some of which are sharp up to the sub-linear term asymptotically. We also obtain the value of $r^\ast(F_m,B_n^{(p)})$ as $n\to\infty$.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: Feasibility study of RANS in predicting propeller cavitation in behind-hull conditions
Autorzy:: Zhang, Yuxin
Wu, Xiao-ping
Lai, Ming-yan
Zhou, Guo-ping
Zhang, Jie
Tematy:: RANS
Computational Fluid Dynamics (CFD)
propeller cavitation
turbulence model
grid sensitivity; Pokaż więcej
Wydawca:: Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Powiązania:: https://bibliotekanauki.pl/articles/1573849.pdf Link otwiera się w nowym oknie
Opis:: The propeller cavitation not only affects the propulsive efficiency of a ship but also can cause vibration and noise. Accurate predictions of propeller cavitation are crucial at the design stage. This paper investigates the feasibility of the Reynolds-averaged Navier–Stokes (RANS) method in predicting propeller cavitation in behind-hull conditions, focusing on four aspects: (i) grid sensitivity; (ii) the time step effect; (iii) the turbulence model effect; and (iv) ability to rank two slightly different propellers. The Schnerr-Sauer model is adopted as the cavitation model. A model test is conducted to validate the numerical results. Good agreement on the cavitation pattern is obtained between the model test and computational fluid dynamics. Two propellers are computed, which have similar geometry but slightly different pitch ratios. The results show that RANS is capable of correctly differentiating the cavitation patterns between the two propellers in terms of the occurrence of face cavitation and the extent of sheet cavitation; moreover, time step size is found to slightly affect sheet cavitation and has a significant impact on the survival of the tip vortex cavitation. It is also observed that grid refinement is crucial for capturing tip vortex cavitation and the two-equation turbulence models used – realizable k-ε and shear stress transport (SST) k-ω – yield similar cavitation results.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "Ping, Zhang" wg kryterium: Autor