Array
(
[page] => 129
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 172864
[vysledek_druh_id] => ART
[ex_vysledek_id] => 141843
[vysledek_rok] => 2021
[nazev] => I4C – Robotická buňka podle konceptu Průmyslu 4.0
[nazev_orig] => I4C – Robotická buňka podle konceptu Průmyslu 4.0
[duvernost_udaju_id] => S
[popis] => Článek se zabývá návrhem robotické buňky v konceptu průmyslu 4.0 a jeho realizací na Ústavu Automatizace a Informatiky, Fakulty Strojního Inženýrství, Vysokého Učení Technického v Brně. Hlavní část článku popisuje návrh a implementaci konstrukce robotické buňky, které doplňuje integrací systémů, vývojem uživatelského rozhraní, nástrojem pro simulaci robotů jako dynamických systémů a využitím rozšírené/virtuální reality. Závěr je věnován směřování dalšího rozvoje laboratoře.
[popis_orig] => Článek se zabývá návrhem robotické buňky v konceptu průmyslu 4.0 a jeho realizací na Ústavu Automatizace a Informatiky, Fakulty Strojního Inženýrství, Vysokého Učení Technického v Brně. Hlavní část článku popisuje návrh a implementaci konstrukce robotické buňky, které doplňuje integrací systémů, vývojem uživatelského rozhraní, nástrojem pro simulaci robotů jako dynamických systémů a využitím rozšírené/virtuální reality. Závěr je věnován směřování dalšího rozvoje laboratoře.
[klicova_slova] => Průmysl 4.0, digitální/virtuální dvojče, rozšířená realita, průmyslový/kolaborativní robot, rozhraní člověk-stroj, systémová integrace
[klicova_slova_orig] => Průmysl 4.0, digitální/virtuální dvojče, rozšířená realita, průmyslový/kolaborativní robot, rozhraní člověk-stroj, systémová integrace
[url] => http://www.automa.cz
[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] => cs
[schvalil_id] => 184605
[schvaleno] => 2021-10-23
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => PARÁK, R.; MATOUŠEK, R.; LACKO, B.
[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] => Článek recenzovaný mimo WoS a Scopus
[druh_popis] => Ostatní články v odborných recenzovaných periodicích splňující definici druhu výsledku
[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 1210-9592
[identifikator_popis] => ISSN - Automa (CZ)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => PARÁK, R.; MATOUŠEK, R.; LACKO, B. I4C – Robotická buňka podle konceptu Průmyslu 4.0. Automa, 2021, roč. 27, č. 1, s. 10-12. ISSN: 1210-9592.
[citace_html] => PARÁK, R.; MATOUŠEK, R.; LACKO, B. I4C – Robotická buňka podle konceptu Průmyslu 4.0. Automa, 2021, roč. 27, č. 1, s. 10-12. ISSN: 1210-9592.
[citace_rtf] =>
[citace_bibtex] => @article{BUT172864,
author="Roman {Parák} and Radomil {Matoušek} and Branislav {Lacko}",
title="I4C – Robotická buňka podle konceptu Průmyslu 4.0",
journal="Automa",
year="2021",
volume="27",
number="1",
pages="10--12",
issn="1210-9592",
url="http://www.automa.cz"
}
[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] => I4C - Robotic cell according to the Industry 4.0 concept
[popis_en] => The article deals with the design of a robotic cell in the context of Industry 4.0 and implementation at the Institute of Automation and Computer Science, Faculty of Mechanical Engineering, Brno University of Technology. The main part of the article describes the construction of the cell, which complements the part of advanced system integration, human-machine interface, tools for the simulation of robots as dynamic systems (Digital-Twin), and the use of augmented/virtual reality. The conclusion is devoted to the direction of further development of the laboratory (Industry 4.0 cell).
[klicova_slova_en] => Industry 4.0, digital / virtual twin, augmented reality, industrial / collaborative robot, human-machine interface, system integration
[vysledek_datum] => 2021-01-26T00:00:00+01:00
)
[1] => Array
(
[vysledek_id] => 173266
[vysledek_druh_id] => CONF
[ex_vysledek_id] => 27094
[vysledek_rok] => 2021
[nazev] => 2021 IEEE Congress on Evolutionary Computation (CEC)
[nazev_orig] => 2021 IEEE Congress on Evolutionary Computation (CEC)
[duvernost_udaju_id] => S
[popis] => IEEE CEC 2021 is a world-class conference that brings together researchers and practitioners in the field of evolutionary computation and computational intelligence from around the globe. The conference program includes plenary lectures, regular and special sessions, tutorials, competitions, workshops and panel discussions.
[popis_orig] => IEEE CEC 2021 is a world-class conference that brings together researchers and practitioners in the field of evolutionary computation and computational intelligence from around the globe. The conference program includes plenary lectures, regular and special sessions, tutorials, competitions, workshops and panel discussions.
[klicova_slova] => Evolutionary computation, Genetic algorithms, Heuristics, Metaheuristics, Hyper-heuristics, Optimization, Swarm Intelligence, Differential evolution
[klicova_slova_orig] => Evolutionary computation, Genetic algorithms, Heuristics, Metaheuristics, Hyper-heuristics, Optimization, Swarm Intelligence, Differential evolution
[url] => https://cec2021.mini.pw.edu.pl/en
[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] => 2401
[schvaleno] => 2021-11-18
[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] => 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] => 2021 IEEE Congress on Evolutionary Computation (CEC). Krakow (28.06.2021)
[citace_html] => 2021 IEEE Congress on Evolutionary Computation (CEC). Krakow (28.06.2021)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT173266,
title="2021 IEEE Congress on Evolutionary Computation (CEC)",
year="2021",
url="https://cec2021.mini.pw.edu.pl/en",
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] => 2021 IEEE Congress on Evolutionary Computation (CEC)
[popis_en] => IEEE CEC 2021 is a world-class conference that brings together researchers and practitioners in the field of evolutionary computation and computational intelligence from around the globe. The conference program includes plenary lectures, regular and special sessions, tutorials, competitions, workshops and panel discussions.
[klicova_slova_en] => Evolutionary computation, Genetic algorithms, Heuristics, Metaheuristics, Hyper-heuristics, Optimization, Swarm Intelligence, Differential evolution
[vysledek_datum] => 2021-06-28T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 175647
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 142804
[vysledek_rok] => 2021
[nazev] => Novel Zigzag-based Benchmark Functions for Bound Constrained Single Objective Optimization
[nazev_orig] => Novel Zigzag-based Benchmark Functions for Bound Constrained Single Objective Optimization
[duvernost_udaju_id] => S
[popis] => The development and comparison of new optimization methods in general, and evolutionary algorithms in particular, rely heavily on benchmarking. In this paper, the construction of novel zigzag-based benchmark functions for bound constrained single objective optimization is presented. The new benchmark functions are non-differentiable, highly multimodal, and have a built-in parameter that controls the complexity of the function. To investigate the properties of the new benchmark functions two of the best algorithms from the CEC'20 Competition on Single Objective Bound Constrained Optimization, as well as one standard evolutionary algorithm, were utilized in a computational study. The results of the study suggest that the new benchmark functions are very well suited for algorithmic comparison.
[popis_orig] => The development and comparison of new optimization methods in general, and evolutionary algorithms in particular, rely heavily on benchmarking. In this paper, the construction of novel zigzag-based benchmark functions for bound constrained single objective optimization is presented. The new benchmark functions are non-differentiable, highly multimodal, and have a built-in parameter that controls the complexity of the function. To investigate the properties of the new benchmark functions two of the best algorithms from the CEC'20 Competition on Single Objective Bound Constrained Optimization, as well as one standard evolutionary algorithm, were utilized in a computational study. The results of the study suggest that the new benchmark functions are very well suited for algorithmic comparison.
[klicova_slova] => benchmark functions; single objective optimization; zigzag function
[klicova_slova_orig] => benchmark functions; single objective optimization; zigzag function
[url] => https://ieeexplore.ieee.org/document/9504720
[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] => 125766
[schvaleno] => 2022-02-21
[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.1109/CEC45853.2021.9504720
[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-7281-8393-0
[identifikator_popis] => ISBN - 2021 IEEE Congress on Evolutionary Computation (CEC)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => KŮDELA, J. Novel Zigzag-based Benchmark Functions for Bound Constrained Single Objective Optimization. In 2021 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2021. p. 857-862. ISBN: 978-1-7281-8393-0.
[citace_html] => KŮDELA, J. Novel Zigzag-based Benchmark Functions for Bound Constrained Single Objective Optimization. In 2021 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2021. p. 857-862. ISBN: 978-1-7281-8393-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT175647,
author="Jakub {Kůdela}",
title="Novel Zigzag-based Benchmark Functions for Bound Constrained Single Objective Optimization",
booktitle="2021 IEEE Congress on Evolutionary Computation (CEC)",
year="2021",
pages="857--862",
publisher="IEEE",
doi="10.1109/CEC45853.2021.9504720",
isbn="978-1-7281-8393-0",
url="https://ieeexplore.ieee.org/document/9504720"
}
[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] => 4
[incites_open_access] => 0
[incites_jnci] => 0.88
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.8992
[incites_avg_percentile] => 70.44244
[scival_citations_count] => 5
[scival_fwci] => 0.392536
[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] => Novel Zigzag-based Benchmark Functions for Bound Constrained Single Objective Optimization
[popis_en] => The development and comparison of new optimization methods in general, and evolutionary algorithms in particular, rely heavily on benchmarking. In this paper, the construction of novel zigzag-based benchmark functions for bound constrained single objective optimization is presented. The new benchmark functions are non-differentiable, highly multimodal, and have a built-in parameter that controls the complexity of the function. To investigate the properties of the new benchmark functions two of the best algorithms from the CEC'20 Competition on Single Objective Bound Constrained Optimization, as well as one standard evolutionary algorithm, were utilized in a computational study. The results of the study suggest that the new benchmark functions are very well suited for algorithmic comparison.
[klicova_slova_en] => benchmark functions; single objective optimization; zigzag function
[vysledek_datum] => 2021-07-01T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 175648
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 142805
[vysledek_rok] => 2021
[nazev] => How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem
[nazev_orig] => How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem
[duvernost_udaju_id] => S
[popis] => The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. The QAP is an NP-hard optimization problem which attracts the use of heuristic or metaheuristic algorithms that can find quality solutions in an acceptable computation time. On the other hand, there is quite a broad spectrum of mathematical programming techniques that were developed for finding the lower bounds for the QAP. This paper presents a fusion of the two approaches whereby the solutions from the computations of the lower bounds are used as the starting points for a metaheuristic, called HC12, which is implemented on a GPU CUDA platform. We perform extensive computational experiments that demonstrate that the use of these lower bounding techniques for the construction of the starting points has a significant impact on the quality of the resulting solutions.
[popis_orig] => The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. The QAP is an NP-hard optimization problem which attracts the use of heuristic or metaheuristic algorithms that can find quality solutions in an acceptable computation time. On the other hand, there is quite a broad spectrum of mathematical programming techniques that were developed for finding the lower bounds for the QAP. This paper presents a fusion of the two approaches whereby the solutions from the computations of the lower bounds are used as the starting points for a metaheuristic, called HC12, which is implemented on a GPU CUDA platform. We perform extensive computational experiments that demonstrate that the use of these lower bounding techniques for the construction of the starting points has a significant impact on the quality of the resulting solutions.
[klicova_slova] => Heuristics; Lower bounds; Metaheuristics; Quadratic assignment problem; Starting values
[klicova_slova_orig] => Heuristics; Lower bounds; Metaheuristics; Quadratic assignment problem; Starting values
[url] => http://www.growingscience.com/ijiec/Vol13/IJIEC_2021_33.pdf
[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] => 125766
[schvaleno] => 2022-03-02
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 115100
[posledni_diagnostika] =>
[vycet_osob] => MATOUŠEK, R.; DOBROVSKÝ, L.; KŮDELA, J.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.5267/j.ijiec.2021.12.003
[kod_dspace] => 11012/203280
[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 1923-2926
[identifikator_popis] => ISSN - International Journal of Industrial Engineering Computations (CA)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 3
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 2
[citace_text] => MATOUŠEK, R.; DOBROVSKÝ, L.; KŮDELA, J. How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem. International Journal of Industrial Engineering Computations, 2021, vol. 13, no. 2, p. 151-164. ISSN: 1923-2934.
[citace_html] => MATOUŠEK, R.; DOBROVSKÝ, L.; KŮDELA, J. How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem. International Journal of Industrial Engineering Computations, 2021, vol. 13, no. 2, p. 151-164. ISSN: 1923-2934.
[citace_rtf] =>
[citace_bibtex] => @article{BUT175648,
author="Radomil {Matoušek} and Ladislav {Dobrovský} and Jakub {Kůdela}",
title="How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem",
journal="International Journal of Industrial Engineering Computations",
year="2021",
volume="13",
number="2",
pages="151--164",
doi="10.5267/j.ijiec.2021.12.003",
issn="1923-2926",
url="http://www.growingscience.com/ijiec/Vol13/IJIEC_2021_33.pdf"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 3.271
[if_q] => 2
[if_m17_q] => 2
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 5
[if_m25_d] => 5
[if_percentil] => 61.494
[if_m17_percentil] => 58.316
[if_m25_percentil] => 58.316
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] => 0.62
[jci_q] => 2
[jci_percentil] => 51.5
[ef] =>
[scopus_sjr] => 0.794
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 12
[incites_open_access] => 1
[incites_jnci] => 3.27
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.61
[incites_avg_percentile] => 51.9355
[scival_citations_count] => 18
[scival_fwci] => 0.7251
[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] => How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem
[popis_en] => The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. The QAP is an NP-hard optimization problem which attracts the use of heuristic or metaheuristic algorithms that can find quality solutions in an acceptable computation time. On the other hand, there is quite a broad spectrum of mathematical programming techniques that were developed for finding the lower bounds for the QAP. This paper presents a fusion of the two approaches whereby the solutions from the computations of the lower bounds are used as the starting points for a metaheuristic, called HC12, which is implemented on a GPU CUDA platform. We perform extensive computational experiments that demonstrate that the use of these lower bounding techniques for the construction of the starting points has a significant impact on the quality of the resulting solutions.
[klicova_slova_en] => Heuristics; Lower bounds; Metaheuristics; Quadratic assignment problem; Starting values
[vysledek_datum] => 2021-12-31T00:00:00+01:00
)
[4] => Array
(
[vysledek_id] => 175669
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 142820
[vysledek_rok] => 2022
[nazev] => Comparison of machinability of nickel alloys using WEDM
[nazev_orig] => Comparison of machinability of nickel alloys using WEDM
[duvernost_udaju_id] => S
[popis] => Heat resistance, heat stableness and corrosion resistance are properties that predispose nickel superalloys such as Inconel 625, Mar-M247, Nimonic C 263 and B1914 to a very wide range of applications. Due to their mechanical properties, their machinability by conventional technologies is relatively difficult, so wire electrical discharge machining (WEDM) is widely used, where only one condition is placed on the material being machined, which is at least minimal electrical conductivity. Despite the fact that the main element of which these superalloys are always composed is nickel, their machinability by WEDM is quite different. For this reason, an extensive study comparing the machinability of the four above-mentioned nickel superalloys using WEDM was performed, examining the effect of setting the machine parameters on the cutting speed as well as on the quality of the surface and subsurface layer. It was found out that the cutting speed is different for individual materials with the same set of machine parameters and so that it is possible to significantly increase the quality of the machined surface for individual materials.
[popis_orig] => Heat resistance, heat stableness and corrosion resistance are properties that predispose nickel superalloys such as Inconel 625, Mar-M247, Nimonic C 263 and B1914 to a very wide range of applications. Due to their mechanical properties, their machinability by conventional technologies is relatively difficult, so wire electrical discharge machining (WEDM) is widely used, where only one condition is placed on the material being machined, which is at least minimal electrical conductivity. Despite the fact that the main element of which these superalloys are always composed is nickel, their machinability by WEDM is quite different. For this reason, an extensive study comparing the machinability of the four above-mentioned nickel superalloys using WEDM was performed, examining the effect of setting the machine parameters on the cutting speed as well as on the quality of the surface and subsurface layer. It was found out that the cutting speed is different for individual materials with the same set of machine parameters and so that it is possible to significantly increase the quality of the machined surface for individual materials.
[klicova_slova] => WEDM; wire electrical discharge machining;nickel alloy;B1914; Inconel; Mar-M; nimonic;machining parameters
[klicova_slova_orig] => WEDM; wire electrical discharge machining;nickel alloy;B1914; Inconel; Mar-M; nimonic;machining parameters
[url] => https://doi.org/10.1177/09544054221075876
[oecd_obor_id] => 20301
[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] => 85160
[schvaleno] => 2022-07-13
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => POLZER, A.; MOURALOVÁ, K.; BENEŠ, L.; ZAHRADNÍČEK, R.; FRIES, J.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1177/09544054221075876
[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 0954-4054
[identifikator_popis] => ISSN - PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE (GB)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => POLZER, A.; MOURALOVÁ, K.; BENEŠ, L.; ZAHRADNÍČEK, R.; FRIES, J. Comparison of machinability of nickel alloys using WEDM. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2022, vol. 236, no. 9, p. 1268-1281. ISSN: 0954-4054.
[citace_html] => POLZER, A.; MOURALOVÁ, K.; BENEŠ, L.; ZAHRADNÍČEK, R.; FRIES, J. Comparison of machinability of nickel alloys using WEDM. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2022, vol. 236, no. 9, p. 1268-1281. ISSN: 0954-4054.
[citace_rtf] =>
[citace_bibtex] => @article{BUT175669,
author="Aleš {Polzer} and Kateřina {Mouralová} and Libor {Beneš} and Radim {Zahradníček} and Jiří {Fries}",
title="Comparison of machinability of nickel alloys using WEDM",
journal="PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE",
year="2022",
volume="236",
number="9",
pages="1268--1281",
doi="10.1177/09544054221075876",
issn="0954-4054",
url="https://doi.org/10.1177/09544054221075876"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.6
[if_q] => 2
[if_m17_q] => 2
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 4
[if_m25_d] => 4
[if_percentil] => 54.4
[if_m17_percentil] => 62.15
[if_m25_percentil] => 68.042
[ais] => 0.318
[ais_m17_q] => 3
[ais_m25_q] => 3
[ais_m17_d] => 7
[ais_m25_d] => 6
[ais_m17_percentil] => 32.866
[ais_m25_percentil] => 43.015
[jci] => 0.64
[jci_q] => 2
[jci_percentil] => 62.64
[ef] =>
[scopus_sjr] => 0.632
[scopus_sjr_q] => 2
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 4
[incites_open_access] => 0
[incites_jnci] => 0.92
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.3357
[incites_avg_percentile] => 27.253
[scival_citations_count] => 7
[scival_fwci] => 1.227154
[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] => 20301
[oecd_tree_podobor_nazev] => Mechanical engineering
[poznamka_metriky] =>
[nazev_en] => Comparison of machinability of nickel alloys using WEDM
[popis_en] => Heat resistance, heat stableness and corrosion resistance are properties that predispose nickel superalloys such as Inconel 625, Mar-M247, Nimonic C 263 and B1914 to a very wide range of applications. Due to their mechanical properties, their machinability by conventional technologies is relatively difficult, so wire electrical discharge machining (WEDM) is widely used, where only one condition is placed on the material being machined, which is at least minimal electrical conductivity. Despite the fact that the main element of which these superalloys are always composed is nickel, their machinability by WEDM is quite different. For this reason, an extensive study comparing the machinability of the four above-mentioned nickel superalloys using WEDM was performed, examining the effect of setting the machine parameters on the cutting speed as well as on the quality of the surface and subsurface layer. It was found out that the cutting speed is different for individual materials with the same set of machine parameters and so that it is possible to significantly increase the quality of the machined surface for individual materials.
[klicova_slova_en] => WEDM; wire electrical discharge machining;nickel alloy;B1914; Inconel; Mar-M; nimonic;machining parameters
[vysledek_datum] => 2022-06-17T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 175928
[vysledek_druh_id] => ARTSC
[ex_vysledek_id] => 143041
[vysledek_rok] => 2021
[nazev] => Novel Approaches for Transport Infrastructure Reduction to Effective Optimisation of Flow Tasks
[nazev_orig] => Novel Approaches for Transport Infrastructure Reduction to Effective Optimisation of Flow Tasks
[duvernost_udaju_id] => S
[popis] => Nowadays, increasing complexity of solved optimisation problems leads to necessity of dealing with computation time demand. In the case of network flow tasks, computation time is highly dependent on detail of transport infrastructure. The presented paper is concerned with developing novel approaches for transport infrastructure reduction using clustering analysis. According to the required outputs of the task, it is possible to variably change the detail of the network in individual territorial units to ensure the solvability of the task, but without significant distortion of the results. The main idea and novelty of the presented research is to have a finer construction only in the vicinity of the monitored subject. With a greater distance, it is possible to reduce the level of detail in the transport network. The principle of reduction technique is based on transformation of geographic coordinates with subsequent cluster analysis. K-means and hierarchical clustering are introduced and results of developed approach are shown on municipalities in Czech Republic. Consistency within clusters of both methods is evaluated using silhouettes. The presented methodology allows to solve optimisation of case studies more efficiently with greater detail in monitored region, which leads to more accurate solutions.
[popis_orig] => Nowadays, increasing complexity of solved optimisation problems leads to necessity of dealing with computation time demand. In the case of network flow tasks, computation time is highly dependent on detail of transport infrastructure. The presented paper is concerned with developing novel approaches for transport infrastructure reduction using clustering analysis. According to the required outputs of the task, it is possible to variably change the detail of the network in individual territorial units to ensure the solvability of the task, but without significant distortion of the results. The main idea and novelty of the presented research is to have a finer construction only in the vicinity of the monitored subject. With a greater distance, it is possible to reduce the level of detail in the transport network. The principle of reduction technique is based on transformation of geographic coordinates with subsequent cluster analysis. K-means and hierarchical clustering are introduced and results of developed approach are shown on municipalities in Czech Republic. Consistency within clusters of both methods is evaluated using silhouettes. The presented methodology allows to solve optimisation of case studies more efficiently with greater detail in monitored region, which leads to more accurate solutions.
[klicova_slova] => Model-size reduction techniques, Cluster analysis, Infrastructure transformation
[klicova_slova_orig] => Model-size reduction techniques, Cluster analysis, Infrastructure transformation
[url] => https://www.aidic.it/cet/21/88/077.pdf
[oecd_obor_id] => 10102
[odpovedny_utvar_id] => 188
[odpovedny_utvar_nazev] => Ústav procesního inženýrství
[odpovedny_utvar_zkratka] => ÚPI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 170449
[schvaleno] => 2022-01-20
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => PLUSKAL, J.; ŠOMPLÁK, R.; KŮDELA, J.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.3303/CET21880777
[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] =>
[identifikator_popis] =>
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => PLUSKAL, J.; ŠOMPLÁK, R.; KŮDELA, J. Novel Approaches for Transport Infrastructure Reduction to Effective Optimisation of Flow Tasks. Chemical Engineering transactions, 2021, vol. 88, no. 1, p. 463-468. ISSN: 2283-9216.
[citace_html] => PLUSKAL, J.; ŠOMPLÁK, R.; KŮDELA, J. Novel Approaches for Transport Infrastructure Reduction to Effective Optimisation of Flow Tasks. Chemical Engineering transactions, 2021, vol. 88, no. 1, p. 463-468. ISSN: 2283-9216.
[citace_rtf] =>
[citace_bibtex] => @article{BUT175928,
author="Jaroslav {Pluskal} and Radovan {Šomplák} and Jakub {Kůdela}",
title="Novel Approaches for Transport Infrastructure Reduction to Effective Optimisation of Flow Tasks",
journal="Chemical Engineering transactions",
year="2021",
volume="88",
number="1",
pages="463--468",
doi="10.3303/CET21880777",
url="https://www.aidic.it/cet/21/88/077.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.254
[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] => 1
[scival_fwci] => 0.68924
[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] => Novel Approaches for Transport Infrastructure Reduction to Effective Optimisation of Flow Tasks
[popis_en] => Nowadays, increasing complexity of solved optimisation problems leads to necessity of dealing with computation time demand. In the case of network flow tasks, computation time is highly dependent on detail of transport infrastructure. The presented paper is concerned with developing novel approaches for transport infrastructure reduction using clustering analysis. According to the required outputs of the task, it is possible to variably change the detail of the network in individual territorial units to ensure the solvability of the task, but without significant distortion of the results. The main idea and novelty of the presented research is to have a finer construction only in the vicinity of the monitored subject. With a greater distance, it is possible to reduce the level of detail in the transport network. The principle of reduction technique is based on transformation of geographic coordinates with subsequent cluster analysis. K-means and hierarchical clustering are introduced and results of developed approach are shown on municipalities in Czech Republic. Consistency within clusters of both methods is evaluated using silhouettes. The presented methodology allows to solve optimisation of case studies more efficiently with greater detail in monitored region, which leads to more accurate solutions.
[klicova_slova_en] => Model-size reduction techniques, Cluster analysis, Infrastructure transformation
[vysledek_datum] => 2021-11-15T00:00:00+01:00
)
[6] => Array
(
[vysledek_id] => 176022
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 143121
[vysledek_rok] => 2022
[nazev] => New Benchmark Functions for Single-Objective Optimization Based on a Zigzag Pattern
[nazev_orig] => New Benchmark Functions for Single-Objective Optimization Based on a Zigzag Pattern
[duvernost_udaju_id] => S
[popis] => Benchmarking plays a crucial role in both development of new optimization methods, and in conducting proper comparisons between already existing methods, particularly in the field of evolutionary computation. In this paper, we develop new benchmark functions for bound-constrained single-objective optimization that are based on a zigzag function. The proposed zigzag function has three parameters that control its behaviour and difficulty of the resulting problems. Utilizing the zigzag function, we introduce four new functions and conduct extensive computational experiments to evaluate their performance as benchmarks. The experiments comprise of using the newly proposed functions in 100 different parameter settings for the comparison of eight different optimization algorithms, which are a mix of canonical methods and best performing methods from the Congress on Evolutionary Computation competitions. Using the results from the computational comparison, we choose some of the parametrization of the newly proposed functions to devise an ambiguous benchmark set in which each of the problems introduces a statistically significant ranking among the algorithms, but the ranking for the entire set is ambiguous with no clear dominating relationship between the algorithms. We also conduct an exploratory landscape analysis of the newly proposed benchmark functions and compare the results with the benchmark functions used in the Black-Box-Optimization-Benchmarking suite. The results suggest that the new benchmark functions are well suited for algorithmic comparisons.
[popis_orig] => Benchmarking plays a crucial role in both development of new optimization methods, and in conducting proper comparisons between already existing methods, particularly in the field of evolutionary computation. In this paper, we develop new benchmark functions for bound-constrained single-objective optimization that are based on a zigzag function. The proposed zigzag function has three parameters that control its behaviour and difficulty of the resulting problems. Utilizing the zigzag function, we introduce four new functions and conduct extensive computational experiments to evaluate their performance as benchmarks. The experiments comprise of using the newly proposed functions in 100 different parameter settings for the comparison of eight different optimization algorithms, which are a mix of canonical methods and best performing methods from the Congress on Evolutionary Computation competitions. Using the results from the computational comparison, we choose some of the parametrization of the newly proposed functions to devise an ambiguous benchmark set in which each of the problems introduces a statistically significant ranking among the algorithms, but the ranking for the entire set is ambiguous with no clear dominating relationship between the algorithms. We also conduct an exploratory landscape analysis of the newly proposed benchmark functions and compare the results with the benchmark functions used in the Black-Box-Optimization-Benchmarking suite. The results suggest that the new benchmark functions are well suited for algorithmic comparisons.
[klicova_slova] => numerical optimization; benchmarking; single objective problems; exploratory landscape analysis
[klicova_slova_orig] => numerical optimization; benchmarking; single objective problems; exploratory landscape analysis
[url] => https://ieeexplore.ieee.org/document/9684455
[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] => 125766
[schvaleno] => 2022-06-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 115613
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.; MATOUŠEK, R.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1109/ACCESS.2022.3144067
[kod_dspace] => 11012/203516
[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 2169-3536
[identifikator_popis] => ISSN - IEEE Access (US)
[riv_dodavka_id] => 3026
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => KŮDELA, J.; MATOUŠEK, R. New Benchmark Functions for Single-Objective Optimization Based on a Zigzag Pattern. IEEE Access, 2022, vol. 10, no. 1, p. 8262-8278. ISSN: 2169-3536.
[citace_html] => KŮDELA, J.; MATOUŠEK, R. New Benchmark Functions for Single-Objective Optimization Based on a Zigzag Pattern. IEEE Access, 2022, vol. 10, no. 1, p. 8262-8278. ISSN: 2169-3536.
[citace_rtf] =>
[citace_bibtex] => @article{BUT176022,
author="Jakub {Kůdela} and Radomil {Matoušek}",
title="New Benchmark Functions for Single-Objective Optimization Based on a Zigzag Pattern",
journal="IEEE Access",
year="2022",
volume="10",
number="1",
pages="8262--8278",
doi="10.1109/ACCESS.2022.3144067",
issn="2169-3536",
url="https://ieeexplore.ieee.org/document/9684455"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 3.9
[if_q] => 2
[if_m17_q] => 2
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 4
[if_m25_d] => 3
[if_percentil] => 63.8
[if_m17_percentil] => 63.314
[if_m25_percentil] => 71.611
[ais] => 0.685
[ais_m17_q] => 2
[ais_m25_q] => 2
[ais_m17_d] => 5
[ais_m25_d] => 4
[ais_m17_percentil] => 58.353
[ais_m25_percentil] => 64.047
[jci] => 0.89
[jci_q] => 2
[jci_percentil] => 68.911
[ef] =>
[scopus_sjr] => 0.926
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 15
[incites_open_access] => 1
[incites_jnci] => 1.81
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 1.4403
[incites_avg_percentile] => 80.016067
[scival_citations_count] => 24
[scival_fwci] => 0.780812
[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] => New Benchmark Functions for Single-Objective Optimization Based on a Zigzag Pattern
[popis_en] => Benchmarking plays a crucial role in both development of new optimization methods, and in conducting proper comparisons between already existing methods, particularly in the field of evolutionary computation. In this paper, we develop new benchmark functions for bound-constrained single-objective optimization that are based on a zigzag function. The proposed zigzag function has three parameters that control its behaviour and difficulty of the resulting problems. Utilizing the zigzag function, we introduce four new functions and conduct extensive computational experiments to evaluate their performance as benchmarks. The experiments comprise of using the newly proposed functions in 100 different parameter settings for the comparison of eight different optimization algorithms, which are a mix of canonical methods and best performing methods from the Congress on Evolutionary Computation competitions. Using the results from the computational comparison, we choose some of the parametrization of the newly proposed functions to devise an ambiguous benchmark set in which each of the problems introduces a statistically significant ranking among the algorithms, but the ranking for the entire set is ambiguous with no clear dominating relationship between the algorithms. We also conduct an exploratory landscape analysis of the newly proposed benchmark functions and compare the results with the benchmark functions used in the Black-Box-Optimization-Benchmarking suite. The results suggest that the new benchmark functions are well suited for algorithmic comparisons.
[klicova_slova_en] => numerical optimization; benchmarking; single objective problems; exploratory landscape analysis
[vysledek_datum] => 2022-01-20T00:00:00+01:00
)
[7] => Array
(
[vysledek_id] => 176636
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 143548
[vysledek_rok] => 2021
[nazev] => R-Loop Tracker: Web Access-Based Tool for R-Loop Detection and Analysis in Genomic DNA Sequences
[nazev_orig] => R-Loop Tracker: Web Access-Based Tool for R-Loop Detection and Analysis in Genomic DNA Sequences
[duvernost_udaju_id] => S
[popis] => R-loops are common non-B nucleic acid structures formed by a three-stranded nucleic acid composed of an RNA–DNA hybrid and a displaced single-stranded DNA (ssDNA) loop. Because the aberrant R-loop formation leads to increased mutagenesis, hyper-recombination, rearrangements, and transcription-replication collisions, it is regarded as important in human diseases. Therefore, its prevalence and distribution in genomes are studied intensively. However, in silico tools for R-loop prediction are limited, and therefore, we have developed the R-loop tracker tool, which was implemented as a part of the DNA Analyser web server. This new tool is focused upon (1) prediction of R-loops in genomic DNA without length and sequence limitations; (2) integration of R-loop tracker results with other tools for nucleic acids analyses, including Genome Browser; (3) internal cross-evaluation of in silico results with experimental data, where available; (4) easy export and correlation analyses with other genome features and markers; and (5) enhanced visualization outputs. Our new R-loop tracker tool is freely accessible on the web pages of DNA Analyser tools, and its implementation on the web-based server allows effective analyses not only for DNA segments but also for full chromosomes and genomes.
[popis_orig] => R-loops are common non-B nucleic acid structures formed by a three-stranded nucleic acid composed of an RNA–DNA hybrid and a displaced single-stranded DNA (ssDNA) loop. Because the aberrant R-loop formation leads to increased mutagenesis, hyper-recombination, rearrangements, and transcription-replication collisions, it is regarded as important in human diseases. Therefore, its prevalence and distribution in genomes are studied intensively. However, in silico tools for R-loop prediction are limited, and therefore, we have developed the R-loop tracker tool, which was implemented as a part of the DNA Analyser web server. This new tool is focused upon (1) prediction of R-loops in genomic DNA without length and sequence limitations; (2) integration of R-loop tracker results with other tools for nucleic acids analyses, including Genome Browser; (3) internal cross-evaluation of in silico results with experimental data, where available; (4) easy export and correlation analyses with other genome features and markers; and (5) enhanced visualization outputs. Our new R-loop tracker tool is freely accessible on the web pages of DNA Analyser tools, and its implementation on the web-based server allows effective analyses not only for DNA segments but also for full chromosomes and genomes.
[klicova_slova] => sequence analysis; RNA–DNA hybrid; non-B structure
[klicova_slova_orig] => sequence analysis; RNA–DNA hybrid; non-B structure
[url] => https://www.mdpi.com/1422-0067/22/23/12857
[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] => 51108
[schvaleno] => 2022-03-22
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 117499
[posledni_diagnostika] =>
[vycet_osob] => BRÁZDA, V.; HAVLÍK, J.; KOLOMAZNÍK, J.; TRENZ, O.; ŠŤASTNÝ, J.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.3390/ijms222312857
[kod_dspace] => 11012/204020
[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 1661-6596
[identifikator_popis] => ISSN - INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES (CH)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => BRÁZDA, V.; HAVLÍK, J.; KOLOMAZNÍK, J.; TRENZ, O.; ŠŤASTNÝ, J. R-Loop Tracker: Web Access-Based Tool for R-Loop Detection and Analysis in Genomic DNA Sequences. INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES, 2021, vol. 22, no. 23, p. 1-8. ISSN: 1422-0067.
[citace_html] => BRÁZDA, V.; HAVLÍK, J.; KOLOMAZNÍK, J.; TRENZ, O.; ŠŤASTNÝ, J. R-Loop Tracker: Web Access-Based Tool for R-Loop Detection and Analysis in Genomic DNA Sequences. INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES, 2021, vol. 22, no. 23, p. 1-8. ISSN: 1422-0067.
[citace_rtf] =>
[citace_bibtex] => @article{BUT176636,
author="Václav {Brázda} and Jan {Havlík} and Jan {Kolomazník} and Oldřich {Trenz} and Jiří {Šťastný}",
title="R-Loop Tracker: Web Access-Based Tool for R-Loop Detection and Analysis in Genomic DNA Sequences",
journal="INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES",
year="2021",
volume="22",
number="23",
pages="1--8",
doi="10.3390/ijms222312857",
issn="1661-6596",
url="https://www.mdpi.com/1422-0067/22/23/12857"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 6.208
[if_q] => 1
[if_m17_q] => 1
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 2
[if_m25_d] => 2
[if_percentil] => 76.936
[if_m17_percentil] => 85.329
[if_m25_percentil] => 85.329
[ais] => 1.064
[ais_m17_q] => 1
[ais_m25_q] => 1
[ais_m17_d] => 2
[ais_m25_d] => 2
[ais_m17_percentil] => 81.111
[ais_m25_percentil] => 82.765
[jci] => 0.7
[jci_q] => 2
[jci_percentil] => 65.848
[ef] =>
[scopus_sjr] => 1.176
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 6
[incites_open_access] => 1
[incites_jnci] => 0.49
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.3135
[incites_avg_percentile] => 29.6345
[scival_citations_count] => 8
[scival_fwci] => 1.082592
[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] => R-Loop Tracker: Web Access-Based Tool for R-Loop Detection and Analysis in Genomic DNA Sequences
[popis_en] => R-loops are common non-B nucleic acid structures formed by a three-stranded nucleic acid composed of an RNA–DNA hybrid and a displaced single-stranded DNA (ssDNA) loop. Because the aberrant R-loop formation leads to increased mutagenesis, hyper-recombination, rearrangements, and transcription-replication collisions, it is regarded as important in human diseases. Therefore, its prevalence and distribution in genomes are studied intensively. However, in silico tools for R-loop prediction are limited, and therefore, we have developed the R-loop tracker tool, which was implemented as a part of the DNA Analyser web server. This new tool is focused upon (1) prediction of R-loops in genomic DNA without length and sequence limitations; (2) integration of R-loop tracker results with other tools for nucleic acids analyses, including Genome Browser; (3) internal cross-evaluation of in silico results with experimental data, where available; (4) easy export and correlation analyses with other genome features and markers; and (5) enhanced visualization outputs. Our new R-loop tracker tool is freely accessible on the web pages of DNA Analyser tools, and its implementation on the web-based server allows effective analyses not only for DNA segments but also for full chromosomes and genomes.
[klicova_slova_en] => sequence analysis; RNA–DNA hybrid; non-B structure
[vysledek_datum] => 2021-11-27T00:00:00+01:00
)
[8] => Array
(
[vysledek_id] => 176667
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 143580
[vysledek_rok] => 2022
[nazev] => MT Evaluation in the Context of Language Complexity
[nazev_orig] => MT Evaluation in the Context of Language Complexity
[duvernost_udaju_id] => S
[popis] => The paper focuses on investigating the impact of artificial agent (machine translator) on human agent (posteditor) using a proposed methodology, which is based on language complexity measures, POS tags, frequent tagsets, association rules, and their summarization. We examine this impact from the point of view of language complexity in terms of word and sentence structure. By the proposed methodology, we analyzed 24 733 tags of English to Slovak translations of technical texts, corresponding to the output of two MT systems (Google Translate and the European Commission’s MT tool). We used both manual (adequacy and fluency) and semiautomatic (HTER metric) MT evaluation measures as the criteria for validity. We show that the proposed methodology is valid based on the evaluation of frequent tagsets and rules of MT outputs produced by Google Translate or of the European Commission’s MT tool, and both postedited MT (PEMT) outputs using baseline methods. Our results have also shown that PEMT output produced by Google Translate is characterized by more frequent tagsets such as verbs in the infinitive with modal verbs compared to its MT output, which is characterized by masculine, inanimate nouns in locative of singular. In the MT output, produced by the European Commission’s MT tool, the most frequent tagset was verbs in the infinitive compared to its postedited MT output, where verbs in imperative and the second person of plural occurred. These findings are also obtained from the use of the proposed methodology for MT evaluation. The contribution of the proposed methodology is an identification of systematic not random errors. Additionally, the study can also serve as information for optimizing the translation process using postediting.
[popis_orig] => The paper focuses on investigating the impact of artificial agent (machine translator) on human agent (posteditor) using a proposed methodology, which is based on language complexity measures, POS tags, frequent tagsets, association rules, and their summarization. We examine this impact from the point of view of language complexity in terms of word and sentence structure. By the proposed methodology, we analyzed 24 733 tags of English to Slovak translations of technical texts, corresponding to the output of two MT systems (Google Translate and the European Commission’s MT tool). We used both manual (adequacy and fluency) and semiautomatic (HTER metric) MT evaluation measures as the criteria for validity. We show that the proposed methodology is valid based on the evaluation of frequent tagsets and rules of MT outputs produced by Google Translate or of the European Commission’s MT tool, and both postedited MT (PEMT) outputs using baseline methods. Our results have also shown that PEMT output produced by Google Translate is characterized by more frequent tagsets such as verbs in the infinitive with modal verbs compared to its MT output, which is characterized by masculine, inanimate nouns in locative of singular. In the MT output, produced by the European Commission’s MT tool, the most frequent tagset was verbs in the infinitive compared to its postedited MT output, where verbs in imperative and the second person of plural occurred. These findings are also obtained from the use of the proposed methodology for MT evaluation. The contribution of the proposed methodology is an identification of systematic not random errors. Additionally, the study can also serve as information for optimizing the translation process using postediting.
[klicova_slova] => artificial agent, association rules, language complexity measures, machine translator
[klicova_slova_orig] => artificial agent, association rules, language complexity measures, machine translator
[url] => https://www.hindawi.com/journals/complexity/2021/2806108/
[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] => 2022-04-25
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 117326
[posledni_diagnostika] =>
[vycet_osob] => MUNKOVÁ, D.; MUNK, M.; BENKO, L.; ŠŤASTNÝ, J.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1155/2021/2806108
[kod_dspace] => 11012/203982
[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 1076-2787
[identifikator_popis] => ISSN - COMPLEXITY (US)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 2
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 2
[citace_text] => MUNKOVÁ, D.; MUNK, M.; BENKO, L.; ŠŤASTNÝ, J. MT Evaluation in the Context of Language Complexity. COMPLEXITY, 2022, vol. 2021, no. 1, p. 1-15. ISSN: 1076-2787.
[citace_html] => MUNKOVÁ, D.; MUNK, M.; BENKO, L.; ŠŤASTNÝ, J. MT Evaluation in the Context of Language Complexity. COMPLEXITY, 2022, vol. 2021, no. 1, p. 1-15. ISSN: 1076-2787.
[citace_rtf] =>
[citace_bibtex] => @article{BUT176667,
author="Dáša {Munková} and Michal {Munk} and Lubomír {Benko} and Jiří {Šťastný}",
title="MT Evaluation in the Context of Language Complexity",
journal="COMPLEXITY",
year="2022",
volume="2021",
number="1",
pages="1--15",
doi="10.1155/2021/2806108",
issn="1076-2787",
url="https://www.hindawi.com/journals/complexity/2021/2806108/"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.3
[if_q] => 2
[if_m17_q] => 1
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 2
[if_m25_d] => 2
[if_percentil] => 66.8
[if_m17_percentil] => 83.805
[if_m25_percentil] => 87.526
[ais] => 0.334
[ais_m17_q] => 3
[ais_m25_q] => 2
[ais_m17_d] => 7
[ais_m25_d] => 5
[ais_m17_percentil] => 34.932
[ais_m25_percentil] => 53.516
[jci] => 0.72
[jci_q] => 2
[jci_percentil] => 68.797
[ef] =>
[scopus_sjr] => 0.439
[scopus_sjr_q] => 2
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 4
[incites_open_access] => 1
[incites_jnci] => 0.66
[incites_is_int_collab] => 1
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.3693
[incites_avg_percentile] => 40.2372
[scival_citations_count] => 5
[scival_fwci] => 1.999634
[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] => MT Evaluation in the Context of Language Complexity
[popis_en] => The paper focuses on investigating the impact of artificial agent (machine translator) on human agent (posteditor) using a proposed methodology, which is based on language complexity measures, POS tags, frequent tagsets, association rules, and their summarization. We examine this impact from the point of view of language complexity in terms of word and sentence structure. By the proposed methodology, we analyzed 24 733 tags of English to Slovak translations of technical texts, corresponding to the output of two MT systems (Google Translate and the European Commission’s MT tool). We used both manual (adequacy and fluency) and semiautomatic (HTER metric) MT evaluation measures as the criteria for validity. We show that the proposed methodology is valid based on the evaluation of frequent tagsets and rules of MT outputs produced by Google Translate or of the European Commission’s MT tool, and both postedited MT (PEMT) outputs using baseline methods. Our results have also shown that PEMT output produced by Google Translate is characterized by more frequent tagsets such as verbs in the infinitive with modal verbs compared to its MT output, which is characterized by masculine, inanimate nouns in locative of singular. In the MT output, produced by the European Commission’s MT tool, the most frequent tagset was verbs in the infinitive compared to its postedited MT output, where verbs in imperative and the second person of plural occurred. These findings are also obtained from the use of the proposed methodology for MT evaluation. The contribution of the proposed methodology is an identification of systematic not random errors. Additionally, the study can also serve as information for optimizing the translation process using postediting.
[klicova_slova_en] => artificial agent, association rules, language complexity measures, machine translator
[vysledek_datum] => 2022-01-01T00:00:00+01:00
)
[9] => Array
(
[vysledek_id] => 176680
[vysledek_druh_id] => ABSTR
[ex_vysledek_id] => 143586
[vysledek_rok] => 2021
[nazev] => Design of Transport Infrastructure with Respect to the Specific Features of Case Study
[nazev_orig] => Design of Transport Infrastructure with Respect to the Specific Features of Case Study
[duvernost_udaju_id] => S
[popis] => Currently, the increasing emphasis is placed on the long-term sustainability of the supply and processing
chain in all sectors. In addition to the economic aspect, the overall impact on the environment are often
addressed. To implement appropriate changes and meet the set goals, support tools based on mathematical
programming are widely used. These tools can provide appropriate insight into the issues addressed and
draw attention to possible unfavorable conditions or overall inefficiency of operation. The main problems
are location and allocation tasks, which are usually solved using flow in the network. For accurate results
and their possible applicability, it is necessary to use a detailed infrastructure, which is modeled using graph
construction. However, these tasks are fundamentally limited by extreme computational complexity if a
real problem is addressed. In the case of thousands nodes with millions of edges, it is almost impossible to
perform a calculation, where the non-linearity or integer variables are included. The computation can often
be performed only on less detailed infrastructure, which is usually given by historical development or
legislation. On the other hand, this structure does not reflect the specific conditions of the problem and the
obtained results could be distorted and their usability can be considerably limited. It is therefore appropriate
to deal with the design of own infrastructure. The aim is to create a changing detail of the transport
infrastructure based on key elements in the system. The presented study introduces a proposal of a
methodology for the design and reduction of transport infrastructure regarding an optimisation of network
flow tasks. The principle of the procedure consists in keeping the finer detail of infrastructure in the vicinity
of the monitored node and it is possible to have coarser detail with increasing distance. For this purpose,
the transformation of the coordinates of the nodes is used, followed by the application of cluster analysis.
Gradually, the k-means and hierarchical clustering algorithms are introduced, including their evaluation by
silhouette. For the design of the transport network, the distances between municipalities and population are
used. On the other hand, it is desirable to include other key factors such as production, capacity and taking
into account multiple reference nodes, which will be the subject of consequent research.
[popis_orig] => Currently, the increasing emphasis is placed on the long-term sustainability of the supply and processing
chain in all sectors. In addition to the economic aspect, the overall impact on the environment are often
addressed. To implement appropriate changes and meet the set goals, support tools based on mathematical
programming are widely used. These tools can provide appropriate insight into the issues addressed and
draw attention to possible unfavorable conditions or overall inefficiency of operation. The main problems
are location and allocation tasks, which are usually solved using flow in the network. For accurate results
and their possible applicability, it is necessary to use a detailed infrastructure, which is modeled using graph
construction. However, these tasks are fundamentally limited by extreme computational complexity if a
real problem is addressed. In the case of thousands nodes with millions of edges, it is almost impossible to
perform a calculation, where the non-linearity or integer variables are included. The computation can often
be performed only on less detailed infrastructure, which is usually given by historical development or
legislation. On the other hand, this structure does not reflect the specific conditions of the problem and the
obtained results could be distorted and their usability can be considerably limited. It is therefore appropriate
to deal with the design of own infrastructure. The aim is to create a changing detail of the transport
infrastructure based on key elements in the system. The presented study introduces a proposal of a
methodology for the design and reduction of transport infrastructure regarding an optimisation of network
flow tasks. The principle of the procedure consists in keeping the finer detail of infrastructure in the vicinity
of the monitored node and it is possible to have coarser detail with increasing distance. For this purpose,
the transformation of the coordinates of the nodes is used, followed by the application of cluster analysis.
Gradually, the k-means and hierarchical clustering algorithms are introduced, including their evaluation by
silhouette. For the design of the transport network, the distances between municipalities and population are
used. On the other hand, it is desirable to include other key factors such as production, capacity and taking
into account multiple reference nodes, which will be the subject of consequent research.
[klicova_slova] => Model-Size Reduction Techniques, Cluster Analysis, Infrastructure Transformation
[klicova_slova_orig] => Model-Size Reduction Techniques, Cluster Analysis, Infrastructure Transformation
[url] =>
[oecd_obor_id] => 20701
[odpovedny_utvar_id] => 188
[odpovedny_utvar_nazev] => Ústav procesního inženýrství
[odpovedny_utvar_zkratka] => ÚPI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 170449
[schvaleno] => 2022-02-21
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => PLUSKAL, J.; ŠOMPLÁK, R.; KŮDELA, 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] => Abstrakt
[druh_popis] => Abstrakt
[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 2653-8911
[identifikator_popis] => ISSN - Book of Abstracts of the Energy, Sustainability and Climate Change Conference (GR)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => PLUSKAL, J.; ŠOMPLÁK, R.; KŮDELA, J. Design of Transport Infrastructure with Respect to the Specific Features of Case Study. Book of Abstracts of the Energy, Sustainability and Climate Change Conference. 2021. no. 1, p. 90-90. ISSN: 2653-8911.
[citace_html] => PLUSKAL, J.; ŠOMPLÁK, R.; KŮDELA, J. Design of Transport Infrastructure with Respect to the Specific Features of Case Study. Book of Abstracts of the Energy, Sustainability and Climate Change Conference. 2021. no. 1, p. 90-90. ISSN: 2653-8911.
[citace_rtf] =>
[citace_bibtex] => @misc{BUT176680,
author="Jaroslav {Pluskal} and Radovan {Šomplák} and Jakub {Kůdela}",
title="Design of Transport Infrastructure with Respect to the Specific Features of Case Study",
year="2021",
journal="Book of Abstracts of the Energy, Sustainability and Climate Change Conference",
volume="8",
number="1",
pages="90--90",
issn="2653-8911",
note="Abstract"
}
[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] => 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] => Design of Transport Infrastructure with Respect to the Specific Features of Case Study
[popis_en] => Currently, the increasing emphasis is placed on the long-term sustainability of the supply and processing
chain in all sectors. In addition to the economic aspect, the overall impact on the environment are often
addressed. To implement appropriate changes and meet the set goals, support tools based on mathematical
programming are widely used. These tools can provide appropriate insight into the issues addressed and
draw attention to possible unfavorable conditions or overall inefficiency of operation. The main problems
are location and allocation tasks, which are usually solved using flow in the network. For accurate results
and their possible applicability, it is necessary to use a detailed infrastructure, which is modeled using graph
construction. However, these tasks are fundamentally limited by extreme computational complexity if a
real problem is addressed. In the case of thousands nodes with millions of edges, it is almost impossible to
perform a calculation, where the non-linearity or integer variables are included. The computation can often
be performed only on less detailed infrastructure, which is usually given by historical development or
legislation. On the other hand, this structure does not reflect the specific conditions of the problem and the
obtained results could be distorted and their usability can be considerably limited. It is therefore appropriate
to deal with the design of own infrastructure. The aim is to create a changing detail of the transport
infrastructure based on key elements in the system. The presented study introduces a proposal of a
methodology for the design and reduction of transport infrastructure regarding an optimisation of network
flow tasks. The principle of the procedure consists in keeping the finer detail of infrastructure in the vicinity
of the monitored node and it is possible to have coarser detail with increasing distance. For this purpose,
the transformation of the coordinates of the nodes is used, followed by the application of cluster analysis.
Gradually, the k-means and hierarchical clustering algorithms are introduced, including their evaluation by
silhouette. For the design of the transport network, the distances between municipalities and population are
used. On the other hand, it is desirable to include other key factors such as production, capacity and taking
into account multiple reference nodes, which will be the subject of consequent research.
[klicova_slova_en] => Model-Size Reduction Techniques, Cluster Analysis, Infrastructure Transformation
[vysledek_datum] => 2021-08-30T00:00:00+02:00
)
[10] => Array
(
[vysledek_id] => 176693
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 143589
[vysledek_rok] => 2022
[nazev] => RGB images-driven recognition of grapevine varieties using a densely connected convolutional network
[nazev_orig] => RGB images-driven recognition of grapevine varieties using a densely connected convolutional network
[duvernost_udaju_id] => S
[popis] => We present a pocket-size densely connected convolutional network (DenseNet) directed to classification of size-normalized colour images according to varieties of grapes captured in those images. We compare the DenseNet with three established small-size networks in terms of performance, inference time, and model size. We propose a data augmentation that we use in training the networks. We train and evaluate the networks on in-field images. The trained networks distinguish between seven grapevine varieties and background, where four and three varieties, respectively are of red and green grapes. Compared to the established networks, the DenseNet is characterized by near state-of-the-art performance, short inference time, and minimal model size. All these aspects qualify the network for real-time, mobile, and edge computing applications. The DenseNet opens possibilities for constructing affordable selective harvesters in accordance with agriculture 4.0.
[popis_orig] => We present a pocket-size densely connected convolutional network (DenseNet) directed to classification of size-normalized colour images according to varieties of grapes captured in those images. We compare the DenseNet with three established small-size networks in terms of performance, inference time, and model size. We propose a data augmentation that we use in training the networks. We train and evaluate the networks on in-field images. The trained networks distinguish between seven grapevine varieties and background, where four and three varieties, respectively are of red and green grapes. Compared to the established networks, the DenseNet is characterized by near state-of-the-art performance, short inference time, and minimal model size. All these aspects qualify the network for real-time, mobile, and edge computing applications. The DenseNet opens possibilities for constructing affordable selective harvesters in accordance with agriculture 4.0.
[klicova_slova] => Recognition of grapevine varieties; Densely connected convolutional network; Data augmentation; In-field images; Edge-computing; Agricultural mechanization
[klicova_slova_orig] => Recognition of grapevine varieties; Densely connected convolutional network; Data augmentation; In-field images; Edge-computing; Agricultural mechanization
[url] => https://academic.oup.com/jigpal/advance-article-abstract/doi/10.1093/jigpal/jzac029/6529721
[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] => 209801
[schvaleno] => 2024-03-05
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠKRABÁNEK, P.; DOLEŽEL, P.; MATOUŠEK, R.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1093/jigpal/jzac029
[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 1367-0751
[identifikator_popis] => ISSN - LOGIC JOURNAL OF THE IGPL (GB)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 5
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 1
[diagnostika_pocet_informace] => 3
[citace_text] => ŠKRABÁNEK, P.; DOLEŽEL, P.; MATOUŠEK, R. RGB images-driven recognition of grapevine varieties using a densely connected convolutional network. LOGIC JOURNAL OF THE IGPL, 2022, no. jzac029, p. 1-16. ISSN: 1367-0751.
[citace_html] => ŠKRABÁNEK, P.; DOLEŽEL, P.; MATOUŠEK, R. RGB images-driven recognition of grapevine varieties using a densely connected convolutional network. LOGIC JOURNAL OF THE IGPL, 2022, no. jzac029, p. 1-16. ISSN: 1367-0751.
[citace_rtf] =>
[citace_bibtex] => @article{BUT176693,
author="Pavel {Škrabánek} and Petr {Doležel} and Radomil {Matoušek}",
title="RGB images-driven recognition of grapevine varieties using a densely connected convolutional network",
journal="LOGIC JOURNAL OF THE IGPL",
year="2022",
number="jzac029",
pages="1--16",
doi="10.1093/jigpal/jzac029",
issn="1367-0751",
url="https://academic.oup.com/jigpal/advance-article-abstract/doi/10.1093/jigpal/jzac029/6529721"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 1
[if_q] => 1
[if_m17_q] => 3
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 6
[if_m25_d] => 5
[if_percentil] => 88.1
[if_m17_percentil] => 41.372
[if_m25_percentil] => 52.31
[ais] => 0.349
[ais_m17_q] => 4
[ais_m25_q] => 3
[ais_m17_d] => 8
[ais_m25_d] => 7
[ais_m17_percentil] => 21.332
[ais_m25_percentil] => 34.437
[jci] => 0.91
[jci_q] => 1
[jci_percentil] => 82
[ef] =>
[scopus_sjr] => 0.411
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 1
[incites_open_access] => 1
[incites_jnci] => 0.43
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.3779
[incites_avg_percentile] => 31.046967
[scival_citations_count] =>
[scival_fwci] => 1.753419
[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 using a densely connected convolutional network
[popis_en] => We present a pocket-size densely connected convolutional network (DenseNet) directed to classification of size-normalized colour images according to varieties of grapes captured in those images. We compare the DenseNet with three established small-size networks in terms of performance, inference time, and model size. We propose a data augmentation that we use in training the networks. We train and evaluate the networks on in-field images. The trained networks distinguish between seven grapevine varieties and background, where four and three varieties, respectively are of red and green grapes. Compared to the established networks, the DenseNet is characterized by near state-of-the-art performance, short inference time, and minimal model size. All these aspects qualify the network for real-time, mobile, and edge computing applications. The DenseNet opens possibilities for constructing affordable selective harvesters in accordance with agriculture 4.0.
[klicova_slova_en] => Recognition of grapevine varieties; Densely connected convolutional network; Data augmentation; In-field images; Edge-computing; Agricultural mechanization
[vysledek_datum] => 2022-02-16T00:00:00+01:00
)
[11] => Array
(
[vysledek_id] => 177360
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 144128
[vysledek_rok] => 2022
[nazev] => Production of precision slots in copper foil using micro EDM
[nazev_orig] => Production of precision slots in copper foil using micro EDM
[duvernost_udaju_id] => S
[popis] => Elektroerozivní hloubení (EDM) je nekonvenční technologie obrábění. Umožňuje obrábět všechny alespoň minimálně elektricky vodivé materiály. Trend miniaturizace průmyslových výrobků je zřejmý. Je však třeba udržet požadovanou kvalitu a přesnost, což je možné dosáhnout pomocí mikro-EDM. Jedním z průmyslových výrobků jsou i optické přístroje používané pro testování automobilů. Tyto obsahují miniaturizované díly, které jsou však nezbytné pro jejich správnou funkčnost. For this reason, this study was performed, which focused on the production of a precise slot measuring 5000x170 µm in a copper foil with a thickness of 125 µm. The same copper foil was used as a tool, which represents an advance in the production of micro-parts. Použití stejného polotovaru pro výrobu štěrbiny i jako samotný nástroj nebylo dosud v žádné podobné studii prezentováno. A design of experiment Box and Behnken Response Surface Design was performed for a total of 15 rounds, monitoring the effect of machine setting parameters (Pulse current, Pulse on time and Voltage) on responses in the form of Erosion rate, corner radius, slot length and width. Using multi-criteria optimization, the optimal setting of the machine parameters for the production of a given slit was determined, which is Pulse current = 2.1 A, Pulse on time = 40 µs and Voltage = 238.8 V. Technologie mikro-EDM byla shledána za vhodnou pro výrobu miniaturizovaných štěrbin.
[popis_orig] => Elektroerozivní hloubení (EDM) je nekonvenční technologie obrábění. Umožňuje obrábět všechny alespoň minimálně elektricky vodivé materiály. Trend miniaturizace průmyslových výrobků je zřejmý. Je však třeba udržet požadovanou kvalitu a přesnost, což je možné dosáhnout pomocí mikro-EDM. Jedním z průmyslových výrobků jsou i optické přístroje používané pro testování automobilů. Tyto obsahují miniaturizované díly, které jsou však nezbytné pro jejich správnou funkčnost. For this reason, this study was performed, which focused on the production of a precise slot measuring 5000x170 µm in a copper foil with a thickness of 125 µm. The same copper foil was used as a tool, which represents an advance in the production of micro-parts. Použití stejného polotovaru pro výrobu štěrbiny i jako samotný nástroj nebylo dosud v žádné podobné studii prezentováno. A design of experiment Box and Behnken Response Surface Design was performed for a total of 15 rounds, monitoring the effect of machine setting parameters (Pulse current, Pulse on time and Voltage) on responses in the form of Erosion rate, corner radius, slot length and width. Using multi-criteria optimization, the optimal setting of the machine parameters for the production of a given slit was determined, which is Pulse current = 2.1 A, Pulse on time = 40 µs and Voltage = 238.8 V. Technologie mikro-EDM byla shledána za vhodnou pro výrobu miniaturizovaných štěrbin.
[klicova_slova] => micro-EDM; electrical discharge machining;copper;foil; design of experiment;machining parameters
[klicova_slova_orig] => micro-EDM; electrical discharge machining;copper;foil; design of experiment;machining parameters
[url] => https://www.nature.com/articles/s41598-022-08957-9
[oecd_obor_id] => 20301
[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] => 85160
[schvaleno] => 2022-04-26
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 119748
[posledni_diagnostika] =>
[vycet_osob] => MOURALOVÁ, K.; BEDNÁŘ, J.; BENEŠ, L.; PLICHTA, T.; PROKEŠ, T.; FRIES, J.
[pocet_tvurcu] => 6
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1038/s41598-022-08957-9
[kod_dspace] => 11012/204472
[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 2045-2322
[identifikator_popis] => ISSN - Scientific Reports (GB)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => MOURALOVÁ, K.; BEDNÁŘ, J.; BENEŠ, L.; PLICHTA, T.; PROKEŠ, T.; FRIES, J. Production of precision slots in copper foil using micro EDM. Scientific Reports, 2022, vol. 12, no. 1, p. 1-10. ISSN: 2045-2322.
[citace_html] => MOURALOVÁ, K.; BEDNÁŘ, J.; BENEŠ, L.; PLICHTA, T.; PROKEŠ, T.; FRIES, J. Production of precision slots in copper foil using micro EDM. Scientific Reports, 2022, vol. 12, no. 1, p. 1-10. ISSN: 2045-2322.
[citace_rtf] =>
[citace_bibtex] => @article{BUT177360,
author="Kateřina {Mouralová} and Josef {Bednář} and Libor {Beneš} and Tomáš {Plichta} and Tomáš {Prokeš} and Jiří {Fries}",
title="Production of precision slots in copper foil using micro EDM",
journal="Scientific Reports",
year="2022",
volume="12",
number="1",
pages="1--10",
doi="10.1038/s41598-022-08957-9",
issn="2045-2322",
url="https://www.nature.com/articles/s41598-022-08957-9"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 4.6
[if_q] => 2
[if_m17_q] => 2
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 4
[if_m25_d] => 2
[if_percentil] => 70.5
[if_m17_percentil] => 70.548
[if_m25_percentil] => 80.827
[ais] => 1.129
[ais_m17_q] => 2
[ais_m25_q] => 1
[ais_m17_d] => 4
[ais_m25_d] => 3
[ais_m17_percentil] => 70.548
[ais_m25_percentil] => 80.078
[jci] => 1.06
[jci_q] => 1
[jci_percentil] => 84.586
[ef] =>
[scopus_sjr] => 0.973
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 7
[incites_open_access] => 1
[incites_jnci] => 0.72
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.521
[incites_avg_percentile] => 42.524
[scival_citations_count] => 9
[scival_fwci] => 2.730359
[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] => 20301
[oecd_tree_podobor_nazev] => Mechanical engineering
[poznamka_metriky] =>
[nazev_en] => Production of precision slots in copper foil using micro EDM
[popis_en] => Elektroerozivní hloubení (EDM) je nekonvenční technologie obrábění. Umožňuje obrábět všechny alespoň minimálně elektricky vodivé materiály. Trend miniaturizace průmyslových výrobků je zřejmý. Je však třeba udržet požadovanou kvalitu a přesnost, což je možné dosáhnout pomocí mikro-EDM. Jedním z průmyslových výrobků jsou i optické přístroje používané pro testování automobilů. Tyto obsahují miniaturizované díly, které jsou však nezbytné pro jejich správnou funkčnost. For this reason, this study was performed, which focused on the production of a precise slot measuring 5000x170 µm in a copper foil with a thickness of 125 µm. The same copper foil was used as a tool, which represents an advance in the production of micro-parts. Použití stejného polotovaru pro výrobu štěrbiny i jako samotný nástroj nebylo dosud v žádné podobné studii prezentováno. A design of experiment Box and Behnken Response Surface Design was performed for a total of 15 rounds, monitoring the effect of machine setting parameters (Pulse current, Pulse on time and Voltage) on responses in the form of Erosion rate, corner radius, slot length and width. Using multi-criteria optimization, the optimal setting of the machine parameters for the production of a given slit was determined, which is Pulse current = 2.1 A, Pulse on time = 40 µs and Voltage = 238.8 V. Technologie mikro-EDM byla shledána za vhodnou pro výrobu miniaturizovaných štěrbin.
[klicova_slova_en] => micro-EDM; electrical discharge machining;copper;foil; design of experiment;machining parameters
[vysledek_datum] => 2022-03-23T00:00:00+01:00
)
[12] => Array
(
[vysledek_id] => 177513
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 144246
[vysledek_rok] => 2022
[nazev] => Experimental analysis of microhardness changes of subsurface areas affected by WEDM
[nazev_orig] => Experimental analysis of microhardness changes of subsurface areas affected by WEDM
[duvernost_udaju_id] => S
[popis] => The influence of the surface area by the impact of high temperatures after wire electric discharge machining (WEDM) is a known fact. However, the affected parameters also include a change in microhardness. In order to further investigate this statement, 5 different ferrous and non-ferrous materials were selected, from which three samples were always made with different settings of machine parameters (gap voltage, pulse on and off time, wire feed and discharge current). This examined not only the effect of the machining itself on the material but also whether the change in the microhardness of the material is affected by the setting of the machine parameters. In order to measure the microhardness of the subsurface layer, a metallographic preparation was made from each sample, which enabled accurate measurements always in the same area. Subsequent evaluation revealed that the microhardness may not be affected at all and everything depends only on the type of material being machined. The changes in microhardness affected by setting machine parameters are negligible.
[popis_orig] => The influence of the surface area by the impact of high temperatures after wire electric discharge machining (WEDM) is a known fact. However, the affected parameters also include a change in microhardness. In order to further investigate this statement, 5 different ferrous and non-ferrous materials were selected, from which three samples were always made with different settings of machine parameters (gap voltage, pulse on and off time, wire feed and discharge current). This examined not only the effect of the machining itself on the material but also whether the change in the microhardness of the material is affected by the setting of the machine parameters. In order to measure the microhardness of the subsurface layer, a metallographic preparation was made from each sample, which enabled accurate measurements always in the same area. Subsequent evaluation revealed that the microhardness may not be affected at all and everything depends only on the type of material being machined. The changes in microhardness affected by setting machine parameters are negligible.
[klicova_slova] => WEDM; electrical discharge machining; microhardness; machining parameters; subsurface layer
[klicova_slova_orig] => WEDM; electrical discharge machining; microhardness; machining parameters; subsurface layer
[url] => https://doi.org/10.1177/09544089221078383
[oecd_obor_id] => 20301
[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] => 51108
[schvaleno] => 2022-06-07
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 120255
[posledni_diagnostika] =>
[vycet_osob] => MOURALOVÁ, K.; MICHNA, S; ZAHRADNÍČEK, R.; BEDNÁŘ, J.; PLICHTA, T.; FRIES, J.
[pocet_tvurcu] => 6
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1177/09544089221078383
[kod_dspace] => 11012/204707
[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 0954-4089
[identifikator_popis] => ISSN - Proceedings of the Institution of Mechanical Engineers. Part E, Journal of process mechanical engineering (GB)
[riv_dodavka_id] => 2920
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 2
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 2
[citace_text] => MOURALOVÁ, K.; MICHNA, S; ZAHRADNÍČEK, R.; BEDNÁŘ, J.; PLICHTA, T.; FRIES, J. Experimental analysis of microhardness changes of subsurface areas affected by WEDM. Proceedings of the Institution of Mechanical Engineers. Part E, Journal of process mechanical engineering, 2022, vol. 2022, no. 236, p. 1-13. ISSN: 0954-4089.
[citace_html] => MOURALOVÁ, K.; MICHNA, S; ZAHRADNÍČEK, R.; BEDNÁŘ, J.; PLICHTA, T.; FRIES, J. Experimental analysis of microhardness changes of subsurface areas affected by WEDM. Proceedings of the Institution of Mechanical Engineers. Part E, Journal of process mechanical engineering, 2022, vol. 2022, no. 236, p. 1-13. ISSN: 0954-4089.
[citace_rtf] =>
[citace_bibtex] => @article{BUT177513,
author="Kateřina {Mouralová} and Štefan {Michna} and Radim {Zahradníček} and Josef {Bednář} and Tomáš {Plichta} and Jiří {Fries}",
title="Experimental analysis of microhardness changes of subsurface areas affected by WEDM",
journal="Proceedings of the Institution of Mechanical Engineers. Part E, Journal of process mechanical engineering",
year="2022",
volume="2022",
number="236",
pages="1--13",
doi="10.1177/09544089221078383",
issn="0954-4089",
url="https://doi.org/10.1177/09544089221078383"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.4
[if_q] => 3
[if_m17_q] => 2
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 5
[if_m25_d] => 4
[if_percentil] => 47.8
[if_m17_percentil] => 54.05
[if_m25_percentil] => 61.675
[ais] => 0.245
[ais_m17_q] => 4
[ais_m25_q] => 3
[ais_m17_d] => 9
[ais_m25_d] => 7
[ais_m17_percentil] => 18.847
[ais_m25_percentil] => 30.515
[jci] => 0.61
[jci_q] => 2
[jci_percentil] => 60.393
[ef] =>
[scopus_sjr] => 0.324
[scopus_sjr_q] => 3
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 4
[incites_open_access] => 1
[incites_jnci] => 0.76
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.3737
[incites_avg_percentile] => 30.5307
[scival_citations_count] => 2
[scival_fwci] => 1.191062
[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] => 20301
[oecd_tree_podobor_nazev] => Mechanical engineering
[poznamka_metriky] =>
[nazev_en] => Experimental analysis of microhardness changes of subsurface areas affected by WEDM
[popis_en] => The influence of the surface area by the impact of high temperatures after wire electric discharge machining (WEDM) is a known fact. However, the affected parameters also include a change in microhardness. In order to further investigate this statement, 5 different ferrous and non-ferrous materials were selected, from which three samples were always made with different settings of machine parameters (gap voltage, pulse on and off time, wire feed and discharge current). This examined not only the effect of the machining itself on the material but also whether the change in the microhardness of the material is affected by the setting of the machine parameters. In order to measure the microhardness of the subsurface layer, a metallographic preparation was made from each sample, which enabled accurate measurements always in the same area. Subsequent evaluation revealed that the microhardness may not be affected at all and everything depends only on the type of material being machined. The changes in microhardness affected by setting machine parameters are negligible.
[klicova_slova_en] => WEDM; electrical discharge machining; microhardness; machining parameters; subsurface layer
[vysledek_datum] => 2022-03-30T00:00:00+02:00
)
[13] => Array
(
[vysledek_id] => 178336
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 144872
[vysledek_rok] => 2022
[nazev] => Surrogate-Assisted Differential Evolution-Based Method for the ICSI’2022 Competition
[nazev_orig] => Surrogate-Assisted Differential Evolution-Based Method for the ICSI’2022 Competition
[duvernost_udaju_id] => S
[popis] => In this paper, a method called Lipschitz-surrogate Assisted Differential Evolution (LSADE) is described. The method uses two different surrogates: a standard radial basis function one and a specialized one based on a Lipschitz condition. It also uses two optimization methods: differential evolution and sequential quadratic programming. The LSADE method is investigated on the benchmark set of the ICSI’2022 competition and is compared with two other high-performing methods for bound constrained optimization, outperforming them both on the studied benchmark set.
[popis_orig] => In this paper, a method called Lipschitz-surrogate Assisted Differential Evolution (LSADE) is described. The method uses two different surrogates: a standard radial basis function one and a specialized one based on a Lipschitz condition. It also uses two optimization methods: differential evolution and sequential quadratic programming. The LSADE method is investigated on the benchmark set of the ICSI’2022 competition and is compared with two other high-performing methods for bound constrained optimization, outperforming them both on the studied benchmark set.
[klicova_slova] => ICSI’2022 competition; Surrogate-assisted optimization; Differential evolution; Numerical optimization
[klicova_slova_orig] => ICSI’2022 competition; Surrogate-assisted optimization; Differential evolution; Numerical optimization
[url] => https://link.springer.com/chapter/10.1007/978-3-031-09726-3_40
[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] => 125766
[schvaleno] => 2022-11-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.; HOLOUBEK, T.; NEVORAL, T.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1007/978-3-031-09726-3_40
[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-3-031-09726-3
[identifikator_popis] => ISBN - Advances in Swarm Intelligence. ICSI 2022, Part II. Lecture Notes in Computer Science, vol 13345.
[riv_dodavka_id] => 3026
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => KŮDELA, J.; HOLOUBEK, T.; NEVORAL, T. Surrogate-Assisted Differential Evolution-Based Method for the ICSI’2022 Competition. In Advances in Swarm Intelligence. ICSI 2022, Part II. Lecture Notes in Computer Science, vol 13345. Springer, Cham, 2022. p. 440-449. ISBN: 978-3-031-09726-3.
[citace_html] => KŮDELA, J.; HOLOUBEK, T.; NEVORAL, T. Surrogate-Assisted Differential Evolution-Based Method for the ICSI’2022 Competition. In Advances in Swarm Intelligence. ICSI 2022, Part II. Lecture Notes in Computer Science, vol 13345. Springer, Cham, 2022. p. 440-449. ISBN: 978-3-031-09726-3.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT178336,
author="Jakub {Kůdela} and Tomáš {Holoubek} and Tomáš {Nevoral}",
title="Surrogate-Assisted Differential Evolution-Based Method for the ICSI’2022 Competition",
booktitle="Advances in Swarm Intelligence. ICSI 2022, Part II. Lecture Notes in Computer Science, vol 13345.",
year="2022",
publisher="Springer, Cham",
pages="440--449",
doi="10.1007/978-3-031-09726-3\{_}40",
isbn="978-3-031-09726-3",
url="https://link.springer.com/chapter/10.1007/978-3-031-09726-3_40"
}
[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] => 2
[incites_open_access] => 0
[incites_jnci] => 0.39
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.4426
[incites_avg_percentile] => 55.37335
[scival_citations_count] => 1
[scival_fwci] => 0.423466
[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] => Surrogate-Assisted Differential Evolution-Based Method for the ICSI’2022 Competition
[popis_en] => In this paper, a method called Lipschitz-surrogate Assisted Differential Evolution (LSADE) is described. The method uses two different surrogates: a standard radial basis function one and a specialized one based on a Lipschitz condition. It also uses two optimization methods: differential evolution and sequential quadratic programming. The LSADE method is investigated on the benchmark set of the ICSI’2022 competition and is compared with two other high-performing methods for bound constrained optimization, outperforming them both on the studied benchmark set.
[klicova_slova_en] => ICSI’2022 competition; Surrogate-assisted optimization; Differential evolution; Numerical optimization
[vysledek_datum] => 2022-06-26T00:00:00+02:00
)
[14] => Array
(
[vysledek_id] => 178337
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 144874
[vysledek_rok] => 2022
[nazev] => Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition
[nazev_orig] => Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition
[duvernost_udaju_id] => S
[popis] => In this paper, a composite method for bound constrained optimization called Composite Evolutionary Strategy and Differential Evolution (CESDE) is described. This method combines two well-performing methods from the Congress on Evolutionary Computation Competitions. Through numerical investigation on the ICSI’2022 benchmark set, the favourite scheme for combining the two methods was determined, and it was found that CESDE outperforms both of its “parental” methods on all studied instances.
[popis_orig] => In this paper, a composite method for bound constrained optimization called Composite Evolutionary Strategy and Differential Evolution (CESDE) is described. This method combines two well-performing methods from the Congress on Evolutionary Computation Competitions. Through numerical investigation on the ICSI’2022 benchmark set, the favourite scheme for combining the two methods was determined, and it was found that CESDE outperforms both of its “parental” methods on all studied instances.
[klicova_slova] => ICSI’2022 competition; Evolutionary strategy; Differential evolution; Numerical optimization; Composite method
[klicova_slova_orig] => ICSI’2022 competition; Evolutionary strategy; Differential evolution; Numerical optimization; Composite method
[url] => https://link.springer.com/chapter/10.1007/978-3-031-09726-3_39
[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] => 125766
[schvaleno] => 2022-11-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.; NEVORAL, T.; HOLOUBEK, T.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1007/978-3-031-09726-3_39
[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-3-031-09726-3
[identifikator_popis] => ISBN - Advances in Swarm Intelligence. ICSI 2022, Part II. Lecture Notes in Computer Science, vol 13345.
[riv_dodavka_id] => 3026
[riv_dodavka_oznaceni] => RIV22-MSM-26210___
[riv_dodavka_rok] => 2022
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => KŮDELA, J.; NEVORAL, T.; HOLOUBEK, T. Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition. In Advances in Swarm Intelligence. ICSI 2022, Part II. Lecture Notes in Computer Science, vol 13345. Springer, Cham, 2022. p. 432-439. ISBN: 978-3-031-09726-3.
[citace_html] => KŮDELA, J.; NEVORAL, T.; HOLOUBEK, T. Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition. In Advances in Swarm Intelligence. ICSI 2022, Part II. Lecture Notes in Computer Science, vol 13345. Springer, Cham, 2022. p. 432-439. ISBN: 978-3-031-09726-3.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT178337,
author="Jakub {Kůdela} and Tomáš {Nevoral} and Tomáš {Holoubek}",
title="Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition",
booktitle="Advances in Swarm Intelligence. ICSI 2022, Part II. Lecture Notes in Computer Science, vol 13345.",
year="2022",
publisher="Springer, Cham",
pages="432--439",
doi="10.1007/978-3-031-09726-3\{_}39",
isbn="978-3-031-09726-3",
url="https://link.springer.com/chapter/10.1007/978-3-031-09726-3_39"
}
[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] => 1
[incites_open_access] => 0
[incites_jnci] => 0.19
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 0.2213
[incites_avg_percentile] => 37.14745
[scival_citations_count] => 1
[scival_fwci] => 0.592852
[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] => Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition
[popis_en] => In this paper, a composite method for bound constrained optimization called Composite Evolutionary Strategy and Differential Evolution (CESDE) is described. This method combines two well-performing methods from the Congress on Evolutionary Computation Competitions. Through numerical investigation on the ICSI’2022 benchmark set, the favourite scheme for combining the two methods was determined, and it was found that CESDE outperforms both of its “parental” methods on all studied instances.
[klicova_slova_en] => ICSI’2022 competition; Evolutionary strategy; Differential evolution; Numerical optimization; Composite method
[vysledek_datum] => 2022-06-26T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 129
[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] => PARÁK, R.; MATOUŠEK, R.; LACKO, B.
[title] => I4C – Robotická buňka podle konceptu Průmyslu 4.0
[typ] => PV
[year] => 2021
[id_vav] => 172864
)
[1] => Array
(
[quotations] =>
[title] => 2021 IEEE Congress on Evolutionary Computation (CEC)
[typ] => EV
[year] => 2021
[id_vav] => 173266
)
[2] => Array
(
[quotations] => KŮDELA, J.
[title] => Novel Zigzag-based Benchmark Functions for Bound Constrained Single Objective Optimization
[typ] => PV
[year] => 2021
[id_vav] => 175647
)
[3] => Array
(
[quotations] => MATOUŠEK, R.; DOBROVSKÝ, L.; KŮDELA, J.
[title] => How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem
[typ] => PV
[year] => 2021
[id_vav] => 175648
)
[4] => Array
(
[quotations] => POLZER, A.; MOURALOVÁ, K.; BENEŠ, L.; ZAHRADNÍČEK, R.; FRIES, J.
[title] => Comparison of machinability of nickel alloys using WEDM
[typ] => PV
[year] => 2022
[id_vav] => 175669
)
[5] => Array
(
[quotations] => PLUSKAL, J.; ŠOMPLÁK, R.; KŮDELA, J.
[title] => Novel Approaches for Transport Infrastructure Reduction to Effective Optimisation of Flow Tasks
[typ] => PV
[year] => 2021
[id_vav] => 175928
)
[6] => Array
(
[quotations] => KŮDELA, J.; MATOUŠEK, R.
[title] => New Benchmark Functions for Single-Objective Optimization Based on a Zigzag Pattern
[typ] => PV
[year] => 2022
[id_vav] => 176022
)
[7] => Array
(
[quotations] => BRÁZDA, V.; HAVLÍK, J.; KOLOMAZNÍK, J.; TRENZ, O.; ŠŤASTNÝ, J.
[title] => R-Loop Tracker: Web Access-Based Tool for R-Loop Detection and Analysis in Genomic DNA Sequences
[typ] => PV
[year] => 2021
[id_vav] => 176636
)
[8] => Array
(
[quotations] => MUNKOVÁ, D.; MUNK, M.; BENKO, L.; ŠŤASTNÝ, J.
[title] => MT Evaluation in the Context of Language Complexity
[typ] => PV
[year] => 2022
[id_vav] => 176667
)
[9] => Array
(
[quotations] => PLUSKAL, J.; ŠOMPLÁK, R.; KŮDELA, J.
[title] => Design of Transport Infrastructure with Respect to the Specific Features of Case Study
[typ] => PV
[year] => 2021
[id_vav] => 176680
)
[10] => Array
(
[quotations] => ŠKRABÁNEK, P.; DOLEŽEL, P.; MATOUŠEK, R.
[title] => RGB images-driven recognition of grapevine varieties using a densely connected convolutional network
[typ] => PV
[year] => 2022
[id_vav] => 176693
)
[11] => Array
(
[quotations] => MOURALOVÁ, K.; BEDNÁŘ, J.; BENEŠ, L.; PLICHTA, T.; PROKEŠ, T.; FRIES, J.
[title] => Production of precision slots in copper foil using micro EDM
[typ] => PV
[year] => 2022
[id_vav] => 177360
)
[12] => Array
(
[quotations] => MOURALOVÁ, K.; MICHNA, S; ZAHRADNÍČEK, R.; BEDNÁŘ, J.; PLICHTA, T.; FRIES, J.
[title] => Experimental analysis of microhardness changes of subsurface areas affected by WEDM
[typ] => PV
[year] => 2022
[id_vav] => 177513
)
[13] => Array
(
[quotations] => KŮDELA, J.; HOLOUBEK, T.; NEVORAL, T.
[title] => Surrogate-Assisted Differential Evolution-Based Method for the ICSI’2022 Competition
[typ] => PV
[year] => 2022
[id_vav] => 178336
)
[14] => Array
(
[quotations] => KŮDELA, J.; NEVORAL, T.; HOLOUBEK, T.
[title] => Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition
[typ] => PV
[year] => 2022
[id_vav] => 178337
)
)
)