Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 6671
-
Katalog
- Publikacje 4752 wyników po odfiltrowaniu
- Czasopisma 56 wyników po odfiltrowaniu
- Konferencje 4 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 227 wyników po odfiltrowaniu
- Wynalazki 19 wyników po odfiltrowaniu
- Projekty 37 wyników po odfiltrowaniu
- Zespoły Badawcze 2 wyników po odfiltrowaniu
- Aparatura Badawcza 2 wyników po odfiltrowaniu
- Kursy Online 124 wyników po odfiltrowaniu
- Wydarzenia 85 wyników po odfiltrowaniu
- Dane Badawcze 1362 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: UNEQUAL-SPLIT COU-PLER
-
Inverse and forward surrogate models for expedited design optimization of unequal-power-split patch couplers
PublikacjaIn the paper, a procedure for precise and expedited design optimization of unequal power split patchcouplers is proposed. Our methodology aims at identifying the coupler dimensions that correspond to thecircuit operating at the requested frequency and featuring a required power split. At the same time, thedesign process is supposed to be computationally efficient. The proposed methodology involves two typesof auxiliary models (surrogates):...
-
Matrix Strengthening the Identification of Observations with Split Functional Models in the Squared Msplit(q) Estimation Process
Publikacja -
Matrix Strengthening the Identification of Observations with Split Functional Models in the Squared Msplit(q) Estimation Process
PublikacjaThis article addresses the issue of raising the level of identification of observations with either single or more split functional models in the squared Msplit(q) estimation process. The theoretical part of the study presents the theoretical grounds for the classical method for estimating parameters in a split functional model and proposes a modification of the computational algorithm to increase the quality of the determinations...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Progress in Electromagnetics Research-PIER
Czasopisma -
Smart platforms for collaborative urban design and peer-to-peer sharing of resources
Publikacja.
-
Statement of Peer Review
Publikacja -
Free trade with the former COMECON Countries as Unequal Exchange
PublikacjaTwo authors of this chapter were born to the East of what was once The Iron Curtain and two to the West. From both angles, the two systems – capitalism and communism – seemed to be as contrary to each other as possible. Few people are aware that in terms of industrial and trade policy, both classical capitalism and communism had a common root in the theories of German economist Friedrich List (1789-1846) (List, 1841). In fact,...
-
Matching Split Distance for Unrooted Binary Phylogenetic Trees
Publikacja -
Optimal backbone coloring of split graphs with matching backbones
PublikacjaFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.