Autor: Xu, Jun - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: On the (2,2)-domination number of trees
Autorzy:: Lu, You
Hou, Xinmin
Xu, Jun-Ming
Tematy:: domination number
total domination number
(2,2)-domination number; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/744559.pdf Link otwiera się w nowym oknie
Opis:: Let γ(G) and $γ_{2,2}(G)$ denote the domination number and (2,2)-domination number of a graph G, respectively. In this paper, for any nontrivial tree T, we show that $(2(γ(T)+1))/3 ≤ γ_{2,2}(T) ≤ 2γ(T)$. Moreover, we characterize all the trees achieving the equalities.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: A characterization of (γₜ,γ₂)-trees
Autorzy:: Lu, You
Hou, Xinmin
Xu, Jun-Ming
Li, Ning
Tematy:: domination
total domination
2-domination
(λ,μ)-tree; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/744036.pdf Link otwiera się w nowym oknie
Opis:: Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respectively. It has been shown that: γₜ(T) ≤ γ₂(T) for any tree T. In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Analysis of Clothing Image Classification Models: A Comparison Study between Traditional Machine Learning and Deep Learning Models
Autorzy:: Wang, Aichun
Zhao, Heng
Xu, Jun
Lefloch, Damien
Wei, Yumeng
Wydawca:: Sciendo
Cytata wydawnicza:: Xu, Jun, et al. "Analysis of Clothing Image Classification Models: A Comparison Study between Traditional Machine Learning and Deep Learning Models" Fibres & Textiles in Eastern Europe, vol. 30, no. 5, Sciendo, 2022, pp. 66-78. https://doi.org/10.2478/ftee-2022-0046
Opis:: Clothing image in the e-commerce industry plays an important role in providing customers with information. This paper divides clothing images into two groups: pure clothing images and dressed clothing images. Targeting small and medium-sized clothing companies or merchants, it compares traditional machine learning and deep learning models to determine suitable models for each group. For pure clothing images, the HOG+SVM algorithm with the Gaussian kernel function obtains the highest classification accuracy of 91.32% as compared to the Small VGG network. For dressed clothing images, the CNN model obtains a higher accuracy than the HOG+SVM algorithm, with the highest accuracy rate of 69.78% for the Small VGG network. Therefore, for end-users with only ordinary computing processors, it is recommended to apply the traditional machine learning algorithm HOG+SVM to classify pure clothing images. The classification of dressed clothing images is performed using a more efficient and less computationally intensive lightweight model, such as the Small VGG network.
Dostawca treści:: Repozytorium Centrum Otwartej Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Analysis of Clothing Image Classification Models: A Comparison Study between Traditional Machine Learning and Deep Learning Models
Autorzy:: Xu, Jun
Wei, Yumeng
Wang, Aichun
Zhao, Heng
Lefloch, Damien
Tematy:: e-commerce
clothing image classification
traditional machine learning
CNN
HOG
SVM
small VGG network; Pokaż więcej
Wydawca:: Sieć Badawcza Łukasiewicz - Instytut Biopolimerów i Włókien Chemicznych
Powiązania:: https://bibliotekanauki.pl/articles/2200761.pdf Link otwiera się w nowym oknie
Opis:: Clothing image in the e-commerce industry plays an important role in providing customers with information. This paper divides clothing images into two groups: pure clothing images and dressed clothing images. Targeting small and medium-sized clothing companies or merchants, it compares traditional machine learning and deep learning models to determine suitable models for each group. For pure clothing images, the HOG+SVM algorithm with the Gaussian kernel function obtains the highest classification accuracy of 91.32% as compared to the Small VGG network. For dressed clothing images, the CNN model obtains a higher accuracy than the HOG+SVM algorithm, with the highest accuracy rate of 69.78% for the Small VGG network. Therefore, for end-users with only ordinary computing processors, it is recommended to apply the traditional machine learning algorithm HOG+SVM to classify pure clothing images. The classification of dressed clothing images is performed using a more efficient and less computationally intensive lightweight model, such as the Small VGG network.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: Spectral bounds for the zero forcing number of a graph
Autorzy:: Chen, Hongzhang
Li, Jianxi
Xu, Shou-Jun
Tematy:: zero forcing number
eigenvalue
bound; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/59898645.pdf Link otwiera się w nowym oknie
Opis:: Let $Z(G)$ be the zero forcing number of a simple connected graph $G$. In this paper, we study the relationship between the zero forcing number of a graph and its (normalized) Laplacian eigenvalues. We provide the upper and lower bounds on $Z(G)$ in terms of its (normalized) Laplacian eigenvalues, respectively. Our bounds extend the existing bounds for regular graphs.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Semitotal domination in claw-free graphs
Autorzy:: Chen, Jie
Liang, Yi-Ping
Xu, Shou-Jun
Tematy:: semitotal domination
minimum degree
claw-free graphs; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/59901342.pdf Link otwiera się w nowym oknie
Opis:: In an isolate-free graph $G$, a subset $S$ of vertices is a semitotal dominating set of $G$ if it is a dominating set of $G$ and every vertex in $S$ is within distance 2 of another vertex of $S$. The semitotal domination number of $G$, denoted by $\gamma_{t2}(G)$, is the minimum cardinality of a semitotal dominating set in $G$. We prove that if $G$ is a connected claw-free graph of order $n$ with minimum degree $\delta(G)\geq 2$ and is not one of fourteen exceptional graphs (ten of which are cycles), then $ \gamma_{t2}(G) \leq \tfrac{3}{7}n $, and we also characterize the graphs achieving equality, which are an infinite family of graphs. In particular, if we restrict $\delta(G) \geq 3$ and $G\ne K_4$, then we can improve the result to $ \gamma_{t2}(G) \leq \tfrac{2}{5}n $, solving the conjecture for the case of claw-free graphs, proposed by Goddard, Henning and McPillan in [Semitotal domination in graphs, Util. Math. 94 (2014) 67–81].
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: Semitotal forcing in claw-free cubic graphs
Autorzy:: Liang, Yi-Ping
Chen, Jie
Xu, Shou-Jun
Tematy:: semitotal forcing number
claw-free
cubic; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/59945798.pdf Link otwiera się w nowym oknie
Opis:: For an isolate-free graph $G=(V(G),E(G))$, a set $S\subseteq V(G)$ is called a semitotal forcing set of $G$ if it is a forcing set (or a zero forcing set) of $G$ and every vertex in $S$ is within distance 2 of another vertex of $S$. The semitotal forcing number $F_{t2}(G)$ is the minimum cardinality of a semitotal forcing set in $G$. In this paper, we prove that if $G \ne K_4$ is a connected claw-free cubic graph of order $n$, then $ F_{t2}(G)\leq \tfrac{3}{8}n+1 $. The graphs achieving equality in this bound are characterized, an infinite set of graphs.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: Sufficient conditions for spanning trees with constrained leaf distance in a graph
Autorzy:: Chen, Hongzhang
Lv, Xiaoyun
Li, Jianxi
Xu, Shou-Jun
Tematy:: spanning tree
leaf distance
(signless Laplacian) spectral radius; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/59945828.pdf Link otwiera się w nowym oknie
Opis:: The leaf distance of a tree is the minimum of distances between any two leaves of a tree. It is well known that seeking sufficient conditions for a graph to have some special kinds of spanning trees is an interesting and popular problem. In this paper, we first provide a lower bound on the size of a graph $G$ to guarantee that $G$ has a spanning tree with leaf distance at least $4$. Moreover, for any graph $G$ with minimum degree $\delta$, we also deduce a lower bound on the spectral radius (or the signless Laplacian spectral radius) of $G$ to ensure the existence of a spanning tree with leaf distance of at least $4$ in $G$.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: Some results on the $k$-alliance and domination of graphs
Autorzy:: Chen, Hongzhang
Li, Jianxi
Sun, Bin
Xu, Shou-Jun
Tematy:: total (signed) domination number
defensive (global offensive) $k$-alliance number
eigenvalue
bound; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/63482039.pdf Link otwiera się w nowym oknie
Opis:: For a graph $G$ of order $n$ and real number $a\geq-1$, let $\rho_{i}^{a}(G)$ be the $i$-th largest eigenvalue of $A_a(G):=aD(G)+A(G)$, where $A(G)$ and $D(G)$ are the adjacency matrix and the diagonal degree matrix of $G$. In this paper, we investigate connections of the eigenvalues of $A_a(G)$ to the alliances and domination parameters of $G$ including defensive $k$-alliance number, global offensive $k$-alliance number, total domination number and signed domination number. Our results in this paper provide a unified approach to study the alliances and domination in a graph by its eigenvalues of associated matrices. We derive two lower bounds for the defensive $k$-alliance number of $G$ based on the parameter $\rho_{2}^{a}(G)$. Moreover, we establish a lower bound for the global offensive $k$-alliance number of $G$ in relation to $\rho_{n}^{a}(G)$. Additionally, we also deduce the lower bounds for $\rho_{2}^{a}(G)$ based on its total and signed domination numbers, as well as upper bounds for $\rho_{n}^{a}(G)$, respectively. Those results generalize the corresponding known results on $a=-1$ due to Fernau, Rodríguez-Velázquez and Sigarreta (2004), Rodríguez-Velázquez, Yero and Sigarreta (2009) and Shi, Kang and Wu (2010), respectively.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: Sono-photocatalysis for continuous-flow intensification: A disruptive strategy for lignocellulose valorization
Sono-fotokataliza dla intensyfikacji przepływu ciągłego: przełomowa strategia waloryzacji lignocelulozy
Autorzy:: Colmenares Quintero, Juan Carlos
Hsu, Hsien-Yi
Xu, Yi-Jun
Varma, Rajender S.
Hashemi Hosseini, Behdokht
Paszkiewicz-Gawron, Marta
Wydawca:: Elsevier
Cytata wydawnicza:: Behdokht Hashemi Hosseini, Marta Paszkiewicz-Gawron, Rajender S. Varma, Yi-Jun Xu, Hsien-Yi Hsu, Juan Carlos Colmenares Quintero, Sono-photocatalysis for continuous-flow intensification: A disruptive strategy for lignocellulose valorization, Applied Catalysis O: Open, Volume 193, 2024, 206973, ISSN 2950-6484, https://doi.org/10.1016/j.apcato.2024.206973.
Opis:: National Science Center (NCN), Poland, OPUS 20 No. 2020/39/B/ST5/00076.
The valorization of lignocellulosic biomass represents a significant frontier in scientific research, promising a sustainable source of renewable energy and valuable chemical compounds. Traditional methods for converting lignocellulose often suffer from challenges such as low selectivity, suboptimal yield, and high energy consumption. To address these issues, innovative approaches that blend different catalytic processes are gaining traction. One such approach is the combination of sonication with photocatalysis in continuous-flow systems. This method offers the potential to revolutionize lignocellulose valorization by enhancing process efficiency and selectivity, thus opening new pathways for producing high-value chemicals and energy sources. This paper delves into the potential of integrating sonication and photocatalysis for lignocellulose conversion within continuous-flow systems. It discusses the opportunities that arise from this synergistic approach, as well as the associated challenges, such as the need for precise control of reaction conditions and the integration of scalable technologies. Moreover, a critical review of the current state of the art in this domain is provided to highlight recent advancements and identify avenues for future exploration. This paper is particularly relevant to researchers, engineers, and professionals in chemical engineering, renewable energy, and environmental science who are focused on sustainable technologies and biomass conversion. It is also valuable for academic and industrial stakeholders seeking innovative solutions to enhance the efficiency and sustainability of biomass processing.
Dostawca treści:: Repozytorium Centrum Otwartej Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "Xu, Jun" wg kryterium: Autor