Array
(
[page] => 131
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 179075
[vysledek_druh_id] => TECHNOV
[ex_vysledek_id] => 36342
[vysledek_rok] => 2022
[nazev] => openTube2
[nazev_orig] => openTube2
[duvernost_udaju_id] => S
[popis] => ověřená technologie systému openTube2 v ostrém provozu laboratoře CMBG IHOK FN Brno při manipulaci se vzorky covid-19
[popis_orig] => ověřená technologie systému openTube2 v ostrém provozu laboratoře CMBG IHOK FN Brno při manipulaci se vzorky covid-19
[klicova_slova] => laboratoř, automatizace, robotika, informatika, covid-19
[klicova_slova_orig] => laboratoř, automatizace, robotika, informatika, covid-19
[url] => https://opentube.fme.vutbr.cz/
[oecd_obor_id] => 30502
[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] => 2023-02-15
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MATOUŠEK, R.; DOBROVSKÝ, L.; LENGEROVÁ, M.; PARÁK, R.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Aplikované výsledky
[druh_nazev] => Ověřená technologie
[druh_popis] => Ověřená technologie
[stav] => Schválený
[vysledek_kategorie_id] => AV
[vysledek_system_kategorie_id] => PD
[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] => 2984
[riv_dodavka_oznaceni] => RIV23-MPO-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => MATOUŠEK, R.; DOBROVSKÝ, L.; LENGEROVÁ, M.; PARÁK, R.: openTube2. URL: https://opentube.fme.vutbr.cz/. (Ověřená technologie)
[citace_html] => MATOUŠEK, R.; DOBROVSKÝ, L.; LENGEROVÁ, M.; PARÁK, R.: openTube2. URL: https://opentube.fme.vutbr.cz/. (Ověřená technologie)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT179075,
author="Radomil {Matoušek} and Ladislav {Dobrovský} and Martina {Lengerová} and Roman {Parák}",
title="openTube2",
year="2022",
url="https://opentube.fme.vutbr.cz/",
note="Verified technology"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 30000
[oecd_tree_oblast_nazev] => 3. Medical and Health Sciences
[oecd_tree_obor_id] => 30500
[oecd_tree_obor_nazev] => 3.5 Other medical sciences
[oecd_tree_podobor_id] => 30502
[oecd_tree_podobor_nazev] => Other medical science
[poznamka_metriky] =>
[nazev_en] => openTube2
[popis_en] => ověřená technologie systému openTube2 v ostrém provozu laboratoře CMBG IHOK FN Brno při manipulaci se vzorky covid-19
[klicova_slova_en] => laboratoř, automatizace, robotika, informatika, covid-19
[vysledek_datum] => 2022-03-01T00:00:00+01:00
)
[1] => Array
(
[vysledek_id] => 179504
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 145845
[vysledek_rok] => 2023
[nazev] => Combining Lipschitz and RBF Surrogate Models for High-dimensional Computationally Expensive Problems
[nazev_orig] => Combining Lipschitz and RBF Surrogate Models for High-dimensional Computationally Expensive Problems
[duvernost_udaju_id] => S
[popis] => Standard evolutionary optimization algorithms assume that the evaluation of the objective and constraint functions is straightforward and computationally cheap. However, in many real-world optimization problems, these evaluations involve computationally expensive numerical simulations or physical experiments. Surrogate-assisted evolutionary algorithms (SAEAs) have recently gained increased attention for their performance in solving these types of problems. The main idea of SAEAs is the integration of an evolutionary algorithm with a selected surrogate model that approximates the computationally expensive function. In this paper, we propose a surrogate model based on a Lipschitz underestimation and use it to develop a differential evolution-based algorithm. The algorithm, called Lipschitz Surrogate-assisted Differential Evolution (LSADE), utilizes the Lipschitz-based surrogate model, along with a standard radial basis function surrogate model and a local search procedure. The experimental results on seven benchmark functions of dimensions 30, 50, 100, and 200 show that the proposed LSADE algorithm is competitive compared with the state-of-the-art algorithms under a limited computational budget, being especially effective for the very complicated benchmark functions in high dimensions.
[popis_orig] => Standard evolutionary optimization algorithms assume that the evaluation of the objective and constraint functions is straightforward and computationally cheap. However, in many real-world optimization problems, these evaluations involve computationally expensive numerical simulations or physical experiments. Surrogate-assisted evolutionary algorithms (SAEAs) have recently gained increased attention for their performance in solving these types of problems. The main idea of SAEAs is the integration of an evolutionary algorithm with a selected surrogate model that approximates the computationally expensive function. In this paper, we propose a surrogate model based on a Lipschitz underestimation and use it to develop a differential evolution-based algorithm. The algorithm, called Lipschitz Surrogate-assisted Differential Evolution (LSADE), utilizes the Lipschitz-based surrogate model, along with a standard radial basis function surrogate model and a local search procedure. The experimental results on seven benchmark functions of dimensions 30, 50, 100, and 200 show that the proposed LSADE algorithm is competitive compared with the state-of-the-art algorithms under a limited computational budget, being especially effective for the very complicated benchmark functions in high dimensions.
[klicova_slova] => Lipschitz surrogate model; Differential evolution; Radial basis function; Surrogate assisted evolutionary algorithms; High-dimensional expensive optimization
[klicova_slova_orig] => Lipschitz surrogate model; Differential evolution; Radial basis function; Surrogate assisted evolutionary algorithms; High-dimensional expensive optimization
[url] => https://www.sciencedirect.com/science/article/pii/S0020025522013342
[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] => 254501
[schvaleno] => 2025-07-01
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.; MATOUŠEK, R.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1016/j.ins.2022.11.045
[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 0020-0255
[identifikator_popis] => ISSN - INFORMATION SCIENCES (US)
[riv_dodavka_id] => 2990
[riv_dodavka_oznaceni] => RIV23-MSM-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 3
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 2
[citace_text] => KŮDELA, J.; MATOUŠEK, R. Combining Lipschitz and RBF Surrogate Models for High-dimensional Computationally Expensive Problems. INFORMATION SCIENCES, 2023, vol. 619, no. January, p. 457-477. ISSN: 0020-0255.
[citace_html] => KŮDELA, J.; MATOUŠEK, R. Combining Lipschitz and RBF Surrogate Models for High-dimensional Computationally Expensive Problems. INFORMATION SCIENCES, 2023, vol. 619, no. January, p. 457-477. ISSN: 0020-0255.
[citace_rtf] =>
[citace_bibtex] => @article{BUT179504,
author="Jakub {Kůdela} and Radomil {Matoušek}",
title="Combining Lipschitz and RBF Surrogate Models for High-dimensional Computationally Expensive Problems",
journal="INFORMATION SCIENCES",
year="2023",
volume="619",
number="January",
pages="457--477",
doi="10.1016/j.ins.2022.11.045",
issn="0020-0255",
url="https://www.sciencedirect.com/science/article/pii/S0020025522013342"
}
[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] => 1.399
[ais_m17_q] => 1
[ais_m25_q] => 1
[ais_m17_d] => 2
[ais_m25_d] => 2
[ais_m17_percentil] => 83.818
[ais_m25_percentil] => 87.09
[jci] => 2.09
[jci_q] => 1
[jci_percentil] => 93.426
[ef] =>
[scopus_sjr] => 2.238
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 25
[incites_open_access] => 1
[incites_jnci] => 1.42
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 2.5885
[incites_avg_percentile] => 91.3243
[scival_citations_count] => 23
[scival_fwci] => 0.793235
[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] => Combining Lipschitz and RBF Surrogate Models for High-dimensional Computationally Expensive Problems
[popis_en] => Standard evolutionary optimization algorithms assume that the evaluation of the objective and constraint functions is straightforward and computationally cheap. However, in many real-world optimization problems, these evaluations involve computationally expensive numerical simulations or physical experiments. Surrogate-assisted evolutionary algorithms (SAEAs) have recently gained increased attention for their performance in solving these types of problems. The main idea of SAEAs is the integration of an evolutionary algorithm with a selected surrogate model that approximates the computationally expensive function. In this paper, we propose a surrogate model based on a Lipschitz underestimation and use it to develop a differential evolution-based algorithm. The algorithm, called Lipschitz Surrogate-assisted Differential Evolution (LSADE), utilizes the Lipschitz-based surrogate model, along with a standard radial basis function surrogate model and a local search procedure. The experimental results on seven benchmark functions of dimensions 30, 50, 100, and 200 show that the proposed LSADE algorithm is competitive compared with the state-of-the-art algorithms under a limited computational budget, being especially effective for the very complicated benchmark functions in high dimensions.
[klicova_slova_en] => Lipschitz surrogate model; Differential evolution; Radial basis function; Surrogate assisted evolutionary algorithms; High-dimensional expensive optimization
[vysledek_datum] => 2023-01-01T00:00:00+01:00
)
[2] => Array
(
[vysledek_id] => 179505
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 145846
[vysledek_rok] => 2022
[nazev] => A critical problem in benchmarking and analysis of evolutionary computation methods
[nazev_orig] => A critical problem in benchmarking and analysis of evolutionary computation methods
[duvernost_udaju_id] => S
[popis] => Benchmarking constitutes a cornerstone in the analysis and development of computational methods. Especially in the field of evolutionary computation, where theoretical analysis of the algorithms is almost impossible, benchmarking is at the center of attention. In this text, we show that some of the frequently used benchmark functions that have their respective optima in the center of the feasible set pose a critical problem for the analysis of evolutionary computation methods. We carry out the analysis of seven recent methods, published in respected journals, which contain a center-bias operator that lets them find these optima with ease. This makes their comparison with other methods (that do not have a center-bias) meaningless on such types of problems. We perform a computational comparison of these methods with two of the oldest methods in evolutionary computation on shifted problems and on more advanced benchmark problems. The results show a serious problem, as only one of the seven methods performed consistently better than the pair of old methods, three performed on par, two performed very badly, and the worst one performed barely better than a random search. We also give several suggestions that could help to resolve the presented issues.
[popis_orig] => Benchmarking constitutes a cornerstone in the analysis and development of computational methods. Especially in the field of evolutionary computation, where theoretical analysis of the algorithms is almost impossible, benchmarking is at the center of attention. In this text, we show that some of the frequently used benchmark functions that have their respective optima in the center of the feasible set pose a critical problem for the analysis of evolutionary computation methods. We carry out the analysis of seven recent methods, published in respected journals, which contain a center-bias operator that lets them find these optima with ease. This makes their comparison with other methods (that do not have a center-bias) meaningless on such types of problems. We perform a computational comparison of these methods with two of the oldest methods in evolutionary computation on shifted problems and on more advanced benchmark problems. The results show a serious problem, as only one of the seven methods performed consistently better than the pair of old methods, three performed on par, two performed very badly, and the worst one performed barely better than a random search. We also give several suggestions that could help to resolve the presented issues.
[klicova_slova] => Evolutionary computation; Metaheuristics; Benchmarking; Zero-bias
[klicova_slova_orig] => Evolutionary computation; Metaheuristics; Benchmarking; Zero-bias
[url] => https://www.nature.com/articles/s42256-022-00579-0
[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] => 2023-01-12
[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.1038/s42256-022-00579-0
[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] =>
[identifikator_popis] =>
[riv_dodavka_id] => 2990
[riv_dodavka_oznaceni] => RIV23-MSM-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => KŮDELA, J. A critical problem in benchmarking and analysis of evolutionary computation methods. Nature Machine Intelligence, 2022, no. 4, p. 1238-1245. ISSN: 2522-5839.
[citace_html] => KŮDELA, J. A critical problem in benchmarking and analysis of evolutionary computation methods. Nature Machine Intelligence, 2022, no. 4, p. 1238-1245. ISSN: 2522-5839.
[citace_rtf] =>
[citace_bibtex] => @article{BUT179505,
author="Jakub {Kůdela}",
title="A critical problem in benchmarking and analysis of evolutionary computation methods",
journal="Nature Machine Intelligence",
year="2022",
number="4",
pages="1238--1245",
doi="10.1038/s42256-022-00579-0",
url="https://www.nature.com/articles/s42256-022-00579-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 23.8
[if_q] => 1
[if_m17_q] => 1
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 1
[if_m25_d] => 1
[if_percentil] => 99.7
[if_m17_percentil] => 99.713
[if_m25_percentil] => 99.53
[ais] => 8.959
[ais_m17_q] => 1
[ais_m25_q] => 1
[ais_m17_d] => 1
[ais_m25_d] => 1
[ais_m17_percentil] => 99.71
[ais_m25_percentil] => 99.652
[jci] => 3.97
[jci_q] => 1
[jci_percentil] => 99.693
[ef] =>
[scopus_sjr] => 6.21
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 33
[incites_open_access] => 0
[incites_jnci] => 0.6
[incites_is_int_collab] => 0
[incites_is_industry_collab] => 0
[incites_esi_hot_paper] => 0
[incites_esi_highly_cited_paper] => 0
[incites_avg_cnci] => 2.424
[incites_avg_percentile] => 90.76865
[scival_citations_count] => 42
[scival_fwci] => 2.196815
[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] => A critical problem in benchmarking and analysis of evolutionary computation methods
[popis_en] => Benchmarking constitutes a cornerstone in the analysis and development of computational methods. Especially in the field of evolutionary computation, where theoretical analysis of the algorithms is almost impossible, benchmarking is at the center of attention. In this text, we show that some of the frequently used benchmark functions that have their respective optima in the center of the feasible set pose a critical problem for the analysis of evolutionary computation methods. We carry out the analysis of seven recent methods, published in respected journals, which contain a center-bias operator that lets them find these optima with ease. This makes their comparison with other methods (that do not have a center-bias) meaningless on such types of problems. We perform a computational comparison of these methods with two of the oldest methods in evolutionary computation on shifted problems and on more advanced benchmark problems. The results show a serious problem, as only one of the seven methods performed consistently better than the pair of old methods, three performed on par, two performed very badly, and the worst one performed barely better than a random search. We also give several suggestions that could help to resolve the presented issues.
[klicova_slova_en] => Evolutionary computation; Metaheuristics; Benchmarking; Zero-bias
[vysledek_datum] => 2022-12-12T00:00:00+01:00
)
[3] => Array
(
[vysledek_id] => 179566
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 145892
[vysledek_rok] => 2022
[nazev] => The Assignment Problem and Its Relation to Logistics Problems
[nazev_orig] => The Assignment Problem and Its Relation to Logistics Problems
[duvernost_udaju_id] => S
[popis] => The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution and scheduling problems. Showing such correlations is one of the aims of this paper. Some of the derived problems having exponential time complexity, the question arises of their solvability for larger instances. Instead of the traditional approach based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of mixed integer programming models in the GAMS environment, which is now capable of solving instances much larger than in the past and does not require complex parameter settings or statistical evaluation of the results as in the case of stochastic heuristics because the computational core of software tools, nested in GAMS, is deterministic in nature. The source codes presented may be an aid, because this tool is not yet as well known as the MATLAB Optimisation Toolbox. Benchmarks of the permutation flow shop scheduling problem with informally derived MIP model and the travelling salesman problem are used to present the limits of the software’s applicability.
[popis_orig] => The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution and scheduling problems. Showing such correlations is one of the aims of this paper. Some of the derived problems having exponential time complexity, the question arises of their solvability for larger instances. Instead of the traditional approach based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of mixed integer programming models in the GAMS environment, which is now capable of solving instances much larger than in the past and does not require complex parameter settings or statistical evaluation of the results as in the case of stochastic heuristics because the computational core of software tools, nested in GAMS, is deterministic in nature. The source codes presented may be an aid, because this tool is not yet as well known as the MATLAB Optimisation Toolbox. Benchmarks of the permutation flow shop scheduling problem with informally derived MIP model and the travelling salesman problem are used to present the limits of the software’s applicability.
[klicova_slova] => assignment problem; travelling salesman problem; vehicle routing problem; flow shop scheduling problem; GAMS, genetic algorithm
[klicova_slova_orig] => assignment problem; travelling salesman problem; vehicle routing problem; flow shop scheduling problem; GAMS, genetic algorithm
[url] => https://www.mdpi.com/1999-4893/15/10/377
[oecd_obor_id] => 10102
[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-12-06
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 125316
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.3390/a15100377
[kod_dspace] => 11012/208586
[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] =>
[identifikator_popis] =>
[riv_dodavka_id] => 2990
[riv_dodavka_oznaceni] => RIV23-MSM-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 3
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 2
[citace_text] => ŠEDA, M. The Assignment Problem and Its Relation to Logistics Problems. Algorithms, 2022, vol. 15, no. 10, p. 1-27. ISSN: 1999-4893.
[citace_html] => ŠEDA, M. The Assignment Problem and Its Relation to Logistics Problems. Algorithms, 2022, vol. 15, no. 10, p. 1-27. ISSN: 1999-4893.
[citace_rtf] =>
[citace_bibtex] => @article{BUT179566,
author="Miloš {Šeda}",
title="The Assignment Problem and Its Relation to Logistics Problems",
journal="Algorithms",
year="2022",
volume="15",
number="10",
pages="1--27",
doi="10.3390/a15100377",
url="https://www.mdpi.com/1999-4893/15/10/377"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.3
[if_q] =>
[if_m17_q] =>
[if_m25_q] => 3
[if_d] =>
[if_m17_d] =>
[if_m25_d] => 6
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] => 48.121
[ais] => 0.399
[ais_m17_q] =>
[ais_m25_q] => 3
[ais_m17_d] =>
[ais_m25_d] => 7
[ais_m17_percentil] =>
[ais_m25_percentil] => 38.595
[jci] => 0.44
[jci_q] => 3
[jci_percentil] => 46.181
[ef] =>
[scopus_sjr] => 0.497
[scopus_sjr_q] => 2
[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] => 4
[scival_fwci] => 2.148639
[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] => The Assignment Problem and Its Relation to Logistics Problems
[popis_en] => The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution and scheduling problems. Showing such correlations is one of the aims of this paper. Some of the derived problems having exponential time complexity, the question arises of their solvability for larger instances. Instead of the traditional approach based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of mixed integer programming models in the GAMS environment, which is now capable of solving instances much larger than in the past and does not require complex parameter settings or statistical evaluation of the results as in the case of stochastic heuristics because the computational core of software tools, nested in GAMS, is deterministic in nature. The source codes presented may be an aid, because this tool is not yet as well known as the MATLAB Optimisation Toolbox. Benchmarks of the permutation flow shop scheduling problem with informally derived MIP model and the travelling salesman problem are used to present the limits of the software’s applicability.
[klicova_slova_en] => assignment problem; travelling salesman problem; vehicle routing problem; flow shop scheduling problem; GAMS, genetic algorithm
[vysledek_datum] => 2022-10-16T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 179674
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 145990
[vysledek_rok] => 2022
[nazev] => High predation risk decimates survival during the reproduction season
[nazev_orig] => High predation risk decimates survival during the reproduction season
[duvernost_udaju_id] => S
[popis] => Predators attack conspicuous prey phenotypes that are present in the environment. Male display behavior of conspicuous nuptial coloration becomes risky in the presence of a predator, and adult males face higher predation risk. High predation risk in one sex will lead to low survival and sex ratio bias in adult cohorts, unless the increased predation risk is compensated by higher escape rate. Here, we tested the hypothesis that sand lizards (Lacerta agilis) have sex-specific predation risk and escape rate. We expected the differences to manifest in changes in sex ratio with age, differences in frequency of tail autotomy, and in sex-specific survival rate. We developed a statistical model to estimate predation risk and escape rate, combining the observed sex ratio and frequency of tail autotomy with likelihood-based survival rate. Using Bayesian framework, we estimated the model parameters. We projected the date of the tail autotomy events from growth rates derived from capture-recapture data measurements. We found statistically stable sex ratio in age groups, equal frequency of tail regenerates between sexes, and similar survival rate. Predation risk is similar between sexes, and escape rate increases survival by about 5%. We found low survival rate and a low number of tail autotomy events in females during months when sand lizards mate and lay eggs, indicating high predator pressure throughout reproduction. Our data show that gravid females fail to escape predation. The risks of reproduction season in an ectotherm are a convolution of morphological changes (conspicuous coloration in males and body allometry changes in gravid females), behavior (nuptial displays), and environmental conditions which challenge lizard thermal performance. Performance of endotherm predators in cold spring months endangers gravid females more than displaying males in bright nuptial coloration.
[popis_orig] => Predators attack conspicuous prey phenotypes that are present in the environment. Male display behavior of conspicuous nuptial coloration becomes risky in the presence of a predator, and adult males face higher predation risk. High predation risk in one sex will lead to low survival and sex ratio bias in adult cohorts, unless the increased predation risk is compensated by higher escape rate. Here, we tested the hypothesis that sand lizards (Lacerta agilis) have sex-specific predation risk and escape rate. We expected the differences to manifest in changes in sex ratio with age, differences in frequency of tail autotomy, and in sex-specific survival rate. We developed a statistical model to estimate predation risk and escape rate, combining the observed sex ratio and frequency of tail autotomy with likelihood-based survival rate. Using Bayesian framework, we estimated the model parameters. We projected the date of the tail autotomy events from growth rates derived from capture-recapture data measurements. We found statistically stable sex ratio in age groups, equal frequency of tail regenerates between sexes, and similar survival rate. Predation risk is similar between sexes, and escape rate increases survival by about 5%. We found low survival rate and a low number of tail autotomy events in females during months when sand lizards mate and lay eggs, indicating high predator pressure throughout reproduction. Our data show that gravid females fail to escape predation. The risks of reproduction season in an ectotherm are a convolution of morphological changes (conspicuous coloration in males and body allometry changes in gravid females), behavior (nuptial displays), and environmental conditions which challenge lizard thermal performance. Performance of endotherm predators in cold spring months endangers gravid females more than displaying males in bright nuptial coloration.
[klicova_slova] => caudal autotomy; CJS model; escape rate; predation risk; predator pressure; reptile
[klicova_slova_orig] => caudal autotomy; CJS model; escape rate; predation risk; predator pressure; reptile
[url] => https://onlinelibrary.wiley.com/doi/full/10.1002/ece3.9407
[oecd_obor_id] => 10600
[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] => 2023-02-01
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 125314
[posledni_diagnostika] =>
[vycet_osob] => SMOLINSKY, R.; HIADLOVSKÁ, Z.; MARŠALA, Š.; ŠKRABÁNEK, P.; ŠKROBÁNEK, M.; MARTÍNKOVÁ, N.
[pocet_tvurcu] => 6
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1002/ece3.9407
[kod_dspace] => 11012/208587
[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-7758
[identifikator_popis] => ISSN - Ecology and Evolution (US)
[riv_dodavka_id] => 2990
[riv_dodavka_oznaceni] => RIV23-MSM-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => SMOLINSKY, R.; HIADLOVSKÁ, Z.; MARŠALA, Š.; ŠKRABÁNEK, P.; ŠKROBÁNEK, M.; MARTÍNKOVÁ, N. High predation risk decimates survival during the reproduction season. Ecology and Evolution, 2022, vol. 12, no. 10, p. 1-12. ISSN: 2045-7758.
[citace_html] => SMOLINSKY, R.; HIADLOVSKÁ, Z.; MARŠALA, Š.; ŠKRABÁNEK, P.; ŠKROBÁNEK, M.; MARTÍNKOVÁ, N. High predation risk decimates survival during the reproduction season. Ecology and Evolution, 2022, vol. 12, no. 10, p. 1-12. ISSN: 2045-7758.
[citace_rtf] =>
[citace_bibtex] => @article{BUT179674,
author="Radovan {Smolinsky} and Zuzana {Hiadlovská} and Štěpán {Maršala} and Pavel {Škrabánek} and Michal {Škrobánek} and Natália {Martínková}",
title="High predation risk decimates survival during the reproduction season",
journal="Ecology and Evolution",
year="2022",
volume="12",
number="10",
pages="1--12",
doi="10.1002/ece3.9407",
issn="2045-7758",
url="https://onlinelibrary.wiley.com/doi/full/10.1002/ece3.9407"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.6
[if_q] => 3
[if_m17_q] => 3
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 6
[if_m25_d] => 5
[if_percentil] => 50
[if_m17_percentil] => 49.681
[if_m25_percentil] => 51.7
[ais] => 0.777
[ais_m17_q] => 2
[ais_m25_q] => 2
[ais_m17_d] => 4
[ais_m25_d] => 4
[ais_m17_percentil] => 65.224
[ais_m25_percentil] => 66.479
[jci] => 0.69
[jci_q] => 2
[jci_percentil] => 53.947
[ef] =>
[scopus_sjr] => 0.918
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 3
[incites_open_access] => 1
[incites_jnci] => 0.5
[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.3447
[incites_avg_percentile] => 24.58545
[scival_citations_count] => 2
[scival_fwci] => 1.377088
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10600
[oecd_tree_obor_nazev] => 1.6 Biological sciences
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => High predation risk decimates survival during the reproduction season
[popis_en] => Predators attack conspicuous prey phenotypes that are present in the environment. Male display behavior of conspicuous nuptial coloration becomes risky in the presence of a predator, and adult males face higher predation risk. High predation risk in one sex will lead to low survival and sex ratio bias in adult cohorts, unless the increased predation risk is compensated by higher escape rate. Here, we tested the hypothesis that sand lizards (Lacerta agilis) have sex-specific predation risk and escape rate. We expected the differences to manifest in changes in sex ratio with age, differences in frequency of tail autotomy, and in sex-specific survival rate. We developed a statistical model to estimate predation risk and escape rate, combining the observed sex ratio and frequency of tail autotomy with likelihood-based survival rate. Using Bayesian framework, we estimated the model parameters. We projected the date of the tail autotomy events from growth rates derived from capture-recapture data measurements. We found statistically stable sex ratio in age groups, equal frequency of tail regenerates between sexes, and similar survival rate. Predation risk is similar between sexes, and escape rate increases survival by about 5%. We found low survival rate and a low number of tail autotomy events in females during months when sand lizards mate and lay eggs, indicating high predator pressure throughout reproduction. Our data show that gravid females fail to escape predation. The risks of reproduction season in an ectotherm are a convolution of morphological changes (conspicuous coloration in males and body allometry changes in gravid females), behavior (nuptial displays), and environmental conditions which challenge lizard thermal performance. Performance of endotherm predators in cold spring months endangers gravid females more than displaying males in bright nuptial coloration.
[klicova_slova_en] => caudal autotomy; CJS model; escape rate; predation risk; predator pressure; reptile
[vysledek_datum] => 2022-10-17T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 179804
[vysledek_druh_id] => ART
[ex_vysledek_id] => 146097
[vysledek_rok] => 2022
[nazev] => Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS
[nazev_orig] => Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS
[duvernost_udaju_id] => S
[popis] => The Steiner tree problem in graphs involves finding a minimum cost tree which connects a defined subset of the vertices. This problem generalises the minimum spanning tree problem, in contrast, it is NP-complete and is usually solved for large instances by deterministic or stochastic heuristic methods and approximate algorithms. In this paper, however, we focus on a different approach, based on the formulation of a mixed integer programming model and its modification for solving in the professional optimization tool GAMS, which is now capable of solving even large instances of problems of exponential complexity.
[popis_orig] => The Steiner tree problem in graphs involves finding a minimum cost tree which connects a defined subset of the vertices. This problem generalises the minimum spanning tree problem, in contrast, it is NP-complete and is usually solved for large instances by deterministic or stochastic heuristic methods and approximate algorithms. In this paper, however, we focus on a different approach, based on the formulation of a mixed integer programming model and its modification for solving in the professional optimization tool GAMS, which is now capable of solving even large instances of problems of exponential complexity.
[klicova_slova] => Steiner tree problem, NP-completeness, heuristic, performance ratio, network flow, mixed-integer linear programming, GAMS
[klicova_slova_orig] => Steiner tree problem, NP-completeness, heuristic, performance ratio, network flow, mixed-integer linear programming, GAMS
[url] => https://wseas.com/journals/computers/2022/a625105-028(2022).pdf
[oecd_obor_id] => 10102
[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] => 1421
[schvaleno] => 2022-11-02
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.37394/23205.2022.21.31
[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 1109-2750
[identifikator_popis] => ISSN - WSEAS Transactions on Computers (GR)
[riv_dodavka_id] => 2990
[riv_dodavka_oznaceni] => RIV23-MSM-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS. WSEAS Transactions on Computers, 2022, vol. 21, no. July, p. 257-262. ISSN: 1109-2750.
[citace_html] => ŠEDA, M. Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS. WSEAS Transactions on Computers, 2022, vol. 21, no. July, p. 257-262. ISSN: 1109-2750.
[citace_rtf] =>
[citace_bibtex] => @article{BUT179804,
author="Miloš {Šeda}",
title="Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS",
journal="WSEAS Transactions on Computers",
year="2022",
volume="21",
number="July",
pages="257--262",
doi="10.37394/23205.2022.21.31",
issn="1109-2750",
url="https://wseas.com/journals/computers/2022/a625105-028(2022).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] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10102
[oecd_tree_podobor_nazev] => Applied mathematics
[poznamka_metriky] =>
[nazev_en] => Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS
[popis_en] => The Steiner tree problem in graphs involves finding a minimum cost tree which connects a defined subset of the vertices. This problem generalises the minimum spanning tree problem, in contrast, it is NP-complete and is usually solved for large instances by deterministic or stochastic heuristic methods and approximate algorithms. In this paper, however, we focus on a different approach, based on the formulation of a mixed integer programming model and its modification for solving in the professional optimization tool GAMS, which is now capable of solving even large instances of problems of exponential complexity.
[klicova_slova_en] => Steiner tree problem, NP-completeness, heuristic, performance ratio, network flow, mixed-integer linear programming, GAMS
[vysledek_datum] => 2022-07-01T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 179862
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 146133
[vysledek_rok] => 2022
[nazev] => Analysis of the effect of material thickness during the WEDM processon cutting speed, topography and morphology
[nazev_orig] => Analysis of the effect of material thickness during the WEDM processon cutting speed, topography and morphology
[duvernost_udaju_id] => S
[popis] => Wire electrical discharge machining (WEDM) is an unconventional machining technology that is indispensable in many industries. Machining is performed using the thermoelectric principle, while it is possible to machine all at least minimally electrically conductive materials. Due to the wide range of applications of WEDM, it is necessary to ensure the appropriate quality of machined surfaces, regardless of the thickness of the machined materials, while maintaining an acceptable cutting speed. For this purpose, this study was performed to analyse the effect of material thickness on the cutting speed, morphology and topography of Ampcoloy 35 material. In this study, thicknesses from 5 to 160 mm were analysed in 5 mm increments with the same machine parameter settings. The surface topography and morphology were studied using electron and light microscopy, and cross-sections of the sample were created to examine the condition of the subsurface layer. It was found that the values of Ra at the edge ranged from 1.8 to 3.2 µm and in the middle of the sample from 1.7 to 3 µm, while the trend of increasing Ra with thickness is not visible. It is clear from the morphology analysis that a rugged surface with more craters was created at the edges than in the middle of the sample, while segregated lead needles were also formed at the edges of the samples.
[popis_orig] => Wire electrical discharge machining (WEDM) is an unconventional machining technology that is indispensable in many industries. Machining is performed using the thermoelectric principle, while it is possible to machine all at least minimally electrically conductive materials. Due to the wide range of applications of WEDM, it is necessary to ensure the appropriate quality of machined surfaces, regardless of the thickness of the machined materials, while maintaining an acceptable cutting speed. For this purpose, this study was performed to analyse the effect of material thickness on the cutting speed, morphology and topography of Ampcoloy 35 material. In this study, thicknesses from 5 to 160 mm were analysed in 5 mm increments with the same machine parameter settings. The surface topography and morphology were studied using electron and light microscopy, and cross-sections of the sample were created to examine the condition of the subsurface layer. It was found that the values of Ra at the edge ranged from 1.8 to 3.2 µm and in the middle of the sample from 1.7 to 3 µm, while the trend of increasing Ra with thickness is not visible. It is clear from the morphology analysis that a rugged surface with more craters was created at the edges than in the middle of the sample, while segregated lead needles were also formed at the edges of the samples.
[klicova_slova] => WEDM; electrical discharge machining; thickness; topography; morphology
[klicova_slova_orig] => WEDM; electrical discharge machining; thickness; topography; morphology
[url] => https://doi.org/10.1177/09544054221136516
[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-12-10
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MOURALOVÁ, K.; BENEŠ, L.; PROKEŠ, T.; BEDNÁŘ, J.; ZAHRADNÍČEK, R.; FRIES, J.
[pocet_tvurcu] => 6
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1177/09544054221136516
[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] => 2990
[riv_dodavka_oznaceni] => RIV23-MSM-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 4
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 3
[citace_text] => MOURALOVÁ, K.; BENEŠ, L.; PROKEŠ, T.; BEDNÁŘ, J.; ZAHRADNÍČEK, R.; FRIES, J. Analysis of the effect of material thickness during the WEDM processon cutting speed, topography and morphology. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2022, vol. 236, no. 15, p. 1-9. ISSN: 0954-4054.
[citace_html] => MOURALOVÁ, K.; BENEŠ, L.; PROKEŠ, T.; BEDNÁŘ, J.; ZAHRADNÍČEK, R.; FRIES, J. Analysis of the effect of material thickness during the WEDM processon cutting speed, topography and morphology. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2022, vol. 236, no. 15, p. 1-9. ISSN: 0954-4054.
[citace_rtf] =>
[citace_bibtex] => @article{BUT179862,
author="Kateřina {Mouralová} and Libor {Beneš} and Tomáš {Prokeš} and Josef {Bednář} and Radim {Zahradníček} and Jiří {Fries}",
title="Analysis of the effect of material thickness during the WEDM processon cutting speed, topography and morphology",
journal="PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE",
year="2022",
volume="236",
number="15",
pages="1--9",
doi="10.1177/09544054221136516",
issn="0954-4054",
url="https://doi.org/10.1177/09544054221136516"
}
[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] => 0
[incites_open_access] => 0
[incites_jnci] => 0
[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
[incites_avg_percentile] => 0
[scival_citations_count] =>
[scival_fwci] => 1.133261
[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] => Analysis of the effect of material thickness during the WEDM processon cutting speed, topography and morphology
[popis_en] => Wire electrical discharge machining (WEDM) is an unconventional machining technology that is indispensable in many industries. Machining is performed using the thermoelectric principle, while it is possible to machine all at least minimally electrically conductive materials. Due to the wide range of applications of WEDM, it is necessary to ensure the appropriate quality of machined surfaces, regardless of the thickness of the machined materials, while maintaining an acceptable cutting speed. For this purpose, this study was performed to analyse the effect of material thickness on the cutting speed, morphology and topography of Ampcoloy 35 material. In this study, thicknesses from 5 to 160 mm were analysed in 5 mm increments with the same machine parameter settings. The surface topography and morphology were studied using electron and light microscopy, and cross-sections of the sample were created to examine the condition of the subsurface layer. It was found that the values of Ra at the edge ranged from 1.8 to 3.2 µm and in the middle of the sample from 1.7 to 3 µm, while the trend of increasing Ra with thickness is not visible. It is clear from the morphology analysis that a rugged surface with more craters was created at the edges than in the middle of the sample, while segregated lead needles were also formed at the edges of the samples.
[klicova_slova_en] => WEDM; electrical discharge machining; thickness; topography; morphology
[vysledek_datum] => 2022-11-18T00:00:00+01:00
)
[7] => Array
(
[vysledek_id] => 179989
[vysledek_druh_id] => VZ
[ex_vysledek_id] => 36400
[vysledek_rok] => 2022
[nazev] => Část formy vyrobená užitím optimálního nastavení parametrů elektroerozivní drátové řezačky
[nazev_orig] => Část formy vyrobená užitím optimálního nastavení parametrů elektroerozivní drátové řezačky
[duvernost_udaju_id] => S
[popis] => Funkční vzorek bude uplatněn při reálné výrobě části formy pro vstřikování plastů z měděné slitiny Ampcoloy. Tento výstup představuje finální výstup v řešení projektu a bude implementován do praxe, přičemž přinese výrazné zlepšení v pracovní hygieně obsluze vstřikolisů, kterým nebudou uplívat výrobky ve formě, ale bude možné je snadno odstranit bez použití zdraví neprospěšných separačních sprejů. Dále jejich výroba dle optimálního nastavení parametrů elektroerozivní drátové řezačky přinese ekonomickou úsporu v důsledku snížení strojního času a spotřeby elektrické energie.
[popis_orig] => Funkční vzorek bude uplatněn při reálné výrobě části formy pro vstřikování plastů z měděné slitiny Ampcoloy. Tento výstup představuje finální výstup v řešení projektu a bude implementován do praxe, přičemž přinese výrazné zlepšení v pracovní hygieně obsluze vstřikolisů, kterým nebudou uplívat výrobky ve formě, ale bude možné je snadno odstranit bez použití zdraví neprospěšných separačních sprejů. Dále jejich výroba dle optimálního nastavení parametrů elektroerozivní drátové řezačky přinese ekonomickou úsporu v důsledku snížení strojního času a spotřeby elektrické energie.
[klicova_slova] => část formy; Ampcoloy; vstřikování plastů; elektroerozivní drátové řezání; snížení strojního času
[klicova_slova_orig] => část formy; Ampcoloy; vstřikování plastů; elektroerozivní drátové řezání; snížení strojního času
[url] =>
[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] => cs
[schvalil_id] => 85160
[schvaleno] => 2022-11-19
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 124825
[posledni_diagnostika] =>
[vycet_osob] => DVOŘÁK, J.;MOURALOVÁ, K.; BEDNÁŘ, J.; PROKEŠ, T.; ZAHRADNÍČEK, R.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Aplikované výsledky
[druh_nazev] => Funkční vzorek
[druh_popis] => Funkční vzorek
[stav] => Schválený
[vysledek_kategorie_id] => AV
[vysledek_system_kategorie_id] => PD
[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] => 3004
[riv_dodavka_oznaceni] => RIV23-TA0-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => DVOŘÁK, J.;MOURALOVÁ, K.; BEDNÁŘ, J.; PROKEŠ, T.; ZAHRADNÍČEK, R.: Část formy vyrobená užitím optimálního nastavení parametrů elektroerozivní drátové řezačky. (Funkční vzorek)
[citace_html] => DVOŘÁK, J.;MOURALOVÁ, K.; BEDNÁŘ, J.; PROKEŠ, T.; ZAHRADNÍČEK, R.: Část formy vyrobená užitím optimálního nastavení parametrů elektroerozivní drátové řezačky. (Funkční vzorek)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT179989,
author="Kateřina {Mouralová} and Josef {Bednář} and Tomáš {Prokeš} and Radim {Zahradníček}",
title="Část formy vyrobená užitím optimálního nastavení parametrů elektroerozivní drátové řezačky",
year="2022",
note="Functioning sample"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20300
[oecd_tree_obor_nazev] => 2.3 Mechanical engineering
[oecd_tree_podobor_id] => 20301
[oecd_tree_podobor_nazev] => Mechanical engineering
[poznamka_metriky] =>
[nazev_en] => Part of the mold made using the optimal settings of the parameters of the wire electrical discharge machining
[popis_en] => The functional sample will be applied during the actual production of a part of the Ampcoloy copper alloy plastic injection mold. This output represents the final output in the project solution and will be implemented in practice, bringing a significant improvement in the work hygiene of the injection molding operators, who will not spit on the products in the mold, but will be able to easily remove them without using unhealthy separating sprays. Furthermore, their production according to the optimal setting of the parameters of the wire electrical discharge machining will bring economic savings due to a reduction in machine time and electricity consumption.
[klicova_slova_en] => part of a mold; Ampcoloy; injection molding of plastics; wire electrical discharge machining; reduction of machining time
[vysledek_datum] => 2022-11-18T00:00:00+01:00
)
[8] => Array
(
[vysledek_id] => 180422
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 146558
[vysledek_rok] => 2022
[nazev] => Genome polarisation for detecting barriers to geneflow
[nazev_orig] => Genome polarisation for detecting barriers to geneflow
[duvernost_udaju_id] => S
[popis] => Semi-permeable barriers to geneflow in principle allow distantly related organisms to capture and exchange pre-adapted genes potentially speeding adaptation. However, describing barriers to geneflow on a genomic scale is non-trivial. We extend classic diagnostic allele counting measures of geneflow across a barrier to the case of genome-scale data. Diagnostic index expectation maximisation (diem) polarises the labelling of bistate markers with respect to the sides of a barrier. An initial state of ignorance is enforced by starting with randomly generated marker polarisations. This means there is no prior on population or taxon membership of the genomes concerned. Using a deterministic data labelling, small numbers of classic diagnostic markers can be replaced by large numbers of markers, each with a diagnostic index. Individuals' hybrid indices (genome admixture proportions) are then calculated genome wide conditioned on marker diagnosticity; within diploid, haplodiploid and/or haploid genome compartments; or indeed over any subset of markers, allowing classical cline width/barrier strength comparisons along genomes. Along-genome barrier strength heterogeneity allows for barrier regions to be identified. Furthermore, blocks of genetic material that have introgressed across a barrier are easily identified with high power. diem indicates panmixis among Myotis myotis bat genomes, with a barrier separating low data quality outliers. In a Mus musculus domesticus/Mus spretus system, diem adds multiple introgressions of olfactory (and vomeronasal) gene clusters in one direction to previous demonstrations of a pesticide resistance gene introgressing in the opposite direction across a strong species barrier. diem is a genome analysis solution, which scales over reduced representation genomics of thousands of markers to treatment of all variant sites in large genomes. While the method lends itself to visualisation, its output of markers with barrier-informative annotation will fuel research in population genetics, phylogenetics and association studies. diem can equip such downstream applications with millions of informative markers.
[popis_orig] => Semi-permeable barriers to geneflow in principle allow distantly related organisms to capture and exchange pre-adapted genes potentially speeding adaptation. However, describing barriers to geneflow on a genomic scale is non-trivial. We extend classic diagnostic allele counting measures of geneflow across a barrier to the case of genome-scale data. Diagnostic index expectation maximisation (diem) polarises the labelling of bistate markers with respect to the sides of a barrier. An initial state of ignorance is enforced by starting with randomly generated marker polarisations. This means there is no prior on population or taxon membership of the genomes concerned. Using a deterministic data labelling, small numbers of classic diagnostic markers can be replaced by large numbers of markers, each with a diagnostic index. Individuals' hybrid indices (genome admixture proportions) are then calculated genome wide conditioned on marker diagnosticity; within diploid, haplodiploid and/or haploid genome compartments; or indeed over any subset of markers, allowing classical cline width/barrier strength comparisons along genomes. Along-genome barrier strength heterogeneity allows for barrier regions to be identified. Furthermore, blocks of genetic material that have introgressed across a barrier are easily identified with high power. diem indicates panmixis among Myotis myotis bat genomes, with a barrier separating low data quality outliers. In a Mus musculus domesticus/Mus spretus system, diem adds multiple introgressions of olfactory (and vomeronasal) gene clusters in one direction to previous demonstrations of a pesticide resistance gene introgressing in the opposite direction across a strong species barrier. diem is a genome analysis solution, which scales over reduced representation genomics of thousands of markers to treatment of all variant sites in large genomes. While the method lends itself to visualisation, its output of markers with barrier-informative annotation will fuel research in population genetics, phylogenetics and association studies. diem can equip such downstream applications with millions of informative markers.
[klicova_slova] => gene capture; geneflow; genome admixture; genome polarisation; hybrid zone; hybridisation; introgression; reduced representation genomics
[klicova_slova_orig] => gene capture; geneflow; genome admixture; genome polarisation; hybrid zone; hybridisation; introgression; reduced representation genomics
[url] => https://besjournals.onlinelibrary.wiley.com/doi/full/10.1111/2041-210X.14010
[oecd_obor_id] => 10600
[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] => 2023-02-01
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => BAIRD, S.; PETRUŽELA, J.; IZAR, J.; ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1111/2041-210X.14010
[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 2041-210X
[identifikator_popis] => ISSN - Methods in Ecology and Evolution (GB)
[riv_dodavka_id] => 2990
[riv_dodavka_oznaceni] => RIV23-MSM-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 3
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 3
[citace_text] => BAIRD, S.; PETRUŽELA, J.; IZAR, J.; ŠKRABÁNEK, P.; MARTÍNKOVÁ, N. Genome polarisation for detecting barriers to geneflow. Methods in Ecology and Evolution, 2022, vol. n/a, no. n/a, p. 1-17. ISSN: 2041-210X.
[citace_html] => BAIRD, S.; PETRUŽELA, J.; IZAR, J.; ŠKRABÁNEK, P.; MARTÍNKOVÁ, N. Genome polarisation for detecting barriers to geneflow. Methods in Ecology and Evolution, 2022, vol. n/a, no. n/a, p. 1-17. ISSN: 2041-210X.
[citace_rtf] =>
[citace_bibtex] => @article{BUT180422,
author="Stuart J. E. {Baird} and Jan {Petružela} and Jaroň {Izar} and Pavel {Škrabánek} and Natália {Martínková}",
title="Genome polarisation for detecting barriers to geneflow",
journal="Methods in Ecology and Evolution",
year="2022",
volume="n/a",
number="n/a",
pages="1--17",
doi="10.1111/2041-210X.14010",
issn="2041-210X",
url="https://besjournals.onlinelibrary.wiley.com/doi/full/10.1111/2041-210X.14010"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 6.6
[if_q] => 1
[if_m17_q] => 1
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 2
[if_m25_d] => 1
[if_percentil] => 93.2
[if_m17_percentil] => 89.832
[if_m25_percentil] => 90.664
[ais] => 2.808
[ais_m17_q] => 1
[ais_m25_q] => 1
[ais_m17_d] => 1
[ais_m25_d] => 1
[ais_m17_percentil] => 93.928
[ais_m25_percentil] => 94.283
[jci] => 1.76
[jci_q] => 1
[jci_percentil] => 94.474
[ef] =>
[scopus_sjr] => 2.805
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 6
[incites_open_access] => 1
[incites_jnci] => 0.36
[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.6573
[incites_avg_percentile] => 50.2875
[scival_citations_count] => 5
[scival_fwci] => 0.671631
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10600
[oecd_tree_obor_nazev] => 1.6 Biological sciences
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => Genome polarisation for detecting barriers to geneflow
[popis_en] => Semi-permeable barriers to geneflow in principle allow distantly related organisms to capture and exchange pre-adapted genes potentially speeding adaptation. However, describing barriers to geneflow on a genomic scale is non-trivial. We extend classic diagnostic allele counting measures of geneflow across a barrier to the case of genome-scale data. Diagnostic index expectation maximisation (diem) polarises the labelling of bistate markers with respect to the sides of a barrier. An initial state of ignorance is enforced by starting with randomly generated marker polarisations. This means there is no prior on population or taxon membership of the genomes concerned. Using a deterministic data labelling, small numbers of classic diagnostic markers can be replaced by large numbers of markers, each with a diagnostic index. Individuals' hybrid indices (genome admixture proportions) are then calculated genome wide conditioned on marker diagnosticity; within diploid, haplodiploid and/or haploid genome compartments; or indeed over any subset of markers, allowing classical cline width/barrier strength comparisons along genomes. Along-genome barrier strength heterogeneity allows for barrier regions to be identified. Furthermore, blocks of genetic material that have introgressed across a barrier are easily identified with high power. diem indicates panmixis among Myotis myotis bat genomes, with a barrier separating low data quality outliers. In a Mus musculus domesticus/Mus spretus system, diem adds multiple introgressions of olfactory (and vomeronasal) gene clusters in one direction to previous demonstrations of a pesticide resistance gene introgressing in the opposite direction across a strong species barrier. diem is a genome analysis solution, which scales over reduced representation genomics of thousands of markers to treatment of all variant sites in large genomes. While the method lends itself to visualisation, its output of markers with barrier-informative annotation will fuel research in population genetics, phylogenetics and association studies. diem can equip such downstream applications with millions of informative markers.
[klicova_slova_en] => gene capture; geneflow; genome admixture; genome polarisation; hybrid zone; hybridisation; introgression; reduced representation genomics
[vysledek_datum] => 2022-11-20T00:00:00+01:00
)
[9] => Array
(
[vysledek_id] => 180423
[vysledek_druh_id] => SW
[ex_vysledek_id] => 36439
[vysledek_rok] => 2021
[nazev] => fuzzyreg: Fuzzy Linear Regression
[nazev_orig] => fuzzyreg: Fuzzy Linear Regression
[duvernost_udaju_id] => S
[popis] => Estimators for fuzzy linear regression. The functions estimate parameters of fuzzy linear regression models with crisp or fuzzy independent variables (triangular fuzzy numbers are supported). Implements multiple methods for parameter estimation and algebraic operations with triangular fuzzy numbers. Includes functions for summarising, printing and plotting the model fit. Calculates predictions from the model and total error of fit. Diamond (1988) , Hung & Yang (2006) , Lee & Tanaka (1999) , Nasrabadi, Nasrabadi & Nasrabady (2005) , Skrabanek, Marek & Pozdilkova (2021) , Tanaka, Hayashi & Watada (1989) , Zeng, Feng & Li (2017) .
[popis_orig] => Estimators for fuzzy linear regression. The functions estimate parameters of fuzzy linear regression models with crisp or fuzzy independent variables (triangular fuzzy numbers are supported). Implements multiple methods for parameter estimation and algebraic operations with triangular fuzzy numbers. Includes functions for summarising, printing and plotting the model fit. Calculates predictions from the model and total error of fit. Diamond (1988) , Hung & Yang (2006) , Lee & Tanaka (1999) , Nasrabadi, Nasrabadi & Nasrabady (2005) , Skrabanek, Marek & Pozdilkova (2021) , Tanaka, Hayashi & Watada (1989) , Zeng, Feng & Li (2017) .
[klicova_slova] => possibilistic-based fuzzy regression; Fuzzy regression; statistics-based fuzzy regression; R; fuzzy set
[klicova_slova_orig] => possibilistic-based fuzzy regression; Fuzzy regression; statistics-based fuzzy regression; R; fuzzy set
[url] => https://cran.r-project.org/web/packages/fuzzyreg/index.html
[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] => 2022-12-19
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Aplikované výsledky
[druh_nazev] => Software
[druh_popis] => Software
[stav] => Schválený
[vysledek_kategorie_id] => AV
[vysledek_system_kategorie_id] => PD
[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] => ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.: fuzzyreg: Fuzzy Linear Regression. URL: https://cran.r-project.org/web/packages/fuzzyreg/index.html. (Software)
[citace_html] => ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.: fuzzyreg: Fuzzy Linear Regression. URL: https://cran.r-project.org/web/packages/fuzzyreg/index.html. (Software)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT180423,
author="Pavel {Škrabánek} and Natália {Martínková}",
title="fuzzyreg: Fuzzy Linear Regression",
year="2021",
url="https://cran.r-project.org/web/packages/fuzzyreg/index.html",
note="Software"
}
[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] => fuzzyreg: Fuzzy Linear Regression
[popis_en] => Estimators for fuzzy linear regression. The functions estimate parameters of fuzzy linear regression models with crisp or fuzzy independent variables (triangular fuzzy numbers are supported). Implements multiple methods for parameter estimation and algebraic operations with triangular fuzzy numbers. Includes functions for summarising, printing and plotting the model fit. Calculates predictions from the model and total error of fit. Diamond (1988) , Hung & Yang (2006) , Lee & Tanaka (1999) , Nasrabadi, Nasrabadi & Nasrabady (2005) , Skrabanek, Marek & Pozdilkova (2021) , Tanaka, Hayashi & Watada (1989) , Zeng, Feng & Li (2017) .
[klicova_slova_en] => possibilistic-based fuzzy regression; Fuzzy regression; statistics-based fuzzy regression; R; fuzzy set
[vysledek_datum] => 2021-09-01T00:00:00+02:00
)
[10] => Array
(
[vysledek_id] => 180438
[vysledek_druh_id] => SW
[ex_vysledek_id] => 36443
[vysledek_rok] => 2022
[nazev] => TGV methodology MATLAB implementation
[nazev_orig] => TGV methodology MATLAB implementation
[duvernost_udaju_id] => S
[popis] => n implementation of TGV methodology published in
TGV searches for an optimal setting of a computer vision system or of its sub-system. Within the system/sub-system must be implemented a weighted means grayscale conversion method. This implementation of TGV is based on one-stage grid-search algorithm supervised by a computer vision expert. The expert assesses settings proposed by the grid-searc method using WECIA graphs. One WECIA graph displays dependence of the system performance on setting of the grayscale conversion weights for one specific setting of the remaining adjustable parameters of the system/sub-system. The performance of the system/sub-system can be evaluated using one or more objective functions where only one of these function is used as a primary objective function, i.e. the grid-search algorihm uses this function for the selection of the optimal parameter setting. The expert can use all the objective functions while assessing a setting proposed by the grid-search algorithm, i.e. nJ WECIA graph are displeyed for one assesed setting where nJ is the number of the objective functions.
[popis_orig] => n implementation of TGV methodology published in
TGV searches for an optimal setting of a computer vision system or of its sub-system. Within the system/sub-system must be implemented a weighted means grayscale conversion method. This implementation of TGV is based on one-stage grid-search algorithm supervised by a computer vision expert. The expert assesses settings proposed by the grid-searc method using WECIA graphs. One WECIA graph displays dependence of the system performance on setting of the grayscale conversion weights for one specific setting of the remaining adjustable parameters of the system/sub-system. The performance of the system/sub-system can be evaluated using one or more objective functions where only one of these function is used as a primary objective function, i.e. the grid-search algorihm uses this function for the selection of the optimal parameter setting. The expert can use all the objective functions while assessing a setting proposed by the grid-search algorithm, i.e. nJ WECIA graph are displeyed for one assesed setting where nJ is the number of the objective functions.
[klicova_slova] => Computer vision; Parameter optimization; Performance evaluationl WECIA graph; Weighted means grayscale conversion
[klicova_slova_orig] => Computer vision; Parameter optimization; Performance evaluationl WECIA graph; Weighted means grayscale conversion
[url] => https://www.sciencedirect.com/science/article/pii/S0141938222001044#mmc1
[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] => 2023-02-01
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Aplikované výsledky
[druh_nazev] => Software
[druh_popis] => Software
[stav] => Schválený
[vysledek_kategorie_id] => AV
[vysledek_system_kategorie_id] => PD
[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] => 2990
[riv_dodavka_oznaceni] => RIV23-MSM-26210___
[riv_dodavka_rok] => 2023
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.: TGV methodology MATLAB implementation. URL: https://www.sciencedirect.com/science/article/pii/S0141938222001044#mmc1. (Software)
[citace_html] => ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.: TGV methodology MATLAB implementation. URL: https://www.sciencedirect.com/science/article/pii/S0141938222001044#mmc1. (Software)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT180438,
author="Pavel {Škrabánek} and Natália {Martínková}",
title="TGV methodology MATLAB implementation",
year="2022",
url="https://www.sciencedirect.com/science/article/pii/S0141938222001044#mmc1",
note="Software"
}
[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] => TGV methodology MATLAB implementation
[popis_en] => n implementation of TGV methodology published in
TGV searches for an optimal setting of a computer vision system or of its sub-system. Within the system/sub-system must be implemented a weighted means grayscale conversion method. This implementation of TGV is based on one-stage grid-search algorithm supervised by a computer vision expert. The expert assesses settings proposed by the grid-searc method using WECIA graphs. One WECIA graph displays dependence of the system performance on setting of the grayscale conversion weights for one specific setting of the remaining adjustable parameters of the system/sub-system. The performance of the system/sub-system can be evaluated using one or more objective functions where only one of these function is used as a primary objective function, i.e. the grid-search algorihm uses this function for the selection of the optimal parameter setting. The expert can use all the objective functions while assessing a setting proposed by the grid-search algorithm, i.e. nJ WECIA graph are displeyed for one assesed setting where nJ is the number of the objective functions.
[klicova_slova_en] => Computer vision; Parameter optimization; Performance evaluationl WECIA graph; Weighted means grayscale conversion
[vysledek_datum] => 2022-09-01T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 131
[count] => 11
[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] => MATOUŠEK, R.; DOBROVSKÝ, L.; LENGEROVÁ, M.; PARÁK, R.
[title] => openTube2
[typ] => AV
[year] => 2022
[id_vav] => 179075
)
[1] => Array
(
[quotations] => KŮDELA, J.; MATOUŠEK, R.
[title] => Combining Lipschitz and RBF Surrogate Models for High-dimensional Computationally Expensive Problems
[typ] => PV
[year] => 2023
[id_vav] => 179504
)
[2] => Array
(
[quotations] => KŮDELA, J.
[title] => A critical problem in benchmarking and analysis of evolutionary computation methods
[typ] => PV
[year] => 2022
[id_vav] => 179505
)
[3] => Array
(
[quotations] => ŠEDA, M.
[title] => The Assignment Problem and Its Relation to Logistics Problems
[typ] => PV
[year] => 2022
[id_vav] => 179566
)
[4] => Array
(
[quotations] => SMOLINSKY, R.; HIADLOVSKÁ, Z.; MARŠALA, Š.; ŠKRABÁNEK, P.; ŠKROBÁNEK, M.; MARTÍNKOVÁ, N.
[title] => High predation risk decimates survival during the reproduction season
[typ] => PV
[year] => 2022
[id_vav] => 179674
)
[5] => Array
(
[quotations] => ŠEDA, M.
[title] => Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS
[typ] => PV
[year] => 2022
[id_vav] => 179804
)
[6] => Array
(
[quotations] => MOURALOVÁ, K.; BENEŠ, L.; PROKEŠ, T.; BEDNÁŘ, J.; ZAHRADNÍČEK, R.; FRIES, J.
[title] => Analysis of the effect of material thickness during the WEDM processon cutting speed, topography and morphology
[typ] => PV
[year] => 2022
[id_vav] => 179862
)
[7] => Array
(
[quotations] => DVOŘÁK, J.;MOURALOVÁ, K.; BEDNÁŘ, J.; PROKEŠ, T.; ZAHRADNÍČEK, R.
[title] => Část formy vyrobená užitím optimálního nastavení parametrů elektroerozivní drátové řezačky
[typ] => AV
[year] => 2022
[id_vav] => 179989
)
[8] => Array
(
[quotations] => BAIRD, S.; PETRUŽELA, J.; IZAR, J.; ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.
[title] => Genome polarisation for detecting barriers to geneflow
[typ] => PV
[year] => 2022
[id_vav] => 180422
)
[9] => Array
(
[quotations] => ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.
[title] => fuzzyreg: Fuzzy Linear Regression
[typ] => AV
[year] => 2021
[id_vav] => 180423
)
[10] => Array
(
[quotations] => ŠKRABÁNEK, P.; MARTÍNKOVÁ, N.
[title] => TGV methodology MATLAB implementation
[typ] => AV
[year] => 2022
[id_vav] => 180438
)
)
)