Array
(
[page] => 33
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 15918
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 53763
[vysledek_rok] => 2005
[nazev] => Geometric Structures for Solving Network Optimisation Problems
[nazev_orig] => Geometric Structures for Solving Network Optimisation Problems
[duvernost_udaju_id] => S
[popis] => This paper deals with fundamental structures of computational geometry, the Voronoi diagram, and its geometric dual, the Delaunay triangulation. They arise naturally in various branches of science. This paper surveys their basic properties and possible use for solving selected network optimisation problems.
[popis_orig] => This paper deals with fundamental structures of computational geometry, the Voronoi diagram, and its geometric dual, the Delaunay triangulation. They arise naturally in various branches of science. This paper surveys their basic properties and possible use for solving selected network optimisation problems.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 963-661-645-0
[identifikator_popis] => ISBN - Proceedings of the 6th International Carpathian Control Conference ICCC ’2005
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Geometric Structures for Solving Network Optimisation Problems. In Proceedings of the 6th International Carpathian Control Conference ICCC ’2005. Miskolc-Lillafüred (Hungary): University of Miskolc, 2005. 6 p. ISBN: 963-661-645-0.
[citace_html] => ŠEDA, M. Geometric Structures for Solving Network Optimisation Problems. In Proceedings of the 6th International Carpathian Control Conference ICCC ’2005. Miskolc-Lillafüred (Hungary): University of Miskolc, 2005. 6 p. ISBN: 963-661-645-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT15918,
author="Miloš {Šeda}",
title="Geometric Structures for Solving Network Optimisation Problems",
booktitle="Proceedings of the 6th International Carpathian Control Conference ICCC ’2005",
year="2005",
pages="6",
publisher="University of Miskolc",
address="Miskolc-Lillafüred (Hungary)",
isbn="963-661-645-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Geometric Structures for Solving Network Optimisation Problems
[popis_en] => This paper deals with fundamental structures of computational geometry, the Voronoi diagram, and its geometric dual, the Delaunay triangulation. They arise naturally in various branches of science. This paper surveys their basic properties and possible use for solving selected network optimisation problems.
[klicova_slova_en] => Voronoi diagram, Delaunay triangulation, spanning tree, Steiner tree
[vysledek_datum] => 2005-05-24T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 15919
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 53765
[vysledek_rok] => 2005
[nazev] => Data Structures and Time Complexity of Algorithms
[nazev_orig] => Data Structures and Time Complexity of Algorithms
[duvernost_udaju_id] => S
[popis] => The focus of programming techniques for solving problems of operations research, graph theory, and many others areas is on how to design good algorithms and how to analyse their efficiency. Besides the fact that many problems can be solved more or less efficiently by various algorithms, their implementation efficiency can also be controlled by used data structures. In this paper, we present a simple algorithm for solving the minimum spanning tree problem and its more efficient implementation using a binary heap. This procedure is also used for an approximation algorithm of solving the network Steiner tree problem that belongs to the class of NP-hard problems.
[popis_orig] => The focus of programming techniques for solving problems of operations research, graph theory, and many others areas is on how to design good algorithms and how to analyse their efficiency. Besides the fact that many problems can be solved more or less efficiently by various algorithms, their implementation efficiency can also be controlled by used data structures. In this paper, we present a simple algorithm for solving the minimum spanning tree problem and its more efficient implementation using a binary heap. This procedure is also used for an approximation algorithm of solving the network Steiner tree problem that belongs to the class of NP-hard problems.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-969264-2-X
[identifikator_popis] => ISBN - Proceedings of the 4th International Conference Aplimat
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Data Structures and Time Complexity of Algorithms. In Proceedings of the 4th International Conference Aplimat. Bratislava (Slovakia): Slovak University of Technology, 2005. 6 p. ISBN: 80-969264-2-X.
[citace_html] => ŠEDA, M. Data Structures and Time Complexity of Algorithms. In Proceedings of the 4th International Conference Aplimat. Bratislava (Slovakia): Slovak University of Technology, 2005. 6 p. ISBN: 80-969264-2-X.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT15919,
author="Miloš {Šeda}",
title="Data Structures and Time Complexity of Algorithms",
booktitle="Proceedings of the 4th International Conference Aplimat",
year="2005",
pages="6",
publisher="Slovak University of Technology",
address="Bratislava (Slovakia)",
isbn="80-969264-2-X"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Data Structures and Time Complexity of Algorithms
[popis_en] => The focus of programming techniques for solving problems of operations research, graph theory, and many others areas is on how to design good algorithms and how to analyse their efficiency. Besides the fact that many problems can be solved more or less efficiently by various algorithms, their implementation efficiency can also be controlled by used data structures. In this paper, we present a simple algorithm for solving the minimum spanning tree problem and its more efficient implementation using a binary heap. This procedure is also used for an approximation algorithm of solving the network Steiner tree problem that belongs to the class of NP-hard problems.
[klicova_slova_en] => priority queue, binary heap, spanning tree, Steiner tree
[vysledek_datum] => 2005-02-01T00:00:00+01:00
)
[2] => Array
(
[vysledek_id] => 15920
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 53766
[vysledek_rok] => 2005
[nazev] => Scheduling Flow Shops
[nazev_orig] => Scheduling Flow Shops
[duvernost_udaju_id] => S
[popis] => In this paper, two different approaches to permutation flow shop scheduling problem are investigated. The first one is based on a mixed integer programming model and is solved by an optimization package GAMS. As the problem belongs to NP-complete problems, this approach is limited to smaller instances, its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings. Finally, a modification of the problem using uncertain processing times of jobs is presented.
[popis_orig] => In this paper, two different approaches to permutation flow shop scheduling problem are investigated. The first one is based on a mixed integer programming model and is solved by an optimization package GAMS. As the problem belongs to NP-complete problems, this approach is limited to smaller instances, its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings. Finally, a modification of the problem using uncertain processing times of jobs is presented.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-214-2976-3
[identifikator_popis] => ISBN - Proceedings of the International Conference CEEPUS Summer School 2005 Intelligent Control Systems
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Scheduling Flow Shops. In Proceedings of the International Conference CEEPUS Summer School 2005 Intelligent Control Systems. Brno: VUT FEKT, 2005. 101 p. ISBN: 80-214-2976-3.
[citace_html] => ŠEDA, M. Scheduling Flow Shops. In Proceedings of the International Conference CEEPUS Summer School 2005 Intelligent Control Systems. Brno: VUT FEKT, 2005. 101 p. ISBN: 80-214-2976-3.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT15920,
author="Miloš {Šeda}",
title="Scheduling Flow Shops",
booktitle="Proceedings of the International Conference CEEPUS Summer School 2005 Intelligent Control Systems",
year="2005",
pages="101",
publisher="VUT FEKT",
address="Brno",
isbn="80-214-2976-3"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Scheduling Flow Shops
[popis_en] => In this paper, two different approaches to permutation flow shop scheduling problem are investigated. The first one is based on a mixed integer programming model and is solved by an optimization package GAMS. As the problem belongs to NP-complete problems, this approach is limited to smaller instances, its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings. Finally, a modification of the problem using uncertain processing times of jobs is presented.
[klicova_slova_en] => flow shop, mixed integer programming, heuristic, genetic algorithm
[vysledek_datum] => 2005-08-29T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 15921
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 53767
[vysledek_rok] => 2005
[nazev] => Datové struktury a složitost algoritmů
[nazev_orig] => Datové struktury a složitost algoritmů
[duvernost_udaju_id] => S
[popis] => Při řešení problémů operačního výzkumu, teorie grafů a dalších oblastí je potřebné navrhnout vhodný algoritmus, který řešení problému dokáže najít a navíc bude dostatečně efektivní. Řadu problémů lze řešit různými algoritmy, např. problém seřazení číselných položek podle vzestupného nebo sestupného uspořádání můžeme např. řešit algoritmem bublinového třídění s časovou složitostí O(n*n), kde n je počet seřazovaných položek, nebo mnohem sofistikovanějšími algoritmy QuickSort, HeapSort či MergeSort apod., které mají časovou složitost O(n log n). Efektivitu algoritmu nemusí však určovat jen jeho procedurální část, ale lze ji ovlivnit i volbou datových struktur. Z důvodu omezeného rozsahu se zaměříme pouze problém hledání minimální kostry grafu a jeho efektivní implementaci pomocí speciálních datových struktur disjunktní množina a binární halda
[popis_orig] => Při řešení problémů operačního výzkumu, teorie grafů a dalších oblastí je potřebné navrhnout vhodný algoritmus, který řešení problému dokáže najít a navíc bude dostatečně efektivní. Řadu problémů lze řešit různými algoritmy, např. problém seřazení číselných položek podle vzestupného nebo sestupného uspořádání můžeme např. řešit algoritmem bublinového třídění s časovou složitostí O(n*n), kde n je počet seřazovaných položek, nebo mnohem sofistikovanějšími algoritmy QuickSort, HeapSort či MergeSort apod., které mají časovou složitost O(n log n). Efektivitu algoritmu nemusí však určovat jen jeho procedurální část, ale lze ji ovlivnit i volbou datových struktur. Z důvodu omezeného rozsahu se zaměříme pouze problém hledání minimální kostry grafu a jeho efektivní implementaci pomocí speciálních datových struktur disjunktní množina a binární halda
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-248-0951-6
[identifikator_popis] => ISBN - Sborník ze 14. semináře Moderní matematické metody v inženýrství 3mi
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Datové struktury a složitost algoritmů. In Sborník ze 14. semináře Moderní matematické metody v inženýrství 3mi. Dolní Lomná u Jablunkova: VŠB-TU Ostrava, 2005. 5 s. ISBN: 80-248-0951-6.
[citace_html] => ŠEDA, M. Datové struktury a složitost algoritmů. In Sborník ze 14. semináře Moderní matematické metody v inženýrství 3mi. Dolní Lomná u Jablunkova: VŠB-TU Ostrava, 2005. 5 s. ISBN: 80-248-0951-6.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT15921,
author="Miloš {Šeda}",
title="Datové struktury a složitost algoritmů",
booktitle="Sborník ze 14. semináře Moderní matematické metody v inženýrství 3mi",
year="2005",
pages="5",
publisher="VŠB-TU Ostrava",
address="Dolní Lomná u Jablunkova",
isbn="80-248-0951-6"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Data Structures and Time Complexity of Algorithms
[popis_en] => Solving problems of operations research, graph theory, and many others areas means to find a suitable and efficient algorithm. Many problems can be solved by various algorithms, e.g. sorting items in ascending or descending order can be solved by the BubbleSort algorithm with O(n*n) time complexity where n is a number of items, or by much more sophisticated algorithms such QuickSort, HeapSort or MergeSort that run O(n log n) time. The efficiency of algorithms, besides their procedural part, can also be controlled by used data structures. In this paper, we present a simple algorithm for solving the minimum spanning tree problem and their more efficient implementation using a binary heap and disjoint sets.
[klicova_slova_en] => disjoint set, priority queue, binary heap, spanning tree
[vysledek_datum] => 2005-05-30T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 16110
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 53965
[vysledek_rok] => 2005
[nazev] => Měřící řetězec s využitím SW LabView 7 Express
[nazev_orig] => Měřící řetězec s využitím SW LabView 7 Express
[duvernost_udaju_id] => S
[popis] => Tento příspěvek popisuje aplikace, kde je možné využití výpočetní techniky v měřicím řetězci. Pokud máme aplikace, kde je nutné provádět složité matematické operace, je výhodné použít výpočetní techniku.
Jako příklad je v článku uvedeno měření vibrací, kde je velmi výhodné použít frekvenční analýzu. A v druhé části je uvedeno, jak se dá využít výpočetní technika pro měření teploty pomocí termočlánků.
[popis_orig] => Tento příspěvek popisuje aplikace, kde je možné využití výpočetní techniky v měřicím řetězci. Pokud máme aplikace, kde je nutné provádět složité matematické operace, je výhodné použít výpočetní techniku.
Jako příklad je v článku uvedeno měření vibrací, kde je velmi výhodné použít frekvenční analýzu. A v druhé části je uvedeno, jak se dá využít výpočetní technika pro měření teploty pomocí termočlánků.
[klicova_slova] => Měřicí řetězec, LabView , termočlánek
[klicova_slova_orig] => Měřicí řetězec, LabView , termočlánek
[url] =>
[oecd_obor_id] => 20201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ZUTH, D.; ROJKA, A.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-227-2314-2
[identifikator_popis] => ISBN - Mechanical Engineering 2005
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ZUTH, D.; ROJKA, A. Měřící řetězec s využitím SW LabView 7 Express. In Mechanical Engineering 2005. Bratislava: Strojnícka fakulta STU v Bratislave, 2005. 6 s. ISBN: 80-227-2314-2.
[citace_html] => ZUTH, D.; ROJKA, A. Měřící řetězec s využitím SW LabView 7 Express. In Mechanical Engineering 2005. Bratislava: Strojnícka fakulta STU v Bratislave, 2005. 6 s. ISBN: 80-227-2314-2.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT16110,
author="Daniel {Zuth} and Aleš {Rojka}",
title="Měřící řetězec s využitím SW LabView 7 Express",
booktitle="Mechanical Engineering 2005",
year="2005",
number="1",
pages="6",
publisher="Strojnícka fakulta STU v Bratislave",
address="Bratislava",
isbn="80-227-2314-2"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20201
[oecd_tree_podobor_nazev] => Electrical and electronic engineering
[poznamka_metriky] =>
[nazev_en] => Measuring chain with computational technology
[popis_en] => This contribution describes some application possibilities of a computational technology in a measuring chain. If we have to deal with some more complicated signals and subsequently analyse them (e.g. a frequency analysis, interpolation by a polynomial of higher degrees, etc.), then is suitable an integrating the computational technology into a measuring chain.
As an example, there was used a measuring chain that conducts a measuring of vibrations and simultaneously there is executed the frequency analysis by using of the computational technology. In the next part of this contribution we deal with possibilities of how to utilize the computational technology for temperature measuring with thermocouples.
[klicova_slova_en] => Measuring chain, LabView, thermocouple,
[vysledek_datum] => 2005-11-16T00:00:00+01:00
)
[5] => Array
(
[vysledek_id] => 16111
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 53966
[vysledek_rok] => 2005
[nazev] => Modelování frekvenčního analyzátoru pomocí Labview 7 Express
[nazev_orig] => Modelování frekvenčního analyzátoru pomocí Labview 7 Express
[duvernost_udaju_id] => S
[popis] => V současné technické diagnostice se stále více využívá výpočetní technika, pomocí které jsme schopni realizovat modely jednouchých i složitějších meřících přístrojů.
Příspěvek se zabývá vytvořením jednoduchého modelu frekvenčního analyzátoru realizovaného pomocí SW LabView 7 Express a ukázkou využití tohoto analyzátoru při diagnostice simulovaných vibrací.
[popis_orig] => V současné technické diagnostice se stále více využívá výpočetní technika, pomocí které jsme schopni realizovat modely jednouchých i složitějších meřících přístrojů.
Příspěvek se zabývá vytvořením jednoduchého modelu frekvenčního analyzátoru realizovaného pomocí SW LabView 7 Express a ukázkou využití tohoto analyzátoru při diagnostice simulovaných vibrací.
[klicova_slova] => Labview , modelování, frekvenční analyzátor
[klicova_slova_orig] => Labview , modelování, frekvenční analyzátor
[url] =>
[oecd_obor_id] => 20306
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ZUTH, D.; ROJKA, A.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-7318-293-9
[identifikator_popis] => ISBN - TD 2005 - Diagon 2005
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ZUTH, D.; ROJKA, A. Modelování frekvenčního analyzátoru pomocí Labview 7 Express. In TD 2005 - Diagon 2005. Zlín: Academia centrum UTB Zlín, 2005. 6 s. ISBN: 80-7318-293-9.
[citace_html] => ZUTH, D.; ROJKA, A. Modelování frekvenčního analyzátoru pomocí Labview 7 Express. In TD 2005 - Diagon 2005. Zlín: Academia centrum UTB Zlín, 2005. 6 s. ISBN: 80-7318-293-9.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT16111,
author="Daniel {Zuth} and Aleš {Rojka}",
title="Modelování frekvenčního analyzátoru pomocí Labview 7 Express",
booktitle="TD 2005 - Diagon 2005",
year="2005",
number="1",
pages="6",
publisher="Academia centrum UTB Zlín",
address="Zlín",
isbn="80-7318-293-9"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20300
[oecd_tree_obor_nazev] => 2.3 Mechanical engineering
[oecd_tree_podobor_id] => 20306
[oecd_tree_podobor_nazev] => Audio engineering, reliability analysis
[poznamka_metriky] =>
[nazev_en] => Simulation of frequency analyzer with Labview 7 Express
[popis_en] => Present technical diagnostic increasingly exploits computational technology and with the assistance her we can create model of simple or complicated instruments.
This contribution describes how create simply model of frequency analyser, which was realize with SW LabView 7 Express, and the next part describe how is possible utilise him in technical diagnostics.
[klicova_slova_en] => Frequency analyzer, LabView, simulation,
[vysledek_datum] => 2005-04-26T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 16176
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 52007
[vysledek_rok] => 2005
[nazev] => The Q-learned controller for small asynchronous electromotor
[nazev_orig] => The Q-learned controller for small asynchronous electromotor
[duvernost_udaju_id] => S
[popis] => The contribution is focused on the application of two staged Q-learning on asynchronous electromotor (AE) control. Tutorage stage uses conventional Q-learning procedure applied on Q function created during the prelearning stage. Tutorage is expected to be processed on real AE plant and its use for controller adaptation on possible system parameters changes is not excluded. Based on the tests the best grids of Q-function table for 2-D state and 3-D state were selected and obtained policies performance was compared with the performance of AE controlled by PID, which was tuned through
Ziegler-Nichols methodology.
[popis_orig] => The contribution is focused on the application of two staged Q-learning on asynchronous electromotor (AE) control. Tutorage stage uses conventional Q-learning procedure applied on Q function created during the prelearning stage. Tutorage is expected to be processed on real AE plant and its use for controller adaptation on possible system parameters changes is not excluded. Based on the tests the best grids of Q-function table for 2-D state and 3-D state were selected and obtained policies performance was compared with the performance of AE controlled by PID, which was tuned through
Ziegler-Nichols methodology.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MARADA, T., BŘEZINA, T., SINGULE, V.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-8075-058-0
[identifikator_popis] => ISBN - Mechatronika 2005
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => MARADA, T., BŘEZINA, T., SINGULE, V. The Q-learned controller for small asynchronous electromotor. In Mechatronika 2005. Trenčianske Teplice, Slovakia: Fakulta Mechatroniky TnU AD v spolupráci s firmou GC TECH Ing. Peter Gerši, 2005. 5 p. ISBN: 80-8075-058-0.
[citace_html] => MARADA, T., BŘEZINA, T., SINGULE, V. The Q-learned controller for small asynchronous electromotor. In Mechatronika 2005. Trenčianske Teplice, Slovakia: Fakulta Mechatroniky TnU AD v spolupráci s firmou GC TECH Ing. Peter Gerši, 2005. 5 p. ISBN: 80-8075-058-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT16176,
author="Tomáš {Marada} and Tomáš {Březina} and Vladislav {Singule}",
title="The Q-learned controller for small asynchronous electromotor",
booktitle="Mechatronika 2005",
year="2005",
volume="8",
number="8",
pages="5",
publisher="Fakulta Mechatroniky TnU AD v spolupráci s firmou GC TECH Ing. Peter Gerši",
address="Trenčianske Teplice, Slovakia",
isbn="80-8075-058-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => The Q-learned controller for small asynchronous electromotor
[popis_en] => The contribution is focused on the application of two staged Q-learning on asynchronous electromotor (AE) control. Tutorage stage uses conventional Q-learning procedure applied on Q function created during the prelearning stage. Tutorage is expected to be processed on real AE plant and its use for controller adaptation on possible system parameters changes is not excluded. Based on the tests the best grids of Q-function table for 2-D state and 3-D state were selected and obtained policies performance was compared with the performance of AE controlled by PID, which was tuned through
Ziegler-Nichols methodology.
[klicova_slova_en] => asynchronous motor, control, q-learning, pre-learning stage, tutorage stage
[vysledek_datum] => 2005-05-19T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 16177
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 52011
[vysledek_rok] => 2005
[nazev] => The effect of selected variables on Q-learning during the control of asynchronous electric motor
[nazev_orig] => The effect of selected variables on Q-learning during the control of asynchronous electric motor
[duvernost_udaju_id] => S
[popis] => Asynchronous electric motor control task can be successfully solved using reinforcement learning based method called Q-learning. The main problem to solve is the convergence speed. Two-phase Q-learning can be used to speed up the learning process. Efficient prelearning phase uses mathematical model and next phase using for tutorage real system. This method can increase learning speed significantly. The paper is focused on presentation of random error effect of system variable observation, delay of interference action and response on jump torque onto convergence speed.
[popis_orig] => Asynchronous electric motor control task can be successfully solved using reinforcement learning based method called Q-learning. The main problem to solve is the convergence speed. Two-phase Q-learning can be used to speed up the learning process. Efficient prelearning phase uses mathematical model and next phase using for tutorage real system. This method can increase learning speed significantly. The paper is focused on presentation of random error effect of system variable observation, delay of interference action and response on jump torque onto convergence speed.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MARADA, T., BŘEZINA, T.,
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] => + CD-ROM
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-85918-93-5
[identifikator_popis] => ISBN - Engineering Mechanics 2005
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => MARADA, T., BŘEZINA, T. The effect of selected variables on Q-learning during the control of asynchronous electric motor. In Engineering Mechanics 2005. Svratka, CZ: 2005. č. 1, 2 s. ISBN: 80-85918-93-5.
[citace_html] => MARADA, T., BŘEZINA, T. The effect of selected variables on Q-learning during the control of asynchronous electric motor. In Engineering Mechanics 2005. Svratka, CZ: 2005. č. 1, 2 s. ISBN: 80-85918-93-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT16177,
author="Tomáš {Marada} and Tomáš {Březina}",
title="The effect of selected variables on Q-learning during the control of asynchronous electric motor",
booktitle="Engineering Mechanics 2005",
year="2005",
number="1",
pages="2",
address="Svratka, CZ",
isbn="80-85918-93-5"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => THE EFFECT OF SELECTED VARIABLES ON Q-LEARNING DURINNG THE CONTROL OF ASYNCHRONOUS ELECTRIC MOTOR
[popis_en] => Asynchronous electric motor control task can be successfully solved using reinforcement learning based method called Q-learning. The main problem to solve is the convergence speed. Two-phase Q-learning can be used to speed up the learning process. Efficient prelearning phase uses mathematical model and next phase using for tutorage real system. This method can increase learning speed significantly. The paper is focused on presentation of random error effect of system variable observation, delay of interference action and response on jump torque onto convergence speed.
[klicova_slova_en] => asynchronous motor, control, q-learning, pre-learning stage, tutorage stage
[vysledek_datum] => 2005-05-09T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 33
[count] => 8
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /en/veda/publikace/detail/
[base_page] => /en/veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => ŠEDA, M.
[title] => Geometric Structures for Solving Network Optimisation Problems
[typ] => PV
[year] => 2005
[id_vav] => 15918
)
[1] => Array
(
[quotations] => ŠEDA, M.
[title] => Data Structures and Time Complexity of Algorithms
[typ] => PV
[year] => 2005
[id_vav] => 15919
)
[2] => Array
(
[quotations] => ŠEDA, M.
[title] => Scheduling Flow Shops
[typ] => PV
[year] => 2005
[id_vav] => 15920
)
[3] => Array
(
[quotations] => ŠEDA, M.
[title] => Datové struktury a složitost algoritmů
[typ] => PV
[year] => 2005
[id_vav] => 15921
)
[4] => Array
(
[quotations] => ZUTH, D.; ROJKA, A.
[title] => Měřící řetězec s využitím SW LabView 7 Express
[typ] => PV
[year] => 2005
[id_vav] => 16110
)
[5] => Array
(
[quotations] => ZUTH, D.; ROJKA, A.
[title] => Modelování frekvenčního analyzátoru pomocí Labview 7 Express
[typ] => PV
[year] => 2005
[id_vav] => 16111
)
[6] => Array
(
[quotations] => MARADA, T., BŘEZINA, T., SINGULE, V.
[title] => The Q-learned controller for small asynchronous electromotor
[typ] => PV
[year] => 2005
[id_vav] => 16176
)
[7] => Array
(
[quotations] => MARADA, T., BŘEZINA, T.,
[title] => The effect of selected variables on Q-learning during the control of asynchronous electric motor
[typ] => PV
[year] => 2005
[id_vav] => 16177
)
)
)