Array
(
[page] => 127
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 163938
[vysledek_druh_id] => ARTSC
[ex_vysledek_id] => 136450
[vysledek_rok] => 2019
[nazev] => Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching
[nazev_orig] => Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching
[duvernost_udaju_id] => S
[popis] => The Minimum-Volume Covering Ellipsoid (MVCE) problem is an important opti-mization problem that comes up in various areas of engineering and statistics. Inthis paper, we improve the state-of-the-art Wolfe-Atwood algorithm for solving theMVCE problem with pooling and batching procedures. This implementation yieldssignificant improvements on the runtime of the algorithm for large-scale instancesof the MVCE problem, which is demonstrated on quite extensive computationalexperiments.
[popis_orig] => The Minimum-Volume Covering Ellipsoid (MVCE) problem is an important opti-mization problem that comes up in various areas of engineering and statistics. Inthis paper, we improve the state-of-the-art Wolfe-Atwood algorithm for solving theMVCE problem with pooling and batching procedures. This implementation yieldssignificant improvements on the runtime of the algorithm for large-scale instancesof the MVCE problem, which is demonstrated on quite extensive computationalexperiments.
[klicova_slova] => minimum-volume covering ellipsoid; Lowner-John ellipsoid; large-scale optimization; Wolfe-Atwood algorithm; pooling; batching
[klicova_slova_orig] => minimum-volume covering ellipsoid; Lowner-John ellipsoid; large-scale optimization; Wolfe-Atwood algorithm; pooling; batching
[url] => https://mendel-journal.org/index.php/mendel/article/view/104
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 200135
[schvaleno] => 2021-03-09
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.13164/mendel.2019.2.019
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Scopus Article
[druh_popis] => Peer-reviewed article included in Scopus database as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 1803-3814
[identifikator_popis] => ISSN - Mendel Journal series (CZ)
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => KŮDELA, J. Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching. Mendel Journal series, 2019, vol. 25, no. 2, p. 19-26. ISSN: 1803-3814.
[citace_html] => KŮDELA, J. Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching. Mendel Journal series, 2019, vol. 25, no. 2, p. 19-26. ISSN: 1803-3814.
[citace_rtf] =>
[citace_bibtex] => @article{BUT163938,
author="Jakub {Kůdela}",
title="Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching",
journal="Mendel Journal series",
year="2019",
volume="25",
number="2",
pages="19--26",
doi="10.13164/mendel.2019.2.019",
issn="1803-3814",
url="https://mendel-journal.org/index.php/mendel/article/view/104"
}
[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] => 4
[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] => Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching
[popis_en] => The Minimum-Volume Covering Ellipsoid (MVCE) problem is an important opti-mization problem that comes up in various areas of engineering and statistics. Inthis paper, we improve the state-of-the-art Wolfe-Atwood algorithm for solving theMVCE problem with pooling and batching procedures. This implementation yieldssignificant improvements on the runtime of the algorithm for large-scale instancesof the MVCE problem, which is demonstrated on quite extensive computationalexperiments.
[klicova_slova_en] => minimum-volume covering ellipsoid; Lowner-John ellipsoid; large-scale optimization; Wolfe-Atwood algorithm; pooling; batching
[vysledek_datum] => 2019-12-21T00:00:00+01:00
)
[1] => Array
(
[vysledek_id] => 163939
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 136451
[vysledek_rok] => 2020
[nazev] => Pool & Discard Algorithm for Chance Constrained Optimization Problems
[nazev_orig] => Pool & Discard Algorithm for Chance Constrained Optimization Problems
[duvernost_udaju_id] => S
[popis] => In this paper, we describe an effective algorithm for handling chance constrained optimization problems, called the Pool & Discard algorithm. The algorithm utilizes the scenario approximation framework for chance constrained optimization problems, and the warm-start and problem modification features of modern solvers. The exploitation of the problem structure and efficient implementation allows us to considerably speed up the computations, especially for large instances, when compared with conventional methods.
[popis_orig] => In this paper, we describe an effective algorithm for handling chance constrained optimization problems, called the Pool & Discard algorithm. The algorithm utilizes the scenario approximation framework for chance constrained optimization problems, and the warm-start and problem modification features of modern solvers. The exploitation of the problem structure and efficient implementation allows us to considerably speed up the computations, especially for large instances, when compared with conventional methods.
[klicova_slova] => chance constrained programming; scenario approximation; P&D algorithm; stochastic programming; constraint removal
[klicova_slova_orig] => chance constrained programming; scenario approximation; P&D algorithm; stochastic programming; constraint removal
[url] => https://ieeexplore.ieee.org/document/9079523
[oecd_obor_id] => 10102
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 51108
[schvaleno] => 2020-07-29
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 101861
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.; POPELA, P.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1109/ACCESS.2020.2990726
[kod_dspace] => 11012/193413
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 2169-3536
[identifikator_popis] => ISSN - IEEE Access (US)
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => KŮDELA, J.; POPELA, P. Pool & Discard Algorithm for Chance Constrained Optimization Problems. IEEE Access, 2020, vol. 8, no. 1, p. 79397-79407. ISSN: 2169-3536.
[citace_html] => KŮDELA, J.; POPELA, P. Pool & Discard Algorithm for Chance Constrained Optimization Problems. IEEE Access, 2020, vol. 8, no. 1, p. 79397-79407. ISSN: 2169-3536.
[citace_rtf] =>
[citace_bibtex] => @article{BUT163939,
author="Jakub {Kůdela} and Pavel {Popela}",
title="Pool & Discard Algorithm for Chance Constrained Optimization Problems",
journal="IEEE Access",
year="2020",
volume="8",
number="1",
pages="79397--79407",
doi="10.1109/ACCESS.2020.2990726",
issn="2169-3536",
url="https://ieeexplore.ieee.org/document/9079523"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 3.367
[if_q] => 2
[if_m17_q] => 2
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 4
[if_m25_d] => 4
[if_percentil] => 65.751
[if_m17_percentil] => 67.148
[if_m25_percentil] => 67.148
[ais] => 0.592
[ais_m17_q] => 2
[ais_m25_q] => 2
[ais_m17_d] => 5
[ais_m25_d] => 4
[ais_m17_percentil] => 55.698
[ais_m25_percentil] => 61.561
[jci] => 1.01
[jci_q] => 1
[jci_percentil] => 76.646
[ef] =>
[scopus_sjr] => 0.587
[scopus_sjr_q] => 1
[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] => 10102
[oecd_tree_podobor_nazev] => Applied mathematics
[poznamka_metriky] =>
[nazev_en] => Pool & Discard Algorithm for Chance Constrained Optimization Problems
[popis_en] => In this paper, we describe an effective algorithm for handling chance constrained optimization problems, called the Pool & Discard algorithm. The algorithm utilizes the scenario approximation framework for chance constrained optimization problems, and the warm-start and problem modification features of modern solvers. The exploitation of the problem structure and efficient implementation allows us to considerably speed up the computations, especially for large instances, when compared with conventional methods.
[klicova_slova_en] => chance constrained programming; scenario approximation; P&D algorithm; stochastic programming; constraint removal
[vysledek_datum] => 2020-04-27T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 164187
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 136592
[vysledek_rok] => 2020
[nazev] => G4Killer web application: a tool to design G-quadruplex mutations
[nazev_orig] => G4Killer web application: a tool to design G-quadruplex mutations
[duvernost_udaju_id] => S
[popis] => G-quadruplexes (G4) are important regulatory non-B DNA structures with therapeutic potential. A tool for rational design of mutations leading to decreased propensity for G4 formation should be useful in studying G4 functions. Although tools exist for G4 prediction, no easily accessible tool for the rational design of G4 mutations has been available. RESULTS: We developed a web-based tool termed G4Killer that is based on the G4Hunter algorithm. This new tool is a platform-independent and user-friendly application to design mutations crippling G4 propensity in a parsimonious way (i.e., keeping the primary sequence as close as possible to the original one). The tool is integrated into our DNA analyzer server and allows for generating mutated DNA sequences having the desired lowered G4Hunter score with minimal mutation steps. AVAILABILITY AND IMPLEMENTATION: The G4Killer web tool can be accessed at: http://bioinformatics.ibp.cz. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. © The Author(s) 2020. Published by Oxford University Press.
[popis_orig] => G-quadruplexes (G4) are important regulatory non-B DNA structures with therapeutic potential. A tool for rational design of mutations leading to decreased propensity for G4 formation should be useful in studying G4 functions. Although tools exist for G4 prediction, no easily accessible tool for the rational design of G4 mutations has been available. RESULTS: We developed a web-based tool termed G4Killer that is based on the G4Hunter algorithm. This new tool is a platform-independent and user-friendly application to design mutations crippling G4 propensity in a parsimonious way (i.e., keeping the primary sequence as close as possible to the original one). The tool is integrated into our DNA analyzer server and allows for generating mutated DNA sequences having the desired lowered G4Hunter score with minimal mutation steps. AVAILABILITY AND IMPLEMENTATION: The G4Killer web tool can be accessed at: http://bioinformatics.ibp.cz. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. © The Author(s) 2020. Published by Oxford University Press.
[klicova_slova] => G4Killer, G-quadruplex, web application
[klicova_slova_orig] => G4Killer, G-quadruplex, web application
[url] => https://academic.oup.com/bioinformatics/article/36/10/3246/5716328
[oecd_obor_id] => 20205
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 1519
[schvaleno] => 2020-08-26
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 102199
[posledni_diagnostika] =>
[vycet_osob] => BRÁZDA, V.; KOLOMAZNÍK, J.; MERGNY, J.; ŠŤASTNÝ, J.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1093/bioinformatics/btaa057
[kod_dspace] => 11012/194871
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 1367-4803
[identifikator_popis] => ISSN - BIOINFORMATICS (GB)
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => BRÁZDA, V.; KOLOMAZNÍK, J.; MERGNY, J.; ŠŤASTNÝ, J. G4Killer web application: a tool to design G-quadruplex mutations. BIOINFORMATICS, 2020, vol. 36, no. 10, p. 3246-3247. ISSN: 1367-4803.
[citace_html] => BRÁZDA, V.; KOLOMAZNÍK, J.; MERGNY, J.; ŠŤASTNÝ, J. G4Killer web application: a tool to design G-quadruplex mutations. BIOINFORMATICS, 2020, vol. 36, no. 10, p. 3246-3247. ISSN: 1367-4803.
[citace_rtf] =>
[citace_bibtex] => @article{BUT164187,
author="Václav {Brázda} and Jan {Kolomazník} and Jean-Louis {Mergny} and Jiří {Šťastný}",
title="G4Killer web application: a tool to design G-quadruplex mutations",
journal="BIOINFORMATICS",
year="2020",
volume="36",
number="10",
pages="3246--3247",
doi="10.1093/bioinformatics/btaa057",
issn="1367-4803",
url="https://academic.oup.com/bioinformatics/article/36/10/3246/5716328"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 6.937
[if_q] => 1
[if_m17_q] => 1
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 1
[if_m25_d] => 1
[if_percentil] => 95.69
[if_m17_percentil] => 90.943
[if_m25_percentil] => 90.943
[ais] => 3.582
[ais_m17_q] => 1
[ais_m25_q] => 1
[ais_m17_d] => 1
[ais_m25_d] => 1
[ais_m17_percentil] => 96.584
[ais_m25_percentil] => 96.707
[jci] => 1.96
[jci_q] => 1
[jci_percentil] => 96.269
[ef] =>
[scopus_sjr] => 3.599
[scopus_sjr_q] => 1
[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] => 20205
[oecd_tree_podobor_nazev] => Automation and control systems
[poznamka_metriky] =>
[nazev_en] => G4Killer web application: a tool to design G-quadruplex mutations
[popis_en] => G-quadruplexes (G4) are important regulatory non-B DNA structures with therapeutic potential. A tool for rational design of mutations leading to decreased propensity for G4 formation should be useful in studying G4 functions. Although tools exist for G4 prediction, no easily accessible tool for the rational design of G4 mutations has been available. RESULTS: We developed a web-based tool termed G4Killer that is based on the G4Hunter algorithm. This new tool is a platform-independent and user-friendly application to design mutations crippling G4 propensity in a parsimonious way (i.e., keeping the primary sequence as close as possible to the original one). The tool is integrated into our DNA analyzer server and allows for generating mutated DNA sequences having the desired lowered G4Hunter score with minimal mutation steps. AVAILABILITY AND IMPLEMENTATION: The G4Killer web tool can be accessed at: http://bioinformatics.ibp.cz. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. © The Author(s) 2020. Published by Oxford University Press.
[klicova_slova_en] => G4Killer, G-quadruplex, web application
[vysledek_datum] => 2020-05-15T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 164570
[vysledek_druh_id] => CONPAX
[ex_vysledek_id] => 136878
[vysledek_rok] => 2020
[nazev] => Analýza statorového proudu asynchronního motoru při různých zatíženích a poruchách
[nazev_orig] => Analýza statorového proudu asynchronního motoru při různých zatíženích a poruchách
[duvernost_udaju_id] => S
[popis] => Příspěvek je zaměřen na analýzu statorového proudu trojfázového asynchronního
motoru s kotvou nakrátko při různých zatíženích motoru a poruchách tyčí rotorové klece.
V úvodu je proveden stručný rozbor diagnostiky elektrických zařízení s důrazem na
elektrické motory. Dále je rozebrána jedna z důležitých metod diagnostiky uvedených
zařízení, a to analýza statorového proudu. Je stručně popsán experiment, který spočíval
v měření spekter statorového proudu při jmenovitém zatížení a dále při hodnotách 25%
a 50% zatížení jmenovitého. Poruchy motoru byly simulovány různým přerušením vodičů
(tyčí) rotoru motoru. Byly sledovány poruchy při poškození 1 vodiče, 2 vodičů vedle sebe
a totéž pro 3 vodiče. Rovněž byly přerušeny 2 vodiče, a to vždy 1 a 1 vodič proti sobě
a podobně 2 a 2 vodiče proti sobě. Výsledky analýzy statorového proudu při sledovaných
kombinací zatížení a poruch vodičů jsou náležitě popsány a vyhodnoceny.
[popis_orig] => Příspěvek je zaměřen na analýzu statorového proudu trojfázového asynchronního
motoru s kotvou nakrátko při různých zatíženích motoru a poruchách tyčí rotorové klece.
V úvodu je proveden stručný rozbor diagnostiky elektrických zařízení s důrazem na
elektrické motory. Dále je rozebrána jedna z důležitých metod diagnostiky uvedených
zařízení, a to analýza statorového proudu. Je stručně popsán experiment, který spočíval
v měření spekter statorového proudu při jmenovitém zatížení a dále při hodnotách 25%
a 50% zatížení jmenovitého. Poruchy motoru byly simulovány různým přerušením vodičů
(tyčí) rotoru motoru. Byly sledovány poruchy při poškození 1 vodiče, 2 vodičů vedle sebe
a totéž pro 3 vodiče. Rovněž byly přerušeny 2 vodiče, a to vždy 1 a 1 vodič proti sobě
a podobně 2 a 2 vodiče proti sobě. Výsledky analýzy statorového proudu při sledovaných
kombinací zatížení a poruch vodičů jsou náležitě popsány a vyhodnoceny.
[klicova_slova] => Statorový proud; asynchronní motor, diagnostika elektrických zařízení; spektra statorového proudu
[klicova_slova_orig] => Statorový proud; asynchronní motor, diagnostika elektrických zařízení; spektra statorového proudu
[url] =>
[oecd_obor_id] => 20201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 1508
[schvaleno] => 2020-07-23
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => NAHODIL, P.; HAMMER, M.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings outside WoS and Scopus
[druh_popis] => Paper in proceedings outside WoS and Scopus
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => NAHODIL, P.; HAMMER, M. Analýza statorového proudu asynchronního motoru při různých zatíženích a poruchách. VŠB TU Ostrava: VŠB TU Ostrava, 2020. s. 67-76.
[citace_html] => NAHODIL, P.; HAMMER, M. Analýza statorového proudu asynchronního motoru při různých zatíženích a poruchách. VŠB TU Ostrava: VŠB TU Ostrava, 2020. s. 67-76.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT164570,
author="Petr {Nahodil} and Miloš {Hammer}",
title="Analýza statorového proudu asynchronního motoru při různých zatíženích a poruchách",
year="2020",
pages="67--76",
publisher="VŠB TU Ostrava",
address="VŠB TU Ostrava"
}
[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] => ASYNCHRONOUS STATOR CURRENT ANALYSIS
ENGINE UNDER DIFFERENT LOADS AND FAULTS
[popis_en] => The paper focuses on the analysis of the stator current of a three-phase asynchronous motor with a short-circuit armature at different motor loads and rotor cage rod failures. In the introduction, a brief analysis of electrical equipment diagnostics with emphasis on electric motors is performed. Furthermore, one of the important methods of diagnostics of these devices, namely the analysis of stator current, is discussed. The experiment is briefly described, which consisted in measuring the spectra of the stator current at the rated load and further at the values of 25% and 50% of the rated load. Motor failures were simulated by various interruptions of the wires (rods) of the motor rotor. Faults were monitored in case of damage of 1 wire, 2 wires next to each other and the same for 3 wires. Also, 2 wires were interrupted, namely 1 and 1 wire facing each other and similarly 2 and 2 wires facing each other. The results of the stator current analysis for the monitored combinations of loads and conductor faults are properly described and evaluated.
[klicova_slova_en] => Stator current; asynchronous motor, diagnostics of electrical equipment; stator current spectrum
[vysledek_datum] => 2020-01-23T00:00:00+01:00
)
[4] => Array
(
[vysledek_id] => 164571
[vysledek_druh_id] => REV
[ex_vysledek_id] => 136879
[vysledek_rok] => 2020
[nazev] => Elektrodiagnostika jako součást multiparametrické diagnostiky v průmyslové praxi
[nazev_orig] => Elektrodiagnostika jako součást multiparametrické diagnostiky v průmyslové praxi
[duvernost_udaju_id] => S
[popis] => Článek je zaměřen na elektrodiagnostiku a další diagnostické metody jako součást multiparametrické diagnostiky. V úvodní části je obecně pojednáno o technické diagnostice, jejím dělení a objasnění pojmu multiparametrická diagnostika. Dále je popsán objekt diagnostiky – dieselelektrické soustrojí a jsou stručně rozebrány aspekty s vlivem na jeho chování. Podstatná část článku je věnována příkladu použití multiparametrické diagnostiky s důrazem na rozbor a zobecnění výsledků. Nechybí návrh opatření pro technickou praxi a stručný závěr.
[popis_orig] => Článek je zaměřen na elektrodiagnostiku a další diagnostické metody jako součást multiparametrické diagnostiky. V úvodní části je obecně pojednáno o technické diagnostice, jejím dělení a objasnění pojmu multiparametrická diagnostika. Dále je popsán objekt diagnostiky – dieselelektrické soustrojí a jsou stručně rozebrány aspekty s vlivem na jeho chování. Podstatná část článku je věnována příkladu použití multiparametrické diagnostiky s důrazem na rozbor a zobecnění výsledků. Nechybí návrh opatření pro technickou praxi a stručný závěr.
[klicova_slova] => Elektrodiagnostika; diagnostické metody; multiparametrická diagnostika
[klicova_slova_orig] => Elektrodiagnostika; diagnostické metody; multiparametrická diagnostika
[url] =>
[oecd_obor_id] => 20205
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 1508
[schvaleno] => 2020-07-23
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => HAMMER, M.; NAHODIL, 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] => Publication results
[druh_nazev] => Article - other
[druh_popis] => Article - other
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => HAMMER, M.; NAHODIL, P. Elektrodiagnostika jako součást multiparametrické diagnostiky v průmyslové praxi. Český Těšín: Trade Media International,s.r.o, 2020. s. 11-15.
[citace_html] => HAMMER, M.; NAHODIL, P. Elektrodiagnostika jako součást multiparametrické diagnostiky v průmyslové praxi. Český Těšín: Trade Media International,s.r.o, 2020. s. 11-15.
[citace_rtf] =>
[citace_bibtex] => @misc{BUT164571,
author="Miloš {Hammer} and Petr {Nahodil}",
title="Elektrodiagnostika jako součást multiparametrické diagnostiky v průmyslové praxi",
year="2020",
pages="11--15",
publisher="Trade Media International,s.r.o",
address="Český Těšín",
note="Article - other"
}
[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] => 20205
[oecd_tree_podobor_nazev] => Automation and control systems
[poznamka_metriky] =>
[nazev_en] => Electrodiagnostics as a part of multiparametric diagnostics in industrial practice
[popis_en] => The article is focused on electrodiagnostics and other diagnostic methods as a part of multiparametric diagnostics. The introductory part generally discusses technical diagnostics, its division and clarification of the term multiparametric diagnostics. Furthermore, the object of diagnostics - diesel-electric set is described and aspects with influence on its behavior are briefly analyzed. A substantial part of the article is devoted to the example of the use of multiparametric diagnostics with emphasis on the analysis and generalization of results. There is also a draft of measures for technical practice and a brief conclusion.
[klicova_slova_en] => Electrodiagnostics; diagnostic methods; multiparametric diagnostics
[vysledek_datum] => 2020-06-01T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 164599
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 136897
[vysledek_rok] => 2020
[nazev] => Legislation-induced planning of waste processing infrastructure: A case study of the Czech Republic
[nazev_orig] => Legislation-induced planning of waste processing infrastructure: A case study of the Czech Republic
[duvernost_udaju_id] => S
[popis] => Trends in the treatment of municipal solid waste are changing worldwide. In the European Union, one of the largest economies in the world, the waste treatment and management among the member states vary significantly. To support and promote environmentally friendly waste management, the European Union issued directives commonly called the Circular Economy Package. This legislative is designed to accelerate the transition to a cleaner future. It gives an obligation to member states to meet specific landfilling and recycling targets. To reach these ambitious goals will be a challenging task, especially for the member states with less developed waste management systems. An approach using multi-stage stochastic programming is suggested for solving such a problem. The developed model considers current material recovery rates and trends in municipal waste, while uncertain waste production is forecasted by possible scenarios. The model enables sequential decision-making and assessment of various strategies for different future scenarios with specific years, locations, technologies and capacities for the establishment of the waste processing infrastructure. The utilization of the model and its computational tractability is demonstrated in a case study of the Czech Republic.
[popis_orig] => Trends in the treatment of municipal solid waste are changing worldwide. In the European Union, one of the largest economies in the world, the waste treatment and management among the member states vary significantly. To support and promote environmentally friendly waste management, the European Union issued directives commonly called the Circular Economy Package. This legislative is designed to accelerate the transition to a cleaner future. It gives an obligation to member states to meet specific landfilling and recycling targets. To reach these ambitious goals will be a challenging task, especially for the member states with less developed waste management systems. An approach using multi-stage stochastic programming is suggested for solving such a problem. The developed model considers current material recovery rates and trends in municipal waste, while uncertain waste production is forecasted by possible scenarios. The model enables sequential decision-making and assessment of various strategies for different future scenarios with specific years, locations, technologies and capacities for the establishment of the waste processing infrastructure. The utilization of the model and its computational tractability is demonstrated in a case study of the Czech Republic.
[klicova_slova] => Waste management planning; Circular economy; Multi-stage optimization; Sustainable processing infrastructure; Renewable energy; Waste-to-energy
[klicova_slova_orig] => Waste management planning; Circular economy; Multi-stage optimization; Sustainable processing infrastructure; Renewable energy; Waste-to-energy
[url] => https://www.sciencedirect.com/science/article/pii/S136403212030349X
[oecd_obor_id] => 20701
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 200135
[schvaleno] => 2021-03-09
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.; SMEJKALOVÁ, V.; ŠOMPLÁK, R.; NEVRLÝ, V.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1016/j.rser.2020.110058
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 1364-0321
[identifikator_popis] => ISSN - RENEWABLE & SUSTAINABLE ENERGY REVIEWS (US)
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => KŮDELA, J.; SMEJKALOVÁ, V.; ŠOMPLÁK, R.; NEVRLÝ, V. Legislation-induced planning of waste processing infrastructure: A case study of the Czech Republic. RENEWABLE & SUSTAINABLE ENERGY REVIEWS, 2020, vol. 132, no. Oct 2020, p. 1-14. ISSN: 1364-0321.
[citace_html] => KŮDELA, J.; SMEJKALOVÁ, V.; ŠOMPLÁK, R.; NEVRLÝ, V. Legislation-induced planning of waste processing infrastructure: A case study of the Czech Republic. RENEWABLE & SUSTAINABLE ENERGY REVIEWS, 2020, vol. 132, no. Oct 2020, p. 1-14. ISSN: 1364-0321.
[citace_rtf] =>
[citace_bibtex] => @article{BUT164599,
author="Jakub {Kůdela} and Veronika {Smejkalová} and Radovan {Šomplák} and Vlastimír {Nevrlý}",
title="Legislation-induced planning of waste processing infrastructure: A case study of the Czech Republic",
journal="RENEWABLE & SUSTAINABLE ENERGY REVIEWS",
year="2020",
volume="132",
number="Oct 2020",
pages="1--14",
doi="10.1016/j.rser.2020.110058",
issn="1364-0321",
url="https://www.sciencedirect.com/science/article/pii/S136403212030349X"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 14.982
[if_q] => 1
[if_m17_q] => 1
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 1
[if_m25_d] => 1
[if_percentil] => 98.864
[if_m17_percentil] => 97.368
[if_m25_percentil] => 97.368
[ais] => 2.572
[ais_m17_q] => 1
[ais_m25_q] => 1
[ais_m17_d] => 1
[ais_m25_d] => 1
[ais_m17_percentil] => 97.049
[ais_m25_percentil] => 97.763
[jci] => 1.05
[jci_q] => 1
[jci_percentil] => 79.545
[ef] =>
[scopus_sjr] => 3.522
[scopus_sjr_q] => 1
[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] => 20700
[oecd_tree_obor_nazev] => 2.7 Environmental engineering
[oecd_tree_podobor_id] => 20701
[oecd_tree_podobor_nazev] => Environmental and geological engineering, geotechnics
[poznamka_metriky] =>
[nazev_en] => Legislation-induced planning of waste processing infrastructure: A case study of the Czech Republic
[popis_en] => Trends in the treatment of municipal solid waste are changing worldwide. In the European Union, one of the largest economies in the world, the waste treatment and management among the member states vary significantly. To support and promote environmentally friendly waste management, the European Union issued directives commonly called the Circular Economy Package. This legislative is designed to accelerate the transition to a cleaner future. It gives an obligation to member states to meet specific landfilling and recycling targets. To reach these ambitious goals will be a challenging task, especially for the member states with less developed waste management systems. An approach using multi-stage stochastic programming is suggested for solving such a problem. The developed model considers current material recovery rates and trends in municipal waste, while uncertain waste production is forecasted by possible scenarios. The model enables sequential decision-making and assessment of various strategies for different future scenarios with specific years, locations, technologies and capacities for the establishment of the waste processing infrastructure. The utilization of the model and its computational tractability is demonstrated in a case study of the Czech Republic.
[klicova_slova_en] => Waste management planning; Circular economy; Multi-stage optimization; Sustainable processing infrastructure; Renewable energy; Waste-to-energy
[vysledek_datum] => 2020-07-30T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 164727
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 136978
[vysledek_rok] => 2020
[nazev] => Social Distancing as p-Dispersion Problem
[nazev_orig] => Social Distancing as p-Dispersion Problem
[duvernost_udaju_id] => S
[popis] => The spread of COVID-19 and similar viruses poses new challenges for our society. There is a strong incentive towards safety measures that help to mitigate the outbreaks. Many countries have imposed social distancing measures that require a minimum distance between people in given places, such as schools, restaurants, shops, etc. This in turn creates complications for these places, as their function is to serve as many people as they were originally designed for. In this paper, we pose the problem of using the available space in a given place, such that the social distancing measures are satisfied, as a p-dispersion problem. We use recent algorithmic advancements, that were developed for the p-dispersion problem, and combine them with discretization schemes to find computationally attainable solutions to the p-dispersion problem and investigate the trade-off between the level of discretization and computational efforts on one side, and the value of the optimal solution on the other.
[popis_orig] => The spread of COVID-19 and similar viruses poses new challenges for our society. There is a strong incentive towards safety measures that help to mitigate the outbreaks. Many countries have imposed social distancing measures that require a minimum distance between people in given places, such as schools, restaurants, shops, etc. This in turn creates complications for these places, as their function is to serve as many people as they were originally designed for. In this paper, we pose the problem of using the available space in a given place, such that the social distancing measures are satisfied, as a p-dispersion problem. We use recent algorithmic advancements, that were developed for the p-dispersion problem, and combine them with discretization schemes to find computationally attainable solutions to the p-dispersion problem and investigate the trade-off between the level of discretization and computational efforts on one side, and the value of the optimal solution on the other.
[klicova_slova] => social distancing; p-dispersion problem; decremental clustering; COVID-19
[klicova_slova_orig] => social distancing; p-dispersion problem; decremental clustering; COVID-19
[url] => https://ieeexplore.ieee.org/document/9167199
[oecd_obor_id] => 10102
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 200135
[schvaleno] => 2021-03-09
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 109467
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1109/ACCESS.2020.3016724
[kod_dspace] => 11012/196567
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 2169-3536
[identifikator_popis] => ISSN - IEEE Access (US)
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 2
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 2
[citace_text] => KŮDELA, J. Social Distancing as p-Dispersion Problem. IEEE Access, 2020, vol. 8, no. 1, p. 149402-149411. ISSN: 2169-3536.
[citace_html] => KŮDELA, J. Social Distancing as p-Dispersion Problem. IEEE Access, 2020, vol. 8, no. 1, p. 149402-149411. ISSN: 2169-3536.
[citace_rtf] =>
[citace_bibtex] => @article{BUT164727,
author="Jakub {Kůdela}",
title="Social Distancing as p-Dispersion Problem",
journal="IEEE Access",
year="2020",
volume="8",
number="1",
pages="149402--149411",
doi="10.1109/ACCESS.2020.3016724",
issn="2169-3536",
url="https://ieeexplore.ieee.org/document/9167199"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 3.367
[if_q] => 2
[if_m17_q] => 2
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 4
[if_m25_d] => 4
[if_percentil] => 65.751
[if_m17_percentil] => 67.148
[if_m25_percentil] => 67.148
[ais] => 0.592
[ais_m17_q] => 2
[ais_m25_q] => 2
[ais_m17_d] => 5
[ais_m25_d] => 4
[ais_m17_percentil] => 55.698
[ais_m25_percentil] => 61.561
[jci] => 1.01
[jci_q] => 1
[jci_percentil] => 76.646
[ef] =>
[scopus_sjr] => 0.587
[scopus_sjr_q] => 1
[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] => 10102
[oecd_tree_podobor_nazev] => Applied mathematics
[poznamka_metriky] =>
[nazev_en] => Social Distancing as p-Dispersion Problem
[popis_en] => The spread of COVID-19 and similar viruses poses new challenges for our society. There is a strong incentive towards safety measures that help to mitigate the outbreaks. Many countries have imposed social distancing measures that require a minimum distance between people in given places, such as schools, restaurants, shops, etc. This in turn creates complications for these places, as their function is to serve as many people as they were originally designed for. In this paper, we pose the problem of using the available space in a given place, such that the social distancing measures are satisfied, as a p-dispersion problem. We use recent algorithmic advancements, that were developed for the p-dispersion problem, and combine them with discretization schemes to find computationally attainable solutions to the p-dispersion problem and investigate the trade-off between the level of discretization and computational efforts on one side, and the value of the optimal solution on the other.
[klicova_slova_en] => social distancing; p-dispersion problem; decremental clustering; COVID-19
[vysledek_datum] => 2020-08-14T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 165002
[vysledek_druh_id] => ARTSC
[ex_vysledek_id] => 137130
[vysledek_rok] => 2020
[nazev] => The Potential for Future Material Recovery of Municipal Solid Waste: Inputs for Sustainable Infrastructure Planning
[nazev_orig] => The Potential for Future Material Recovery of Municipal Solid Waste: Inputs for Sustainable Infrastructure Planning
[duvernost_udaju_id] => S
[popis] => The aim of the EU is to maximize material recovery from waste and minimize landfilling. For continuous development within the upcoming years, the circular economy package has been issued. It sets out gradually the goals of more efficient waste management. The waste production under the current conditions does not meet the EU targets in many states. The future waste management planning should take into account simultaneously both materially recoverable waste and the waste suitable for energy utilization. In this regard, the important aspect is their direct dependency and keeping the balance for a constant amount of produced waste for each year. The waste production can be forecasted, so it changes within the time horizon. Also, the interdependence of the targets changes other treatment ways, since landfilling significantly affects the residual amount of waste. However, approaches for assessing possible scenarios for the future development of waste production play a key role in transitions to cleaner treatment. Waste production scenarios are modeled to achieve recycling and landfilling targets. In order to integrate these connections into the infrastructure planning process, a penalty function for the potential of increase of material recovery is presented. Such a penalty differs among the regions within the analyzed area and is also waste type related. The approach is demonstrated using data from the EU member state-the Czech Republic is approximately average in the waste landfilling and recycling between EU member states. The results of this study define the potential of increase of material recovery for individual micro-regions of the Czech Republic. It represents a crucial input for multi-stage decision-making, which is usually modeled by mathematical programming. It can be integrated into the objective function, where it changes the cost of infrastructure modification. Systematic planning in waste management and infrastructure modification is highly required in the Czech Republic to meet the Circular Economy Package goals.
[popis_orig] => The aim of the EU is to maximize material recovery from waste and minimize landfilling. For continuous development within the upcoming years, the circular economy package has been issued. It sets out gradually the goals of more efficient waste management. The waste production under the current conditions does not meet the EU targets in many states. The future waste management planning should take into account simultaneously both materially recoverable waste and the waste suitable for energy utilization. In this regard, the important aspect is their direct dependency and keeping the balance for a constant amount of produced waste for each year. The waste production can be forecasted, so it changes within the time horizon. Also, the interdependence of the targets changes other treatment ways, since landfilling significantly affects the residual amount of waste. However, approaches for assessing possible scenarios for the future development of waste production play a key role in transitions to cleaner treatment. Waste production scenarios are modeled to achieve recycling and landfilling targets. In order to integrate these connections into the infrastructure planning process, a penalty function for the potential of increase of material recovery is presented. Such a penalty differs among the regions within the analyzed area and is also waste type related. The approach is demonstrated using data from the EU member state-the Czech Republic is approximately average in the waste landfilling and recycling between EU member states. The results of this study define the potential of increase of material recovery for individual micro-regions of the Czech Republic. It represents a crucial input for multi-stage decision-making, which is usually modeled by mathematical programming. It can be integrated into the objective function, where it changes the cost of infrastructure modification. Systematic planning in waste management and infrastructure modification is highly required in the Czech Republic to meet the Circular Economy Package goals.
[klicova_slova] => waste management; infrastructure planning; material recovery
[klicova_slova_orig] => waste management; infrastructure planning; material recovery
[url] => https://www.aidic.it/cet/20/81/204.pdf
[oecd_obor_id] => 20701
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 125766
[schvaleno] => 2020-10-14
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.; ŠOMPLÁK, R.; SMEJKALOVÁ, V.; NEVRLÝ, V.; JIRÁSEK, P.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.3303/CET2081204
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Scopus Article
[druh_popis] => Peer-reviewed article included in Scopus database as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => KŮDELA, J.; ŠOMPLÁK, R.; SMEJKALOVÁ, V.; NEVRLÝ, V.; JIRÁSEK, P. The Potential for Future Material Recovery of Municipal Solid Waste: Inputs for Sustainable Infrastructure Planning. Chemical Engineering transactions, 2020, vol. 81, no. 1, p. 1219-1224. ISSN: 2283-9216.
[citace_html] => KŮDELA, J.; ŠOMPLÁK, R.; SMEJKALOVÁ, V.; NEVRLÝ, V.; JIRÁSEK, P. The Potential for Future Material Recovery of Municipal Solid Waste: Inputs for Sustainable Infrastructure Planning. Chemical Engineering transactions, 2020, vol. 81, no. 1, p. 1219-1224. ISSN: 2283-9216.
[citace_rtf] =>
[citace_bibtex] => @article{BUT165002,
author="Jakub {Kůdela} and Radovan {Šomplák} and Veronika {Smejkalová} and Vlastimír {Nevrlý} and Petr {Jirásek}",
title="The Potential for Future Material Recovery of Municipal Solid Waste: Inputs for Sustainable Infrastructure Planning",
journal="Chemical Engineering transactions",
year="2020",
volume="81",
number="1",
pages="1219--1224",
doi="10.3303/CET2081204",
url="https://www.aidic.it/cet/20/81/204.pdf"
}
[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] => 0.274
[scopus_sjr_q] => 3
[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] => 20700
[oecd_tree_obor_nazev] => 2.7 Environmental engineering
[oecd_tree_podobor_id] => 20701
[oecd_tree_podobor_nazev] => Environmental and geological engineering, geotechnics
[poznamka_metriky] =>
[nazev_en] => The Potential for Future Material Recovery of Municipal Solid Waste: Inputs for Sustainable Infrastructure Planning
[popis_en] => The aim of the EU is to maximize material recovery from waste and minimize landfilling. For continuous development within the upcoming years, the circular economy package has been issued. It sets out gradually the goals of more efficient waste management. The waste production under the current conditions does not meet the EU targets in many states. The future waste management planning should take into account simultaneously both materially recoverable waste and the waste suitable for energy utilization. In this regard, the important aspect is their direct dependency and keeping the balance for a constant amount of produced waste for each year. The waste production can be forecasted, so it changes within the time horizon. Also, the interdependence of the targets changes other treatment ways, since landfilling significantly affects the residual amount of waste. However, approaches for assessing possible scenarios for the future development of waste production play a key role in transitions to cleaner treatment. Waste production scenarios are modeled to achieve recycling and landfilling targets. In order to integrate these connections into the infrastructure planning process, a penalty function for the potential of increase of material recovery is presented. Such a penalty differs among the regions within the analyzed area and is also waste type related. The approach is demonstrated using data from the EU member state-the Czech Republic is approximately average in the waste landfilling and recycling between EU member states. The results of this study define the potential of increase of material recovery for individual micro-regions of the Czech Republic. It represents a crucial input for multi-stage decision-making, which is usually modeled by mathematical programming. It can be integrated into the objective function, where it changes the cost of infrastructure modification. Systematic planning in waste management and infrastructure modification is highly required in the Czech Republic to meet the Circular Economy Package goals.
[klicova_slova_en] => waste management; infrastructure planning; material recovery
[vysledek_datum] => 2020-09-01T00:00:00+02:00
)
[8] => Array
(
[vysledek_id] => 165252
[vysledek_druh_id] => EDIT
[ex_vysledek_id] => 137247
[vysledek_rok] => 2020
[nazev] => Kybernetika
[nazev_orig] => Kybernetika
[duvernost_udaju_id] => S
[popis] => xxxx
[popis_orig] => xxxx
[klicova_slova] => cybernetics
[klicova_slova_orig] => cybernetics
[url] =>
[oecd_obor_id] => 20205
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 182808
[schvaleno] => 2021-03-11
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => LACKO, B.
[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] => Other
[druh_nazev] => Editorial
[druh_popis] =>
[stav] => Approved
[vysledek_kategorie_id] => OS
[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] =>
[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] => LACKO, B. Kybernetika. Praha: Academia, 2020. p. 598-600.
[citace_html] => LACKO, B. Kybernetika. Praha: Academia, 2020. p. 598-600.
[citace_rtf] =>
[citace_bibtex] => @misc{BUT165252,
author="Branislav {Lacko}",
title="Kybernetika",
year="2020",
pages="598--600",
publisher="Academia",
address="Praha"
}
[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] => 20205
[oecd_tree_podobor_nazev] => Automation and control systems
[poznamka_metriky] =>
[nazev_en] => Kybernetika
[popis_en] => xxxx
[klicova_slova_en] => cybernetics
[vysledek_datum] => 2020-07-10T00:00:00+02:00
)
[9] => Array
(
[vysledek_id] => 165498
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 137410
[vysledek_rok] => 2020
[nazev] => RGB Images Driven Recognition of Grapevine Varieties
[nazev_orig] => RGB Images Driven Recognition of Grapevine Varieties
[duvernost_udaju_id] => S
[popis] => We present a grapevine variety recognition system based on a densely connected convolutional network. The proposed solution is aimed as a data processing part of an affordable sensor for selective harvesters. The system classifies size normalized RGB images according to varieties of grapes captured in the images. We train and evaluate the system on in-field images of ripe grapes captured without any artificial lighting, in a direction of sunshine likewise in the opposite direction. A dataset created for this purpose consists of 7200 images classified into 8 categories. The system distinguishes among seven grapevine varieties and background, where four and three varieties have red and green grapes, respectively. Its average per-class classification accuracy is at 98.10 % and 97.47 % for red and green grapes, respectively. The system also well differentiates grapes from background. Its overall average per-class accuracy is over 98 %. The evaluation results show that conventional cameras in combination with the proposed system allow construction of affordable automatic selective harvesters.
[popis_orig] => We present a grapevine variety recognition system based on a densely connected convolutional network. The proposed solution is aimed as a data processing part of an affordable sensor for selective harvesters. The system classifies size normalized RGB images according to varieties of grapes captured in the images. We train and evaluate the system on in-field images of ripe grapes captured without any artificial lighting, in a direction of sunshine likewise in the opposite direction. A dataset created for this purpose consists of 7200 images classified into 8 categories. The system distinguishes among seven grapevine varieties and background, where four and three varieties have red and green grapes, respectively. Its average per-class classification accuracy is at 98.10 % and 97.47 % for red and green grapes, respectively. The system also well differentiates grapes from background. Its overall average per-class accuracy is over 98 %. The evaluation results show that conventional cameras in combination with the proposed system allow construction of affordable automatic selective harvesters.
[klicova_slova] => Recognition of grapevine varieties; Densely connected convolutional network; In-field images; Agriculture mechanization
[klicova_slova_orig] => Recognition of grapevine varieties; Densely connected convolutional network; In-field images; Agriculture mechanization
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 2401
[schvaleno] => 2020-11-18
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠKRABÁNEK, P.; DOLEŽEL, P.; MATOUŠEK, R.; JUNEK, P.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1007/978-3-030-57802-2_21
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-3-030-57802-2 ISSN 2194-5365
[identifikator_popis] => ISBN - 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020) ISSN - Advances in Intelligent Systems and Computing (CH)
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠKRABÁNEK, P.; DOLEŽEL, P.; MATOUŠEK, R.; JUNEK, P. RGB Images Driven Recognition of Grapevine Varieties. In 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020). Advances in Intelligent Systems and Computing. Cham: Springer International Publishing, 2020. p. 216-225. ISBN: 978-3-030-57802-2. ISSN: 2194-5365.
[citace_html] => ŠKRABÁNEK, P.; DOLEŽEL, P.; MATOUŠEK, R.; JUNEK, P. RGB Images Driven Recognition of Grapevine Varieties. In 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020). Advances in Intelligent Systems and Computing. Cham: Springer International Publishing, 2020. p. 216-225. ISBN: 978-3-030-57802-2. ISSN: 2194-5365.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT165498,
author="Pavel {Škrabánek} and Petr {Doležel} and Radomil {Matoušek} and Petr {Junek}",
title="RGB Images Driven Recognition of Grapevine Varieties",
booktitle="15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)",
year="2020",
journal="Advances in Intelligent Systems and Computing",
volume="1268",
pages="216--225",
publisher="Springer International Publishing",
address="Cham",
doi="10.1007/978-3-030-57802-2\{_}21",
isbn="978-3-030-57802-2",
issn="2194-5365"
}
[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] => RGB Images Driven Recognition of Grapevine Varieties
[popis_en] => We present a grapevine variety recognition system based on a densely connected convolutional network. The proposed solution is aimed as a data processing part of an affordable sensor for selective harvesters. The system classifies size normalized RGB images according to varieties of grapes captured in the images. We train and evaluate the system on in-field images of ripe grapes captured without any artificial lighting, in a direction of sunshine likewise in the opposite direction. A dataset created for this purpose consists of 7200 images classified into 8 categories. The system distinguishes among seven grapevine varieties and background, where four and three varieties have red and green grapes, respectively. Its average per-class classification accuracy is at 98.10 % and 97.47 % for red and green grapes, respectively. The system also well differentiates grapes from background. Its overall average per-class accuracy is over 98 %. The evaluation results show that conventional cameras in combination with the proposed system allow construction of affordable automatic selective harvesters.
[klicova_slova_en] => Recognition of grapevine varieties; Densely connected convolutional network; In-field images; Agriculture mechanization
[vysledek_datum] => 2020-09-29T00:00:00+02:00
)
[10] => Array
(
[vysledek_id] => 165511
[vysledek_druh_id] => CONF
[ex_vysledek_id] => 26594
[vysledek_rok] => 2020
[nazev] => 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)
[nazev_orig] => 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)
[duvernost_udaju_id] => S
[popis] =>
[popis_orig] =>
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] =>
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 209801
[schvaleno] => 2020-10-09
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] =>
[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] => Event
[druh_nazev] => Holding a conference
[druh_popis] => Holding a conference
[stav] => Approved
[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] => 1
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020). Burgos (16.09.2020)
[citace_html] => 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020). Burgos (16.09.2020)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT165511,
title="15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)",
year="2020",
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] =>
[oecd_tree_oblast_nazev] =>
[oecd_tree_obor_id] =>
[oecd_tree_obor_nazev] =>
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)
[popis_en] =>
[klicova_slova_en] =>
[vysledek_datum] => 2020-09-16T00:00:00+02:00
)
[11] => Array
(
[vysledek_id] => 165612
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 137480
[vysledek_rok] => 2020
[nazev] => Computational Geometry Data Structures in Logistics and Navigation Tasks
[nazev_orig] => Computational Geometry Data Structures in Logistics and Navigation Tasks
[duvernost_udaju_id] => S
[popis] => Computational geometry data structures have many applications, such as network optimisation, location tasks, but they can also be used in robot motion planning when a path of the shortest length must be found between the start and target positions that guarantee movements without the risk of collisions with obstacles. The paper deals with visibility graphs, strip and cell decompositions, Voronoi diagrams and compares their properties and efficiency in the investigated area. Since cell decomposition-based approaches give exponential complexity depending on the number of cells, and the knowledge base makes it possible to reduce it mostly only insignificantly, Voronoi diagrams with their polynomial complexity are more efficient for large instances. In addition, their generalized version allows them to generate smooth trajectories.
[popis_orig] => Computational geometry data structures have many applications, such as network optimisation, location tasks, but they can also be used in robot motion planning when a path of the shortest length must be found between the start and target positions that guarantee movements without the risk of collisions with obstacles. The paper deals with visibility graphs, strip and cell decompositions, Voronoi diagrams and compares their properties and efficiency in the investigated area. Since cell decomposition-based approaches give exponential complexity depending on the number of cells, and the knowledge base makes it possible to reduce it mostly only insignificantly, Voronoi diagrams with their polynomial complexity are more efficient for large instances. In addition, their generalized version allows them to generate smooth trajectories.
[klicova_slova] => Voronoi diagram, robot motion planning, celland strip decompositions, case-based reasoning
[klicova_slova_orig] => Voronoi diagram, robot motion planning, celland strip decompositions, case-based reasoning
[url] => https://ieeexplore.ieee.org/document/9222453
[oecd_obor_id] => 10102
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 154208
[schvaleno] => 2021-05-23
[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] => 10.1109/ICUMT51630.2020.9222453
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-1-7281-9281-9
[identifikator_popis] => ISBN - 2020 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => ŠEDA, M.; ŠEDA, P. Computational Geometry Data Structures in Logistics and Navigation Tasks. In 2020 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). online: IEEE, 2020. p. 179-184. ISBN: 978-1-7281-9281-9.
[citace_html] => ŠEDA, M.; ŠEDA, P. Computational Geometry Data Structures in Logistics and Navigation Tasks. In 2020 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). online: IEEE, 2020. p. 179-184. ISBN: 978-1-7281-9281-9.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT165612,
author="Miloš {Šeda} and Pavel {Šeda}",
title="Computational Geometry Data Structures in Logistics and Navigation Tasks",
booktitle="2020 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)",
year="2020",
pages="179--184",
publisher="IEEE",
address="online",
doi="10.1109/ICUMT51630.2020.9222453",
isbn="978-1-7281-9281-9",
url="https://ieeexplore.ieee.org/document/9222453"
}
[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] => 10102
[oecd_tree_podobor_nazev] => Applied mathematics
[poznamka_metriky] =>
[nazev_en] => Computational Geometry Data Structures in Logistics and Navigation Tasks
[popis_en] => Computational geometry data structures have many applications, such as network optimisation, location tasks, but they can also be used in robot motion planning when a path of the shortest length must be found between the start and target positions that guarantee movements without the risk of collisions with obstacles. The paper deals with visibility graphs, strip and cell decompositions, Voronoi diagrams and compares their properties and efficiency in the investigated area. Since cell decomposition-based approaches give exponential complexity depending on the number of cells, and the knowledge base makes it possible to reduce it mostly only insignificantly, Voronoi diagrams with their polynomial complexity are more efficient for large instances. In addition, their generalized version allows them to generate smooth trajectories.
[klicova_slova_en] => Voronoi diagram, robot motion planning, celland strip decompositions, case-based reasoning
[vysledek_datum] => 2020-10-15T00:00:00+02:00
)
[12] => Array
(
[vysledek_id] => 166042
[vysledek_druh_id] => ARTSC
[ex_vysledek_id] => 137816
[vysledek_rok] => 2020
[nazev] => Optimization of Snake-like Robot Locomotion Using GA: Serpenoid Design
[nazev_orig] => Optimization of Snake-like Robot Locomotion Using GA: Serpenoid Design
[duvernost_udaju_id] => S
[popis] => This work investigates the locomotion efficiency of snake-like robots through evolutionary optimization using the simulation framework PhysX (NVIDIA). The Genetic Algorithm (GA) is used to find the optimal forward head serpentine gait parameters, and the snake speed is taken into consideration in the optimization. A fitness function covering robot speed is based on a complex physics simulation in PhysX. A general serpenoid form is applied to each joint. Optimal gait parameters are calculated for a virtual model in a simulation environment. The fitness function evaluation uses the Simulation In the Loop (SIL) technique, where the virtual model is an approximation of a real snake-like robot. Experiments were performed using an 8-link snake robot with a given mass and a different body friction. The aim of the optimization was speed and length of the trace.
[popis_orig] => This work investigates the locomotion efficiency of snake-like robots through evolutionary optimization using the simulation framework PhysX (NVIDIA). The Genetic Algorithm (GA) is used to find the optimal forward head serpentine gait parameters, and the snake speed is taken into consideration in the optimization. A fitness function covering robot speed is based on a complex physics simulation in PhysX. A general serpenoid form is applied to each joint. Optimal gait parameters are calculated for a virtual model in a simulation environment. The fitness function evaluation uses the Simulation In the Loop (SIL) technique, where the virtual model is an approximation of a real snake-like robot. Experiments were performed using an 8-link snake robot with a given mass and a different body friction. The aim of the optimization was speed and length of the trace.
[klicova_slova] => Snake-like robot, serpenoid curve, genetic algorithm, physical simulation, PhysX
[klicova_slova_orig] => Snake-like robot, serpenoid curve, genetic algorithm, physical simulation, PhysX
[url] => https://mendel-journal.org/index.php/mendel/article/view/113
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 152614
[schvaleno] => 2021-01-25
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => HŮLKA, T.; MATOUŠEK, R.; DOBROVSKÝ, L.; DOSOUDILOVÁ, M.; NOLLE, L.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.13164/mendel.2020.1.001
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Scopus Article
[druh_popis] => Peer-reviewed article included in Scopus database as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 1803-3814
[identifikator_popis] => ISSN - Mendel Journal series (CZ)
[riv_dodavka_id] => 2549
[riv_dodavka_oznaceni] => RIV21-MSM-26210___
[riv_dodavka_rok] => 2021
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => HŮLKA, T.; MATOUŠEK, R.; DOBROVSKÝ, L.; DOSOUDILOVÁ, M.; NOLLE, L. Optimization of Snake-like Robot Locomotion Using GA: Serpenoid Design. Mendel Journal series, 2020, vol. 26 (2020), no. 1, p. 1-6. ISSN: 1803-3814.
[citace_html] => HŮLKA, T.; MATOUŠEK, R.; DOBROVSKÝ, L.; DOSOUDILOVÁ, M.; NOLLE, L. Optimization of Snake-like Robot Locomotion Using GA: Serpenoid Design. Mendel Journal series, 2020, vol. 26 (2020), no. 1, p. 1-6. ISSN: 1803-3814.
[citace_rtf] =>
[citace_bibtex] => @article{BUT166042,
author="Tomáš {Hůlka} and Radomil {Matoušek} and Ladislav {Dobrovský} and Monika {Dosoudilová} and Lars {Nolle}",
title="Optimization of Snake-like Robot Locomotion Using GA: Serpenoid Design",
journal="Mendel Journal series",
year="2020",
volume="26 (2020)",
number="1",
pages="1--6",
doi="10.13164/mendel.2020.1.001",
issn="1803-3814",
url="https://mendel-journal.org/index.php/mendel/article/view/113"
}
[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] => 0.221
[scopus_sjr_q] => 3
[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] => Optimization of Snake-like Robot Locomotion Using GA: Serpenoid Design
[popis_en] => This work investigates the locomotion efficiency of snake-like robots through evolutionary optimization using the simulation framework PhysX (NVIDIA). The Genetic Algorithm (GA) is used to find the optimal forward head serpentine gait parameters, and the snake speed is taken into consideration in the optimization. A fitness function covering robot speed is based on a complex physics simulation in PhysX. A general serpenoid form is applied to each joint. Optimal gait parameters are calculated for a virtual model in a simulation environment. The fitness function evaluation uses the Simulation In the Loop (SIL) technique, where the virtual model is an approximation of a real snake-like robot. Experiments were performed using an 8-link snake robot with a given mass and a different body friction. The aim of the optimization was speed and length of the trace.
[klicova_slova_en] => Snake-like robot, serpenoid curve, genetic algorithm, physical simulation, PhysX
[vysledek_datum] => 2020-08-24T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 127
[count] => 13
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /en/veda/publikace/detail/
[base_page] => /en/veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => KŮDELA, J.
[title] => Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching
[typ] => PV
[year] => 2019
[id_vav] => 163938
)
[1] => Array
(
[quotations] => KŮDELA, J.; POPELA, P.
[title] => Pool & Discard Algorithm for Chance Constrained Optimization Problems
[typ] => PV
[year] => 2020
[id_vav] => 163939
)
[2] => Array
(
[quotations] => BRÁZDA, V.; KOLOMAZNÍK, J.; MERGNY, J.; ŠŤASTNÝ, J.
[title] => G4Killer web application: a tool to design G-quadruplex mutations
[typ] => PV
[year] => 2020
[id_vav] => 164187
)
[3] => Array
(
[quotations] => NAHODIL, P.; HAMMER, M.
[title] => Analýza statorového proudu asynchronního motoru při různých zatíženích a poruchách
[typ] => PV
[year] => 2020
[id_vav] => 164570
)
[4] => Array
(
[quotations] => HAMMER, M.; NAHODIL, P.
[title] => Elektrodiagnostika jako součást multiparametrické diagnostiky v průmyslové praxi
[typ] => PV
[year] => 2020
[id_vav] => 164571
)
[5] => Array
(
[quotations] => KŮDELA, J.; SMEJKALOVÁ, V.; ŠOMPLÁK, R.; NEVRLÝ, V.
[title] => Legislation-induced planning of waste processing infrastructure: A case study of the Czech Republic
[typ] => PV
[year] => 2020
[id_vav] => 164599
)
[6] => Array
(
[quotations] => KŮDELA, J.
[title] => Social Distancing as p-Dispersion Problem
[typ] => PV
[year] => 2020
[id_vav] => 164727
)
[7] => Array
(
[quotations] => KŮDELA, J.; ŠOMPLÁK, R.; SMEJKALOVÁ, V.; NEVRLÝ, V.; JIRÁSEK, P.
[title] => The Potential for Future Material Recovery of Municipal Solid Waste: Inputs for Sustainable Infrastructure Planning
[typ] => PV
[year] => 2020
[id_vav] => 165002
)
[8] => Array
(
[quotations] => LACKO, B.
[title] => Kybernetika
[typ] => OS
[year] => 2020
[id_vav] => 165252
)
[9] => Array
(
[quotations] => ŠKRABÁNEK, P.; DOLEŽEL, P.; MATOUŠEK, R.; JUNEK, P.
[title] => RGB Images Driven Recognition of Grapevine Varieties
[typ] => PV
[year] => 2020
[id_vav] => 165498
)
[10] => Array
(
[quotations] =>
[title] => 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)
[typ] => EV
[year] => 2020
[id_vav] => 165511
)
[11] => Array
(
[quotations] => ŠEDA, M.; ŠEDA, P.
[title] => Computational Geometry Data Structures in Logistics and Navigation Tasks
[typ] => PV
[year] => 2020
[id_vav] => 165612
)
[12] => Array
(
[quotations] => HŮLKA, T.; MATOUŠEK, R.; DOBROVSKÝ, L.; DOSOUDILOVÁ, M.; NOLLE, L.
[title] => Optimization of Snake-like Robot Locomotion Using GA: Serpenoid Design
[typ] => PV
[year] => 2020
[id_vav] => 166042
)
)
)
Results of Research and Development ▪ FME, BUT
Results of Research and Development
Publication results
Year: 2019
KŮDELA, J.
Publication results
Year: 2020
KŮDELA, J.
POPELA, P.
Publication results
Year: 2020
BRÁZDA, V.
KOLOMAZNÍK, J.
MERGNY, J.
ŠŤASTNÝ, J.
Publication results
Year: 2020
NAHODIL, P.
HAMMER, M.
Publication results
Year: 2020
HAMMER, M.
NAHODIL, P.
Publication results
Year: 2020
KŮDELA, J.
SMEJKALOVÁ, V.
ŠOMPLÁK, R.
NEVRLÝ, V.
Publication results
Year: 2020
KŮDELA, J.
Publication results
Year: 2020
KŮDELA, J.
ŠOMPLÁK, R.
SMEJKALOVÁ, V.
NEVRLÝ, V.
JIRÁSEK, P.
Other
Year: 2020
LACKO, B.
Publication results
Year: 2020
ŠKRABÁNEK, P.
DOLEŽEL, P.
MATOUŠEK, R.
JUNEK, P.
Publication results
Year: 2020
ŠEDA, M.
ŠEDA, P.
Publication results
Year: 2020
HŮLKA, T.
MATOUŠEK, R.
DOBROVSKÝ, L.
DOSOUDILOVÁ, M.
NOLLE, L.
Showed 1891–1905 from 2086 results