Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Song, Wen" wg kryterium: Autor


Wyświetlanie 1-6 z 6
Tytuł:
On the connectivity of efficient point sets
Autorzy:
Song, Wen
Powiązania:
https://bibliotekanauki.pl/articles/1339089.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
vector optimization
efficient point sets
density
connectivity
Opis:
The connectivity of the efficient point set and of some proper efficient point sets in locally convex spaces is investigated.
Źródło:
Applicationes Mathematicae; 1998-1999, 25, 1; 121-127
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On automatic boundedness of Nemytskiĭ set-valued operators
Autorzy:
Rolewicz, S.
Song, Wen
Powiązania:
https://bibliotekanauki.pl/articles/1289712.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Nemytskiĭ set-valued operators
superposition measurable set-valued operators
automatic boundedness
modular spaces
Opis:
Let X, Y be two separable F-spaces. Let (Ω,Σ,μ) be a measure space with μ complete, non-atomic and σ-finite. Let $N_F$ be the Nemytskiĭ set-valued operator induced by a sup-measurable set-valued function $F:Ω × X → 2^{Y}$. It is shown that if $N_F$ maps a modular space $(N(L(Ω,Σ,μ;X)), ϱ_{N,μ})$ into subsets of a modular space $(M(L(Ω,Σ,μ;Y)),ϱ_{M,μ})$, then $N_F$ is automatically modular bounded, i.e. for each set K ⊂ N(L(Ω,Σ,μ;X)) such that $r_K = sup{ϱ_{N,μ}(x) : x ∈ K} < ∞$ we have $sup{ϱ_{M,μ}(y): y ∈ N_F(K)} < ∞$.
Źródło:
Studia Mathematica; 1995, 113, 1; 65-72
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong Edge-Coloring Of Planar Graphs
Autorzy:
Song, Wen-Yao
Miao, Lian-Ying
Powiązania:
https://bibliotekanauki.pl/articles/31341618.pdf
Data publikacji:
2017-11-27
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
strong edge-coloring
strong chromatic index
planar graph
dis- charging method
Opis:
A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by $ \chi_s^' (G) $ the strong chromatic index of $G$ which is the smallest integer $k$ such that $G$ can be strongly edge-colored with $k$ colors. It is known that every planar graph $G$ has a strong edge-coloring with at most $ 4 \Delta (G) + 4 $ colors [R.J. Faudree, A. Gyárfás, R.H. Schelp and Zs. Tuza, The strong chromatic index of graphs, Ars Combin. 29B (1990) 205–211]. In this paper, we show that if $G$ is a planar graph with $ g \ge 5$, then $ \chi_s^' (G) \le 4 \Delta (G) − 2 $ when $ \Delta (G) \ge 6 $ and $ \chi_s^' (G) \le 19 $ when $ \Delta (G) = 5 $, where $g$ is the girth of $G$.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 4; 845-857
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Autorzy:
Song, Wen-Yao
Miao, Lian-Ying
Duan, Yuan-Yuan
Powiązania:
https://bibliotekanauki.pl/articles/32083736.pdf
Data publikacji:
2020-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
neighbor sum distinguishing total choosability
maximum degree
IC-planar graph
Combinatorial Nullstellensatz
Opis:
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph $G$ has a drawing in the plane such that every two crossings are independent, then we call $G$ a plane graph with independent crossings or IC-planar graph for short. A proper total-$k$-coloring of a graph $G$ is a mapping $ c : V (G) \cup E(G) \rightarrow \{ 1, 2, . . ., k \} $ such that any two adjacent elements in $ V (G) \cup E(G) $ receive different colors. Let $ \Sigma_c (v) $ denote the sum of the color of a vertex $v$ and the colors of all incident edges of $v$. A total-$k$-neighbor sum distinguishing-coloring of $G$ is a total-$k$-coloring of $G$ such that for each edge $ uv \in E(G)$, $\Sigma_c (u) \ne \Sigma_c (v) $. The least number $k$ needed for such a coloring of $G$ is the neighbor sum distinguishing total chromatic number, denoted by $ \chi_\Sigma^{''} (G) $. In this paper, it is proved that if $G$ is an IC-planar graph with maximum degree $ \Delta (G) $, then $ ch_\Sigma^{''} (G) \le \text{max} \{ \Delta (G)+3, 17 \} $, where $ ch_\Sigma^{''} (G) $ is the neighbor sum distinguishing total choosability of $G$.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 1; 331-344
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The solution set of a differential inclusionon a closed set of a Banach space
Autorzy:
Wen, Song
Powiązania:
https://bibliotekanauki.pl/articles/1340348.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
differential inclusion
relaxation theorem
well-posedness
Opis:
We consider differential inclusions with state constraints in a Banach space and study the properties of their solution sets. We prove a relaxation theorem and we apply it to prove the well-posedness of an optimal control problem.
Źródło:
Applicationes Mathematicae; 1995-1996, 23, 1; 13-23
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reverse flotation of collophanite at natural pH using isooctyl polyoxyethylene ether phosphate as a collector
Autorzy:
Li, Hongqiang
Zhang, Wen
Chen, Qian
Huang, Peng
Kasomo, Richard M.
Zou, Ze
Weng, Xiaoqing
He, Dongsheng
Yang, Siyuan
Song, Shaoxian
Powiązania:
https://bibliotekanauki.pl/articles/1445877.pdf
Data publikacji:
2021
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
reverse flotation
dolomite
fluorapatite
AEP
selective adsorption
Opis:
Reverse flotation of collophanite at natural pH could significantly decrease the cost of pH regulators. In this study, isooctyl polyoxyethylene ether phosphate (AEP) was tested as a new surfactant in the reverse flotation of collophanite. Micro-flotation tests were conducted, and the adsorption mechanism of the new collector was analysed using X-ray photoelectron spectroscopy (XPS) and zeta potential analyses. The results of the flotation tests demonstrated that AEP could enable dolomite to float under natural pH (pH=7.2) and showed profound selectivity towards dolomite as opposed to fluorapatite. Based on the zeta potential and XPS results, the adsorption phenomena are mainly attributed to calcium active sites on both mineral surfaces. Dolomite possesses more magnesium active sites than fluorapatite, which tend to reinforce the interaction effect between AEP and dolomite. Furthermore, when compared to CO32- ions on the dolomite surface, PO43- ions on the fluorapatite surface tend to exhibit a stronger hindrance to the adsorption of AEP on the fluorapatite surface. This is attributed to their larger volumes and more charges on their surfaces, thereby causing a floatability difference between the two minerals.
Źródło:
Physicochemical Problems of Mineral Processing; 2021, 57, 4; 78-86
1643-1049
2084-4735
Pojawia się w:
Physicochemical Problems of Mineral Processing
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies