Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 15

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  decomposition
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Decomposition of complete graphs into factors of diameter two and three

100%
Vukicević D.
Discussiones Mathematicae Graph Theory
|
2003
|
tom 23
|
nr 1
37-54
EN
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.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails

100%
Cichacz S.
Discussiones Mathematicae Graph Theory
|
2007
|
tom 27
|
nr 2
241-249
EN
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.
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On the completeness of decomposable properties of graphs

80%
Hałuszczak M., Vateha P.
Discussiones Mathematicae Graph Theory
|
1999
|
tom 19
|
nr 2
229-236
EN
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.
4
Content available remote

Packing the Hypercube

80%
Offner D.
Discussiones Mathematicae Graph Theory
|
2014
|
tom 34
|
nr 1
85-93
EN
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.
5
Content available remote

Computation of realizations composed of dynamic and static parts of improper transfer matrices

80%
Kaczorek T.
International Journal of Applied Mathematics and Computer Science
|
2007
|
tom 17
|
nr 1
23-25
EN
The problem of computing minimal realizations of a singular system decomposed into a standard dynamical system and a static system of a given improper transfer matrix is formulated and solved. A new notion of the minimal dynamical-static realization is introduced. It is shown that there always exists a minimal dynamical-static realization of a given improper transfer matrix. A procedure for the computation of a minimal dynamical-static realization for a given improper transfer matrix is proposed and illustrated by a numerical example.
6
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Area-oriented technology mapping for LUT-based logic blocks

80%
Kubica M., Kania D.
International Journal of Applied Mathematics and Computer Science
|
2017
|
tom 27
|
nr 1
207-222
EN
One of the main aspects of logic synthesis dedicated to FPGA is the problem of technology mapping, which is directly associated with the logic decomposition technique. This paper focuses on using configurable properties of CLBs in the process of logic decomposition and technology mapping. A novel theory and a set of efficient techniques for logic decomposition based on a BDD are proposed. The paper shows that logic optimization can be efficiently carried out by using multiple decomposition. The essence of the proposed synthesis method is multiple cutting of a BDD. A new diagram form called an SMTBDD is proposed. Moreover, techniques that allow finding the best technology mapping oriented to configurability of CLBs are presented. In the experimental section, the presented method (MultiDec) is compared with academic and commercial tools. The experimental results show that the proposed technology mapping strategy leads to good results in terms of the number of CLBs.
7
Content available remote

Algebraic condition for decomposition of large-scale linear dynamic systems

80%
Górecki H.
International Journal of Applied Mathematics and Computer Science
|
2009
|
tom 19
|
nr 1
107-111
EN
The paper concerns the problem of decomposition of a large-scale linear dynamic system into two subsystems. An equivalent problem is to split the characteristic polynomial of the original system into two polynomials of lower degrees. Conditions are found concerning the coefficients of the original polynomial which must be fulfilled for its factorization. It is proved that knowledge of only one of the symmetric functions of those polynomials of lower degrees is sufficient for factorization of the characteristic polynomial of the original large-scale system. An algorithm for finding all the coefficients of the decomposed polynomials and a general condition of factorization are given. Examples of splitting the polynomials of the fifth and sixth degrees are discussed in detail.
8
Content available remote

An approach to the analysis of observability and controllability in nonlinear systems via linear methods

71%
Zhirabok A., Shumsky A.
International Journal of Applied Mathematics and Computer Science
|
2012
|
tom 22
|
nr 3
507-522
EN
The paper is devoted to the problem of observability and controllability analysis in nonlinear dynamic systems. Both continuous- and discrete-time systems described by nonlinear differential or difference equations, respectively, are considered. A new approach is developed to solve this problem whose features include (i) consideration of systems with non-differentiable nonlinearities and (ii) the use of relatively simple linear methods which may be supported by existing programming systems, e.g., Matlab. Sufficient conditions are given for nonlinear unobservability/uncontrollability analysis. To apply these conditions, one isolates the linear part of the system which is checked to be unobservable/uncontrollable and, if the answer is positive, it is examined whether or not existing nonlinear terms violate the unobservability/uncontrollability property.
9
Content available remote

Decomposition of vibration signals into deterministic and nondeterministic components and its capabilities of fault detection and identification

71%
Barszcz T.
International Journal of Applied Mathematics and Computer Science
|
2009
|
tom 19
|
nr 2
327-335
EN
The paper investigates the possibility of decomposing vibration signals into deterministic and nondeterministic parts, based on the Wold theorem. A short description of the theory of adaptive filters is presented. When an adaptive filter uses the delayed version of the input signal as the reference signal, it is possible to divide the signal into a deterministic (gear and shaft related) part and a nondeterministic (noise and rolling bearings) part. The idea of the self-adaptive filter (in the literature referred to as SANC or ALE) is presented and its most important features are discussed. The flowchart of the Matlab-based SANC algorithm is also presented. In practice, bearing fault signals are in fact nondeterministic components, due to a little jitter in their fundamental period. This phenomenon is illustrated using a simple example. The paper proposes a simulation of a signal containing deterministic and nondeterministic components. The self-adaptive filter is then applied - first to the simulated data. Next, the filter is applied to a real vibration signal from a wind turbine with an outer race fault. The necessity of resampling the real signal is discussed. The signal from an actual source has a more complex structure and contains a significant noise component, which requires additional demodulation of the decomposed signal. For both types of signals the proposed SANC filter shows a very good ability to decompose the signal.
10
Content available remote

Decomposition-based logic synthesis for PAL-based CPLDs

71%
Opara A., Kania D.
International Journal of Applied Mathematics and Computer Science
|
2010
|
tom 20
|
nr 2
367-384
EN
The paper presents one concept of decomposition methods dedicated to PAL-based CPLDs. The proposed approach is an alternative to the classical one, which is based on two-level minimization of separate single-output functions. The key idea of the algorithm is to search for free blocks that could be implemented in PAL-based logic blocks containing a limited number of product terms. In order to better exploit the number of product terms, two-stage decomposition and BDD-based decomposition are to be used. In BDD-based decomposition methods, functions are represented by Reduced Ordered Binary Decision Diagrams (ROBDDs). The results of experiments prove that the proposed solution is more effective, in terms of the usage of programmable device resources, compared with the classical ones.
11
Content available remote

On decomposition of k-tridiagonal ℓ-Toeplitz matrices and its applications

71%
Ohashi A., Sogabe T., Usuda T. S.
Special Matrices
|
2015
|
tom 3
|
nr 1
EN
We consider a k-tridiagonal ℓ-Toeplitz matrix as one of generalizations of a tridiagonal Toeplitz matrix. In the present paper, we provide a decomposition of the matrix under a certain condition. By the decomposition, the matrix is easily analyzed since one only needs to analyze the small matrix obtained from the decomposition. Using the decomposition, eigenpairs and arbitrary integer powers of the matrix are easily shown as applications.
12
Content available remote

Decomposition of the fuzzy inference system for implementation in the FPGA structure

71%
Wyrwoł B., Hrynkiewicz E.
International Journal of Applied Mathematics and Computer Science
|
2013
|
tom 23
|
nr 2
473-483
EN
The paper presents the design and implementation of a digital rule-relational fuzzy logic controller. Classical and decomposed logical structures of fuzzy systems are discussed. The second allows a decrease in the hardware cost of the fuzzy system and in the computing time of the final result (fuzzy or crisp), especially when referring to relational systems. The physical architecture consists of IP modules implemented in an FPGA structure. The modules can be inserted into or removed from the project to get a desirable fuzzy logic controller configuration. The fuzzy inference system implemented in FPGA can operate with a much higher performance than software implementations on standard microcontrollers.
13
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Decompositions of nearly complete digraphs into t isomorphic parts

71%
Meszka M., Skupień Z.
Discussiones Mathematicae Graph Theory
|
2009
|
tom 29
|
nr 3
563-572
EN
An arc decomposition of the complete digraph 𝒟 Kₙ into t isomorphic subdigraphs is generalized to the case where the numerical divisibility condition is not satisfied. Two sets of nearly tth parts are constructively proved to be nonempty. These are the floor tth class (𝒟 Kₙ-R)/t and the ceiling tth class (𝒟 Kₙ+S)/t, where R and S comprise (possibly copies of) arcs whose number is the smallest possible. The existence of cyclically 1-generated decompositions of 𝒟 Kₙ into cycles $^{→}C_{n-1}$ and into paths $^{→}Pₙ$ is characterized.
14
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Colouring of cycles in the de Bruijn graphs

61%
Łazuka E., Żurawiecki J.
Discussiones Mathematicae Graph Theory
|
2000
|
tom 20
|
nr 1
5-21
EN
We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k-1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de Bruijn graphs in order to define a class of so called regular factors, which is not so difficult to construct. Next we prove that each locally reducible factor of the binary de Bruijn graph is a subgraph of a certain regular factor in the m-ary de Bruijn graph.
15
Content available remote

A hierarchical decomposition of decision process Petri nets for modeling complex systems

51%
Clempner J.
International Journal of Applied Mathematics and Computer Science
|
2010
|
tom 20
|
nr 2
349-366
EN
We provide a framework for hierarchical specification called Hierarchical Decision Process Petri Nets (HDPPNs). It is an extension of Decision Process Petri Nets (DPPNs) including a hierarchical decomposition process that generates less complex nets with equivalent behavior. As a result, the complexity of the analysis for a sophisticated system is drastically reduced. In the HDPPN, we represent the mark-dynamic and trajectory-dynamic properties of a DPPN. Within the framework of the mark-dynamic properties, we show that the HDPPN theoretic notions of (local and global) equilibrium and stability are those of the DPPN. As a result in the trajectory-dynamic properties framework, we obtain equivalent characterizations of that of the DPPN for final decision points and stability. We show that the HDPPN mark-dynamic and trajectory-dynamic properties of equilibrium, stability and final decision points coincide under some restrictions. We propose an algorithm for optimum hierarchical trajectory planning. The hierarchical decomposition process is presented under a formal treatment and is illustrated with application examples.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.