Wszystkie pola: cut number - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On one analytical solution of the mass transfer problem in multistage installations with constant cut numbers
Autorzy:: Sulaberidze, G. A.
Borisevich, V. D.
Guliev, D. Zh.
Powiązania:: https://bibliotekanauki.pl/articles/346985.pdf
Data publikacji:: 2003
Wydawca:: Politechnika Bydgoska im. Jana i Jędrzeja Śniadeckich. Wydział Technologii i Inżynierii Chemicznej
Tematy:: multicomponent isotope mixture
separation cascade
cut number
mass transfer regularities
Opis:: Separation of binary isotope mixtures in multistage installations consisting of separation elements with constant cut numbers and separation factors is considered. The analytical solution for component concentration distributions over a cascade with constant cut numbers is obtained. Major mass transfer regularities in such a kind of cascades are reviewed.
Źródło:: Ars Separatoria Acta; 2003, 2; 7-17
1731-6340
Pojawia się w:: Ars Separatoria Acta
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: The signless Laplacian spectral radius of graphs with given number of cut vertices
Autorzy:: Cui, Lin
Fan, Yi-Zheng
Powiązania:: https://bibliotekanauki.pl/articles/744527.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph
cut vertex
signless Laplacian matrix
spectral radius
Opis:: In this paper, we determine the graph with maximal signless Laplacian spectral radius among all connected graphs with fixed order and given number of cut vertices.
Źródło:: Discussiones Mathematicae Graph Theory; 2010, 30, 1; 85-93
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Lower bounds for the domination number
Autorzy:: Delaviña, Ermelinda
Pepper, Ryan
Waller, Bill
Powiązania:: https://bibliotekanauki.pl/articles/744047.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: domination number
radius
matching
cut-vertices
Opis:: In this note, we prove several lower bounds on the domination number of simple connected graphs. Among these are the following: the domination number is at least two-thirds of the radius of the graph, three times the domination number is at least two more than the number of cut-vertices in the graph, and the domination number of a tree is at least as large as the minimum order of a maximal matching.
Źródło:: Discussiones Mathematicae Graph Theory; 2010, 30, 3; 475-487
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: SPH - a comparison of neighbor search methods based on constant number of neighbors and constant cut-off radius
Autorzy:: Wróblewski, P.
Kopeć, M.
Boryczko, Krzysztof
Powiązania:: https://bibliotekanauki.pl/articles/1933174.pdf
Data publikacji:: 2007
Wydawca:: Politechnika Gdańska
Tematy:: SPH
simulations
incompressible fluids
constant cut-off radius method
constant number of neighbors method
breaking dam
side gap
time effectiveness
Opis:: Two methods of neighbor search for the SPH algorithm are presented, based on a constant number of neighbors and a constant cut-off radius. First, feasible methods of comparison were analyzed. Then, the two selected methods were compared visually and computationally. Considering the use of the SPH algorithm for simulating incompressible fluids, the obtained results suggest that the method with a constant cut-off radius is better than that with a constant number of neighbors. The simulation results of both methods are practically indistinguishable, while the computational costs favor one of them.
Źródło:: TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2007, 11, 3; 273-283
1428-6394
Pojawia się w:: TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers
Autorzy:: Goyal, Vandana
Rani, Namrata
Gupta, Deepak
Powiązania:: https://bibliotekanauki.pl/articles/2175831.pdf
Data publikacji:: 2022
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:: multi-objective quadratic fractional programming model
MOQFPM
pentagonal fuzzy number
PFN
mean method of α-cut
parametric approach
ε-constraint method
Opis:: This study proposes a methodology to obtain an efficient solution for a programming model which is multi-objective quadratic fractional with pentagonal fuzzy numbers as coefficients in all the objective functions and constraints. The proposed approach consists of three stages. In the first stage, defuzzification of the coefficients is carried out using the mean method of α-cut. Then, in the second stage, a crisp multi-objective quadratic fractional programming model (MOQFP) is constructed to obtain a non-fractional model based on an iterative parametric approach. In the final stage, this multi- -objective non-fractional model is transformed to obtain a model with a single objective by applying the ε-constraint method. This final model is then solved to get desired solution. Also, an algorithm and flowchart expressing the methodology are given to present a clear picture of the approach. Finally, a numerical example illustrating the complete approach is given.
Źródło:: Operations Research and Decisions; 2022, 32, 1; 49--71
2081-8858
2391-6060
Pojawia się w:: Operations Research and Decisions
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "cut number" wg kryterium: Wszystkie pola

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język