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ę "factorization" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 67
Tytuł:
Théorèmes de factorisation dans les algèbres normées complètes non associatives
Autorzy:
Akkar, M.
Laayouni, M.
Powiązania:
https://bibliotekanauki.pl/articles/966861.pdf
Data publikacji:
1996
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Jordan-Banach algebras
factorization
Źródło:
Colloquium Mathematicum; 1996, 70, 2; 253-264
0010-1354
Pojawia się w:
Colloquium Mathematicum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Note on cyclic decompositions of complete bipartite graphs into cubes
Autorzy:
Fronček, Dalibor
Powiązania:
https://bibliotekanauki.pl/articles/744154.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hypercubes
bipartite graphs
factorization
Opis:
So far, the smallest complete bipartite graph which was known to have a cyclic decomposition into cubes $Q_d$ of a given dimension d was $K_{d2^{d-1}, d2^{d-2}}$. We improve this result and show that also $K_{d2^{d-2}, d2^{d-2}}$ allows a cyclic decomposition into $Q_d$. We also present a cyclic factorization of $K_{8,8}$ into Q₄.
Źródło:
Discussiones Mathematicae Graph Theory; 1999, 19, 2; 219-227
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Unique prime factorization in a partial semigroup of matrix-polynomials
Autorzy:
Kaltenbäck, Michael
Woracek, Harald
Powiązania:
https://bibliotekanauki.pl/articles/729169.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
partial semigroup
unique prime factorization
Opis:
We establish a unique factorization result into irreducibel elements in the partial semigroup of 2 × 2-matrices with entries in K[x] whose determinant is equal to 1, where K is a field, and where multiplication is defined as the usual matrix-multiplication if the degrees of the factors add up. This investigation is motivated by a result on matrices of entire functions.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2006, 26, 1; 21-43
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A method of approximate factorization of positive definite matrix functions
Autorzy:
Janashia, Gigla
Lagvilava, Edem
Powiązania:
https://bibliotekanauki.pl/articles/1216256.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
positive definite matrix function
factorization
Opis:
An algorithm of factorization of positive definite matrix functions of second order is proposed.
Źródło:
Studia Mathematica; 1999, 137, 1; 93-100
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solution to the problem of Kubesa
Autorzy:
Meszka, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/743037.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
tree
T-factorization
degree sequence
Opis:
An infinite family of T-factorizations of complete graphs $K_{2n}$, where 2n = 56k and k is a positive integer, in which the set of vertices of T can be split into two subsets of the same cardinality such that degree sums of vertices in both subsets are not equal, is presented. The existence of such T-factorizations provides a negative answer to the problem posed by Kubesa.
Źródło:
Discussiones Mathematicae Graph Theory; 2008, 28, 2; 375-378
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On twin edge colorings of graphs
Autorzy:
Andrews, Eric
Helenius, Laars
Johnston, Daniel
VerWys, Jonathon
Zhang, Ping
Powiązania:
https://bibliotekanauki.pl/articles/30148690.pdf
Data publikacji:
2014-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge coloring
vertex coloring
factorization
Opis:
A twin edge $k$-coloring of a graph $G$ is a proper edge coloring of $G$ with the elements of $\mathbb{Z}_k$ so that the induced vertex coloring in which the color of a vertex $v$ in $G$ is the sum (in $\mathbb{Z}_k$) of the colors of the edges incident with $v$ is a proper vertex coloring. The minimum $k$ for which $G$ has a twin edge $k$-coloring is called the twin chromatic index of $G$. Among the results presented are formulas for the twin chromatic index of each complete graph and each complete bipartite graph
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 3; 613-627
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposing complete graphs into cubes
Autorzy:
El-Zanati, Saad
Eynden, C.
Powiązania:
https://bibliotekanauki.pl/articles/743903.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph decomposition
graph factorization
d-cube
Opis:
This paper concerns when the complete graph on n vertices can be decomposed into d-dimensional cubes, where d is odd and n is even. (All other cases have been settled.) Necessary conditions are that n be congruent to 1 modulo d and 0 modulo $2^d$. These are known to be sufficient for d equal to 3 or 5. For larger values of d, the necessary conditions are asymptotically sufficient by Wilson's results. We prove that for each odd d there is an infinite arithmetic progression of even integers n for which a decomposition exists. This lends further weight to a long-standing conjecture of Kotzig.
Źródło:
Discussiones Mathematicae Graph Theory; 2006, 26, 1; 141-147
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cyclic decompositions of complete graphs into spanning trees
Autorzy:
Froncek, Dalibor
Powiązania:
https://bibliotekanauki.pl/articles/744515.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph factorization
graph labelling
spanning trees
Opis:
We examine decompositions of complete graphs with an even number of vertices, $K_{2n}$, into n isomorphic spanning trees. While methods of such decompositions into symmetric trees have been known, we develop here a more general method based on a new type of vertex labelling, called flexible q-labelling. This labelling is a generalization of labellings introduced by Rosa and Eldergill.
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 2; 345-353
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed accelerated projection-based consensus decomposition
Autorzy:
Maj, Wiktor
Powiązania:
https://bibliotekanauki.pl/articles/2197532.pdf
Data publikacji:
2022
Wydawca:
Politechnika Gdańska
Tematy:
factorization approximation
numerical optimization
distributed computing
acceleration
Opis:
With the development of machine learning and Big Data, the concepts of linear and non-linear optimization techniques are becoming increasingly valuable for many quantitative disciplines. Problems of that nature are typically solved using distinctive optimization algorithms, iterative methods, or heuristics. A new variant of the Accelerated Projection-Based Consensus (APC) iterative method is proposed, which is faster than its classical version while handling large sparse matrices in distributed settings. The algorithm is proposed, and its description and implementation in a high-level programming language are presented. Convergence tests measuring acceleration factors based on real-world datasets are done, and their results are promising. The results of this research can be used as an alternative to solving numerical optimization problems.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2022, 26, 2; 32-38
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Unique factorisation of additive induced-hereditary properties
Autorzy:
Farrugia, Alastair
Richter, R.
Powiązania:
https://bibliotekanauki.pl/articles/744519.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
additive and hereditary graph classes
unique factorization
Opis:
An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ₁,...,ₙ be additive hereditary graph properties. A graph G has property (₁∘...∘ₙ) if there is a partition (V₁,...,Vₙ) of V(G) into n sets such that, for all i, the induced subgraph $G[V_i]$ is in $_i$. A property is reducible if there are properties , such that = ∘ ; otherwise it is irreducible. Mihók, Semanišin and Vasky [8] gave a factorisation for any additive hereditary property into a given number dc() of irreducible additive hereditary factors. Mihók [7] gave a similar factorisation for properties that are additive and induced-hereditary (closed under taking induced-subgraphs and disjoint unions). Their results left open the possiblity of different factorisations, maybe even with a different number of factors; we prove here that the given factorisations are, in fact, unique.
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 2; 319-343
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ascending Subgraph Decompositions of Oriented Graphs that Factor into Triangles
Autorzy:
Austin, Andrea D.
Wagner, Brian C.
Powiązania:
https://bibliotekanauki.pl/articles/32304154.pdf
Data publikacji:
2022-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
ascending subgraph decomposition
graph factorization
Oberwolfach problem
Opis:
In 1987, Alavi, Boals, Chartrand, Erdős, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). In a previous paper, Wagner showed that all oriented complete balanced tripartite graphs have an ASD. In this paper, we will show that all orientations of an oriented graph that can be factored into triangles with a large portion of the triangles being transitive have an ASD. We will also use the result to obtain an ASD for any orientation of complete multipartite graphs with 3n partite classes each containing 2 vertices (a K(2 : 3n)) or 4 vertices (a K(4 : 3n)).
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 3; 811-822
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Moving cast shadow detection using block nonnegative matrix factorization
Autorzy:
Yang, X.
Liu, D.
Zhou, D.
Yang, R.
Powiązania:
https://bibliotekanauki.pl/articles/200448.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
moving cast shadow detection
video surveillance
nonnegative matrix factorization
block nonnegative matrix factorization
nadzór wideo
nieujemna faktoryzacja macierzy
Opis:
In recent years, moving cast shadow detection has become a critical challenge in improving the accuracy of moving object detection in video surveillance. In this paper, we propose two novel moving cast shadow detection methods based on nonnegative matrix factorization (NMF) and block nonnegative matrix factorization (BNMF). First, the algorithm of moving cast shadow detection using NMF is given and the key points such as the determination of moving shadow areas and the choice of discriminant function are specified. Then BNMF are introduced so that the new training samples and new classes can be added constantly with lower computational complexity. Finally, the improved shadow detection method is detailed described according to BNMF. The effectiveness of proposed methods is evaluated in various scenes. Experimental results demonstrate that the method achieves high detection rate and outperforms several state-of-the-art methods.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 2; 229-234
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Gregarious Kite Factorization of Tensor Product of Complete Graphs
Autorzy:
Tamil Elakkiya, A.
Muthusamy, A.
Powiązania:
https://bibliotekanauki.pl/articles/31804152.pdf
Data publikacji:
2020-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
tensor product
kite
decomposition
gregarious factor
factorization
Opis:
A kite factorization of a multipartite graph is said to be gregarious if every kite in the factorization has all its vertices in different partite sets. In this paper, we show that there exists a gregarious kite factorization of Km × Kn if and only if mn ≡ 0 (mod 4) and (m − 1)(n − 1) ≡ 0 (mod 2), where × denotes the tensor product of graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 1; 7-24
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A newly developed method for computing reliability measures in a water supply network
Autorzy:
Malinowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/406322.pdf
Data publikacji:
2016
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
water supply network
reliability
series-parallel aggregation
factorization
Opis:
A reliability model of a water supply network has beens examined. Its main features are: a topology that can be decomposed by the so-called state factorization into a (relatively)small number of derivative networks, each having a series-parallel structure (1), binary-state components (either operative or failed) with given flow capacities (2), a multi-state character of the whole network and its sub-networks – a network state is defined as the maximal flow between a source (sources) and a sink (sinks) (3), all capacities (component, network, and sub-network) have integer values (4). As the network operates, its state changes due to component failures, repairs, and replacements. A newly developed method of computing the inter-state transition intensities has been presented. It is based on the so-called state factorization and series-parallel aggregation. The analysis of these intensities shows that the failure-repair process of the considered system is an asymptotically homogenous Markov process. It is also demonstrated how certain reliability parameters useful for the network maintenance planning can be determined on the basis of the asymptotic intensities. For better understanding of the presented method, an illustrative example is given.
Źródło:
Operations Research and Decisions; 2016, 26, 4; 49-64
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On unique factorization semilattices
Autorzy:
Silva, Pedro
Powiązania:
https://bibliotekanauki.pl/articles/728874.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
semilattice
factorization
principal ideal
semilattice embedding
Munn semigroup
Opis:
The class of unique factorization semilattices (UFSs) contains important examples of semilattices such as free semilattices and the semilattices of idempotents of free inverse monoids. Their structural properties allow an efficient study, among other things, of their principal ideals. A general construction of UFSs from arbitrary posets is presented and some categorical properties are derived. The problem of embedding arbitrary semilattices into UFSs is considered and complete characterizations are obtained for particular classes of semilattices. The study of the Munn semigroup for regular UFSs is developed and a complete characterization is accomplished with respect to being E-unitary.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2000, 20, 1; 97-120
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 67

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