Filtry
wszystkich: 2891
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SCATTERING NUMBER, MATCHING NUMBER
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
Zero-Pole Space Mapping for CAD of Filters
PublikacjaIn this paper, we propose a new space-mapping technique tailored to the CAD of microwave filters. The goal of space mapping is to achieve a satisfactory design with the minimal number of fine model evaluations. In our approach, the filter is represented by a rational function. To quickly align the coarse and fine models, and to speed up the direct optimization of the coarse model, we propose matching the zeros and poles of a rational...
-
Greedy Multipoint Model-Order Reduction Technique for Fast Computation of Scattering Parameters of Electromagnetic Systems
PublikacjaThis paper attempts to develop a new automated multipoint model-order reduction (MOR) technique, based on matching moments of the system input–output function, which would be suited for fast and accurate computation of scattering parameters for electromagnetic (EM) systems over a wide frequency band. To this end, two questions are addressed. Firstly, the cost of the wideband reduced model generation is optimized by automating a...
-
Scattering and Propagation Analysis for the Multilayered Structures Based on Field Matching Technique
PublikacjaA semi-analytical method is employed to the analysis of scattering and guiding problems in multilayer dielectric structures. The approach allows to investigate objects with arbitrary convex cross section and is based on the direct field matching technique involving the usage of the field projection at the boundary on a fixed set of orthogonal basis functions. For the scattering problems the scattered field in the far zone is calculated...
-
An Analysis of Scattering from Ferrite Post of Arbitrary Convex Cross Section with the Use of Field Matching Method
PublikacjaA problem of electromagnetic wave scattering from ferrite post is presented. The post is assumed to be located in closed areas as waveguide junction, or in open area illuminated by a plane wave. The object is of arbitrary convex cross section and the method of analysis is semi-analytical, based on the direct field matching technique.
-
Scattering From a Cylindrical Object of Arbitrary Cross Section With the Use of Field Matching Method
PublikacjaA simple and intuitive solution to scattering problems in shielded and open structures is presented. The main idea of the analysis is based on the direct field matching technique involving the usage of projection of the fields at the boundary on a fixed set of orthogonal basis functions. Different convex shapes and various obstacle materials are considered to verify the validity of the method in open and closed structures. The...
-
An Analysis of Cylindrical Posts of Arbitrary Convex Cross Sections Located in Waveguide Junctions with the Use of Field Matching Method
PublikacjaA problem of electromagnetic wave scattering from cylindrical posts of arbitrary cross section located in waveguide junction is presented. The method of analysis is based on the direct field matching technique. Multimode scattering matrices of every section of waveguide junction are calculated and cascading procedure is utilized to investigate the whole structure. The results are verified by comparing them with those obtained from...
-
Finite element/mode-matching analysis of ferrite/dielectric line junctions of arbitrary cross-section
PublikacjaThis paper is focused on the analysis of line junctions obtained as a cascade of dielectric and ferrite guides of arbitrary cross-section. The main application of such structures is nonreciprocal devices such as isolators, circulators, or phase shifters. The efficient finite element/mode-matching approach is proposed to the analysis of such structures. In this approach, thefiniteelementmethod is applied todetermine propagation...
-
Hybrid Analysis of Structures Composed of Axially Symmetric Objects
Publikacja— A hybrid method for the scattering problems in shielded and open structures is presented. The procedure is based on the combination of body-of-revolution involving finite-element methods with impedance matrix formulation and the mode-matching technique, which can be utilized for the analysis of structures with axially symmetrical scatterers. In order to confirm the validity and efficiency of the proposed approach, a few examples...
-
An Analysis of Periodic Arrangements of Cylindrical Objects of Arbitrary Convex Cross Sections with the Use of Field Matching Method
PublikacjaA problem of electromagnetic wave scattering from multilayered frequency selective surfaces is presented. Each surface is composed of periodically arranged cylindrical posts of arbitrary convex cross-section. The method of analysis is based on the direct field matching technique for a single cell, and the transmission matrix method with the lattice sums technique for periodic arrangement of scatterers.
-
Isolation Number versus Domination Number of Trees
PublikacjaIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
Communication Model Order Reduction in Hybrid Methods Involving Generalized Impedance Matrix
PublikacjaA novel strategy for the efficient analysis of frequency-domain scattering electromagnetic problems in open and closed domains is presented. A fully automatic model-order reduction technique, called the enhanced reduced-basis method, is applied to increase the efficiency of the hybrid approach, which combines the finite-element and mode-matching methods. Numerical tests show that the proposed algorithm yields reliable and highly...
-
Application of hybrid finite-difference mode-matching method to analysis of structures loaded with axially-symmetrical posts
PublikacjaW artykule przedstawiono nową metodę hybrydową do analizy układów falowodowych zawierających dowolne konfiguracje obiektów osiowo-symetrycznych. Metoda oparta jest na połączeniu metody różnic skończonych, metody dopasowania rodzajów oraz iteracyjnej procedury rozpraszania. W pracy przedstawiono badania zbieżności metody. Uzyskane wyniki numeryczne porównano z wynikami odniesienia. Duża zgodność wyników potwierdziła poprawność opracowanego...
-
Hybrid Technique for the EM Scattering Analysis with the Use of Ring Domain Decomposition
PublikacjaA hybrid technique combining finite-element and mode-matching methods for the analysis of scattering problems in open space is presented here. The main idea is based on impedance matrix descriptions of the boundary surrounding the discrete computational domain and combine it with external field described analytically. The discrete analysis, which is the most time- and memory-consuming, is limited here only to the close proximity...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...