Temat: self-decomposition - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Assessment of threat arising by exploitation of acetylene
Autorzy:: Papliński, Andrzej
Powiązania:: https://bibliotekanauki.pl/articles/111131.pdf
Data publikacji:: 2020
Wydawca:: Centrum Rzeczoznawstwa Budowlanego Sp. z o.o.
Tematy:: acetylene
self-decomposition
combustion and explosion parameters
Opis:: In the paper base reactivity parameters of acetylene are considered. The terms of safe usage of acetylene are interpreted and related to their molecular structure. Unusual susceptibility of acetylene to exothermic self-decomposition is analysed. Chemical composition and parameters of acetylene decomposition at various initial states are estimated in thermodynamic calculations. Combustion and explosion of acetylene/air and acetylene/oxygen mixtures are estimated in full range of acetylene concentration.
Źródło:: Inżynieria Bezpieczeństwa Obiektów Antropogenicznych; 2020, 3; 1-14
2450-1859
2450-8721
Pojawia się w:: Inżynieria Bezpieczeństwa Obiektów Antropogenicznych
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Using Singular Value Decomposition (SVD) as a solution for search result clustering
Autorzy:: Abdulla, H. D.
Abdelrahman, A. S.
Snasel, V.
Powiązania:: https://bibliotekanauki.pl/articles/377259.pdf
Data publikacji:: 2014
Wydawca:: Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:: singular value decomposition
clustering
self-organizing map
Opis:: There are many search engines in the web, but they return a long list of search results, ranked by their relevancies to the given query. Web users have to go through the list and examine the titles and (short) snippets sequentially to identify their required results. In this paper we present how usage of Singular Value Decomposition (SVD) as a very good solution for search results clustering. Results are presented by visualizing neural network. Neural network is responsive for reducing result dimension to two dimensional space and we are able to present result as a picture that we are able to analyze.
Źródło:: Poznan University of Technology Academic Journals. Electrical Engineering; 2014, 80; 71-78
1897-0737
Pojawia się w:: Poznan University of Technology Academic Journals. Electrical Engineering
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Orthogonal double covers of complete graphs by fat caterpillars
Autorzy:: Froncek, Dalibor
Leck, Uwe
Powiązania:: https://bibliotekanauki.pl/articles/743983.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: ODC
orthogonal double cover
graph decomposition
self-orthogonal factorization
Opis:: An orthogonal double cover (ODC) of the complete graph Kₙ by some graph G is a collection of n spanning subgraphs of Kₙ, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kₙ is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n-1 edges. We show that for any given positive integer d, almost all caterpillars of diameter d admit an ODC of the corresponding complete graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2006, 26, 2; 343-349
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja