Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Decomposition" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 695
Tytuł:
Audio and image encryption scheme based on QR decomposition and random modulus decomposition in Fresnel domain
Autorzy:
Anjana, Savita
Yadav, Ak
Singh, Phool
Singh, Hukum
Powiązania:
https://bibliotekanauki.pl/articles/2172830.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
QR decomposition
audio encryption
random modulus decomposition
Opis:
In this paper, an asymmetric audio and image encryption mechanism using QR decomposition and random modulus decomposition (RD) in the Fresnel domain is proposed. The audio file is recorded as a vector and converted to a two-dimensional array to act as an image or a sound map. This sound map is encrypted using the image encryption algorithm proposed in this paper. The proposed cryptosystem is validated for both audios and grayscale images. Fresnel parameters and the two private keys obtained from QR decomposition and random modulus decomposition (RD) form the key space. Computer-based reproductions have been carried out to prove the validity and authenticity of the scheme. Simulation results authenticate that the scheme is robust and efficient against various attacks and is sensitive to input parameters.
Źródło:
Optica Applicata; 2022, 52, 3; 359--374
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decompositions into two paths
Autorzy:
Skupień, Zdzisław
Powiązania:
https://bibliotekanauki.pl/articles/744378.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph
multigraph
path decomposition
hamiltonian decomposition
traceable
Opis:
It is proved that a connected multigraph G which is the union of two edge-disjoint paths has another decomposition into two paths with the same set, U, of endvertices provided that the multigraph is neither a path nor cycle. Moreover, then the number of such decompositions is proved to be even unless the number is three, which occurs exactly if G is a tree homeomorphic with graph of either symbol + or ⊥. A multigraph on n vertices with exactly two traceable pairs is constructed for each n ≥ 3. The Thomason result on hamiltonian pairs is used and is proved to be sharp.
Źródło:
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 325-329
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposition of complete graphs into factors of diameter two and three
Autorzy:
Vukicević, Damir
Powiązania:
https://bibliotekanauki.pl/articles/743378.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
decomposition
graph
Opis:
We analyze a minimum number of vertices of a complete graph that can be decomposed into one factor of diameter 2 and k factors of diameter at most 3. We find exact values for k ≤ 4 and the asymptotic value of the ratio of this number and k when k tends to infinity. We also find the asymptotic value of the ratio of the number of vertices of the smallest complete graph that can be decomposed into p factors of diameter 2 and k factors of diameter 3 and number k when p is fixed.
Źródło:
Discussiones Mathematicae Graph Theory; 2003, 23, 1; 37-54
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails
Autorzy:
Cichacz, Sylwia
Powiązania:
https://bibliotekanauki.pl/articles/743753.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
trail
decomposition
Opis:
It has been shown [3] that any bipartite graph $K_{a,b}$, where a, b are even integers, can be decomposed into closed trails with prescribed even lengths. In this article, we consider the corresponding question for directed bipartite graphs. We show that a complete directed bipartite graph $^↔ K_{a,b}$ is decomposable into directed closed trails of even lengths greater than 2, whenever these lengths sum up to the size of the digraph. We use this result to prove that complete bipartite multigraphs can be decomposed in a similar manner.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 2; 241-249
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Synthesis and Characterization of Polyethylene Glycol Dinitrates
Autorzy:
Matyáš, R.
Šelešovský, J.
Jalový, Z.
Roháčová, J.
Powiązania:
https://bibliotekanauki.pl/articles/358415.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Przemysłu Organicznego
Tematy:
polyethylene glycol dinitrate
synthesis
properties
decomposition
kinetic decomposition
Opis:
Polyethylene glycol dinitrates (PEGN) with molecular weights between 400 and 20 000 gźmol-1 were prepared from polyethylene glycols by esterifcation with nitric acid/sulfuric acid in dichloromethane. The products were characterized by gel permeation chromatography. The yield of PEGN increases with increasing reaction temperature (0-40 °C) however large liberation of nitrogen oxides was observed at 40 °C. No infuence of reaction temperature (0-40 °C) on the cleavage of the polyethylene glycol chain during esterifcation was observed. The dependence of melting point on the molecular weight of PEGN was determined. Polyethylene glycol dinitrates with molecular weights Mn above 454 are not sensitive to impact. Heat of combustion of PEGN increases with increasing molecular weight. All samples tested decompose in a similar way during thermal exposition.
Źródło:
Central European Journal of Energetic Materials; 2011, 8, 3; 145-155
1733-7178
Pojawia się w:
Central European Journal of Energetic Materials
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Speech Enhancement Based on Constrained Low-rank Sparse Matrix Decomposition Integrated with Temporal Continuity Regularisation
Autorzy:
Sun, Chengli
Yuan, Conglin
Powiązania:
https://bibliotekanauki.pl/articles/178075.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
speech enhancement
temporal continuity
low-rank decomposition
sparse decomposition
Opis:
Speech enhancement in strong noise condition is a challenging problem. Low-rank and sparse matrix decomposition (LSMD) theory has been applied to speech enhancement recently and good performance was obtained. Existing LSMD algorithms consider each frame as an individual observation. However, real-world speeches usually have a temporal structure, and their acoustic characteristics vary slowly as a function of time. In this paper, we propose a temporal continuity constrained low-rank sparse matrix decomposition (TCCLSMD) based speech enhancement method. In this method, speech separation is formulated as a TCCLSMD problem and temporal continuity constraints are imposed in the LSMD process. We develop an alternative optimisation algorithm for noisy spectrogram decomposition. By means of TCCLSMD, the recovery speech spectrogram is more consistent with the structure of the clean speech spectrogram, and it can lead to more stable and reasonable results than the existing LSMD algorithm. Experiments with various types of noises show the proposed algorithm can achieve a better performance than traditional speech enhancement algorithms, in terms of yielding less residual noise and lower speech distortion.
Źródło:
Archives of Acoustics; 2019, 44, 4; 681-692
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposition of multigraphs
Autorzy:
Kouider, Mekkia
Mahéo, Maryvonne
Bryś, Krzysztof
Lonc, Zbigniew
Powiązania:
https://bibliotekanauki.pl/articles/744229.pdf
Data publikacji:
1998
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge decomposition
multigraph
Opis:
In this note, we consider the problem of existence of an edge-decomposition of a multigraph into isomorphic copies of 2-edge paths $K_{1,2}$. We find necessary and sufficient conditions for such a decomposition of a multigraph H to exist when
(i) either H does not have incident multiple edges or
(ii) multiplicities of the edges in H are not greater than two. In particular, we answer a problem stated by Z. Skupień.
Źródło:
Discussiones Mathematicae Graph Theory; 1998, 18, 2; 225-232
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Packing the Hypercube
Autorzy:
Offner, David
Powiązania:
https://bibliotekanauki.pl/articles/30147221.pdf
Data publikacji:
2014-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hypercube
packing
decomposition
Opis:
Let G be a graph that is a subgraph of some n-dimensional hypercube Qn. For sufficiently large n, Stout [20] proved that it is possible to pack vertex-disjoint copies of G in Qn so that any proportion r < 1 of the vertices of Qn are covered by the packing. We prove an analogous theorem for edge-disjoint packings: For sufficiently large n, it is possible to pack edge-disjoint copies of G in Qn so that any proportion r < 1 of the edges of Qn are covered by the packing.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 1; 85-93
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Specific Boolean Functions
Autorzy:
Mazurkiewicz, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/307986.pdf
Data publikacji:
2020
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
logic synthesis
functional decomposition
non-disjoint decomposition
index generation functions
Opis:
Functional decomposition is a technique that allows to minimize Boolean functions that cannot be optimally minimized using other methods, such as variable reduction and linear decomposition. A heuristic method for finding nondisjoint decomposition has been proposed lately. In this paper, we examine how the usage of different graph theory techniques affects the computation time and the quality of the solution obtained. In total, six dfferent approaches were analyzed. The results presented herein prove the advantages of the proposed approaches, showing that results obtained for standard benchmark M-out-of-20 functions are better than those presented in previous publication. Results obtained for randomly generated functions prove that time complexity and scalability are significantly better when using the heuristic graph coloring algorithm. However, quality of the solution is worse, in general.
Źródło:
Journal of Telecommunications and Information Technology; 2020, 3; 67-74
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Measuring energy efficiency - structural and index decomposition analysis
Autorzy:
Stachura, Paulina
Powiązania:
https://bibliotekanauki.pl/articles/14451975.pdf
Data publikacji:
2018-12-22
Wydawca:
Wyższa Szkoła Bankowa we Wrocławiu
Tematy:
energy efficiency
index decomposition analysis
structural decomposition analysis
indicators
energy
Opis:
Aim: The aim is to recognize the main determinants of the energy efficiency improvement in transport in Poland in the years 2000-2014 using structural and index decomposition analysis, and to identify areas where there is still potential for further reduction of energy consumption. Design / Research methods: Techniques used to analyse changes in energy use are: structural decomposition analysis and index decomposition analysis. Each of these two methods is characterized by distinctive, unique techniques and approaches, as they have developed quite independently. Index decomposition analysis measures the impact of energy efficiency gains on the level of energy consumption, at the most detailed sector disaggregation level allowed by the available data. Whereas structural decomposition analysis allows to analyse the impact of the external factors, such as technological, demand, and demographic effects, on the fluctuations of the total energy consumption. The similarities and differences between the two approaches are summarized and illustrated with a numerical example of Polish transport. Conclusions / findings: The article recognizes the main determinants of the energy efficiency improvement in transport sector in Poland in the years 2000-2014. In case of Poland ODEX shows an overall progress of energy efficiency in transport by 24.3%. Results obtained with decomposition analysis indicate large divergences in energy efficiency improvements between modes of transport and vehicle types and identify areas where there is still potential for further reduction of energy consumption. Results from decomposing structure of energy use, show activity effect to be main reason for energy use growth. The distribution of each mode in total traffic of passengers and goods changes toward less energy efficient modes. The only factor driving down the energy use is energy savings.Originality / value of the article: Using two methods of decomposition analysis and comparing obtained outcomes allows to get a broader view on energy use trends. Results presented in this article are a good starting point for further detailed analysis of changes in energy use of transport.
Źródło:
Central European Review of Economics and Management; 2018, 2, 4; 71-86
2543-9472
Pojawia się w:
Central European Review of Economics and Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Completeness of $L_1$ spaces over finitely additive probabilities
Autorzy:
Gangopadhyay, S.
Rao, B.
Powiązania:
https://bibliotekanauki.pl/articles/1396052.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Sobczyk-Hammer decomposition
Hewitt-Yosida decomposition
$L_1$ space
strategic products
Źródło:
Colloquium Mathematicum; 1999, 80, 1; 83-95
0010-1354
Pojawia się w:
Colloquium Mathematicum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Approximate solution of painlevé equation i by natural decomposition method and laplace decomposition method
Autorzy:
Amir, Muhammad
Haider, Jamil Abbase
Ahmad, Shahbaz
Ashraf, Asifa
Gul, Sana
Powiązania:
https://bibliotekanauki.pl/articles/2233067.pdf
Data publikacji:
2023
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
natural decomposition method
Laplace decomposition method
series solution
Adomain polynomial
Painlevéequation
Opis:
The Painlevé equations and their solutions occur in some areas of theoretical physics, pure and applied mathematics. This paper applies natural decomposition method (NDM) and Laplace decomposition method (LDM) to solve the second-order Painlevé equation. These methods are based on the Adomain polynomial to find the non-linear term in the differential equation. The approximate solution of Painlevé equations is determined in the series form, and recursive relation is used to calculate the remaining components. The results are compared with the existing numerical solutions in the literature to demonstrate the efficiency and validity of the proposed methods. Using these methods, we can properly handle a class of non-linear partial differential equations (NLPDEs) simply. Novelty: One of the key novelties of the Painlevé equations is their remarkable property of having only movable singularities, which means that their solutions do not have any singularities that are fixed in position. This property makes the Painlevé equations particularly useful in the study of non-linear systems, as it allows for the construction of exact solutions in certain cases. Another important feature of the Painlevé equations is their appearance in diverse fields such as statistical mechanics, random matrix theory and soliton theory. This has led to a wide range of applications, including the study of random processes, the dynamics of fluids and the behaviour of non-linear waves.
Źródło:
Acta Mechanica et Automatica; 2023, 17, 3; 417--422
1898-4088
2300-5319
Pojawia się w:
Acta Mechanica et Automatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposition of complete graphs into small graphs
Autorzy:
Froncek, D.
Powiązania:
https://bibliotekanauki.pl/articles/255502.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
graph decomposition
graph labeling
Opis:
In 1967, A. Rosa proved that if a bipartite graph G with n edges has an α-labeling, then for any positive integer p the complete graph K(2np+1) can be cyclically decomposed into copies of G. This has become a part of graph theory folklore since then. In this note we prove a generalization of this result. We show that every bipartite graph H which decomposes K(k) and K(m) also decomposes K(km).
Źródło:
Opuscula Mathematica; 2010, 30, 3; 277-280
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the completeness of decomposable properties of graphs
Autorzy:
Hałuszczak, Mariusz
Vateha, Pavol
Powiązania:
https://bibliotekanauki.pl/articles/744156.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
decomposition
hereditary property
completeness
Opis:
Let ₁,₂ be additive hereditary properties of graphs. A (₁,₂)-decomposition of a graph G is a partition of E(G) into sets E₁, E₂ such that induced subgraph $G[E_i]$ has the property $_i$, i = 1,2. Let us define a property ₁⊕₂ by {G: G has a (₁,₂)-decomposition}.
A property D is said to be decomposable if there exists nontrivial additive hereditary properties ₁, ₂ such that D = ₁⊕₂. In this paper we determine the completeness of some decomposable properties and we characterize the decomposable properties of completeness 2.
Źródło:
Discussiones Mathematicae Graph Theory; 1999, 19, 2; 229-236
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
C7-Decompositions of the Tensor Product of Complete Graphs
Autorzy:
Manikandan, R.S.
Paulraja, P.
Powiązania:
https://bibliotekanauki.pl/articles/31341796.pdf
Data publikacji:
2017-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
cycle decomposition
tensor product
Opis:
In this paper we consider a decomposition of Km × Kn, where × denotes the tensor product of graphs, into cycles of length seven. We prove that for m, n ≥ 3, cycles of length seven decompose the graph Km × Kn if and only if (1) either m or n is odd and (2) 14 | m(m − 1)n(n − 1). The results of this paper together with the results of [Cp-Decompositions of some regular graphs, Discrete Math. 306 (2006) 429–451] and [C5-Decompositions of the tensor product of complete graphs, Australasian J. Combinatorics 37 (2007) 285–293], give necessary and sufficient conditions for the existence of a p-cycle decomposition, where p ≥ 5 is a prime number, of the graph Km × Kn.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 3; 523-535
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 695

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