Array
(
[page] => 116
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 128262
[vysledek_druh_id] => ARTSC
[ex_vysledek_id] => 120301
[vysledek_rok] => 2016
[nazev] => PID CONTROLER PARAMETERS SETTINGS BASED ON GENETIC ALGORITHM FOR INVERTED PENDULUM PURPOSE STABILIZATION
[nazev_orig] => PID CONTROLER PARAMETERS SETTINGS BASED ON GENETIC ALGORITHM FOR INVERTED PENDULUM PURPOSE STABILIZATION
[duvernost_udaju_id] => S
[popis] => One of the classical problems in dynamics and control theory is balancing of an inverted pendulum robot by
moving a cart along a horizontal path. A real world example of this inverted pendulum system is the attitude control of a rocket booster at take-off. Inverted pendulum stabilization can be performed through several methods. This paper presents capability of inverted pendulum control by two PID (Proportional, Integration, and Derivative) controllers for its stabilization. A genetic algorithm is used to optimizing different controller’s parameters. Different performance indicators and genetic algorithm were implemented and calculated in MATLAB software. Simulink environment was used to simulate the inverted pendulum nonlinear equations with PID controllers. The results of simulations have been mentioned in the experiments and conclusion.
[popis_orig] => One of the classical problems in dynamics and control theory is balancing of an inverted pendulum robot by
moving a cart along a horizontal path. A real world example of this inverted pendulum system is the attitude control of a rocket booster at take-off. Inverted pendulum stabilization can be performed through several methods. This paper presents capability of inverted pendulum control by two PID (Proportional, Integration, and Derivative) controllers for its stabilization. A genetic algorithm is used to optimizing different controller’s parameters. Different performance indicators and genetic algorithm were implemented and calculated in MATLAB software. Simulink environment was used to simulate the inverted pendulum nonlinear equations with PID controllers. The results of simulations have been mentioned in the experiments and conclusion.
[klicova_slova] => Inverted pendulum, Genetic algorithm, Penalty in the objective function, PID controller, ITAE criterion.
[klicova_slova_orig] => Inverted pendulum, Genetic algorithm, Penalty in the objective function, PID controller, ITAE criterion.
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2019-08-19
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MARADA, T.
[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] => Publikační výsledky
[druh_nazev] => Článek Scopus
[druh_popis] => Článek v odborném periodiku je obsažen v databázi SCOPUS společnosti Elsevier s příznakem „Article“, „Review“ nebo „Letter“
[stav] => Schválený
[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] => ISSN 1803-3814
[identifikator_popis] => ISSN - Mendel Journal series (CZ)
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => MARADA, T. PID CONTROLER PARAMETERS SETTINGS BASED ON GENETIC ALGORITHM FOR INVERTED PENDULUM PURPOSE STABILIZATION. Mendel Journal series, 2016, vol. 2016, no. 22, p. 31-38. ISSN: 1803-3814.
[citace_html] => MARADA, T. PID CONTROLER PARAMETERS SETTINGS BASED ON GENETIC ALGORITHM FOR INVERTED PENDULUM PURPOSE STABILIZATION. Mendel Journal series, 2016, vol. 2016, no. 22, p. 31-38. ISSN: 1803-3814.
[citace_rtf] =>
[citace_bibtex] => @article{BUT128262,
author="Tomáš {Marada}",
title="PID CONTROLER PARAMETERS SETTINGS BASED ON GENETIC ALGORITHM FOR INVERTED PENDULUM PURPOSE STABILIZATION",
journal="Mendel Journal series",
year="2016",
volume="2016",
number="22",
pages="31--38",
issn="1803-3814"
}
[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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => PID CONTROLER PARAMETERS SETTINGS BASED ON GENETIC ALGORITHM FOR INVERTED PENDULUM PURPOSE STABILIZATION
[popis_en] => One of the classical problems in dynamics and control theory is balancing of an inverted pendulum robot by
moving a cart along a horizontal path. A real world example of this inverted pendulum system is the attitude control of a rocket booster at take-off. Inverted pendulum stabilization can be performed through several methods. This paper presents capability of inverted pendulum control by two PID (Proportional, Integration, and Derivative) controllers for its stabilization. A genetic algorithm is used to optimizing different controller’s parameters. Different performance indicators and genetic algorithm were implemented and calculated in MATLAB software. Simulink environment was used to simulate the inverted pendulum nonlinear equations with PID controllers. The results of simulations have been mentioned in the experiments and conclusion.
[klicova_slova_en] => Inverted pendulum, Genetic algorithm, Penalty in the objective function, PID controller, ITAE criterion.
[vysledek_datum] => 2016-06-08T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 128283
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 120315
[vysledek_rok] => 2016
[nazev] => EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS
[nazev_orig] => EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS
[duvernost_udaju_id] => S
[popis] => The cost of nearest-neighbor calls is one of the bottlenecks in the performance of sampling-based
motion planning algorithms and particularly Rapidly-exploring Random Trees (RRT) algorithm. Although RRT
returns the solution relatively quickly, the computational cost of every new algorithm loop increases as the tree
grows because of the nearest neighbor searching procedure. This paper suggests the enhancement of this function. Through a series of simulation experiments we evaluate and compare the performance of RRT-based algorithms and report on the results verifying the efficiency of the suggested nearest neighbor searching method.
[popis_orig] => The cost of nearest-neighbor calls is one of the bottlenecks in the performance of sampling-based
motion planning algorithms and particularly Rapidly-exploring Random Trees (RRT) algorithm. Although RRT
returns the solution relatively quickly, the computational cost of every new algorithm loop increases as the tree
grows because of the nearest neighbor searching procedure. This paper suggests the enhancement of this function. Through a series of simulation experiments we evaluate and compare the performance of RRT-based algorithms and report on the results verifying the efficiency of the suggested nearest neighbor searching method.
[klicova_slova] => sampling-based motion planning, Rapidly-exploring Random Tree, RRT, nearest-neighbor searching
[klicova_slova_orig] => sampling-based motion planning, Rapidly-exploring Random Tree, RRT, nearest-neighbor searching
[url] => http://www.mendel-conference.org
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 182808
[schvaleno] => 2021-03-03
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => Gulina Irina, Matousek Radomil
[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] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[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 978-80-214-5365-4
[identifikator_popis] => ISBN - MENDEL 2016 22nd Conference on Soft Computing
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => Gulina Irina, Matousek Radomil. EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS. In MENDEL 2016 22nd Conference on Soft Computing. Brno: 2016. p. 189-194. ISBN: 978-80-214-5365-4.
[citace_html] => Gulina Irina, Matousek Radomil. EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS. In MENDEL 2016 22nd Conference on Soft Computing. Brno: 2016. p. 189-194. ISBN: 978-80-214-5365-4.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT128283,
author="Irina {Gulina} and Radomil {Matoušek}",
title="EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS",
booktitle="MENDEL 2016 22nd Conference on Soft Computing",
year="2016",
pages="189--194",
address="Brno",
isbn="978-80-214-5365-4",
url="http://www.mendel-conference.org"
}
[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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS
[popis_en] => The cost of nearest-neighbor calls is one of the bottlenecks in the performance of sampling-based
motion planning algorithms and particularly Rapidly-exploring Random Trees (RRT) algorithm. Although RRT
returns the solution relatively quickly, the computational cost of every new algorithm loop increases as the tree
grows because of the nearest neighbor searching procedure. This paper suggests the enhancement of this function. Through a series of simulation experiments we evaluate and compare the performance of RRT-based algorithms and report on the results verifying the efficiency of the suggested nearest neighbor searching method.
[klicova_slova_en] => sampling-based motion planning, Rapidly-exploring Random Tree, RRT, nearest-neighbor searching
[vysledek_datum] => 2016-06-08T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 128292
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 120323
[vysledek_rok] => 2011
[nazev] => PROJEKTY INTELIGENTNÍ ELEKTROINSTALACE
[nazev_orig] => PROJEKTY INTELIGENTNÍ ELEKTROINSTALACE
[duvernost_udaju_id] => S
[popis] => Na systémovou techniku budov jsou dnešními moderními budovami kladeny stále vyšší
požadavky. Moderními metodami projektování elektroinstalace stále častěji zjišťujeme, že
abychom byly schopni dodržet požadavky na energetickou účinnost, bezpečnost a míru
komfortu tak na zařízení jednotlivých profesí nelze pohlížet samostatně, ale musíme
pohlížet na celý systém jako na jeden celek a realizovat celý návrh elektroinstalace jako
kvalitní projekt. Tuto možnost nám nabízí například systém KNX/EIB.
[popis_orig] => Na systémovou techniku budov jsou dnešními moderními budovami kladeny stále vyšší
požadavky. Moderními metodami projektování elektroinstalace stále častěji zjišťujeme, že
abychom byly schopni dodržet požadavky na energetickou účinnost, bezpečnost a míru
komfortu tak na zařízení jednotlivých profesí nelze pohlížet samostatně, ale musíme
pohlížet na celý systém jako na jeden celek a realizovat celý návrh elektroinstalace jako
kvalitní projekt. Tuto možnost nám nabízí například systém KNX/EIB.
[klicova_slova] => Klasická elektroinstalace, Inteligentní elektroinstalace, Systémová technika
budov, Výukový panel, ABB, KNX/EIB, ETS, i-bus
[klicova_slova_orig] => Klasická elektroinstalace, Inteligentní elektroinstalace, Systémová technika
budov, Výukový panel, ABB, KNX/EIB, ETS, i-bus
[url] =>
[oecd_obor_id] => 50602
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => cs
[schvalil_id] => 14526
[schvaleno] => 2016-09-20
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MARADA, T.
[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] => Publikační výsledky
[druh_nazev] => Kapitola, resp. kapitoly v odborné knize
[druh_popis] => Kapitola, resp. kapitoly v odborné knize
[stav] => Schválený
[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 978-80-7204-770-3
[identifikator_popis] => ISBN - Projektový management 2011
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => MARADA, T. PROJEKTY INTELIGENTNÍ ELEKTROINSTALACE. In Projektový management 2011. 1. Brno: AKADEMICKÉ NAKLADATELSTVÍ CERM®, s.r.o. Brno, 2011. s. 37-43. ISBN: 978-80-7204-770-3.
[citace_html] => MARADA, T. PROJEKTY INTELIGENTNÍ ELEKTROINSTALACE. In Projektový management 2011. 1. Brno: AKADEMICKÉ NAKLADATELSTVÍ CERM®, s.r.o. Brno, 2011. s. 37-43. ISBN: 978-80-7204-770-3.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT128292,
author="Tomáš {Marada}",
title="PROJEKTY INTELIGENTNÍ ELEKTROINSTALACE",
booktitle="Projektový management 2011",
year="2011",
publisher="AKADEMICKÉ NAKLADATELSTVÍ CERM®, s.r.o. Brno",
address="Brno",
series="1",
pages="37--43",
isbn="978-80-7204-770-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] => 50000
[oecd_tree_oblast_nazev] => 5. Social Sciences
[oecd_tree_obor_id] => 50600
[oecd_tree_obor_nazev] => 5.6 Political science
[oecd_tree_podobor_id] => 50602
[oecd_tree_podobor_nazev] => Public administration
[poznamka_metriky] =>
[nazev_en] => INTELLIGENT ELECTRICAL WIRING PROJECTS
[popis_en] => On the system building technology are required ever-higher requirements. Modern methods of designing the wiring increasingly we are finding that we were unable to comply with requirements on energy efficiency, security and peace comfort on the device of individual professions cannot be seen separately, but we must look at the entire system as a single unit and to implement the entire design of the wiring as
quality project. This option offers us such as KNX/EIB system.
[klicova_slova_en] => Classic electrical wiring, Inteligent electrical wiring, System technology buildings, ABB, KNX/EIB, ETS, i-bus
[vysledek_datum] => 2011-10-01T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 128335
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 120338
[vysledek_rok] => 2016
[nazev] => Adaptation of Genetic Algorithm to Determine Air Jet Shape of Flow Visualized by Helium Bubbles
[nazev_orig] => Adaptation of Genetic Algorithm to Determine Air Jet Shape of Flow Visualized by Helium Bubbles
[duvernost_udaju_id] => S
[popis] => During the development of ventilation and air conditioning systems, it is important to verify the functionality of the devised system, especially the method by which air fills the space. In this case, an optical visualization method of introducing helium bubbles into the airflow can be used for this function. A special generator produces small bubbles filled with helium. These bubbles are visible particles of airflow, making it possible to determine the shape of such a flow. This article describes the evaluation of flow images visualized by helium bubbles. Bubbles are detected by comparing intensities and subsequently cleaning faulty bubbles. For a convex airflow shape, exact geometric methods are used, and for a more precisely nonconvex shape of airflow, a genetic algorithm is used, in which a sophisticated algorithm of arranging a boundary line from selected points is applied. The algorithm also includes a specific approach of representing individuals in population inclusive of determining their fitness values.
Read More: http://ascelibrary.org/doi/abs/10.1061/%28ASCE%29AS.1943-5525.0000650
[popis_orig] => During the development of ventilation and air conditioning systems, it is important to verify the functionality of the devised system, especially the method by which air fills the space. In this case, an optical visualization method of introducing helium bubbles into the airflow can be used for this function. A special generator produces small bubbles filled with helium. These bubbles are visible particles of airflow, making it possible to determine the shape of such a flow. This article describes the evaluation of flow images visualized by helium bubbles. Bubbles are detected by comparing intensities and subsequently cleaning faulty bubbles. For a convex airflow shape, exact geometric methods are used, and for a more precisely nonconvex shape of airflow, a genetic algorithm is used, in which a sophisticated algorithm of arranging a boundary line from selected points is applied. The algorithm also includes a specific approach of representing individuals in population inclusive of determining their fitness values.
Read More: http://ascelibrary.org/doi/abs/10.1061/%28ASCE%29AS.1943-5525.0000650
[klicova_slova] => Helium bubble seeding, Spanning tree, Prim-Jarník algorithm, Convex and nonconvex areas, Genetic algorithm
[klicova_slova_orig] => Helium bubble seeding, Spanning tree, Prim-Jarník algorithm, Convex and nonconvex areas, Genetic algorithm
[url] => http://dx.doi.org/10.1061/(ASCE)AS.1943-5525.0000650
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2019-08-08
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠŤASTNÝ, J.; RICHTER, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1061/(ASCE)AS.1943-5525.0000650
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Článek WoS
[druh_popis] => Článek v odborném periodiku je obsažen v databázi Web of Science společností Thomson Reuters s příznakem „Article“, „Review“ nebo „Letter“
[stav] => Schválený
[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] => ISSN 0893-1321
[identifikator_popis] => ISSN - JOURNAL OF AEROSPACE ENGINEERING (US)
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠŤASTNÝ, J.; RICHTER, J. Adaptation of Genetic Algorithm to Determine Air Jet Shape of Flow Visualized by Helium Bubbles. JOURNAL OF AEROSPACE ENGINEERING, 2016, vol. 29, no. 6, p. 1-14. ISSN: 0893-1321.
[citace_html] => ŠŤASTNÝ, J.; RICHTER, J. Adaptation of Genetic Algorithm to Determine Air Jet Shape of Flow Visualized by Helium Bubbles. JOURNAL OF AEROSPACE ENGINEERING, 2016, vol. 29, no. 6, p. 1-14. ISSN: 0893-1321.
[citace_rtf] =>
[citace_bibtex] => @article{BUT128335,
author="Jiří {Šťastný} and Jan {Richter}",
title="Adaptation of Genetic Algorithm to Determine Air Jet Shape of Flow Visualized by Helium Bubbles",
journal="JOURNAL OF AEROSPACE ENGINEERING",
year="2016",
volume="29",
number="6",
pages="1--14",
doi="10.1061/(ASCE)AS.1943-5525.0000650",
issn="0893-1321",
url="http://dx.doi.org/10.1061/(ASCE)AS.1943-5525.0000650"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 1.107
[if_q] => 2
[if_m17_q] => 3
[if_m25_q] => 3
[if_d] =>
[if_m17_d] => 6
[if_m25_d] => 6
[if_percentil] => 56.452
[if_m17_percentil] => 42.486
[if_m25_percentil] => 42.486
[ais] => 0.329
[ais_m17_q] => 3
[ais_m25_q] => 3
[ais_m17_d] => 6
[ais_m25_d] => 6
[ais_m17_percentil] => 46.765
[ais_m25_percentil] => 46.765
[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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Adaptation of Genetic Algorithm to Determine Air Jet Shape of Flow Visualized by Helium Bubbles
[popis_en] => During the development of ventilation and air conditioning systems, it is important to verify the functionality of the devised system, especially the method by which air fills the space. In this case, an optical visualization method of introducing helium bubbles into the airflow can be used for this function. A special generator produces small bubbles filled with helium. These bubbles are visible particles of airflow, making it possible to determine the shape of such a flow. This article describes the evaluation of flow images visualized by helium bubbles. Bubbles are detected by comparing intensities and subsequently cleaning faulty bubbles. For a convex airflow shape, exact geometric methods are used, and for a more precisely nonconvex shape of airflow, a genetic algorithm is used, in which a sophisticated algorithm of arranging a boundary line from selected points is applied. The algorithm also includes a specific approach of representing individuals in population inclusive of determining their fitness values.
Read More: http://ascelibrary.org/doi/abs/10.1061/%28ASCE%29AS.1943-5525.0000650
[klicova_slova_en] => Helium bubble seeding, Spanning tree, Prim-Jarník algorithm, Convex and nonconvex areas, Genetic algorithm
[vysledek_datum] => 2016-11-01T00:00:00+01:00
)
[4] => Array
(
[vysledek_id] => 128390
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 120341
[vysledek_rok] => 2016
[nazev] => Quarter Century with Measurement Uncertainties
[nazev_orig] => Quarter Century with Measurement Uncertainties
[duvernost_udaju_id] => S
[popis] => Uncertainties of measurements are also traditional theme of expert meetings in acoustics. Methodology for evaluating uncertainty exists about a quarter-century, but it is constantly evolving. The article completes liberal to papers line from last years of this seminar thus. It highlights some of the news and also summarizes the historical context.
[popis_orig] => Uncertainties of measurements are also traditional theme of expert meetings in acoustics. Methodology for evaluating uncertainty exists about a quarter-century, but it is constantly evolving. The article completes liberal to papers line from last years of this seminar thus. It highlights some of the news and also summarizes the historical context.
[klicova_slova] => Measurement uncertainty, conformity assessment
[klicova_slova_orig] => Measurement uncertainty, conformity assessment
[url] => http://www.akustikad.com/volume26/
[oecd_obor_id] => 20201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2019-08-19
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => VDOLEČEK, F.
[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] => Publikační výsledky
[druh_nazev] => Článek WoS
[druh_popis] => Článek v odborném periodiku je obsažen v databázi Web of Science společností Thomson Reuters s příznakem „Article“, „Review“ nebo „Letter“
[stav] => Schválený
[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] => ISSN 1801-9064
[identifikator_popis] => ISSN - Akustika (CZ)
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => VDOLEČEK, F. Quarter Century with Measurement Uncertainties. Akustika, 2016, vol. 26, no. september 2016, p. 38-41. ISSN: 1801-9064.
[citace_html] => VDOLEČEK, F. Quarter Century with Measurement Uncertainties. Akustika, 2016, vol. 26, no. september 2016, p. 38-41. ISSN: 1801-9064.
[citace_rtf] =>
[citace_bibtex] => @article{BUT128390,
author="František {Vdoleček}",
title="Quarter Century with Measurement Uncertainties",
journal="Akustika",
year="2016",
volume="26",
number="september 2016",
pages="38--41",
issn="1801-9064",
url="http://www.akustikad.com/volume26/"
}
[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] => Quarter Century with Measurement Uncertainties
[popis_en] => Uncertainties of measurements are also traditional theme of expert meetings in acoustics. Methodology for evaluating uncertainty exists about a quarter-century, but it is constantly evolving. The article completes liberal to papers line from last years of this seminar thus. It highlights some of the news and also summarizes the historical context.
[klicova_slova_en] => Measurement uncertainty, conformity assessment
[vysledek_datum] => 2016-09-07T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 128435
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 120369
[vysledek_rok] => 2016
[nazev] => Palindrome analyser – A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences
[nazev_orig] => Palindrome analyser – A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences
[duvernost_udaju_id] => S
[popis] => DNA cruciform structures play an important role in the regulation of natural processes including gene replication and expression, as well as nucleosome structure and recombination. They have also been implicated in the evolution and development of diseases such as cancer and neurodegenerative disorders. Cruciform structures are formed by inverted repeats, and their stability is enhanced by DNA supercoiling and protein binding. They have received broad attention because of their important roles in biology. Computational approaches to study inverted repeats have allowed detailed analysis of genomes. However, currently there are no easily accessible and user-friendly tools that can analyse inverted repeats, especially among long nucleotide sequences. We have developed a web-based server, Palindrome analyser, which is a user-friendly application for analysing inverted repeats in various DNA (or RNA) sequences including genome sequences and oligonucleotides. It allows users to search and retrieve desired gene/nucleotide sequence entries from the NCBI databases, and provides data on length, sequence, locations and energy required for cruciform formation.
[popis_orig] => DNA cruciform structures play an important role in the regulation of natural processes including gene replication and expression, as well as nucleosome structure and recombination. They have also been implicated in the evolution and development of diseases such as cancer and neurodegenerative disorders. Cruciform structures are formed by inverted repeats, and their stability is enhanced by DNA supercoiling and protein binding. They have received broad attention because of their important roles in biology. Computational approaches to study inverted repeats have allowed detailed analysis of genomes. However, currently there are no easily accessible and user-friendly tools that can analyse inverted repeats, especially among long nucleotide sequences. We have developed a web-based server, Palindrome analyser, which is a user-friendly application for analysing inverted repeats in various DNA (or RNA) sequences including genome sequences and oligonucleotides. It allows users to search and retrieve desired gene/nucleotide sequence entries from the NCBI databases, and provides data on length, sequence, locations and energy required for cruciform formation.
[klicova_slova] => Palindrome analyser, web-based server, inverted repeats, nucleotide sequences, DNA sequences
[klicova_slova_orig] => Palindrome analyser, web-based server, inverted repeats, nucleotide sequences, DNA sequences
[url] => http://www.sciencedirect.com/science/article/pii/S0006291X16314620
[oecd_obor_id] => 10610
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2019-08-08
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => BRÁZDA, V.; KOLOMAZNÍK, J.; LÝSEK, J.; HÁRONÍKOVÁ, L.; COUFAL, J.; ŠŤASTNÝ, J.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1016/j.bbrc.2016.09.015
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Článek WoS
[druh_popis] => Článek v odborném periodiku je obsažen v databázi Web of Science společností Thomson Reuters s příznakem „Article“, „Review“ nebo „Letter“
[stav] => Schválený
[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] => ISSN 0006-291X
[identifikator_popis] => ISSN - Biochemical and biophysical research communications (US)
[riv_dodavka_id] => 2045
[riv_dodavka_oznaceni] => RIV19-MSM-26210___
[riv_dodavka_rok] => 2019
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => BRÁZDA, V.; KOLOMAZNÍK, J.; LÝSEK, J.; HÁRONÍKOVÁ, L.; COUFAL, J.; ŠŤASTNÝ, J. Palindrome analyser – A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences. Biochemical and biophysical research communications, 2016, vol. 479, no. 2, p. 1739-1745. ISSN: 0006-291X.
[citace_html] => BRÁZDA, V.; KOLOMAZNÍK, J.; LÝSEK, J.; HÁRONÍKOVÁ, L.; COUFAL, J.; ŠŤASTNÝ, J. Palindrome analyser – A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences. Biochemical and biophysical research communications, 2016, vol. 479, no. 2, p. 1739-1745. ISSN: 0006-291X.
[citace_rtf] =>
[citace_bibtex] => @article{BUT128435,
author="Václav {Brázda} and Jan {Kolomazník} and Jiří {Lýsek} and Jan {Coufal} and Jiří {Šťastný}",
title="Palindrome analyser – A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences",
journal="Biochemical and biophysical research communications",
year="2016",
volume="479",
number="2",
pages="1739--1745",
doi="10.1016/j.bbrc.2016.09.015",
issn="0006-291X",
url="http://www.sciencedirect.com/science/article/pii/S0006291X16314620"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.466
[if_q] => 3
[if_m17_q] => 2
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 4
[if_m25_d] => 4
[if_percentil] => 48.63
[if_m17_percentil] => 62.636
[if_m25_percentil] => 62.636
[ais] => 0.635
[ais_m17_q] => 2
[ais_m25_q] => 2
[ais_m17_d] => 5
[ais_m25_d] => 5
[ais_m17_percentil] => 52.932
[ais_m25_percentil] => 52.932
[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] => 10600
[oecd_tree_obor_nazev] => 1.6 Biological sciences
[oecd_tree_podobor_id] => 10610
[oecd_tree_podobor_nazev] => Biophysics
[poznamka_metriky] =>
[nazev_en] => Palindrome analyser – A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences
[popis_en] => DNA cruciform structures play an important role in the regulation of natural processes including gene replication and expression, as well as nucleosome structure and recombination. They have also been implicated in the evolution and development of diseases such as cancer and neurodegenerative disorders. Cruciform structures are formed by inverted repeats, and their stability is enhanced by DNA supercoiling and protein binding. They have received broad attention because of their important roles in biology. Computational approaches to study inverted repeats have allowed detailed analysis of genomes. However, currently there are no easily accessible and user-friendly tools that can analyse inverted repeats, especially among long nucleotide sequences. We have developed a web-based server, Palindrome analyser, which is a user-friendly application for analysing inverted repeats in various DNA (or RNA) sequences including genome sequences and oligonucleotides. It allows users to search and retrieve desired gene/nucleotide sequence entries from the NCBI databases, and provides data on length, sequence, locations and energy required for cruciform formation.
[klicova_slova_en] => Palindrome analyser, web-based server, inverted repeats, nucleotide sequences, DNA sequences
[vysledek_datum] => 2016-09-30T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 128441
[vysledek_druh_id] => UV
[ex_vysledek_id] => 21385
[vysledek_rok] => 2016
[nazev] => Kryt svařovací helmy s automaticky řízeným pneumatickým přesunem ochranného skla
[nazev_orig] => Kryt svařovací helmy s automaticky řízeným pneumatickým přesunem ochranného skla
[duvernost_udaju_id] => S
[popis] => Technické řešení se týká krytu svařovací helmy s ochranným sklem, kde do korpusu svařovací helmy je vložen rám krytu, který má na dvou protilehlých stranách vytvořené podélné drážky, v kterých je uložen rámeček s ochranným sklem. Rámeček dosedá na levou patku umístěnou kolmo k jedné straně rámu s drážkou a na pravou patku umístěnou kolmo k druhé straně rámu s drážkou. Levá patka je spojená s vratnou pružinou připevněnou k rámu a pravá patka je spojená s pístní tyčí pístu propojeného s pneumatickým ventilem spojeným s elektromagnetickým ovládáním. Elektromagnetické ovládání je připojeno k fototranzistoru připevněnému k rámu krytu.
[popis_orig] => Technické řešení se týká krytu svařovací helmy s ochranným sklem, kde do korpusu svařovací helmy je vložen rám krytu, který má na dvou protilehlých stranách vytvořené podélné drážky, v kterých je uložen rámeček s ochranným sklem. Rámeček dosedá na levou patku umístěnou kolmo k jedné straně rámu s drážkou a na pravou patku umístěnou kolmo k druhé straně rámu s drážkou. Levá patka je spojená s vratnou pružinou připevněnou k rámu a pravá patka je spojená s pístní tyčí pístu propojeného s pneumatickým ventilem spojeným s elektromagnetickým ovládáním. Elektromagnetické ovládání je připojeno k fototranzistoru připevněnému k rámu krytu.
[klicova_slova] => svařování, automatické pneumatické ovládání, ochranná helma
[klicova_slova_orig] => svařování, automatické pneumatické ovládání, ochranná helma
[url] =>
[oecd_obor_id] => 30305
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => cs
[schvalil_id] => 680
[schvaleno] => 2016-09-22
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 64445
[posledni_diagnostika] =>
[vycet_osob] => Lacko Branislav
[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] => Aplikované výsledky
[druh_nazev] => Užitný vzor
[druh_popis] => Užitný vzor
[stav] => Schválený
[vysledek_kategorie_id] => AV
[vysledek_system_kategorie_id] => PA
[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] =>
[identifikator_popis] =>
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => Lacko Branislav; Vysoké učení technické v Brně: Kryt svařovací helmy s automaticky řízeným pneumatickým přesunem ochranného skla. 29608, Užitný vzor. (2016)
[citace_html] => Lacko Branislav; Vysoké učení technické v Brně: Kryt svařovací helmy s automaticky řízeným pneumatickým přesunem ochranného skla. 29608, Užitný vzor. (2016)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT128441,
author="Branislav {Lacko}",
title="Kryt svařovací helmy s automaticky řízeným pneumatickým přesunem ochranného skla
",
year="2016",
note="Utility model"
}
[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] => 30000
[oecd_tree_oblast_nazev] => 3. Medical and Health Sciences
[oecd_tree_obor_id] => 30300
[oecd_tree_obor_nazev] => 3.3 Health sciences
[oecd_tree_podobor_id] => 30305
[oecd_tree_podobor_nazev] => Occupational health
[poznamka_metriky] =>
[nazev_en] => The cover of the welding helmets with an automatically controlled pneumatic moving protective glass
[popis_en] => The technical solution refers to the cover of the welding helmets with protective glass, where the corpus welding helmets is inserted into the cover frame on the two opposite sides created longitudinal grooves, which is stored in the frame with a protective glass. The frame is on the left foot placed perpendicular to one side of the frame with the Groove and right foot placed at right angles to the other side of the frame with the Groove. The left foot is linked with a return spring attached to the frame and the right foot is attached to the piston rod of the piston linked with pneumatic valve associated with electromagnetic control. Electromagnetic control is connected to the fototranzistoru attached to the frame of the cover.
[klicova_slova_en] => welding, automatic pneumatic control, protective helmet
[vysledek_datum] => 2016-07-04T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 128470
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 120374
[vysledek_rok] => 2016
[nazev] => Minimised Weighted Covering of Service Networks
[nazev_orig] => Minimised Weighted Covering of Service Networks
[duvernost_udaju_id] => S
[popis] => In this paper, we deal with the set covering problem, which consists in finding the minimum number of service centres providing specialized services within a reasonable distance given by a threshold. However, we consider not only the threshold, but also weights of service centres so that the most important ones would not be omitted from the final solution. Since even the basic task without weights belongs to the class of NP-hard problems, stochastic heuristic methods must be used for large instances of the problem.
[popis_orig] => In this paper, we deal with the set covering problem, which consists in finding the minimum number of service centres providing specialized services within a reasonable distance given by a threshold. However, we consider not only the threshold, but also weights of service centres so that the most important ones would not be omitted from the final solution. Since even the basic task without weights belongs to the class of NP-hard problems, stochastic heuristic methods must be used for large instances of the problem.
[klicova_slova] => set covering, threshold, reachability matrix, genetic algorithm, repair operator, weight
[klicova_slova_orig] => set covering, threshold, reachability matrix, genetic algorithm, repair operator, weight
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 182808
[schvaleno] => 2021-03-12
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.; ŠEDA, P.
[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] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[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 978-1-4673-8605-0
[identifikator_popis] => ISBN - Proceedings of the 17th International Carpathian Control Conference ICCC 2016
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M.; ŠEDA, P. Minimised Weighted Covering of Service Networks. In Proceedings of the 17th International Carpathian Control Conference ICCC 2016. Košice: Technical University Košice, 2016. p. 645-650. ISBN: 978-1-4673-8605-0.
[citace_html] => ŠEDA, M.; ŠEDA, P. Minimised Weighted Covering of Service Networks. In Proceedings of the 17th International Carpathian Control Conference ICCC 2016. Košice: Technical University Košice, 2016. p. 645-650. ISBN: 978-1-4673-8605-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT128470,
author="Miloš {Šeda} and Pavel {Šeda}",
title="Minimised Weighted Covering of Service Networks",
booktitle="Proceedings of the 17th International Carpathian Control Conference ICCC 2016",
year="2016",
pages="645--650",
publisher="Technical University Košice",
address="Košice",
isbn="978-1-4673-8605-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] => Minimised Weighted Covering of Service Networks
[popis_en] => In this paper, we deal with the set covering problem, which consists in finding the minimum number of service centres providing specialized services within a reasonable distance given by a threshold. However, we consider not only the threshold, but also weights of service centres so that the most important ones would not be omitted from the final solution. Since even the basic task without weights belongs to the class of NP-hard problems, stochastic heuristic methods must be used for large instances of the problem.
[klicova_slova_en] => set covering, threshold, reachability matrix, genetic algorithm, repair operator, weight
[vysledek_datum] => 2016-05-20T00:00:00+02:00
)
[8] => Array
(
[vysledek_id] => 128490
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 120383
[vysledek_rok] => 2016
[nazev] => Simple Distance Line-point Algorithm for Line Extraction from 2D Laser Data
[nazev_orig] => Simple Distance Line-point Algorithm for Line Extraction from 2D Laser Data
[duvernost_udaju_id] => S
[popis] => To get information about surrounding environment in robotics experts use laser distance sensor the most nowadays. 2D laser range finders usually provide the robot a large number of the accurate data compared to other sensors (ultrasonic, infrared). There are other useful qualities of these data as wide viewing angle, high frequency scanning or small angular resolution. These data describe the environment, where they were taken, quite well. In order to perform robotic tasks, whether essential (front obstacle stop), or complex, such as mapping and localization, or both of them simultaneously, it is necessary to process the input data appropriately. A method of processing the input data is dependent on the environment where they were acquired to some extent. Structured qualities of the data are used mainly for the data obtained indoors. Lines are searched for among other data the most often. The lines represent, for example, straight walls of a room or hallway. Other geometric shapes as circles or ellipses can be searched among the data. This paper presents a simple incremental algorithm DILIP. This algorithm is based on an analytical calculation that is suitable for embedded devices and systems with limited computing power. DILIP algorithm was tested on the data obtained through a low-cost laser rangefinder RPlidar. The data was taken in a normal office environment.
[popis_orig] => To get information about surrounding environment in robotics experts use laser distance sensor the most nowadays. 2D laser range finders usually provide the robot a large number of the accurate data compared to other sensors (ultrasonic, infrared). There are other useful qualities of these data as wide viewing angle, high frequency scanning or small angular resolution. These data describe the environment, where they were taken, quite well. In order to perform robotic tasks, whether essential (front obstacle stop), or complex, such as mapping and localization, or both of them simultaneously, it is necessary to process the input data appropriately. A method of processing the input data is dependent on the environment where they were acquired to some extent. Structured qualities of the data are used mainly for the data obtained indoors. Lines are searched for among other data the most often. The lines represent, for example, straight walls of a room or hallway. Other geometric shapes as circles or ellipses can be searched among the data. This paper presents a simple incremental algorithm DILIP. This algorithm is based on an analytical calculation that is suitable for embedded devices and systems with limited computing power. DILIP algorithm was tested on the data obtained through a low-cost laser rangefinder RPlidar. The data was taken in a normal office environment.
[klicova_slova] => Line extraction. 2D laser. RPlidar. Range finders.
[klicova_slova_orig] => Line extraction. 2D laser. RPlidar. Range finders.
[url] => http://conferences.ukf.sk/index.php/divai/divai2016
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 200135
[schvaleno] => 2020-04-29
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KUBÍN, T.; ŠŤASTNÝ, J.; RÁBOVÁ, I.; ČAPEK, M.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[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 978-80-7552-249-8
[identifikator_popis] => ISBN - DIVAI 2016 ‐ 11th International Scientific Conference on Distance Learning in Applied Informatics
[riv_dodavka_id] => 2419
[riv_dodavka_oznaceni] => RIV20-MSM-26210___
[riv_dodavka_rok] => 2020
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => KUBÍN, T.; ŠŤASTNÝ, J.; RÁBOVÁ, I.; ČAPEK, M. Simple Distance Line-point Algorithm for Line Extraction from 2D Laser Data. In DIVAI 2016 ‐ 11th International Scientific Conference on Distance Learning in Applied Informatics. Prague: Wolters Kluwer, 2016. p. 551-560. ISBN: 978-80-7552-249-8.
[citace_html] => KUBÍN, T.; ŠŤASTNÝ, J.; RÁBOVÁ, I.; ČAPEK, M. Simple Distance Line-point Algorithm for Line Extraction from 2D Laser Data. In DIVAI 2016 ‐ 11th International Scientific Conference on Distance Learning in Applied Informatics. Prague: Wolters Kluwer, 2016. p. 551-560. ISBN: 978-80-7552-249-8.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT128490,
author="Tomáš {Kubín} and Jiří {Šťastný} and Ivana {Rábová} and Martin {Čapek}",
title="Simple Distance Line-point Algorithm for Line Extraction from 2D Laser Data",
booktitle="DIVAI 2016 ‐ 11th International Scientific Conference on Distance Learning in Applied Informatics",
year="2016",
pages="551--560",
publisher="Wolters Kluwer",
address="Prague",
isbn="978-80-7552-249-8",
url="http://conferences.ukf.sk/index.php/divai/divai2016"
}
[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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Simple Distance Line-point Algorithm for Line Extraction from 2D Laser Data
[popis_en] => To get information about surrounding environment in robotics experts use laser distance sensor the most nowadays. 2D laser range finders usually provide the robot a large number of the accurate data compared to other sensors (ultrasonic, infrared). There are other useful qualities of these data as wide viewing angle, high frequency scanning or small angular resolution. These data describe the environment, where they were taken, quite well. In order to perform robotic tasks, whether essential (front obstacle stop), or complex, such as mapping and localization, or both of them simultaneously, it is necessary to process the input data appropriately. A method of processing the input data is dependent on the environment where they were acquired to some extent. Structured qualities of the data are used mainly for the data obtained indoors. Lines are searched for among other data the most often. The lines represent, for example, straight walls of a room or hallway. Other geometric shapes as circles or ellipses can be searched among the data. This paper presents a simple incremental algorithm DILIP. This algorithm is based on an analytical calculation that is suitable for embedded devices and systems with limited computing power. DILIP algorithm was tested on the data obtained through a low-cost laser rangefinder RPlidar. The data was taken in a normal office environment.
[klicova_slova_en] => Line extraction. 2D laser. RPlidar. Range finders.
[vysledek_datum] => 2016-05-02T00:00:00+02:00
)
[9] => Array
(
[vysledek_id] => 128496
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 120392
[vysledek_rok] => 2016
[nazev] => Traveling Salesman Problem Optimization by Means of Graph-based Algorithm
[nazev_orig] => Traveling Salesman Problem Optimization by Means of Graph-based Algorithm
[duvernost_udaju_id] => S
[popis] => There are many different algorithms for
optimization of logistic and scheduling problems and one of the
most known is Genetic algorithm. In this paper we take a deeper
look at a draft of new graph-based algorithm for optimization of
scheduling problems based on Generalized Lifelong Planning A*
algorithm which is usually used for path planning of mobile
robots. And then we test it on Traveling Salesman Problem (TSP)
against classic implementation of genetic algorithm. The results
of these tests are then compared according to the time of finding
the best path, its travel distance, an average distance of travel
paths found and average time of finding these paths. A
comparison of the results shows that the proposed algorithm has
very fast convergence rate towards an optimal solution. Thanks
to this it reaches not only better solutions than genetic algorithm,
but in many instances it also reaches them faster.
[popis_orig] => There are many different algorithms for
optimization of logistic and scheduling problems and one of the
most known is Genetic algorithm. In this paper we take a deeper
look at a draft of new graph-based algorithm for optimization of
scheduling problems based on Generalized Lifelong Planning A*
algorithm which is usually used for path planning of mobile
robots. And then we test it on Traveling Salesman Problem (TSP)
against classic implementation of genetic algorithm. The results
of these tests are then compared according to the time of finding
the best path, its travel distance, an average distance of travel
paths found and average time of finding these paths. A
comparison of the results shows that the proposed algorithm has
very fast convergence rate towards an optimal solution. Thanks
to this it reaches not only better solutions than genetic algorithm,
but in many instances it also reaches them faster.
[klicova_slova] => Genetic algorithm; Graph-based algorithm;
Traveling Salesman Problem; GLPA*; NP-Hard problem; logistics
optimization; task scheduling
[klicova_slova_orig] => Genetic algorithm; Graph-based algorithm;
Traveling Salesman Problem; GLPA*; NP-Hard problem; logistics
optimization; task scheduling
[url] => https://ieeexplore.ieee.org/document/7760861
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 200135
[schvaleno] => 2021-02-26
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠŤASTNÝ, J.; ŠKORPIL, V.; ČÍŽEK, L.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1109/TSP.2016.7760861
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[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 978-1-5090-1287-9
[identifikator_popis] => ISBN - Proceedings of the 39th International Conference on Telecommunications and Signal Processing (TSP)
[riv_dodavka_id] => 2507
[riv_dodavka_oznaceni] => RIV17-MSM-26210___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠŤASTNÝ, J.; ŠKORPIL, V.; ČÍŽEK, L. Traveling Salesman Problem Optimization by Means of Graph-based Algorithm. In Proceedings of the 39th International Conference on Telecommunications and Signal Processing (TSP). Vienna, Austria: 2016. p. 207-210. ISBN: 978-1-5090-1287-9.
[citace_html] => ŠŤASTNÝ, J.; ŠKORPIL, V.; ČÍŽEK, L. Traveling Salesman Problem Optimization by Means of Graph-based Algorithm. In Proceedings of the 39th International Conference on Telecommunications and Signal Processing (TSP). Vienna, Austria: 2016. p. 207-210. ISBN: 978-1-5090-1287-9.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT128496,
author="Jiří {Šťastný} and Vladislav {Škorpil} and Lubomír {Čížek}",
title="Traveling Salesman Problem Optimization by Means of Graph-based Algorithm",
booktitle="Proceedings of the 39th International Conference on Telecommunications and Signal Processing (TSP)",
year="2016",
pages="207--210",
address="Vienna, Austria",
doi="10.1109/TSP.2016.7760861",
isbn="978-1-5090-1287-9",
url="https://ieeexplore.ieee.org/document/7760861"
}
[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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Traveling Salesman Problem Optimization by Means of Graph-based Algorithm
[popis_en] => There are many different algorithms for
optimization of logistic and scheduling problems and one of the
most known is Genetic algorithm. In this paper we take a deeper
look at a draft of new graph-based algorithm for optimization of
scheduling problems based on Generalized Lifelong Planning A*
algorithm which is usually used for path planning of mobile
robots. And then we test it on Traveling Salesman Problem (TSP)
against classic implementation of genetic algorithm. The results
of these tests are then compared according to the time of finding
the best path, its travel distance, an average distance of travel
paths found and average time of finding these paths. A
comparison of the results shows that the proposed algorithm has
very fast convergence rate towards an optimal solution. Thanks
to this it reaches not only better solutions than genetic algorithm,
but in many instances it also reaches them faster.
[klicova_slova_en] => Genetic algorithm; Graph-based algorithm;
Traveling Salesman Problem; GLPA*; NP-Hard problem; logistics
optimization; task scheduling
[vysledek_datum] => 2016-06-27T00:00:00+02:00
)
[10] => Array
(
[vysledek_id] => 128991
[vysledek_druh_id] => CONF
[ex_vysledek_id] => 23970
[vysledek_rok] => 2018
[nazev] => DIVAI 2018 ‐ 12th International Scientific Conference on Distance Learning in Applied Informatics
[nazev_orig] => DIVAI 2018 ‐ 12th International Scientific Conference on Distance Learning in Applied Informatics
[duvernost_udaju_id] => S
[popis] => Detection of collisions is an important part of many applications which work with threeimensional graphics. When intersections of objects can be determined, significant
computation time is saved because many computations do not have to be done. The algorithm
described in this article cannot determine the intersection of real objects, but it can help to save
CPU time by determining the intersection of object boundaries. The algorithm can be used in
many engineering or graphical applications, such as improvement of semi-transparent object
rendering or auxiliary collision detection in applications solving interactions of objects.
[popis_orig] => Detection of collisions is an important part of many applications which work with threeimensional graphics. When intersections of objects can be determined, significant
computation time is saved because many computations do not have to be done. The algorithm
described in this article cannot determine the intersection of real objects, but it can help to save
CPU time by determining the intersection of object boundaries. The algorithm can be used in
many engineering or graphical applications, such as improvement of semi-transparent object
rendering or auxiliary collision detection in applications solving interactions of objects.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] => http://conferences.ukf.sk/index.php/divai/divai2018
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 1519
[schvaleno] => 2019-03-08
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => JINDRA, P.; ŠŤASTNÝ, J.
[pocet_tvurcu] =>
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Akce
[druh_nazev] => Uspořádání (zorganizování) konference
[druh_popis] => Uspořádání (zorganizování) konference
[stav] => Schválený
[vysledek_kategorie_id] => EV
[vysledek_system_kategorie_id] => EV
[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] =>
[identifikator_popis] =>
[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] => JINDRA, P.; ŠŤASTNÝ, J.: DIVAI 2018 ‐ 12th International Scientific Conference on Distance Learning in Applied Informatics. Sturovo, SR (02.05.2018)
[citace_html] => JINDRA, P.; ŠŤASTNÝ, J.: DIVAI 2018 ‐ 12th International Scientific Conference on Distance Learning in Applied Informatics. Sturovo, SR (02.05.2018)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT128991,
title="DIVAI 2018 ‐ 12th International Scientific Conference on Distance Learning in Applied Informatics",
year="2018",
url="http://conferences.ukf.sk/index.php/divai/divai2018",
note="Holding a conference"
}
[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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => DIVAI 2018 ‐ 12th International Scientific Conference on Distance Learning in Applied Informatics
[popis_en] => Detection of collisions is an important part of many applications which work with threeimensional graphics. When intersections of objects can be determined, significant
computation time is saved because many computations do not have to be done. The algorithm
described in this article cannot determine the intersection of real objects, but it can help to save
CPU time by determining the intersection of object boundaries. The algorithm can be used in
many engineering or graphical applications, such as improvement of semi-transparent object
rendering or auxiliary collision detection in applications solving interactions of objects.
[klicova_slova_en] =>
[vysledek_datum] => 2018-05-02T00:00:00+02:00
)
[11] => Array
(
[vysledek_id] => 129193
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 120781
[vysledek_rok] => 2016
[nazev] => Suppression of Motion-Induced Vibration for a Two-DoF System Using State Feedback Control
[nazev_orig] => Suppression of Motion-Induced Vibration for a Two-DoF System Using State Feedback Control
[duvernost_udaju_id] => S
[popis] => Residual vibration control is crucial for applications in
long-range precision transportation, which requires fast
maneuvers with small motion-induced swings as well as low
residual vibrations. To achieve this goal, vibrations resulted
from structure motion must be analyzed and suppressed. A twodegree
of freedom pendulum system mounted on a linear
servomotor was realized to simulate the motion of high speed
rest-to-rest maneuvers for developing vibration control
strategies. Two feedback control schemes: i.e., loop shaping
controls for SISO systems and full state feedback with observers
and feedback linearization for MIMO systems were developed.
The experimental results indicated that in comparison with the
loop shaping control, the MIMO scheme could achieve a better
performance due to its abilities for counting the coupling and
compensating nonlinearities. The research results should be
useful in residual vibration reduction for mechatronics
applications in precision positioning.
[popis_orig] => Residual vibration control is crucial for applications in
long-range precision transportation, which requires fast
maneuvers with small motion-induced swings as well as low
residual vibrations. To achieve this goal, vibrations resulted
from structure motion must be analyzed and suppressed. A twodegree
of freedom pendulum system mounted on a linear
servomotor was realized to simulate the motion of high speed
rest-to-rest maneuvers for developing vibration control
strategies. Two feedback control schemes: i.e., loop shaping
controls for SISO systems and full state feedback with observers
and feedback linearization for MIMO systems were developed.
The experimental results indicated that in comparison with the
loop shaping control, the MIMO scheme could achieve a better
performance due to its abilities for counting the coupling and
compensating nonlinearities. The research results should be
useful in residual vibration reduction for mechatronics
applications in precision positioning.
[klicova_slova] => residual vibration, long-range transportation, full state feedback control, electromagnetic actuations
[klicova_slova_orig] => residual vibration, long-range transportation, full state feedback control, electromagnetic actuations
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 182808
[schvaleno] => 2022-03-16
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => LIN, W.; CHEN, K.; CHEN, Y.; VĚCHET, S.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[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 978-1-5090-1797-3
[identifikator_popis] => ISBN - 2016 IEEE International Power
Electronics and Motion Control
Conference (PEMC)
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => LIN, W.; CHEN, K.; CHEN, Y.; VĚCHET, S. Suppression of Motion-Induced Vibration for a Two-DoF System Using State Feedback Control. In 2016 IEEE International Power Electronics and Motion Control Conference (PEMC). Varna, Bulgaria: The Institute of Electrical and Electronics Engineers, 2016. p. 767-772. ISBN: 978-1-5090-1797-3.
[citace_html] => LIN, W.; CHEN, K.; CHEN, Y.; VĚCHET, S. Suppression of Motion-Induced Vibration for a Two-DoF System Using State Feedback Control. In 2016 IEEE International Power Electronics and Motion Control Conference (PEMC). Varna, Bulgaria: The Institute of Electrical and Electronics Engineers, 2016. p. 767-772. ISBN: 978-1-5090-1797-3.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT129193,
author="LIN, W. and CHEN, K. and CHEN, Y. and VĚCHET, S.",
title="Suppression of Motion-Induced Vibration for a Two-DoF System Using State Feedback Control",
booktitle="2016 IEEE International Power
Electronics and Motion Control
Conference (PEMC)",
year="2016",
pages="767--772",
publisher="The Institute of Electrical and Electronics Engineers",
address="Varna, Bulgaria",
isbn="978-1-5090-1797-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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Suppression of Motion-Induced Vibration for a Two-DoF System Using State Feedback Control
[popis_en] => Residual vibration control is crucial for applications in
long-range precision transportation, which requires fast
maneuvers with small motion-induced swings as well as low
residual vibrations. To achieve this goal, vibrations resulted
from structure motion must be analyzed and suppressed. A twodegree
of freedom pendulum system mounted on a linear
servomotor was realized to simulate the motion of high speed
rest-to-rest maneuvers for developing vibration control
strategies. Two feedback control schemes: i.e., loop shaping
controls for SISO systems and full state feedback with observers
and feedback linearization for MIMO systems were developed.
The experimental results indicated that in comparison with the
loop shaping control, the MIMO scheme could achieve a better
performance due to its abilities for counting the coupling and
compensating nonlinearities. The research results should be
useful in residual vibration reduction for mechatronics
applications in precision positioning.
[klicova_slova_en] => residual vibration, long-range transportation, full state feedback control, electromagnetic actuations
[vysledek_datum] => 2016-09-25T00:00:00+02:00
)
[12] => Array
(
[vysledek_id] => 130675
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 121458
[vysledek_rok] => 2016
[nazev] => Environmental Data Analysis for Learning Behavioral Patterns in Smart Homes
[nazev_orig] => Environmental Data Analysis for Learning Behavioral Patterns in Smart Homes
[duvernost_udaju_id] => S
[popis] => Data acquisition in smart homes is common activity to
ensure a stable, natural and energy saving environment inside
the building. However, typical usage of acquired data is limited to
temperature/humidity monitoring connected to thermostat or AC
control. Modern smart homes try to interconnect all standalone
control systems into one smart solution with information
downloaded from internet as weather forecast, daytime, position
of the sun on the sky, actual season, etc. We present a method,
how to detect window ventilation from measured data so the
control system can automatically turn-off heating which leads to
saving money for energy.
[popis_orig] => Data acquisition in smart homes is common activity to
ensure a stable, natural and energy saving environment inside
the building. However, typical usage of acquired data is limited to
temperature/humidity monitoring connected to thermostat or AC
control. Modern smart homes try to interconnect all standalone
control systems into one smart solution with information
downloaded from internet as weather forecast, daytime, position
of the sun on the sky, actual season, etc. We present a method,
how to detect window ventilation from measured data so the
control system can automatically turn-off heating which leads to
saving money for energy.
[klicova_slova] => smart homes; learning thermostats; data analysis
[klicova_slova_orig] => smart homes; learning thermostats; data analysis
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 107598
[schvaleno] => 2021-03-04
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => VĚCHET, S.; HRBÁČEK, J.; KREJSA, J.
[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] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[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 978-80-01-05882-4
[identifikator_popis] => ISBN - Proceedings of the
2016 17th International Conference on Mechatronics –
Mechatronika (ME) 2016
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => VĚCHET, S.; HRBÁČEK, J.; KREJSA, J. Environmental Data Analysis for Learning Behavioral Patterns in Smart Homes. In Proceedings of the 2016 17th International Conference on Mechatronics – Mechatronika (ME) 2016. 1. Prague: Czech Technical University in Prague, 2016. p. 386-391. ISBN: 978-80-01-05882-4.
[citace_html] => VĚCHET, S.; HRBÁČEK, J.; KREJSA, J. Environmental Data Analysis for Learning Behavioral Patterns in Smart Homes. In Proceedings of the 2016 17th International Conference on Mechatronics – Mechatronika (ME) 2016. 1. Prague: Czech Technical University in Prague, 2016. p. 386-391. ISBN: 978-80-01-05882-4.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT130675,
author="Stanislav {Věchet} and Jan {Hrbáček} and Jiří {Krejsa}",
title="Environmental Data Analysis for Learning Behavioral Patterns in Smart Homes",
booktitle="Proceedings of the
2016 17th International Conference on Mechatronics –
Mechatronika (ME) 2016",
year="2016",
series="1",
pages="386--391",
publisher="Czech Technical University in Prague",
address="Prague",
isbn="978-80-01-05882-4"
}
[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] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Environmental Data Analysis for Learning Behavioral Patterns in Smart Homes
[popis_en] => Data acquisition in smart homes is common activity to
ensure a stable, natural and energy saving environment inside
the building. However, typical usage of acquired data is limited to
temperature/humidity monitoring connected to thermostat or AC
control. Modern smart homes try to interconnect all standalone
control systems into one smart solution with information
downloaded from internet as weather forecast, daytime, position
of the sun on the sky, actual season, etc. We present a method,
how to detect window ventilation from measured data so the
control system can automatically turn-off heating which leads to
saving money for energy.
[klicova_slova_en] => smart homes; learning thermostats; data analysis
[vysledek_datum] => 2016-12-07T00:00:00+01:00
)
[13] => Array
(
[vysledek_id] => 131170
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 121764
[vysledek_rok] => 2016
[nazev] => Virtual Reality in Context of Industry 4.0
[nazev_orig] => Virtual Reality in Context of Industry 4.0
[duvernost_udaju_id] => S
[popis] => In industrial environments, it is often difficult and
expensive to collect a good amount of data to adequately train
expert systems for regression purposes. Therefore the usage of
already available data, related to environments showing similar
characteristics, could represent an effective approach to find a
good balance between regression performance and the amount of
data to gather for training. In this paper, the authors propose two
alternative strategies for improving the regression performance by
using heterogeneous data, i.e. data coming from diverse
environments with respect to the one taken as reference for testing.
These strategies are based on a standard machine learning
algorithm, i.e. the Artificial Neural Network (ANN). The employed
data came from measurements in industrial plants for energy
production through the combustion of coal powder. The powder is
transported in air within ducts and its size is detected by means of
Acoustic Emissions (AE) produced by the impact of powder on the
inner surface of the duct. The estimation of powder size
distribution from AE signals is the task addressed in this work.
Computer simulations show how the proposed strategies achieve a
relevant improvement of regression performance with respect to
the standard approach, using ANN directly on the dataset related
to the reference plant.
[popis_orig] => In industrial environments, it is often difficult and
expensive to collect a good amount of data to adequately train
expert systems for regression purposes. Therefore the usage of
already available data, related to environments showing similar
characteristics, could represent an effective approach to find a
good balance between regression performance and the amount of
data to gather for training. In this paper, the authors propose two
alternative strategies for improving the regression performance by
using heterogeneous data, i.e. data coming from diverse
environments with respect to the one taken as reference for testing.
These strategies are based on a standard machine learning
algorithm, i.e. the Artificial Neural Network (ANN). The employed
data came from measurements in industrial plants for energy
production through the combustion of coal powder. The powder is
transported in air within ducts and its size is detected by means of
Acoustic Emissions (AE) produced by the impact of powder on the
inner surface of the duct. The estimation of powder size
distribution from AE signals is the task addressed in this work.
Computer simulations show how the proposed strategies achieve a
relevant improvement of regression performance with respect to
the standard approach, using ANN directly on the dataset related
to the reference plant.
[klicova_slova] => Virtual Reality; Industry 4.0; Factory of Future; Dynamics; FEM; Atomic Force Microscopy; Microstructures
[klicova_slova_orig] => Virtual Reality; Industry 4.0; Factory of Future; Dynamics; FEM; Atomic Force Microscopy; Microstructures
[url] => http://ieeexplore.ieee.org/abstract/document/7827785/
[oecd_obor_id] => 20302
[odpovedny_utvar_id] => 183
[odpovedny_utvar_nazev] => Ústav výrobních strojů, systémů a robotiky
[odpovedny_utvar_zkratka] => ÚVSSR
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 11599
[schvaleno] => 2021-03-05
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KOVÁŘ, J.; MOURALOVÁ, K.; KŠICA, F.; KROUPA, J.; ANDRŠ, O.; HADAŠ, Z.
[pocet_tvurcu] => 6
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[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 978-80-01-05882-4
[identifikator_popis] => ISBN - Mechatronika 2016
[riv_dodavka_id] => 1530
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => KOVÁŘ, J.; MOURALOVÁ, K.; KŠICA, F.; KROUPA, J.; ANDRŠ, O.; HADAŠ, Z. Virtual Reality in Context of Industry 4.0. In Mechatronika 2016. Praha: Czech Technical University in Prague, Faculty of Electrical Engineering, 2016. p. 1-7. ISBN: 978-80-01-05882-4.
[citace_html] => KOVÁŘ, J.; MOURALOVÁ, K.; KŠICA, F.; KROUPA, J.; ANDRŠ, O.; HADAŠ, Z. Virtual Reality in Context of Industry 4.0. In Mechatronika 2016. Praha: Czech Technical University in Prague, Faculty of Electrical Engineering, 2016. p. 1-7. ISBN: 978-80-01-05882-4.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT131170,
author="Jiří {Kovář} and Kateřina {Mouralová} and Filip {Kšica} and Jiří {Kroupa} and Ondřej {Andrš} and Zdeněk {Hadaš}",
title="Virtual Reality in Context of Industry 4.0",
booktitle="Mechatronika 2016",
year="2016",
pages="1--7",
publisher="Czech Technical University in Prague, Faculty of Electrical Engineering",
address="Praha",
isbn="978-80-01-05882-4",
url="http://ieeexplore.ieee.org/abstract/document/7827785/"
}
[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] => 20302
[oecd_tree_podobor_nazev] => Applied mechanics
[poznamka_metriky] =>
[nazev_en] => Virtual Reality in Context of Industry 4.0
[popis_en] => In industrial environments, it is often difficult and
expensive to collect a good amount of data to adequately train
expert systems for regression purposes. Therefore the usage of
already available data, related to environments showing similar
characteristics, could represent an effective approach to find a
good balance between regression performance and the amount of
data to gather for training. In this paper, the authors propose two
alternative strategies for improving the regression performance by
using heterogeneous data, i.e. data coming from diverse
environments with respect to the one taken as reference for testing.
These strategies are based on a standard machine learning
algorithm, i.e. the Artificial Neural Network (ANN). The employed
data came from measurements in industrial plants for energy
production through the combustion of coal powder. The powder is
transported in air within ducts and its size is detected by means of
Acoustic Emissions (AE) produced by the impact of powder on the
inner surface of the duct. The estimation of powder size
distribution from AE signals is the task addressed in this work.
Computer simulations show how the proposed strategies achieve a
relevant improvement of regression performance with respect to
the standard approach, using ANN directly on the dataset related
to the reference plant.
[klicova_slova_en] => Virtual Reality; Industry 4.0; Factory of Future; Dynamics; FEM; Atomic Force Microscopy; Microstructures
[vysledek_datum] => 2016-12-07T00:00:00+01:00
)
[14] => Array
(
[vysledek_id] => 132900
[vysledek_druh_id] => ARTSC
[ex_vysledek_id] => 122563
[vysledek_rok] => 2014
[nazev] => Canadian traveller problem: A note about Game Theory approach
[nazev_orig] => Canadian traveller problem: A note about Game Theory approach
[duvernost_udaju_id] => S
[popis] => In a variety of real world problems from robot navigation to logistics, agents face the challenge of path optimization on a graph with unknown edge costs. It is known as the Canadian Traveller Problem (CTP). There are many variants of CTP and many path planning approaches to find an optimal solution of the CTP. The aim of the paper is to present the possible way for a solution strategy and possible problem description by means of the Game Theory (GT). The paper presents initial study and theoretical background of the Game Theory approaches to find a proper CTP policy. In this problem the agent known as a traveller needs to go trough the real-life ways implemented by CTP. The presented CTP problem is a base problem with unrecoverable edges. Because the most of the CTP solution strategies are based on heuristic and meta-heuristic algorithms, i.e. on the ground of Artificial Intelligence (AI) approaches, we also present this kind of solution. The GT solution is compared with advance swarm intelligence strategy based on Elitist Ant System (AS).
[popis_orig] => In a variety of real world problems from robot navigation to logistics, agents face the challenge of path optimization on a graph with unknown edge costs. It is known as the Canadian Traveller Problem (CTP). There are many variants of CTP and many path planning approaches to find an optimal solution of the CTP. The aim of the paper is to present the possible way for a solution strategy and possible problem description by means of the Game Theory (GT). The paper presents initial study and theoretical background of the Game Theory approaches to find a proper CTP policy. In this problem the agent known as a traveller needs to go trough the real-life ways implemented by CTP. The presented CTP problem is a base problem with unrecoverable edges. Because the most of the CTP solution strategies are based on heuristic and meta-heuristic algorithms, i.e. on the ground of Artificial Intelligence (AI) approaches, we also present this kind of solution. The GT solution is compared with advance swarm intelligence strategy based on Elitist Ant System (AS).
[klicova_slova] => Ant System; Canadian Traveller Problem; CTP; Game Theory; Swarm intelligence
[klicova_slova_orig] => Ant System; Canadian Traveller Problem; CTP; Game Theory; Swarm intelligence
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 148
[odpovedny_utvar_nazev] => Ústav matematiky
[odpovedny_utvar_zkratka] => ÚM
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2019-08-19
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => HRDINA, J.; MATOUŠEK, R.
[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] => Publikační výsledky
[druh_nazev] => Článek Scopus
[druh_popis] => Článek v odborném periodiku je obsažen v databázi SCOPUS společnosti Elsevier s příznakem „Article“, „Review“ nebo „Letter“
[stav] => Schválený
[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] => ISSN 1803-3814
[identifikator_popis] => ISSN - Mendel Journal series (CZ)
[riv_dodavka_id] => 1562
[riv_dodavka_oznaceni] => RIV18-TA0-26510___
[riv_dodavka_rok] => 2017
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => HRDINA, J.; MATOUŠEK, R. Canadian traveller problem: A note about Game Theory approach. Mendel Journal series, 2014, vol. 2014, no. 1, p. 403-406. ISSN: 1803-3814.
[citace_html] => HRDINA, J.; MATOUŠEK, R. Canadian traveller problem: A note about Game Theory approach. Mendel Journal series, 2014, vol. 2014, no. 1, p. 403-406. ISSN: 1803-3814.
[citace_rtf] =>
[citace_bibtex] => @article{BUT132900,
author="Jaroslav {Hrdina} and Radomil {Matoušek}",
title="Canadian traveller problem: A note about Game Theory approach",
journal="Mendel Journal series",
year="2014",
volume="2014",
number="1",
pages="403--406",
issn="1803-3814"
}
[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] => Canadian traveller problem: A note about Game Theory approach
[popis_en] => In a variety of real world problems from robot navigation to logistics, agents face the challenge of path optimization on a graph with unknown edge costs. It is known as the Canadian Traveller Problem (CTP). There are many variants of CTP and many path planning approaches to find an optimal solution of the CTP. The aim of the paper is to present the possible way for a solution strategy and possible problem description by means of the Game Theory (GT). The paper presents initial study and theoretical background of the Game Theory approaches to find a proper CTP policy. In this problem the agent known as a traveller needs to go trough the real-life ways implemented by CTP. The presented CTP problem is a base problem with unrecoverable edges. Because the most of the CTP solution strategies are based on heuristic and meta-heuristic algorithms, i.e. on the ground of Artificial Intelligence (AI) approaches, we also present this kind of solution. The GT solution is compared with advance swarm intelligence strategy based on Elitist Ant System (AS).
[klicova_slova_en] => Ant System; Canadian Traveller Problem; CTP; Game Theory; Swarm intelligence
[vysledek_datum] => 2014-09-01T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 116
[count] => 15
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /veda/publikace/detail/
[base_page] => /veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => MARADA, T.
[title] => PID CONTROLER PARAMETERS SETTINGS BASED ON GENETIC ALGORITHM FOR INVERTED PENDULUM PURPOSE STABILIZATION
[typ] => PV
[year] => 2016
[id_vav] => 128262
)
[1] => Array
(
[quotations] => Gulina Irina, Matousek Radomil
[title] => EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS
[typ] => PV
[year] => 2016
[id_vav] => 128283
)
[2] => Array
(
[quotations] => MARADA, T.
[title] => PROJEKTY INTELIGENTNÍ ELEKTROINSTALACE
[typ] => PV
[year] => 2011
[id_vav] => 128292
)
[3] => Array
(
[quotations] => ŠŤASTNÝ, J.; RICHTER, J.
[title] => Adaptation of Genetic Algorithm to Determine Air Jet Shape of Flow Visualized by Helium Bubbles
[typ] => PV
[year] => 2016
[id_vav] => 128335
)
[4] => Array
(
[quotations] => VDOLEČEK, F.
[title] => Quarter Century with Measurement Uncertainties
[typ] => PV
[year] => 2016
[id_vav] => 128390
)
[5] => Array
(
[quotations] => BRÁZDA, V.; KOLOMAZNÍK, J.; LÝSEK, J.; HÁRONÍKOVÁ, L.; COUFAL, J.; ŠŤASTNÝ, J.
[title] => Palindrome analyser – A new web-based server for predicting and evaluating inverted repeats in nucleotide sequences
[typ] => PV
[year] => 2016
[id_vav] => 128435
)
[6] => Array
(
[quotations] => Lacko Branislav
[title] => Kryt svařovací helmy s automaticky řízeným pneumatickým přesunem ochranného skla
[typ] => AV
[year] => 2016
[id_vav] => 128441
)
[7] => Array
(
[quotations] => ŠEDA, M.; ŠEDA, P.
[title] => Minimised Weighted Covering of Service Networks
[typ] => PV
[year] => 2016
[id_vav] => 128470
)
[8] => Array
(
[quotations] => KUBÍN, T.; ŠŤASTNÝ, J.; RÁBOVÁ, I.; ČAPEK, M.
[title] => Simple Distance Line-point Algorithm for Line Extraction from 2D Laser Data
[typ] => PV
[year] => 2016
[id_vav] => 128490
)
[9] => Array
(
[quotations] => ŠŤASTNÝ, J.; ŠKORPIL, V.; ČÍŽEK, L.
[title] => Traveling Salesman Problem Optimization by Means of Graph-based Algorithm
[typ] => PV
[year] => 2016
[id_vav] => 128496
)
[10] => Array
(
[quotations] => JINDRA, P.; ŠŤASTNÝ, J.
[title] => DIVAI 2018 ‐ 12th International Scientific Conference on Distance Learning in Applied Informatics
[typ] => EV
[year] => 2018
[id_vav] => 128991
)
[11] => Array
(
[quotations] => LIN, W.; CHEN, K.; CHEN, Y.; VĚCHET, S.
[title] => Suppression of Motion-Induced Vibration for a Two-DoF System Using State Feedback Control
[typ] => PV
[year] => 2016
[id_vav] => 129193
)
[12] => Array
(
[quotations] => VĚCHET, S.; HRBÁČEK, J.; KREJSA, J.
[title] => Environmental Data Analysis for Learning Behavioral Patterns in Smart Homes
[typ] => PV
[year] => 2016
[id_vav] => 130675
)
[13] => Array
(
[quotations] => KOVÁŘ, J.; MOURALOVÁ, K.; KŠICA, F.; KROUPA, J.; ANDRŠ, O.; HADAŠ, Z.
[title] => Virtual Reality in Context of Industry 4.0
[typ] => PV
[year] => 2016
[id_vav] => 131170
)
[14] => Array
(
[quotations] => HRDINA, J.; MATOUŠEK, R.
[title] => Canadian traveller problem: A note about Game Theory approach
[typ] => PV
[year] => 2014
[id_vav] => 132900
)
)
)