Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 7984
-
Catalog
- Publications 5523 available results
- Journals 459 available results
- Conferences 15 available results
- People 160 available results
- Inventions 5 available results
- Projects 38 available results
- Laboratories 4 available results
- Research Teams 7 available results
- Research Equipment 26 available results
- e-Learning Courses 677 available results
- Events 71 available results
- Open Research Data 999 available results
displaying 1000 best results Help
Search results for: E-M ALGORITHM
-
Investigations of scattering from arbitrary configuration of elliptical obstacles
PublicationW niniejszym artykule przedstawiono nową metodę analizy rozpraszania fali e-m. na dowolnej konfiguracji metalowych obiektów cylindrycznych. Przedstawiona metoda oparta jest na wykorzystaniu macierzy rozpraszania T opisującej obiekty eliptyczne oraz zastosowaniu metody iteracyjnej do analizy dowolnej konfiguracji obiektów. Otrzymane wyniki numeryczne porównano z wynikami uzyskanymi w komercyjnym symulatorze e-m.
-
E&M Economics and Management
Journals -
G|A|M|E: The Italian Journal of Game Studies
Journals -
Roberto Bellarmino, Il catechismo. Breve Dottrina Cristiana e Dichiarazione più copiosa, ed. M. Sodi, A. Głusiuk, G. Mignoni. Presentazione di Papa Francesco
Publication -
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Open Research DataFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Open Research DataFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Open Research DataFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Rozdz.5.3. Standardowe interfejsy aparatury i systemów akwizycji danych. W:Systemy komputerowe i teleinformatyczne w służbie zdrowia. Red. E. Kącki, J.L. Kulikowski, A. Nowakowski, E. Waniewski. Warszawa: Akad. Ofic. Wydaw. EXIT88@2002 t. 7 s. 401-430. Biocybernetyka i inżynieria biomedyczna 2000. Red. M. Nałęcz.
PublicationOmówiono podstawowe interfejsy stosowane w cyfrowej transmisji danych w sys-temach informatycznych i w aparaturze pomiarowej rozpatrując ich usytuowaniew ogólnym schemacie ISO OSI. Uwagę skupiono na rozwiązaniach stosowanych wsystemach laboratoryjnych, w systemach intensywnego nadzoru pacjenta i wtransmisji danych EKG. Podkreślono znaczenie prac nad systemami łącznościbezprzewodowej z wykozrystaniem łącz w podczerwieni...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Open Research DataFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...