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

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 59
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ł:
Pointwise completeness and pointwise degeneracy of 2D standard and positive Fornasini-Marchesini models with state-feedbacks
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/205641.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
pointwise completeness
standard
state-feedbacks
Opis:
Necessary and sufficient conditions are established for the pointwise completeness of 2D standard and positive Fornasini-Marchesini models with state-feedbacks. Similar relations are obtained for the pointwise degeneracy of the 2D models with state-feedbacks. It is shown that if the positive 2D model is pointwise complete then there exists a gain matrix of the state-feedback such that the closed-loop system is pointwise degenerated if both matrices B1 and B2 of the 2D Fornasini-Marchesini model are nonzero. The considerations are illustrated by numerical examples.
Źródło:
Control and Cybernetics; 2011, 40, 1; 39-58
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The pragmatics of casual dialogue
Autorzy:
Warchala, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/468274.pdf
Data publikacji:
2015
Wydawca:
Wydawnictwo Uniwersytetu Śląskiego
Tematy:
casual dialogue
coherence
completeness
extralinguistic factors
Opis:
In this paper, the author presents the relationships of dialogue and then characterizes dialogue as a text. In dialogue’s characteristics, it is necessary to distinguish its units and both obligatory and optional elements. The author notes that a lively and spontaneous dialogue is dependent on various extralinguistic factors as well as accident.
Źródło:
Forum Lingwistyczne; 2015, 2; 97-119
2449-9587
2450-2758
Pojawia się w:
Forum Lingwistyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The pointwise completeness and the pointwise degeneracy of fractional descriptor discrete-time linear systems
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/200344.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fractional
descriptor
pointwise completeness
pointwise degeneracy
Opis:
The Drazin inverse of matrices is applied to analysis of the pointwise completeness and of the pointwise degeneracy of the fractional descriptor linear discrete-time systems. Necessary and sufficient conditions for the pointwise completeness and the pointwise degeneracy of the fractional descriptor linear discrete-time systems are established. It is shown that every fractional descriptor linear discrete-time systems is not pointwise complete and it is pointwise degenerated in one step (for i= 1).
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 6; 989-993
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Carathéodory completeness on the plane
Autorzy:
Edigarian, Armen
Powiązania:
https://bibliotekanauki.pl/articles/2188102.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
Carathéodory distance
completeness
Melnikov's theorem
peak function
Opis:
M. A. Selby [8-10] and, independently, N. Sibony [11] proved that on the complex plane c-completeness is equivalent to c-finitely compactness. Their proofs are quite similar and are based on [4]. We give more refined equivalent conditions and, along the way, simplify the proofs.
Źródło:
Universitatis Iagellonicae Acta Mathematica; 2019, 56; 15-21
2084-3828
0083-4386
Pojawia się w:
Universitatis Iagellonicae Acta Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
NP-completeness of weakly convex and convex dominating set decision problems
Autorzy:
Raczek, J.
Powiązania:
https://bibliotekanauki.pl/articles/2050778.pdf
Data publikacji:
2004
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
dominating set
NP-completeness
distance
convex set
Opis:
The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are NP-complete for bipartite and split graphs. Using a modified version of Warshall algorithm we can verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.
Źródło:
Opuscula Mathematica; 2004, 24, 2; 189-196
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/377430.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
regularity
pointwise completeness
pointwise generacy
descriptor electrical circuits
Opis:
The regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits composed of resistances, capacitances, inductances and voltage (current) sources are addressed. It is shown that every descriptor electrical circuit is a linear system with regular pencil. Conditions for the pointwise completeness and pointwise generacy of the descriptor linear electrical circuits are established. The considerations are illustrated by examples of descriptor electrical circuits.
Źródło:
Poznan University of Technology Academic Journals. Electrical Engineering; 2014, 77; 9-28
1897-0737
Pojawia się w:
Poznan University of Technology Academic Journals. Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Balanced problems on graphs with categorization of edges
Autorzy:
Berežný, Štefan
Lacko, Vladimír
Powiązania:
https://bibliotekanauki.pl/articles/743374.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
algorithms on graphs
categorization of edges
NP-completeness
Opis:
Suppose a graph G = (V,E) with edge weights w(e) and edges partitioned into disjoint categories S₁,...,Sₚ is given. We consider optimization problems on G defined by a family of feasible sets (G) and the following objective function:
$L₅(D) = max_{1≤i≤p} (max_{e ∈ S_i ∩ D} w(e) - min_{e ∈ S_i ∩ D} w(e))$
For an arbitrary number of categories we show that the L₅-perfect matching, L₅-a-b path, L₅-spanning tree problems and L₅-Hamilton cycle (on a Halin graph) problem are NP-complete.
We also summarize polynomiality results concerning above objective functions for arbitrary and for fixed number of categories.
Źródło:
Discussiones Mathematicae Graph Theory; 2003, 23, 1; 5-21
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On some properties of Musielak-Orlicz sequence spaces
Autorzy:
Shragin, Isaac V.
Powiązania:
https://bibliotekanauki.pl/articles/745761.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
normal pregenfunction
Musielak-Orlicz sequence space
completeness
separability
Opis:
We consider a nontrivial vector space \(X\) and a semimodular \(M\colon X\tp [0, \infty]\) with property: \((\forall\ x \in X) (\exists\ \alpha \gt 0)\ M (\alphax) \lt \infty\) (in other words, \(M\) is normal (i.e. \((\forall\ x\in X \setminus \{0\}) (\exists \alpha \gt 0)\ M (\alphax) \gt 0)\) pregenfunction). The function \(M\) generates in \(X\) a metric \(d\) with \[ d(x, y) := inf \{a \gt 0: M (a^{-1} (x-y)) \leq a\}. \] At the same time \(M\) generates a metric \(\rho\) in Musielak-Orlicz sequence space \(l_M\), namely \[ \rho(\varphi, \psi) := inf \{a \gt 0 : I(a^{-1} (\varphi - \psi)) \leq a\} \] with \(I(\varphi) = \sum_{n \geq 1} M (\varphiφ(n))\). It is proved that the space \((l_M,\rho)\) is complete if and only if the space \((X, d)\) is complete. We consider also the closed subspace \(G_M \subset l_M\) of sequences \(\varphi = \{\varphi(n)\}\) such that \((\forall \alpha \gt 0) (\exists m \in N) \sum_{n\geq m} M(\alpha\varphi(n)) \lt \infty\) and prove that \((G_M ,\rho)\) is separable if and only if \((X, d)\) is the same. Several examples are considered.
Źródło:
Commentationes Mathematicae; 2008, 48, 2
0373-8299
Pojawia się w:
Commentationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise completeness and pointwise degeneracy of linear continuous-time fractional order systems
Autorzy:
Kaczorek, T.
Busłowicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/384856.pdf
Data publikacji:
2009
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
linear system
fractional
continuous-time
positive
pointwise completeness
Opis:
A dynamical system described by homogeneous equation is called pointwise complete if every final state can be reached by suitable choice of the initial state. The system which is not pointwise complete is called pointwise degenerated. Definitions and necessary and sufficient conditions for the pointwise completeness and the pointwise degeneracy of continuous-time linear systems of fractional order, standard and positive, are given. It is shown that: 1) the standard fractional system is always pointwise complete; 2) the positive fractional system is pointwise complete if and only if the state matrix is diagonal.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2009, 3, 1; 8-11
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of the regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/97423.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
regularity
pointwise completeness
pointwise generacy
descriptor electrical circuits
Opis:
A method for analysis of the regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits composed of resistances, capacitances, inductances and voltage (current) sources is proposed. It is shown that every descriptor electrical circuit is a linear system with regular pencil. Conditions for the pointwise completeness and pointwise generacy of the descriptor linear electrical circuits are established. The considerations are illustrated by examples of descriptor electrical circuits.
Źródło:
Computer Applications in Electrical Engineering; 2014, 12; 1-20
1508-4248
Pojawia się w:
Computer Applications in Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Iterated neighborhood graphs
Autorzy:
Sonntag, Martin
Teichert, Hanns-Martin
Powiązania:
https://bibliotekanauki.pl/articles/743216.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
neighborhood graph
2-step graph
neighborhood completeness number
Opis:
The neighborhood graph N(G) of a simple undirected graph G = (V,E) is the graph $(V,E_N)$ where $E_N$ = {{a,b} | a ≠ b, {x,a} ∈ E and {x,b} ∈ E for some x ∈ V}. It is well-known that the neighborhood graph N(G) is connected if and only if the graph G is connected and non-bipartite.
We present some results concerning the k-iterated neighborhood graph $N^k(G) : = N(N(...N(G)))$ of G. In particular we investigate conditions for G and k such that $N^k(G)$ becomes a complete graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 3; 403-417
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise completeness and pointwise degeneracy of standard and positive linear systems with state-feedbacks
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/384546.pdf
Data publikacji:
2010
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
pointwise completeness
pointwise degeneracy
positive linear systems
state-feedbacks
Opis:
The pointwise completeness and pointwise degeneracy of standard and positive linear discrete-time and continuous- time systems with state-feedbacks are addressed. It is shown that: 1) the pointwise completeness and pointwise degeneracy of continuous-time standard systems are invariant under the state and output feedbacks, 2) for standard and positive discrete-time and positive continuous- time systems necessary and sufficient conditions are established for the existence of gain matrices of statefeedbacks such that the closed-loop systems are pointwise complete. Considerations are illustrated by numerical examples.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2010, 4, 1; 3-7
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise completeness and pointwise degeneracy of standard and positive hybrid linear systems described by the general model
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/229797.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
pointwise completeness
degeneracy
standard
positive
general model
hybrid systems
Opis:
Necessary and sufficient conditions for the pointwise completeness and pointwise degeneracy of the standard and positive hybrid linear systems described by the general model are established. It is shown that the standard general model is always pointwise complete and it is not pointwise degenerated and the positive general model is pointwise complete if and only if its matrix A2 is diagonal.
Źródło:
Archives of Control Sciences; 2010, 20, 2; 123-131
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Completeness, Categoricity and Imaginary Numbers: The Debate on Husserl
Autorzy:
Aranda, Víctor
Powiązania:
https://bibliotekanauki.pl/articles/750024.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Husserl
completeness
categoricity
relative and absolute definiteness
imaginary numbers
Opis:
Husserl's two notions of "definiteness" enabled him to clarify the problem of imaginary numbers. The exact meaning of these notions is a topic of much controversy. A "definite" axiom system has been interpreted as a syntactically complete theory, and also as a categorical one. I discuss whether and how far these readings manage to capture Husserl's goal of elucidating the problem of imaginary numbers, raising objections to both positions. Then, I suggest an interpretation of "absolute definiteness" as semantic completeness and argue that this notion does not suffice to explain Husserl's solution to the problem of imaginary numbers.
Źródło:
Bulletin of the Section of Logic; 2020, 49, 2
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 59

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