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ę "Kim, Boram" wg kryterium: Autor


Wyświetlanie 1-2 z 2
Tytuł:
A Study on Recovery of Cerium by Leaching Solvents from NiMH Waste Battery
Autorzy:
Kim, Boram
Kim, Dae-Weon
Choi, Hee Lack
Powiązania:
https://bibliotekanauki.pl/articles/2203709.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
NiMH
cerium recovery
rare earth composite powder
Opis:
In this study, a rare earth composite precipitation (NaREE(SO4)2H2O, REE: Ce, La, Nd, Pr) powder was prepared from spent nickel hydride batteries, and cerium hydroxide was separated from its constituent rare earth elements. As Ce(OH)3 can be oxidized more easily than other rare earth elements (La, Nd, and Pr), Ce3+ was converted to Ce4+ by injecting air into the leachate at 80°C for 4 h. The oxidized powder was leached using sulfuric and hydrochloric acids. Because Ce(OH)4 has low solubility, it can be separated from other elements. Therefore, the pH of the leaching solution was adjusted for selective precipitation. To determine the crystalline phase, recovery, and grade of the recovered Ce(OH)4, the powders were analyzed using X-ray diffraction, scanning electron microscopy, and inductively coupled plasma optical emission spectroscopy. The grade and recovery rates of the Ce(OH)4 powder recovered from the rare earth composite precipitate using sulfuric acid as the solvent were 95% and 97%, respectively, whereas those of the powder recovered using hydrochloric acid were 96% and 95%, respectively.
Źródło:
Archives of Metallurgy and Materials; 2023, 68, 1; 103--106
1733-3490
Pojawia się w:
Archives of Metallurgy and Materials
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The competition numbers of Johnson graphs
Autorzy:
Kim, Suh-Ryung
Park, Boram
Sano, Yoshio
Powiązania:
https://bibliotekanauki.pl/articles/744040.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
competition graph
competition number
edge clique cover
Johnson graph
Opis:
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of a graph G is defined to be the smallest number of such isolated vertices. In general, it is hard to compute the competition number k(G) for a graph G and to characterize all graphs with given competition number k has been one of the important research problems in the study of competition graphs.
The Johnson graph J(n,d) has the vertex set ${v_X | X ∈ \binom{[n]}{d}$, where $\binom{[n]}{d}$ denotes the set of all d-subsets of an n-set [n] = {1,..., n}, and two vertices $v_{X₁}$ and $v_{X₂}$ are adjacent if and only if |X₁ ∩ X₂| = d - 1. In this paper, we study the edge clique number and the competition number of J(n,d). Especially we give the exact competition numbers of J(n,2) and J(n,3).
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 3; 449-459
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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