Array
(
[page] => 133
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 183950
[vysledek_druh_id] => ARTSC
[ex_vysledek_id] => 148453
[vysledek_rok] => 2023
[nazev] => Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS
[nazev_orig] => Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS
[duvernost_udaju_id] => S
[popis] => The graph colouring problem is one of the most studied combinatorial optimisation problems, one with many applications, e. g., in timetabling, resource assignment, team-building problems, network analysis, and cartography. Because of its NP-hardness, the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of an integer programming model in the GAMS environment. This environment makes it possible to solve instances much larger than in the past. Neither does it 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.
[popis_orig] => The graph colouring problem is one of the most studied combinatorial optimisation problems, one with many applications, e. g., in timetabling, resource assignment, team-building problems, network analysis, and cartography. Because of its NP-hardness, the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of an integer programming model in the GAMS environment. This environment makes it possible to solve instances much larger than in the past. Neither does it 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.
[klicova_slova] => graph colouring, independent set, NP-hard problem, integer programming, GAMS
[klicova_slova_orig] => graph colouring, independent set, NP-hard problem, integer programming, GAMS
[url] => https://wseas.com/journals/systems/2023/b085102-033(2023).pdf
[oecd_obor_id] => 10102
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 2401
[schvaleno] => 2023-07-27
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 134179
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.37394/23202.2023.22.53
[kod_dspace] => 11012/213661
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Scopus Article
[druh_popis] => Peer-reviewed article included in Scopus database as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] => 3367
[riv_dodavka_oznaceni] => RIV24-MSM-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS. 2023, vol. 22, no. May, p. 532-537. ISSN: 1790-2769.
[citace_html] => ŠEDA, M. Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS. 2023, vol. 22, no. May, p. 532-537. ISSN: 1790-2769.
[citace_rtf] =>
[citace_bibtex] => @article{BUT183950,
author="Miloš {Šeda}",
title="Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS",
year="2023",
volume="22",
number="May",
pages="532--537",
doi="10.37394/23202.2023.22.53",
url="https://wseas.com/journals/systems/2023/b085102-033(2023).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] => 2
[scival_fwci] => 0.521899
[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] => Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS
[popis_en] => The graph colouring problem is one of the most studied combinatorial optimisation problems, one with many applications, e. g., in timetabling, resource assignment, team-building problems, network analysis, and cartography. Because of its NP-hardness, the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of an integer programming model in the GAMS environment. This environment makes it possible to solve instances much larger than in the past. Neither does it 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.
[klicova_slova_en] => graph colouring, independent set, NP-hard problem, integer programming, GAMS
[vysledek_datum] => 2023-05-31T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 184031
[vysledek_druh_id] => SW
[ex_vysledek_id] => 37669
[vysledek_rok] => 2023
[nazev] => DIRECTGOLib - DIRECT Global Optimization test problems Library
[nazev_orig] => DIRECTGOLib - DIRECT Global Optimization test problems Library
[duvernost_udaju_id] => S
[popis] => Over a year ago, an online collection called DIRECTGOLib was launched. It stands for DIRECT Global Optimization test problems Library. It offered a range of box-, generally-constrained, and engineering test problems for global optimization without derivatives. Since then, it has experienced significant growth and development.
Now, we present DIRECTGOLib v2.0, an updated version that builds upon the success of its predecessor, DIRECTGOLib v1.x. This latest iteration incorporates extensive expansion and restructuring efforts to ensure improved representation and better alignment with the current demands of testing global optimization algorithms.
[popis_orig] => Over a year ago, an online collection called DIRECTGOLib was launched. It stands for DIRECT Global Optimization test problems Library. It offered a range of box-, generally-constrained, and engineering test problems for global optimization without derivatives. Since then, it has experienced significant growth and development.
Now, we present DIRECTGOLib v2.0, an updated version that builds upon the success of its predecessor, DIRECTGOLib v1.x. This latest iteration incorporates extensive expansion and restructuring efforts to ensure improved representation and better alignment with the current demands of testing global optimization algorithms.
[klicova_slova] => optimization; benchmarking; black-box problems
[klicova_slova_orig] => optimization; benchmarking; black-box problems
[url] => https://github.com/blockchain-group/DIRECTGOLib
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 11599
[schvaleno] => 2025-04-28
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => STRIPINIS, L.; KŮDELA, J.; PAULAVIČIUS, R.
[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] => Applied results
[druh_nazev] => Software
[druh_popis] => Software
[stav] => Approved
[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] => STRIPINIS, L.; KŮDELA, J.; PAULAVIČIUS, R.: DIRECTGOLib - DIRECT Global Optimization test problems Library. URL: https://github.com/blockchain-group/DIRECTGOLib. (Software)
[citace_html] => STRIPINIS, L.; KŮDELA, J.; PAULAVIČIUS, R.: DIRECTGOLib - DIRECT Global Optimization test problems Library. URL: https://github.com/blockchain-group/DIRECTGOLib. (Software)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT184031,
author="Linas {Stripinis} and Jakub {Kůdela} and Remigijus {Paulavičius}",
title="DIRECTGOLib - DIRECT Global Optimization test problems Library",
year="2023",
url="https://github.com/blockchain-group/DIRECTGOLib",
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] => DIRECTGOLib - DIRECT Global Optimization test problems Library
[popis_en] => Over a year ago, an online collection called DIRECTGOLib was launched. It stands for DIRECT Global Optimization test problems Library. It offered a range of box-, generally-constrained, and engineering test problems for global optimization without derivatives. Since then, it has experienced significant growth and development.
Now, we present DIRECTGOLib v2.0, an updated version that builds upon the success of its predecessor, DIRECTGOLib v1.x. This latest iteration incorporates extensive expansion and restructuring efforts to ensure improved representation and better alignment with the current demands of testing global optimization algorithms.
[klicova_slova_en] => optimization; benchmarking; black-box problems
[vysledek_datum] => 2023-07-01T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 184578
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 148961
[vysledek_rok] => 2023
[nazev] => Variability of Inverted Repeats in All Available Genomes of Bacteria
[nazev_orig] => Variability of Inverted Repeats in All Available Genomes of Bacteria
[duvernost_udaju_id] => S
[popis] => Noncanonical secondary structures in nucleic acids have been studied intensively in recent years. Important biological roles of cruciform structures formed by inverted repeats (IRs) have been demonstrated in diverse organisms, including humans. Using Palindrome analyser, we analyzed IRs in all accessible bacterial genome sequences to determine their frequencies, lengths, and localizations. IR sequences were identified in all species, but their frequencies differed significantly across various evolutionary groups. We detected 242,373,717 IRs in all 1,565 bacterial genomes. The highest mean IR frequency was detected in the Tenericutes (61.89 IRs/kbp) and the lowest mean frequency was found in the Alphaproteobacteria (27.08 IRs/kbp). IRs were abundant near genes and around regulatory, tRNA, transfer-messenger RNA (tmRNA), and rRNA regions, pointing to the importance of IRs in such basic cellular processes as genome maintenance, DNA replication, and transcription. Moreover, we found that organisms with high IR frequencies were more likely to be endosymbiotic, antibiotic producing, or pathogenic. On the other hand, those with low IR frequencies were far more likely to be thermophilic. This first comprehensive analysis of IRs in all available bacterial genomes demonstrates their genomic ubiquity, nonrandom distribution, and enrichment in genomic regulatory regions.IMPORTANCE Our manuscript reports for the first time a complete analysis of inverted repeats in all fully sequenced bacterial genomes. Thanks to the availability of unique computational resources, we were able to statistically evaluate the presence and localization of these important regulatory sequences in bacterial genomes. This work revealed a strong abundance of these sequences in regulatory regions and provides researchers with a valuable tool for their manipulation. Our manuscript reports for the first time a complete analysis of inverted repeats in all fully sequenced bacterial genomes. Thanks to the availability of unique computational resources, we were able to statistically evaluate the presence and localization of these important regulatory sequences in bacterial genomes. This work revealed a strong abundance of these sequences in regulatory regions and provides researchers with a valuable tool for their manipulation.
[popis_orig] => Noncanonical secondary structures in nucleic acids have been studied intensively in recent years. Important biological roles of cruciform structures formed by inverted repeats (IRs) have been demonstrated in diverse organisms, including humans. Using Palindrome analyser, we analyzed IRs in all accessible bacterial genome sequences to determine their frequencies, lengths, and localizations. IR sequences were identified in all species, but their frequencies differed significantly across various evolutionary groups. We detected 242,373,717 IRs in all 1,565 bacterial genomes. The highest mean IR frequency was detected in the Tenericutes (61.89 IRs/kbp) and the lowest mean frequency was found in the Alphaproteobacteria (27.08 IRs/kbp). IRs were abundant near genes and around regulatory, tRNA, transfer-messenger RNA (tmRNA), and rRNA regions, pointing to the importance of IRs in such basic cellular processes as genome maintenance, DNA replication, and transcription. Moreover, we found that organisms with high IR frequencies were more likely to be endosymbiotic, antibiotic producing, or pathogenic. On the other hand, those with low IR frequencies were far more likely to be thermophilic. This first comprehensive analysis of IRs in all available bacterial genomes demonstrates their genomic ubiquity, nonrandom distribution, and enrichment in genomic regulatory regions.IMPORTANCE Our manuscript reports for the first time a complete analysis of inverted repeats in all fully sequenced bacterial genomes. Thanks to the availability of unique computational resources, we were able to statistically evaluate the presence and localization of these important regulatory sequences in bacterial genomes. This work revealed a strong abundance of these sequences in regulatory regions and provides researchers with a valuable tool for their manipulation. Our manuscript reports for the first time a complete analysis of inverted repeats in all fully sequenced bacterial genomes. Thanks to the availability of unique computational resources, we were able to statistically evaluate the presence and localization of these important regulatory sequences in bacterial genomes. This work revealed a strong abundance of these sequences in regulatory regions and provides researchers with a valuable tool for their manipulation.
[klicova_slova] => inverted repeats; Palindrome analyser; bacteria domain; bacterial genome analysis
[klicova_slova_orig] => inverted repeats; Palindrome analyser; bacteria domain; bacterial genome analysis
[url] => https://journals.asm.org/doi/10.1128/spectrum.01648-23
[oecd_obor_id] => 10600
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 51108
[schvaleno] => 2024-03-01
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 141439
[posledni_diagnostika] =>
[vycet_osob] => PORUBIAKOVÁ, O.; HAVLÍK, J.; INDU, M.; ŠEDŸ, M.; PŘEPECHALOVÁ, V.; BARTAS, M.; BIDULA, S.; ŠŤASTNÝ, J.; FOJTA, M.; BRÁZDA, V.
[pocet_tvurcu] => 10
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1128/spectrum.01648-23
[kod_dspace] => 11012/244957
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 2165-0497
[identifikator_popis] => ISSN - Microbiology Spectrum (US)
[riv_dodavka_id] => 3367
[riv_dodavka_oznaceni] => RIV24-MSM-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 3
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 2
[citace_text] => PORUBIAKOVÁ, O.; HAVLÍK, J.; INDU, M.; ŠEDŸ, M.; PŘEPECHALOVÁ, V.; BARTAS, M.; BIDULA, S.; ŠŤASTNÝ, J.; FOJTA, M.; BRÁZDA, V. Variability of Inverted Repeats in All Available Genomes of Bacteria. Microbiology Spectrum, 2023, vol. 11, no. 4, p. 1-11. ISSN: 2165-0497.
[citace_html] => PORUBIAKOVÁ, O.; HAVLÍK, J.; INDU, M.; ŠEDŸ, M.; PŘEPECHALOVÁ, V.; BARTAS, M.; BIDULA, S.; ŠŤASTNÝ, J.; FOJTA, M.; BRÁZDA, V. Variability of Inverted Repeats in All Available Genomes of Bacteria. Microbiology Spectrum, 2023, vol. 11, no. 4, p. 1-11. ISSN: 2165-0497.
[citace_rtf] =>
[citace_bibtex] => @article{BUT184578,
author="Otília {Porubiaková} and Jan {Havlík} and Michal {Indu} and Michal {Šedý} and Veronika {Přepechalová} and Martin {Bartas} and Stefan {Bidula} and Jiří {Šťastný} and Miroslav {Fojta} and Václav {Brázda}",
title="Variability of Inverted Repeats in All Available Genomes of Bacteria",
journal="Microbiology Spectrum",
year="2023",
volume="11",
number="4",
pages="1--11",
doi="10.1128/spectrum.01648-23",
issn="2165-0497",
url="https://journals.asm.org/doi/10.1128/spectrum.01648-23"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 3.7
[if_q] => 2
[if_m17_q] => 1
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 3
[if_m25_d] => 3
[if_percentil] => 62.4
[if_m17_percentil] => 75.116
[if_m25_percentil] => 76.224
[ais] => 1.019
[ais_m17_q] => 1
[ais_m25_q] => 1
[ais_m17_d] => 3
[ais_m25_d] => 3
[ais_m17_percentil] => 75.73
[ais_m25_percentil] => 76.457
[jci] => 0.96
[jci_q] => 2
[jci_percentil] => 70.497
[ef] =>
[scopus_sjr] => 1.028
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 1
[incites_open_access] => 1
[incites_jnci] => 0.18
[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.1684
[incites_avg_percentile] => 9.2721
[scival_citations_count] => 1
[scival_fwci] => 0.495937
[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] => Variability of Inverted Repeats in All Available Genomes of Bacteria
[popis_en] => Noncanonical secondary structures in nucleic acids have been studied intensively in recent years. Important biological roles of cruciform structures formed by inverted repeats (IRs) have been demonstrated in diverse organisms, including humans. Using Palindrome analyser, we analyzed IRs in all accessible bacterial genome sequences to determine their frequencies, lengths, and localizations. IR sequences were identified in all species, but their frequencies differed significantly across various evolutionary groups. We detected 242,373,717 IRs in all 1,565 bacterial genomes. The highest mean IR frequency was detected in the Tenericutes (61.89 IRs/kbp) and the lowest mean frequency was found in the Alphaproteobacteria (27.08 IRs/kbp). IRs were abundant near genes and around regulatory, tRNA, transfer-messenger RNA (tmRNA), and rRNA regions, pointing to the importance of IRs in such basic cellular processes as genome maintenance, DNA replication, and transcription. Moreover, we found that organisms with high IR frequencies were more likely to be endosymbiotic, antibiotic producing, or pathogenic. On the other hand, those with low IR frequencies were far more likely to be thermophilic. This first comprehensive analysis of IRs in all available bacterial genomes demonstrates their genomic ubiquity, nonrandom distribution, and enrichment in genomic regulatory regions.IMPORTANCE Our manuscript reports for the first time a complete analysis of inverted repeats in all fully sequenced bacterial genomes. Thanks to the availability of unique computational resources, we were able to statistically evaluate the presence and localization of these important regulatory sequences in bacterial genomes. This work revealed a strong abundance of these sequences in regulatory regions and provides researchers with a valuable tool for their manipulation. Our manuscript reports for the first time a complete analysis of inverted repeats in all fully sequenced bacterial genomes. Thanks to the availability of unique computational resources, we were able to statistically evaluate the presence and localization of these important regulatory sequences in bacterial genomes. This work revealed a strong abundance of these sequences in regulatory regions and provides researchers with a valuable tool for their manipulation.
[klicova_slova_en] => inverted repeats; Palindrome analyser; bacteria domain; bacterial genome analysis
[vysledek_datum] => 2023-06-26T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 184779
[vysledek_druh_id] => UV
[ex_vysledek_id] => 21843
[vysledek_rok] => 2023
[nazev] => Zařízení pro upnutí obrobku při elektroerozivním drátovém řezání a sestava s tímto zařízením
[nazev_orig] => Zařízení pro upnutí obrobku při elektroerozivním drátovém řezání a sestava s tímto zařízením
[duvernost_udaju_id] => S
[popis] => Předložený vynález se týká systému upínání obrobků tak, aby zajistil jeho pevné ukotvení v mnoha místech na pracovním stole v průběhu obrábění na elektroerozivní drátové řezačce (WEDM). Toto ukotvení je odůvodněné u kruhových obrobků s průměrem nad 200 mm. Důsledkem velkého zbytkového napětí, které vzniká v průběhu WEDM obrobky často praskají, čímž jsou zcela znehodnoceny nebo musí být opraveny. Předložený vynález v podobě systému upínání předchází deformacím a následnému praskání obrobených dílů.
[popis_orig] => Předložený vynález se týká systému upínání obrobků tak, aby zajistil jeho pevné ukotvení v mnoha místech na pracovním stole v průběhu obrábění na elektroerozivní drátové řezačce (WEDM). Toto ukotvení je odůvodněné u kruhových obrobků s průměrem nad 200 mm. Důsledkem velkého zbytkového napětí, které vzniká v průběhu WEDM obrobky často praskají, čímž jsou zcela znehodnoceny nebo musí být opraveny. Předložený vynález v podobě systému upínání předchází deformacím a následnému praskání obrobených dílů.
[klicova_slova] => upínání obrobků`; WEDM; kruhové obrobky;
[klicova_slova_orig] => upínání obrobků`; WEDM; kruhové obrobky;
[url] =>
[oecd_obor_id] => 20301
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 2401
[schvaleno] => 2023-11-28
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 136269
[posledni_diagnostika] =>
[vycet_osob] => MOURALOVÁ, K.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Applied results
[druh_nazev] => Utility model
[druh_popis] => Utility model
[stav] => Approved
[vysledek_kategorie_id] => AV
[vysledek_system_kategorie_id] => PA
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] => 3367
[riv_dodavka_oznaceni] => RIV24-MSM-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => MOURALOVÁ, K.; Vysoké učení technické v Brně, Brno, Veveří: Zařízení pro upnutí obrobku při elektroerozivním drátovém řezání a sestava s tímto zařízením. 37340, Užitný vzor. (2023)
[citace_html] => MOURALOVÁ, K.; Vysoké učení technické v Brně, Brno, Veveří: Zařízení pro upnutí obrobku při elektroerozivním drátovém řezání a sestava s tímto zařízením. 37340, Užitný vzor. (2023)
[citace_rtf] =>
[citace_bibtex] => @misc{BUT184779,
author="Kateřina {Mouralová}",
title="Zařízení pro upnutí obrobku při elektroerozivním drátovém řezání a sestava s tímto zařízením",
year="2023",
note="Utility model"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 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] => A device for clamping a workpiece during wire electrical discharge machining and an assembly with this device
[popis_en] => The present invention relates to a workpiece clamping system to ensure its firm anchoring in many places on the work table during machining on a wire electrical discharge machine (WEDM). This anchoring is justified for circular workpieces with a diameter of over 200 mm. As a result of the large residual stresses that arise during WEDM, the workpieces often crack, causing them to be completely degraded or have to be repaired. The present invention in the form of a clamping system prevents deformation and subsequent cracking of machined parts.
[klicova_slova_en] => workpiece clamping; WEDM; circular workpieces;
[vysledek_datum] => 2023-09-29T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 184820
[vysledek_druh_id] => NEWS
[ex_vysledek_id] => 149115
[vysledek_rok] => 2021
[nazev] => Dokumentace k software nástroji pro vypracování dlouhodobé prognózy produkce odpadů v ČR
(Výsledek V12)
[nazev_orig] => Dokumentace k software nástroji pro vypracování dlouhodobé prognózy produkce odpadů v ČR
(Výsledek V12)
[duvernost_udaju_id] => S
[popis] => Zpráva obsahuje systémový popis sw TiramisO vytvořeného v rámci projektu TIRSMZP719. V publikaci je úplný popis sw řešení včetně datových struktur. TiramisO je www informační systém s architekturou klient/server využívající databázi MySQL, je použit jazyk php na straně serveru a JavaScript na straně klienta. Výpočet prognózy je realizován externím modulem v jazyce Julia. Systém umožňuje práci uživatelů s různým oprávněním. Kromě zobrazování a exportu dat prognózy v tabulkové i grafické formě systém umožňuje i vytváření scénářů zohledňujících předpokládané legislativní i faktické změny v produkci odpadů. Uživatelský manuál je v samostatném souboru.
[popis_orig] => Zpráva obsahuje systémový popis sw TiramisO vytvořeného v rámci projektu TIRSMZP719. V publikaci je úplný popis sw řešení včetně datových struktur. TiramisO je www informační systém s architekturou klient/server využívající databázi MySQL, je použit jazyk php na straně serveru a JavaScript na straně klienta. Výpočet prognózy je realizován externím modulem v jazyce Julia. Systém umožňuje práci uživatelů s různým oprávněním. Kromě zobrazování a exportu dat prognózy v tabulkové i grafické formě systém umožňuje i vytváření scénářů zohledňujících předpokládané legislativní i faktické změny v produkci odpadů. Uživatelský manuál je v samostatném souboru.
[klicova_slova] => produkce odpadu, prognóza, www informační systém, databáze, scénáře
[klicova_slova_orig] => produkce odpadu, prognóza, www informační systém, databáze, scénáře
[url] =>
[oecd_obor_id] => 10102
[odpovedny_utvar_id] => 188
[odpovedny_utvar_nazev] => Institute of Process Engineering
[odpovedny_utvar_zkratka] => IPE
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 1574
[schvaleno] => 2023-10-17
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 136335
[posledni_diagnostika] =>
[vycet_osob] => ROUPEC, J.; TALPA, J.; PAVLAS, M.; ŠOMPLÁ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] => Other
[druh_nazev] => Report
[druh_popis] =>
[stav] => Approved
[vysledek_kategorie_id] => OS
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ROUPEC, J.; TALPA, J.; PAVLAS, M.; ŠOMPLÁK, R. Dokumentace k software nástroji pro vypracování dlouhodobé prognózy produkce odpadů v ČR (Výsledek V12). 2021. 137 s.
[citace_html] => ROUPEC, J.; TALPA, J.; PAVLAS, M.; ŠOMPLÁK, R. Dokumentace k software nástroji pro vypracování dlouhodobé prognózy produkce odpadů v ČR (Výsledek V12). 2021. 137 s.
[citace_rtf] =>
[citace_bibtex] => @misc{BUT184820,
author="Jan {Roupec} and Jaroslav {Talpa} and Martin {Pavlas} and Radovan {Šomplák}",
title="Dokumentace k software nástroji pro vypracování dlouhodobé prognózy produkce odpadů v ČR
(Výsledek V12)",
year="2021",
pages="137"
}
[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] => Documentation for a software tool for developing a long-term forecast of waste production in the Czech Republic (Result V12)
[popis_en] => The report contains a system description of sw TiramisO created within the TIRSMZP719 project. The publication contains a complete description of the SW solution, including data structures. TiramisO is a www information system with a client/server architecture using a MySQL database, PHP is used on the server side and JavaScript on the client side. The calculation of the forecast is implemented by an external module in the Julia language. The system allows users with different authorizations to work. In addition to displaying and exporting forecast data in tabular and graphic form, the system also enables the creation of scenarios taking into account anticipated legislative and actual changes in waste production. The user manual is in a separate file.
[klicova_slova_en] => waste generation, forecast, www information system, dababase, scenarios
[vysledek_datum] => 2021-12-31T00:00:00+01:00
)
[5] => Array
(
[vysledek_id] => 184821
[vysledek_druh_id] => NEWS
[ex_vysledek_id] => 149116
[vysledek_rok] => 2021
[nazev] => Manuál k vypracování dlouhodobé prognózy produkce odpadů v ČR (Výsledek V11)
[nazev_orig] => Manuál k vypracování dlouhodobé prognózy produkce odpadů v ČR (Výsledek V11)
[duvernost_udaju_id] => S
[popis] => Dokument předkládá uživatelský manuál k vypracování dlouhodobé prognózy produkce odpadů v ČR pomocí softwaru TiramisO. TiramisO je uživatelsky přívětivý nástroj pro vytvoření dlouhodobé prognózy produkce odpadů v ČR. Software zajišťuje jednotný přístup všech aktérů v odpadovém hospodářství (OH) na různých úrovních (národní, regionální apod.) při tvorbě prognóz významných odpadových toků, skupin a podskupin odpadů a jednotlivých katalogových čísel odpadů dle Katalogu odpadů. Text je určen uživatelům sw s veřejným přístupem.
[popis_orig] => Dokument předkládá uživatelský manuál k vypracování dlouhodobé prognózy produkce odpadů v ČR pomocí softwaru TiramisO. TiramisO je uživatelsky přívětivý nástroj pro vytvoření dlouhodobé prognózy produkce odpadů v ČR. Software zajišťuje jednotný přístup všech aktérů v odpadovém hospodářství (OH) na různých úrovních (národní, regionální apod.) při tvorbě prognóz významných odpadových toků, skupin a podskupin odpadů a jednotlivých katalogových čísel odpadů dle Katalogu odpadů. Text je určen uživatelům sw s veřejným přístupem.
[klicova_slova] => produkce odpadu, prognóza, www informační systém, scénáře
[klicova_slova_orig] => produkce odpadu, prognóza, www informační systém, scénáře
[url] =>
[oecd_obor_id] => 10102
[odpovedny_utvar_id] => 188
[odpovedny_utvar_nazev] => Institute of Process Engineering
[odpovedny_utvar_zkratka] => IPE
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 1574
[schvaleno] => 2023-10-17
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 136336
[posledni_diagnostika] =>
[vycet_osob] => ROUPEC, J.; SZÁSZIOVÁ, L.; TALPA, J.; PAVLAS, M.; ŠOMPLÁK, R.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Other
[druh_nazev] => Report
[druh_popis] =>
[stav] => Approved
[vysledek_kategorie_id] => OS
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ROUPEC, J.; SZÁSZIOVÁ, L.; TALPA, J.; PAVLAS, M.; ŠOMPLÁK, R. Manuál k vypracování dlouhodobé prognózy produkce odpadů v ČR (Výsledek V11). 2021. 39 s.
[citace_html] => ROUPEC, J.; SZÁSZIOVÁ, L.; TALPA, J.; PAVLAS, M.; ŠOMPLÁK, R. Manuál k vypracování dlouhodobé prognózy produkce odpadů v ČR (Výsledek V11). 2021. 39 s.
[citace_rtf] =>
[citace_bibtex] => @misc{BUT184821,
author="Jan {Roupec} and Lenka {Szásziová} and Jaroslav {Talpa} and Martin {Pavlas} and Radovan {Šomplák}",
title="Manuál k vypracování dlouhodobé prognózy produkce odpadů v ČR (Výsledek V11)",
year="2021",
pages="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] =>
[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] => Manual for developing a long-term forecast of waste production in the Czech Republic (Result V11)
[popis_en] => The document presents a user manual for developing a long-term forecast of waste production in the Czech Republic using the TiramisO software. TiramisO is a user-friendly tool for creating a long-term forecast of waste production in the Czech Republic. The software ensures a unified approach of all actors in waste management (OH) at different levels (national, regional, etc.) in creating forecasts of significant waste flows, groups and subgroups of waste and individual catalog numbers of waste according to the Waste Catalog. The text is intended for sw users with public access.
[klicova_slova_en] => waste generation, forecast, www information system, scenarios
[vysledek_datum] => 2021-12-31T00:00:00+01:00
)
[6] => Array
(
[vysledek_id] => 185001
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 149254
[vysledek_rok] => 2023
[nazev] => The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation
[nazev_orig] => The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation
[duvernost_udaju_id] => S
[popis] => The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the use of integer programming models in the GAMS (General Algebraic Modelling System) environment, which is based on exact methods and sophisticated deterministic heuristics incorporated in it. We propose modifications of integer models, derive their time complexities and show their direct use in GAMS. GAMS makes it possible to find optimal solutions to the maximum clique problem for instances with hundreds of vertices and thousands of edges within minutes at most. For extremely large instances, good approximations of the optimum are given in a reasonable amount of time. A great advantage of this approach over all the mentioned algorithms is that even if GAMS does not find the best known solution within the chosen time limit, it displays its value at the end of the calculation as a reachable bound.
[popis_orig] => The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the use of integer programming models in the GAMS (General Algebraic Modelling System) environment, which is based on exact methods and sophisticated deterministic heuristics incorporated in it. We propose modifications of integer models, derive their time complexities and show their direct use in GAMS. GAMS makes it possible to find optimal solutions to the maximum clique problem for instances with hundreds of vertices and thousands of edges within minutes at most. For extremely large instances, good approximations of the optimum are given in a reasonable amount of time. A great advantage of this approach over all the mentioned algorithms is that even if GAMS does not find the best known solution within the chosen time limit, it displays its value at the end of the calculation as a reachable bound.
[klicova_slova] => clique, independent set;,GAMS, NP-complete problem, integer programming
[klicova_slova_orig] => clique, independent set;,GAMS, NP-complete problem, integer programming
[url] => https://www.mdpi.com/2073-8994/15/11/1979
[oecd_obor_id] => 10102
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 51108
[schvaleno] => 2024-02-20
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 141717
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.3390/sym15111979
[kod_dspace] => 11012/245086
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] => 3367
[riv_dodavka_oznaceni] => RIV24-MSM-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => ŠEDA, M. The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation. Symmetry-Basel, 2023, vol. 15, no. 11, p. 1-16. ISSN: 2073-8994.
[citace_html] => ŠEDA, M. The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation. Symmetry-Basel, 2023, vol. 15, no. 11, p. 1-16. ISSN: 2073-8994.
[citace_rtf] =>
[citace_bibtex] => @article{BUT185001,
author="Miloš {Šeda}",
title="The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation",
journal="Symmetry-Basel",
year="2023",
volume="15",
number="11",
pages="1--16",
doi="10.3390/sym15111979",
url="https://www.mdpi.com/2073-8994/15/11/1979"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.2
[if_q] => 2
[if_m17_q] => 3
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 6
[if_m25_d] => 4
[if_percentil] => 63.8
[if_m17_percentil] => 48.592
[if_m25_percentil] => 63.806
[ais] => 0.395
[ais_m17_q] => 3
[ais_m25_q] => 2
[ais_m17_d] => 7
[ais_m25_d] => 5
[ais_m17_percentil] => 38.732
[ais_m25_percentil] => 55.769
[jci] => 0.86
[jci_q] => 2
[jci_percentil] => 75.185
[ef] =>
[scopus_sjr] => 0.485
[scopus_sjr_q] => 2
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 3
[incites_open_access] => 1
[incites_jnci] => 0.78
[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.0688
[incites_avg_percentile] => 66.5096
[scival_citations_count] => 3
[scival_fwci] => 0.724662
[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 Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation
[popis_en] => The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the use of integer programming models in the GAMS (General Algebraic Modelling System) environment, which is based on exact methods and sophisticated deterministic heuristics incorporated in it. We propose modifications of integer models, derive their time complexities and show their direct use in GAMS. GAMS makes it possible to find optimal solutions to the maximum clique problem for instances with hundreds of vertices and thousands of edges within minutes at most. For extremely large instances, good approximations of the optimum are given in a reasonable amount of time. A great advantage of this approach over all the mentioned algorithms is that even if GAMS does not find the best known solution within the chosen time limit, it displays its value at the end of the calculation as a reachable bound.
[klicova_slova_en] => clique, independent set;,GAMS, NP-complete problem, integer programming
[vysledek_datum] => 2023-10-26T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 185216
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 149446
[vysledek_rok] => 2024
[nazev] => Optimal control of combined heat and power station operation
[nazev_orig] => Optimal control of combined heat and power station operation
[duvernost_udaju_id] => S
[popis] => Combined heat and power stations have become one of the most utilized units of district heating systems. These stations usually contain several boilers for burning fossil fuels and renewable resources used for heating up steam, which can be used either for residential and commercial heating or electricity generation. To ensure efficiency, a boiler should either run continuously (for at least a given period) on a power output higher than a given threshold or switch off. The optimal control of the plant operations should combine an efficient setup for the turbine and boilers in operation, reflecting the demand for steam and the price of electricity, and a schedule that describes which boilers should be in operation at a given time. This paper proposes a method for optimal control of combined heat and power station operation for a given time horizon. The method is based on a two-level approach. The lower-level models correspond to finding the optimal setup of the combined heat and power station parameters for an hourly demand for different kinds of steam. The upper-level model corresponds to the optimal schedule of the operations of the individual boilers, which is planned for the entire time horizon. The lower-level model is modeled as a mixed-integer linear programming problem and is solved using parametric programming. A dynamic programming algorithm solves the upper-level model with a rolling horizon. The validity of the proposed method and its computational complexity for different granularity of the time horizon, different ranges of the parameters, varying demand for various kinds of steam, and varying electricity prices are investigated in a case study. The presented approach can be readily applied to other control problems with a similar structure.
[popis_orig] => Combined heat and power stations have become one of the most utilized units of district heating systems. These stations usually contain several boilers for burning fossil fuels and renewable resources used for heating up steam, which can be used either for residential and commercial heating or electricity generation. To ensure efficiency, a boiler should either run continuously (for at least a given period) on a power output higher than a given threshold or switch off. The optimal control of the plant operations should combine an efficient setup for the turbine and boilers in operation, reflecting the demand for steam and the price of electricity, and a schedule that describes which boilers should be in operation at a given time. This paper proposes a method for optimal control of combined heat and power station operation for a given time horizon. The method is based on a two-level approach. The lower-level models correspond to finding the optimal setup of the combined heat and power station parameters for an hourly demand for different kinds of steam. The upper-level model corresponds to the optimal schedule of the operations of the individual boilers, which is planned for the entire time horizon. The lower-level model is modeled as a mixed-integer linear programming problem and is solved using parametric programming. A dynamic programming algorithm solves the upper-level model with a rolling horizon. The validity of the proposed method and its computational complexity for different granularity of the time horizon, different ranges of the parameters, varying demand for various kinds of steam, and varying electricity prices are investigated in a case study. The presented approach can be readily applied to other control problems with a similar structure.
[klicova_slova] => Combined heat and power station; Dynamic programming; Optimal control; Parametric programming; Rolling horizon control
[klicova_slova_orig] => Combined heat and power station; Dynamic programming; Optimal control; Parametric programming; Rolling horizon control
[url] => https://link.springer.com/article/10.1007/s11081-023-09848-2
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 51108
[schvaleno] => 2024-02-26
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 137661
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.; SUJA, J.; ŠOMPLÁK, R.; PLUSKAL, J.; HRABEC, D.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1007/s11081-023-09848-2
[kod_dspace] => 11012/245225
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Kalmárová Kristýna
[ins_uid] => 999999
[upd_uid] => 254501
[ins_ts] => 2025-09-22
[upd_ts] => 2026-02-02
[status] => 9
[identifikator] => ISSN 1389-4420
[identifikator_popis] => ISSN - Optimization and engineering (NL)
[riv_dodavka_id] => 3367
[riv_dodavka_oznaceni] => RIV24-MSM-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => KŮDELA, J.; SUJA, J.; ŠOMPLÁK, R.; PLUSKAL, J.; HRABEC, D. Optimal control of combined heat and power station operation. Optimization and engineering, 2024, vol. 1, no. 1, p. 121-145.
[citace_html] => KŮDELA, J.; SUJA, J.; ŠOMPLÁK, R.; PLUSKAL, J.; HRABEC, D. Optimal control of combined heat and power station operation. Optimization and engineering, 2024, vol. 1, no. 1, p. 121-145.
[citace_rtf] =>
[citace_bibtex] => @article{BUT185216,
author="Jakub {Kůdela} and Jerguš {Suja} and Radovan {Šomplák} and Jaroslav {Pluskal} and Dušan {Hrabec}",
title="Optimal control of combined heat and power station operation",
journal="Optimization and engineering",
year="2024",
volume="1",
number="1",
pages="121--145",
doi="10.1007/s11081-023-09848-2",
issn="1389-4420",
url="https://link.springer.com/article/10.1007/s11081-023-09848-2"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 1.7
[if_q] => 2
[if_m17_q] => 2
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 3
[if_m25_d] => 3
[if_percentil] => 55.7
[if_m17_percentil] => 72.734
[if_m25_percentil] => 79.019
[ais] => 0.581
[ais_m17_q] => 2
[ais_m25_q] => 2
[ais_m17_d] => 5
[ais_m25_d] => 4
[ais_m17_percentil] => 58.972
[ais_m25_percentil] => 65.269
[jci] => 0.5
[jci_q] => 2
[jci_percentil] => 60.286
[ef] =>
[scopus_sjr] => 0.573
[scopus_sjr_q] => 2
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 4
[incites_open_access] => 1
[incites_jnci] => 1.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.6167
[incites_avg_percentile] => 50.645133
[scival_citations_count] => 3
[scival_fwci] => 3.033047
[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] => Optimal control of combined heat and power station operation
[popis_en] => Combined heat and power stations have become one of the most utilized units of district heating systems. These stations usually contain several boilers for burning fossil fuels and renewable resources used for heating up steam, which can be used either for residential and commercial heating or electricity generation. To ensure efficiency, a boiler should either run continuously (for at least a given period) on a power output higher than a given threshold or switch off. The optimal control of the plant operations should combine an efficient setup for the turbine and boilers in operation, reflecting the demand for steam and the price of electricity, and a schedule that describes which boilers should be in operation at a given time. This paper proposes a method for optimal control of combined heat and power station operation for a given time horizon. The method is based on a two-level approach. The lower-level models correspond to finding the optimal setup of the combined heat and power station parameters for an hourly demand for different kinds of steam. The upper-level model corresponds to the optimal schedule of the operations of the individual boilers, which is planned for the entire time horizon. The lower-level model is modeled as a mixed-integer linear programming problem and is solved using parametric programming. A dynamic programming algorithm solves the upper-level model with a rolling horizon. The validity of the proposed method and its computational complexity for different granularity of the time horizon, different ranges of the parameters, varying demand for various kinds of steam, and varying electricity prices are investigated in a case study. The presented approach can be readily applied to other control problems with a similar structure.
[klicova_slova_en] => Combined heat and power station; Dynamic programming; Optimal control; Parametric programming; Rolling horizon control
[vysledek_datum] => 2024-03-01T00:00:00+01:00
)
[8] => Array
(
[vysledek_id] => 185653
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 149779
[vysledek_rok] => 2023
[nazev] => Low complexity subspace approach for unbiased frequency estimation of a complex single-tone
[nazev_orig] => Low complexity subspace approach for unbiased frequency estimation of a complex single-tone
[duvernost_udaju_id] => S
[popis] => We propose a single-tone frequency estimator of a one-dimensional complex signal in complex white Gaussian noise. The estimator is based on the subspace approach and the unitary transformation. Due to its low space and time-complexity, we name the estimator as Low complexity Unitary Principal-singular-vector Utilization for Model Analysis (LUPUMA). Regardless of the observation length, LUPUMA provides a uniform estimation variance over the whole frequency range, while achieving the lowest time-complexity among subspace methods. The proposed estimator asymptotically reaches the Cramér-Rao Lower Bound. For short observations, the signal-to-noise ratio threshold of LUPUMA corresponds to the threshold of the maximum likelihood estimator. The low space and time-complexity along with the stable and state-of-the-art estimation performance for short observations make LUPUMA an ideal candidate for applications with a limited number of signal samples, limited computational power, limited memory, and for applications that require rapid processing time (low latency).
[popis_orig] => We propose a single-tone frequency estimator of a one-dimensional complex signal in complex white Gaussian noise. The estimator is based on the subspace approach and the unitary transformation. Due to its low space and time-complexity, we name the estimator as Low complexity Unitary Principal-singular-vector Utilization for Model Analysis (LUPUMA). Regardless of the observation length, LUPUMA provides a uniform estimation variance over the whole frequency range, while achieving the lowest time-complexity among subspace methods. The proposed estimator asymptotically reaches the Cramér-Rao Lower Bound. For short observations, the signal-to-noise ratio threshold of LUPUMA corresponds to the threshold of the maximum likelihood estimator. The low space and time-complexity along with the stable and state-of-the-art estimation performance for short observations make LUPUMA an ideal candidate for applications with a limited number of signal samples, limited computational power, limited memory, and for applications that require rapid processing time (low latency).
[klicova_slova] => Frequency estimation; Complex single-tone; Subspace method; Short observation interval
[klicova_slova_orig] => Frequency estimation; Complex single-tone; Subspace method; Short observation interval
[url] => https://www.sciencedirect.com/science/article/pii/S1051200423003998
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 11599
[schvaleno] => 2024-03-22
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => POURAFZAL, A.; ŠKRABÁNEK, P.; CHEFFENA, M.; YILDIRIM, S.; ROI-TARAVELLA, T.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1016/j.dsp.2023.104304
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 1051-2004
[identifikator_popis] => ISSN - DIGITAL SIGNAL PROCESSING (US)
[riv_dodavka_id] => 3367
[riv_dodavka_oznaceni] => RIV24-MSM-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 3
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 2
[citace_text] => POURAFZAL, A.; ŠKRABÁNEK, P.; CHEFFENA, M.; YILDIRIM, S.; ROI-TARAVELLA, T. Low complexity subspace approach for unbiased frequency estimation of a complex single-tone. DIGITAL SIGNAL PROCESSING, 2023, vol. 145, no. February 2024, p. 1-20. ISSN: 1095-4333.
[citace_html] => POURAFZAL, A.; ŠKRABÁNEK, P.; CHEFFENA, M.; YILDIRIM, S.; ROI-TARAVELLA, T. Low complexity subspace approach for unbiased frequency estimation of a complex single-tone. DIGITAL SIGNAL PROCESSING, 2023, vol. 145, no. February 2024, p. 1-20. ISSN: 1095-4333.
[citace_rtf] =>
[citace_bibtex] => @article{BUT185653,
author="Alireza {Pourafzal} and Pavel {Škrabánek} and Michael {Cheffena} and Sule {Yildirim} and Thomas {Roi-Taravella}",
title="Low complexity subspace approach for unbiased frequency estimation of a complex single-tone",
journal="DIGITAL SIGNAL PROCESSING",
year="2023",
volume="145",
number="February 2024",
pages="1--20",
doi="10.1016/j.dsp.2023.104304",
issn="1051-2004",
url="https://www.sciencedirect.com/science/article/pii/S1051200423003998"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.9
[if_q] => 2
[if_m17_q] => 2
[if_m25_q] => 2
[if_d] =>
[if_m17_d] => 5
[if_m25_d] => 4
[if_percentil] => 59.5
[if_m17_percentil] => 55.071
[if_m25_percentil] => 60.227
[ais] => 0.68
[ais_m17_q] => 2
[ais_m25_q] => 2
[ais_m17_d] => 5
[ais_m25_d] => 5
[ais_m17_percentil] => 55.778
[ais_m25_percentil] => 59.189
[jci] => 0.72
[jci_q] => 2
[jci_percentil] => 60.593
[ef] =>
[scopus_sjr] => 0.799
[scopus_sjr_q] => 2
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 0
[incites_open_access] => 1
[incites_jnci] => 0
[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
[incites_avg_percentile] => 0
[scival_citations_count] =>
[scival_fwci] => 0.835548
[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] => Low complexity subspace approach for unbiased frequency estimation of a complex single-tone
[popis_en] => We propose a single-tone frequency estimator of a one-dimensional complex signal in complex white Gaussian noise. The estimator is based on the subspace approach and the unitary transformation. Due to its low space and time-complexity, we name the estimator as Low complexity Unitary Principal-singular-vector Utilization for Model Analysis (LUPUMA). Regardless of the observation length, LUPUMA provides a uniform estimation variance over the whole frequency range, while achieving the lowest time-complexity among subspace methods. The proposed estimator asymptotically reaches the Cramér-Rao Lower Bound. For short observations, the signal-to-noise ratio threshold of LUPUMA corresponds to the threshold of the maximum likelihood estimator. The low space and time-complexity along with the stable and state-of-the-art estimation performance for short observations make LUPUMA an ideal candidate for applications with a limited number of signal samples, limited computational power, limited memory, and for applications that require rapid processing time (low latency).
[klicova_slova_en] => Frequency estimation; Complex single-tone; Subspace method; Short observation interval
[vysledek_datum] => 2023-11-14T00:00:00+01:00
)
[9] => Array
(
[vysledek_id] => 185701
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 149817
[vysledek_rok] => 2023
[nazev] => Character-based Writer Verification of Ancient Hebrew Square-script Manuscripts: On Edge-direction Feature
[nazev_orig] => Character-based Writer Verification of Ancient Hebrew Square-script Manuscripts: On Edge-direction Feature
[duvernost_udaju_id] => S
[popis] => Handwriting significantly contributes to the task of the writer identification and verification of modern and historical documents. This work developed a writer verification system for ancient Hebrew square-script manuscripts, mainly based on the edge-direction feature. Two configurations within the proposed system are carried out, i.e., character-based edge-direction feature extraction and extraction techniques of handwriting shape representation that may drive the system performance. A classification-based verification approach, utilizing Support Vector Machine (SVM) as the classifier, is employed to evaluate the performance of the two configurations. This study has confirmed that the skeleton-based shape representation technique outperforms the edge detection technique used in the predecessor approach. Furthermore, a character-based writer verification system provides the corresponding scholars and experts with an alphabetical investigation to identify the uniqueness of each writer’s handwriting.
[popis_orig] => Handwriting significantly contributes to the task of the writer identification and verification of modern and historical documents. This work developed a writer verification system for ancient Hebrew square-script manuscripts, mainly based on the edge-direction feature. Two configurations within the proposed system are carried out, i.e., character-based edge-direction feature extraction and extraction techniques of handwriting shape representation that may drive the system performance. A classification-based verification approach, utilizing Support Vector Machine (SVM) as the classifier, is employed to evaluate the performance of the two configurations. This study has confirmed that the skeleton-based shape representation technique outperforms the edge detection technique used in the predecessor approach. Furthermore, a character-based writer verification system provides the corresponding scholars and experts with an alphabetical investigation to identify the uniqueness of each writer’s handwriting.
[klicova_slova] => writer verification; edge-direction feature; edge detection; ancient manuscript
[klicova_slova_orig] => writer verification; edge-direction feature; edge detection; ancient manuscript
[url] => https://library.imaging.org/archiving/articles/20/1/32
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 2233
[schvaleno] => 2023-12-24
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => TOBING, T.; ŠKRABÁNEK, P.; YILDIRIM, S.; GEORGE, S.; ELGVIN, T.
[pocet_tvurcu] => 5
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.2352/issn.2168-3204.2023.20.1.32
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-0-89208-362-6
[identifikator_popis] => ISBN - Archiving Conference
[riv_dodavka_id] => 3367
[riv_dodavka_oznaceni] => RIV24-MSM-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => TOBING, T.; ŠKRABÁNEK, P.; YILDIRIM, S.; GEORGE, S.; ELGVIN, T. Character-based Writer Verification of Ancient Hebrew Square-script Manuscripts: On Edge-direction Feature. In Archiving Conference. 2023. p. 155-158. ISBN: 978-0-89208-362-6.
[citace_html] => TOBING, T.; ŠKRABÁNEK, P.; YILDIRIM, S.; GEORGE, S.; ELGVIN, T. Character-based Writer Verification of Ancient Hebrew Square-script Manuscripts: On Edge-direction Feature. In Archiving Conference. 2023. p. 155-158. ISBN: 978-0-89208-362-6.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT185701,
author="Tabita Lumban {Tobing} and Pavel {Škrabánek} and Sule {Yildirim} and Sony {George} and Torleif {Elgvin}",
title="Character-based Writer Verification of Ancient Hebrew Square-script Manuscripts: On Edge-direction Feature",
booktitle="Archiving Conference",
year="2023",
pages="155--158",
doi="10.2352/issn.2168-3204.2023.20.1.32",
isbn="978-0-89208-362-6",
url="https://library.imaging.org/archiving/articles/20/1/32"
}
[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] => Character-based Writer Verification of Ancient Hebrew Square-script Manuscripts: On Edge-direction Feature
[popis_en] => Handwriting significantly contributes to the task of the writer identification and verification of modern and historical documents. This work developed a writer verification system for ancient Hebrew square-script manuscripts, mainly based on the edge-direction feature. Two configurations within the proposed system are carried out, i.e., character-based edge-direction feature extraction and extraction techniques of handwriting shape representation that may drive the system performance. A classification-based verification approach, utilizing Support Vector Machine (SVM) as the classifier, is employed to evaluate the performance of the two configurations. This study has confirmed that the skeleton-based shape representation technique outperforms the edge detection technique used in the predecessor approach. Furthermore, a character-based writer verification system provides the corresponding scholars and experts with an alphabetical investigation to identify the uniqueness of each writer’s handwriting.
[klicova_slova_en] => writer verification; edge-direction feature; edge detection; ancient manuscript
[vysledek_datum] => 2023-06-23T00:00:00+02:00
)
[10] => Array
(
[vysledek_id] => 186908
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 150034
[vysledek_rok] => 2023
[nazev] => Chance-Constrained Optimization Formulation for Ship Conceptual Design: A Comparison of Metaheuristic Algorithms
[nazev_orig] => Chance-Constrained Optimization Formulation for Ship Conceptual Design: A Comparison of Metaheuristic Algorithms
[duvernost_udaju_id] => S
[popis] => This paper presents a new chance-constrained optimization (CCO) formulation for the bulk carrier conceptual design. The CCO problem is modeled through the scenario design approach. We conducted extensive numerical experiments comparing the convergence of both canonical and state-of-the-art metaheuristic algorithms on the original and CCO formulations and showed that the CCO formulation is substantially more difficult to solve. The two best-performing methods were both found to be differential evolution-based algorithms. We then provide an analysis of the resulting solutions in terms of the dependence of the distribution functions of the unit transportation costs and annual cargo capacity of the ship design on the probability of violating the chance constraints.
[popis_orig] => This paper presents a new chance-constrained optimization (CCO) formulation for the bulk carrier conceptual design. The CCO problem is modeled through the scenario design approach. We conducted extensive numerical experiments comparing the convergence of both canonical and state-of-the-art metaheuristic algorithms on the original and CCO formulations and showed that the CCO formulation is substantially more difficult to solve. The two best-performing methods were both found to be differential evolution-based algorithms. We then provide an analysis of the resulting solutions in terms of the dependence of the distribution functions of the unit transportation costs and annual cargo capacity of the ship design on the probability of violating the chance constraints.
[klicova_slova] => chance-constrained optimization; ship conceptual design; metaheuristics; evolutionary computation; numerical optimization
[klicova_slova_orig] => chance-constrained optimization; ship conceptual design; metaheuristics; evolutionary computation; numerical optimization
[url] => https://www.mdpi.com/2073-431X/12/11/225
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 11599
[schvaleno] => 2024-01-10
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] => 141753
[posledni_diagnostika] =>
[vycet_osob] => KŮDELA, J.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.3390/computers12110225
[kod_dspace] => 11012/245110
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 2073-431X
[identifikator_popis] => ISSN - Computers (CH)
[riv_dodavka_id] => 3367
[riv_dodavka_oznaceni] => RIV24-MSM-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 2
[diagnostika_pocet_chyba] => 1
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => KŮDELA, J. Chance-Constrained Optimization Formulation for Ship Conceptual Design: A Comparison of Metaheuristic Algorithms. Computers, 2023, vol. 12, no. 11, 17 p. ISSN: 2073-431X.
[citace_html] => KŮDELA, J. Chance-Constrained Optimization Formulation for Ship Conceptual Design: A Comparison of Metaheuristic Algorithms. Computers, 2023, vol. 12, no. 11, 17 p. ISSN: 2073-431X.
[citace_rtf] =>
[citace_bibtex] => @article{BUT186908,
author="Jakub {Kůdela}",
title="Chance-Constrained Optimization Formulation for Ship Conceptual Design: A Comparison of Metaheuristic Algorithms",
journal="Computers",
year="2023",
volume="12",
number="11",
pages="17",
doi="10.3390/computers12110225",
issn="2073-431X",
url="https://www.mdpi.com/2073-431X/12/11/225"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 2.6
[if_q] => 2
[if_m17_q] =>
[if_m25_q] => 2
[if_d] =>
[if_m17_d] =>
[if_m25_d] => 4
[if_percentil] => 53
[if_m17_percentil] =>
[if_m25_percentil] => 60.119
[ais] => 0.396
[ais_m17_q] =>
[ais_m25_q] => 3
[ais_m17_d] =>
[ais_m25_d] => 7
[ais_m17_percentil] =>
[ais_m25_percentil] => 35.178
[jci] => 0.56
[jci_q] => 3
[jci_percentil] => 42.899
[ef] =>
[scopus_sjr] => 0.616
[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] => 2
[scival_fwci] => 0.468788
[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] => Chance-Constrained Optimization Formulation for Ship Conceptual Design: A Comparison of Metaheuristic Algorithms
[popis_en] => This paper presents a new chance-constrained optimization (CCO) formulation for the bulk carrier conceptual design. The CCO problem is modeled through the scenario design approach. We conducted extensive numerical experiments comparing the convergence of both canonical and state-of-the-art metaheuristic algorithms on the original and CCO formulations and showed that the CCO formulation is substantially more difficult to solve. The two best-performing methods were both found to be differential evolution-based algorithms. We then provide an analysis of the resulting solutions in terms of the dependence of the distribution functions of the unit transportation costs and annual cargo capacity of the ship design on the probability of violating the chance constraints.
[klicova_slova_en] => chance-constrained optimization; ship conceptual design; metaheuristics; evolutionary computation; numerical optimization
[vysledek_datum] => 2023-11-03T00:00:00+01:00
)
[11] => Array
(
[vysledek_id] => 187108
[vysledek_druh_id] => ARTWOS
[ex_vysledek_id] => 150181
[vysledek_rok] => 2023
[nazev] => Solution approaches to inverse heat transfer problems with and without phase changes: A state-of-the-art review
[nazev_orig] => Solution approaches to inverse heat transfer problems with and without phase changes: A state-of-the-art review
[duvernost_udaju_id] => S
[popis] => Heat transfer problems (HTPs) with and without phase change are encountered in many areas of science and engineering. Some HTPs cannot be solved straightforwardly since certain heat transfer parameters are unknown. As a result, the need to find solutions to inverse HTPs arises. A number of approaches, methods, and algorithms for the solution of inverse HTPs have been developed and published in the past. Nonetheless, even the most recent handbooks dealing with inverse HTPs do not provide a comprehensive overview of the developments and advancements in this area (in particular the applications and comparisons of the methods). The present state-of-the-art review aims at filling this information gap and it also presents an overview of the most recent research works. Four classes of distinct methods and algorithms are addressed in detail; conventional (usually iterative and gradient-based) algorithms, nature-inspired meta-heuristic algorithms, techniques utilising artificial neural networks and machine learning, and algorithms based on fuzzy logic. The results obtained with the use of these methods are assessed and compared to each other. The intended contributions of the present review are twofold. Firstly, the review presents a comprehensive overview of the latest advancements and developments in the field of inverse HTPs, including cutting-edge research works. Secondly, it critically evaluates and compares the performance of different methods and algorithms, providing practical insights to researchers for the selection of suitable approaches to solve their specific inverse HTPs.
[popis_orig] => Heat transfer problems (HTPs) with and without phase change are encountered in many areas of science and engineering. Some HTPs cannot be solved straightforwardly since certain heat transfer parameters are unknown. As a result, the need to find solutions to inverse HTPs arises. A number of approaches, methods, and algorithms for the solution of inverse HTPs have been developed and published in the past. Nonetheless, even the most recent handbooks dealing with inverse HTPs do not provide a comprehensive overview of the developments and advancements in this area (in particular the applications and comparisons of the methods). The present state-of-the-art review aims at filling this information gap and it also presents an overview of the most recent research works. Four classes of distinct methods and algorithms are addressed in detail; conventional (usually iterative and gradient-based) algorithms, nature-inspired meta-heuristic algorithms, techniques utilising artificial neural networks and machine learning, and algorithms based on fuzzy logic. The results obtained with the use of these methods are assessed and compared to each other. The intended contributions of the present review are twofold. Firstly, the review presents a comprehensive overview of the latest advancements and developments in the field of inverse HTPs, including cutting-edge research works. Secondly, it critically evaluates and compares the performance of different methods and algorithms, providing practical insights to researchers for the selection of suitable approaches to solve their specific inverse HTPs.
[klicova_slova] => Inverse heat transfer; Phase change; Least square problem; Iterative algorithms; Meta-heuristics; Artificial neural networks; Fuzzy logic
[klicova_slova_orig] => Inverse heat transfer; Phase change; Least square problem; Iterative algorithms; Meta-heuristics; Artificial neural networks; Fuzzy logic
[url] => https://www.sciencedirect.com/science/article/pii/S0360544223013683
[oecd_obor_id] => 20303
[odpovedny_utvar_id] => 174
[odpovedny_utvar_nazev] => Energy Institute
[odpovedny_utvar_zkratka] => EI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 2325
[schvaleno] => 2024-02-12
[vykazovat_riv] => 1
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ZÁLEŠÁK, M.; KLIMEŠ, L.; CHARVÁT, P.; CABALKA, M.; KŮDELA, J.; MAUDER, T.
[pocet_tvurcu] => 6
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] => 10.1016/j.energy.2023.127974
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => WoS Article
[druh_popis] => Peer-reviewed article included in Web of Science database as as an “Article”, “Review” or “Letter”
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISSN 0360-5442
[identifikator_popis] => ISSN - Energy (GB)
[riv_dodavka_id] => 3314
[riv_dodavka_oznaceni] => RIV24-GA0-26210___
[riv_dodavka_rok] => 2024
[diagnostika_pocet] => 1
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 1
[citace_text] => ZÁLEŠÁK, M.; KLIMEŠ, L.; CHARVÁT, P.; CABALKA, M.; KŮDELA, J.; MAUDER, T. Solution approaches to inverse heat transfer problems with and without phase changes: A state-of-the-art review. Energy, 2023, vol. 278, no. 1, 27 p. ISSN: 0360-5442.
[citace_html] => ZÁLEŠÁK, M.; KLIMEŠ, L.; CHARVÁT, P.; CABALKA, M.; KŮDELA, J.; MAUDER, T. Solution approaches to inverse heat transfer problems with and without phase changes: A state-of-the-art review. Energy, 2023, vol. 278, no. 1, 27 p. ISSN: 0360-5442.
[citace_rtf] =>
[citace_bibtex] => @article{BUT187108,
author="Martin {Zálešák} and Lubomír {Klimeš} and Pavel {Charvát} and Matouš {Cabalka} and Jakub {Kůdela} and Tomáš {Mauder}",
title="Solution approaches to inverse heat transfer problems with and without phase changes: A state-of-the-art review",
journal="Energy",
year="2023",
volume="278",
number="1",
pages="27",
doi="10.1016/j.energy.2023.127974",
issn="0360-5442",
url="https://www.sciencedirect.com/science/article/pii/S0360544223013683"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] => 9
[if_q] => 1
[if_m17_q] => 1
[if_m25_q] => 1
[if_d] =>
[if_m17_d] => 1
[if_m25_d] => 1
[if_percentil] => 96.7
[if_m17_percentil] => 97.335
[if_m25_percentil] => 98.014
[ais] => 1.334
[ais_m17_q] => 1
[ais_m25_q] => 1
[ais_m17_d] => 1
[ais_m25_d] => 1
[ais_m17_percentil] => 95.455
[ais_m25_percentil] => 96.489
[jci] => 1.59
[jci_q] => 1
[jci_percentil] => 95.395
[ef] =>
[scopus_sjr] => 2.11
[scopus_sjr_q] => 1
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] => 28
[incites_open_access] => 0
[incites_jnci] => 1.23
[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.1076
[incites_avg_percentile] => 72.08645
[scival_citations_count] => 16
[scival_fwci] => 2.961077
[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] => 20303
[oecd_tree_podobor_nazev] => Thermodynamics
[poznamka_metriky] =>
[nazev_en] => Solution approaches to inverse heat transfer problems with and without phase changes: A state-of-the-art review
[popis_en] => Heat transfer problems (HTPs) with and without phase change are encountered in many areas of science and engineering. Some HTPs cannot be solved straightforwardly since certain heat transfer parameters are unknown. As a result, the need to find solutions to inverse HTPs arises. A number of approaches, methods, and algorithms for the solution of inverse HTPs have been developed and published in the past. Nonetheless, even the most recent handbooks dealing with inverse HTPs do not provide a comprehensive overview of the developments and advancements in this area (in particular the applications and comparisons of the methods). The present state-of-the-art review aims at filling this information gap and it also presents an overview of the most recent research works. Four classes of distinct methods and algorithms are addressed in detail; conventional (usually iterative and gradient-based) algorithms, nature-inspired meta-heuristic algorithms, techniques utilising artificial neural networks and machine learning, and algorithms based on fuzzy logic. The results obtained with the use of these methods are assessed and compared to each other. The intended contributions of the present review are twofold. Firstly, the review presents a comprehensive overview of the latest advancements and developments in the field of inverse HTPs, including cutting-edge research works. Secondly, it critically evaluates and compares the performance of different methods and algorithms, providing practical insights to researchers for the selection of suitable approaches to solve their specific inverse HTPs.
[klicova_slova_en] => Inverse heat transfer; Phase change; Least square problem; Iterative algorithms; Meta-heuristics; Artificial neural networks; Fuzzy logic
[vysledek_datum] => 2023-09-01T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 133
[count] => 12
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /en/veda/publikace/detail/
[base_page] => /en/veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => ŠEDA, M.
[title] => Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS
[typ] => PV
[year] => 2023
[id_vav] => 183950
)
[1] => Array
(
[quotations] => STRIPINIS, L.; KŮDELA, J.; PAULAVIČIUS, R.
[title] => DIRECTGOLib - DIRECT Global Optimization test problems Library
[typ] => AV
[year] => 2023
[id_vav] => 184031
)
[2] => Array
(
[quotations] => PORUBIAKOVÁ, O.; HAVLÍK, J.; INDU, M.; ŠEDŸ, M.; PŘEPECHALOVÁ, V.; BARTAS, M.; BIDULA, S.; ŠŤASTNÝ, J.; FOJTA, M.; BRÁZDA, V.
[title] => Variability of Inverted Repeats in All Available Genomes of Bacteria
[typ] => PV
[year] => 2023
[id_vav] => 184578
)
[3] => Array
(
[quotations] => MOURALOVÁ, K.
[title] => Zařízení pro upnutí obrobku při elektroerozivním drátovém řezání a sestava s tímto zařízením
[typ] => AV
[year] => 2023
[id_vav] => 184779
)
[4] => Array
(
[quotations] => ROUPEC, J.; TALPA, J.; PAVLAS, M.; ŠOMPLÁK, R.
[title] => Dokumentace k software nástroji pro vypracování dlouhodobé prognózy produkce odpadů v ČR
(Výsledek V12)
[typ] => OS
[year] => 2021
[id_vav] => 184820
)
[5] => Array
(
[quotations] => ROUPEC, J.; SZÁSZIOVÁ, L.; TALPA, J.; PAVLAS, M.; ŠOMPLÁK, R.
[title] => Manuál k vypracování dlouhodobé prognózy produkce odpadů v ČR (Výsledek V11)
[typ] => OS
[year] => 2021
[id_vav] => 184821
)
[6] => Array
(
[quotations] => ŠEDA, M.
[title] => The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation
[typ] => PV
[year] => 2023
[id_vav] => 185001
)
[7] => Array
(
[quotations] => KŮDELA, J.; SUJA, J.; ŠOMPLÁK, R.; PLUSKAL, J.; HRABEC, D.
[title] => Optimal control of combined heat and power station operation
[typ] => PV
[year] => 2024
[id_vav] => 185216
)
[8] => Array
(
[quotations] => POURAFZAL, A.; ŠKRABÁNEK, P.; CHEFFENA, M.; YILDIRIM, S.; ROI-TARAVELLA, T.
[title] => Low complexity subspace approach for unbiased frequency estimation of a complex single-tone
[typ] => PV
[year] => 2023
[id_vav] => 185653
)
[9] => Array
(
[quotations] => TOBING, T.; ŠKRABÁNEK, P.; YILDIRIM, S.; GEORGE, S.; ELGVIN, T.
[title] => Character-based Writer Verification of Ancient Hebrew Square-script Manuscripts: On Edge-direction Feature
[typ] => PV
[year] => 2023
[id_vav] => 185701
)
[10] => Array
(
[quotations] => KŮDELA, J.
[title] => Chance-Constrained Optimization Formulation for Ship Conceptual Design: A Comparison of Metaheuristic Algorithms
[typ] => PV
[year] => 2023
[id_vav] => 186908
)
[11] => Array
(
[quotations] => ZÁLEŠÁK, M.; KLIMEŠ, L.; CHARVÁT, P.; CABALKA, M.; KŮDELA, J.; MAUDER, T.
[title] => Solution approaches to inverse heat transfer problems with and without phase changes: A state-of-the-art review
[typ] => PV
[year] => 2023
[id_vav] => 187108
)
)
)