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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-13 z 13
    Tytuł:
    The Role of CeO₂-Doping of γ-Al₂O₃ on its Structural and Superficial Area
    Autorzy:
    Aribi, K.
    Ghelamallah, M.
    Bellifa, A.
    Bousehaba, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/1030118.pdf
    Data publikacji:
    2017-09
    Wydawca:
    Polska Akademia Nauk. Instytut Fizyki PAN
    Tematy:
    γ-Al₂O₃
    CeO₂
    surface
    structure
    reducibility
    Opis:
    A series of samples, noted Al_xCe_{1-x} has been prepared by hydrolysis, from γ-Al₂O₃ and CeO₂. These samples were calcined under air at 450, 900 and 1200°C, and then characterized by specific surface area, X-ray diffraction and thermoreduction programmed under H₂. Obtained results show that after calcination at 450 and 900°C, the cerium decreases the surface of alumina. Results of X-ray diffraction and thermoreduction programmed under H₂ experiments showed that the samples are constituted of: γ-Al₂O₃ and CeO₂. The global consumption of hydrogen increase with rate of CeO₂ added. At 1200°C, the sintering of the samples is very important and γ-Al₂O₃ is transformed into the α-phase. The decrease in specific surface area is more accentuated for Al₁Ce₀ sample, since sintering occurs due to the growth in crystallite size. Thermoreduction programmed under H₂ experiments show that reduction of CeO₂ much more accentuated for ceria samples or its decrease can reflect some alterations of the nature of interactions between Al₂O₃ and CeO₂.
    Źródło:
    Acta Physica Polonica A; 2017, 132, 3; 445-447
    0587-4246
    1898-794X
    Pojawia się w:
    Acta Physica Polonica A
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Process engineering in iron production
    Autorzy:
    Pustejovska, P.
    Jursova, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/184940.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    heat balance
    kinetic model
    carbon consumption
    reducibility
    bilans cieplny
    model kinetyczny
    zużycie węgla
    redukowalność
    Opis:
    Balance, thermodynamic and mainly kinetic approaches using methods of process engineering enable to determine conditions under which iron technology can actually work in limiting technological states, at the lowest reachable fuel consumption (reducing factor) and the highest reachable productivity accordingly. Kinetic simulation can be also used for variant prognostic calculations. The paper deals with thermodynamics and kinetics of iron making process. It presents a kinetic model of iron oxide reduction in a low temperature area. In the experimental part it deals with testing of iron ore feedstock properties. The theoretical and practical limits determined by heat conditions, feedstock reducibility and kinetics of processes are calculated.
    Źródło:
    Chemical and Process Engineering; 2013, 34, 1; 63-76
    0208-6425
    2300-1925
    Pojawia się w:
    Chemical and Process Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Reducibility condition for nonlinear discrete-time systems: behavioral approach
    Autorzy:
    Bartosiewicz, Z.
    Kotta, U.
    Pawłuszewicz, E.
    Tonso, M.
    Wyrwas, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206211.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    nonlinear discrete-time systems reducibility
    behavioral approach
    left difference polynomials
    Opis:
    The paper addresses the problem of reducibility of nonlinear discrete-time systems, described by implicit higher order difference equations where no a priori distinction is made between input and output variables. The reducibility definition is based on the concept of autonomous element. We prove necessary reducibility condition, presented in terms of the left submodule, generated by the row matrix, describing the behavior of the linearized system, over the ring of left difference polynomials. Then the reducibility of the system implies the closedness of the submodule, like in the linear time-invariant case. In the special case, when the variables may be specified as inputs and outputs and the system equations are Niven in the explicit form, the results of this paper yield the known results.
    Źródło:
    Control and Cybernetics; 2013, 42, 2; 329-346
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties
    Autorzy:
    Drgas-Burchardt, Ewa
    Powiązania:
    https://bibliotekanauki.pl/articles/743169.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hereditary graph property
    lattice of additive hereditary graph properties
    minimal forbidden graph family
    join in the lattice
    reducibility
    Opis:
    An additive hereditary graph property is any class of simple graphs, which is closed under isomorphisms unions and taking subgraphs. Let $L^a$ denote a class of all such properties. In the paper, we consider H-reducible over $L^a$ properties with H being a fixed graph. The finiteness of the sets of all minimal forbidden graphs is analyzed for such properties.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2009, 29, 2; 263-274
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On infinite uniquely partitionable graphs and graph properties of finite character
    Autorzy:
    Bucko, Jozef
    Mihók, Peter
    Powiązania:
    https://bibliotekanauki.pl/articles/743160.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    graph property of finite character
    reducibility
    uniquely partitionable graphs
    weakly universal graph
    Opis:
    A graph property is any nonempty isomorphism-closed class of simple (finite or infinite) graphs. A graph property is of finite character if a graph G has a property if and only if every finite induced subgraph of G has a property . Let ₁,₂,...,ₙ be graph properties of finite character, a graph G is said to be (uniquely) (₁, ₂, ...,ₙ)-partitionable if there is an (exactly one) partition {V₁, V₂, ..., Vₙ} of V(G) such that $G[V_i] ∈ _i$ for i = 1,2,...,n. Let us denote by ℜ = ₁ ∘ ₂ ∘ ... ∘ ₙ the class of all (₁,₂,...,ₙ)-partitionable graphs. A property ℜ = ₁ ∘ ₂ ∘ ... ∘ ₙ, n ≥ 2 is said to be reducible. We prove that any reducible additive graph property ℜ of finite character has a uniquely (₁, ₂, ...,ₙ)-partitionable countable generating graph. We also prove that for a reducible additive hereditary graph property ℜ of finite character there exists a weakly universal countable graph if and only if each property $_i$ has a weakly universal graph.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2009, 29, 2; 241-251
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The use of complexity hierarchies in descriptive set theory and automata theory
    Autorzy:
    Andretta, A.
    Camerlo, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/1964199.pdf
    Data publikacji:
    2005
    Wydawca:
    Politechnika Gdańska
    Tematy:
    hierarchies
    infinite games
    Borel reducibility
    automata theory
    Opis:
    The concept of a reduction between subsets of a given space is described, giving rise to various complexity hierarchies, studied both in descriptive set theory and in automata theory. We discuss in particular the Wadge and Lipschitz hierarchies for subsets of the Baire and Cantor spaces and the hierarchy of Borel reducibility for finitary relations on standard Borel spaces. The notions of Wadge and Lipschitz reductions are related to corresponding perfect information games.
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2005, 9, 3; 337-356
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Criteria for of the existence of uniquely partitionable graphs with respect to additive induced-hereditary properties
    Autorzy:
    Broere, Izak
    Bucko, Jozef
    Mihók, Peter
    Powiązania:
    https://bibliotekanauki.pl/articles/743535.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    induced-hereditary properties
    reducibility
    divisibility
    uniquely partitionable graphs.
    Opis:
    Let ₁,₂,...,ₙ be graph properties, a graph G is said to be uniquely (₁,₂, ...,ₙ)-partitionable if there is exactly one (unordered) partition {V₁,V₂,...,Vₙ} of V(G) such that $G[V_i] ∈ _i$ for i = 1,2,...,n. We prove that for additive and induced-hereditary properties uniquely (₁,₂,...,ₙ)-partitionable graphs exist if and only if $_i$ and $_j$ are either coprime or equal irreducible properties of graphs for every i ≠ j, i,j ∈ {1,2,...,n}.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2002, 22, 1; 31-37
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On generating sets of induced-hereditary properties
    Autorzy:
    Semanišin, Gabriel
    Powiązania:
    https://bibliotekanauki.pl/articles/743561.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    induced-hereditary property of graphs
    additivity
    reducibility
    generating sets
    maximal graphs
    unique factorization
    Opis:
    A natural generalization of the fundamental graph vertex-colouring problem leads to the class of problems known as generalized or improper colourings. These problems can be very well described in the language of reducible (induced) hereditary properties of graphs. It turned out that a very useful tool for the unique determination of these properties are generating sets. In this paper we focus on the structure of specific generating sets which provide the base for the proof of The Unique Factorization Theorem for induced-hereditary properties of graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2002, 22, 1; 183-192
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Generalized ramsey theory and decomposable properties of graphs
    Autorzy:
    Burr, Stefan
    Jacobson, Michael
    Mihók, Peter
    Semanišin, Gabriel
    Powiązania:
    https://bibliotekanauki.pl/articles/744152.pdf
    Data publikacji:
    1999
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hereditary properties
    additivity
    reducibility
    decomposability
    Ramsey number
    graph invariants
    Opis:
    In this paper we translate Ramsey-type problems into the language of decomposable hereditary properties of graphs. We prove a distributive law for reducible and decomposable properties of graphs. Using it we establish some values of graph theoretical invariants of decomposable properties and show their correspondence to generalized Ramsey numbers.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1999, 19, 2; 199-217
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Uniquely partitionable graphs
    Autorzy:
    Bucko, Jozef
    Frick, Marietjie
    Mihók, Peter
    Vasky, Roman
    Powiązania:
    https://bibliotekanauki.pl/articles/972032.pdf
    Data publikacji:
    1997
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hereditary property of graphs
    additivity
    reducibility
    vertex partition
    Opis:
    Let ₁,...,ₙ be properties of graphs. A (₁,...,ₙ)-partition of a graph G is a partition of the vertex set V(G) into subsets V₁, ...,Vₙ such that the subgraph $G[V_i]$ induced by $V_i$ has property $_i$; i = 1,...,n. A graph G is said to be uniquely (₁, ...,ₙ)-partitionable if G has exactly one (₁,...,ₙ)-partition. A property is called hereditary if every subgraph of every graph with property also has property . If every graph that is a disjoint union of two graphs that have property also has property , then we say that is additive. A property is called degenerate if there exists a bipartite graph that does not have property . In this paper, we prove that if ₁,..., ₙ are degenerate, additive, hereditary properties of graphs, then there exists a uniquely (₁,...,ₙ)-partitionable graph.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1997, 17, 1; 103-113
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the factorization of reducible properties of graphs into irreducible factors
    Autorzy:
    Mihók, P.
    Vasky, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/972030.pdf
    Data publikacji:
    1995
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hereditary property of graphs
    additivity
    reducibility
    vertex partition
    Opis:
    A hereditary property R of graphs is said to be reducible if there exist hereditary properties P₁,P₂ such that G ∈ R if and only if the set of vertices of G can be partitioned into V(G) = V₁∪V₂ so that ⟨V₁⟩ ∈ P₁ and ⟨V₂⟩ ∈ P₂. The problem of the factorization of reducible properties into irreducible factors is investigated.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1995, 15, 2; 195-203
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Reducible properties of graphs
    Autorzy:
    Mihók, P.
    Semanišin, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/972021.pdf
    Data publikacji:
    1995
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hereditary property of graphs
    additivity
    reducibility
    Opis:
    Let L be the set of all hereditary and additive properties of graphs. For P₁, P₂ ∈ L, the reducible property R = P₁∘P₂ is defined as follows: G ∈ R if and only if there is a partition V(G) = V₁∪ V₂ of the vertex set of G such that $⟨V₁⟩_G ∈ P₁$ and $⟨V₂⟩_G ∈ P₂$. The aim of this paper is to investigate the structure of the reducible properties of graphs with emphasis on the uniqueness of the decomposition of a reducible property into irreducible ones.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1995, 15, 1; 11-18
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-13 z 13

      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