Array
(
[page] => 49
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 23386
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 69337
[vysledek_rok] => 2007
[nazev] => Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method
[nazev_orig] => Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method
[duvernost_udaju_id] => S
[popis] => Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.
[popis_orig] => Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.
[klicova_slova] => Karnaugh map, Quine-McCluskey method, set covering problem, genetic algorithm
[klicova_slova_orig] => Karnaugh map, Quine-McCluskey method, set covering problem, genetic algorithm
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[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] => 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] =>
[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] => ŠEDA, M. Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method. In Proceedings of WASET International Conference on Computer, Electrical and Systems Science and Engineering CESSE 2007. Berlin (Germany): WASET, 2007. p. 256-260.
[citace_html] => ŠEDA, M. Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method. In Proceedings of WASET International Conference on Computer, Electrical and Systems Science and Engineering CESSE 2007. Berlin (Germany): WASET, 2007. p. 256-260.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT23386,
author="Miloš {Šeda}",
title="Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method",
booktitle="Proceedings of WASET International Conference on Computer, Electrical and Systems Science and Engineering CESSE 2007",
year="2007",
pages="256--260",
publisher="WASET",
address="Berlin (Germany)"
}
[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] => Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method
[popis_en] => Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.
[klicova_slova_en] => Karnaugh map, Quine-McCluskey method, set covering problem, genetic algorithm
[vysledek_datum] => 2007-08-01T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 23387
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 69338
[vysledek_rok] => 2007
[nazev] => Flexible Heuristics for Project Scheduling with Limited Resources
[nazev_orig] => Flexible Heuristics for Project Scheduling with Limited Resources
[duvernost_udaju_id] => S
[popis] => Resource-constrained project scheduling is an NP-hard optimisation problem. There are many different heuristic strategies how to shift activities in time when resource requirements exceed their available amounts. These strategies are frequently based on priorities of activities. In this paper, we assume that a suitable heuristic has been chosen to decide which activities should be performed immediately and which should be postponed and investigate the resource-constrained project scheduling problem (RCPSP) from the implementation point of view. We propose an efficient routine that, instead of shifting the activities, extends their duration. It makes it possible to break down their duration into active and sleeping subintervals. Then we can apply the classical Critical Path Method that needs only polynomial running time. This algorithm can simply be adapted for multiproject scheduling with limited resources.
[popis_orig] => Resource-constrained project scheduling is an NP-hard optimisation problem. There are many different heuristic strategies how to shift activities in time when resource requirements exceed their available amounts. These strategies are frequently based on priorities of activities. In this paper, we assume that a suitable heuristic has been chosen to decide which activities should be performed immediately and which should be postponed and investigate the resource-constrained project scheduling problem (RCPSP) from the implementation point of view. We propose an efficient routine that, instead of shifting the activities, extends their duration. It makes it possible to break down their duration into active and sleeping subintervals. Then we can apply the classical Critical Path Method that needs only polynomial running time. This algorithm can simply be adapted for multiproject scheduling with limited resources.
[klicova_slova] => project management, resource-constrained scheduling, NP-hard problem, CPM, heuristic method
[klicova_slova_orig] => project management, resource-constrained scheduling, NP-hard problem, CPM, heuristic method
[url] =>
[oecd_obor_id] => 10103
[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] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[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] => 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] =>
[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] => ŠEDA, M. Flexible Heuristics for Project Scheduling with Limited Resources. In Proceedings of WASET International Conference on Computer, Electrical and Systems Science and Engineering CESSE 2007. Nice (France): WASET, 2007. p. 170-174.
[citace_html] => ŠEDA, M. Flexible Heuristics for Project Scheduling with Limited Resources. In Proceedings of WASET International Conference on Computer, Electrical and Systems Science and Engineering CESSE 2007. Nice (France): WASET, 2007. p. 170-174.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT23387,
author="Miloš {Šeda}",
title="Flexible Heuristics for Project Scheduling with Limited Resources",
booktitle="Proceedings of WASET International Conference on Computer, Electrical and Systems Science and Engineering CESSE 2007",
year="2007",
pages="170--174",
publisher="WASET",
address="Nice (France)"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Flexible Heuristics for Project Scheduling with Limited Resources
[popis_en] => Resource-constrained project scheduling is an NP-hard optimisation problem. There are many different heuristic strategies how to shift activities in time when resource requirements exceed their available amounts. These strategies are frequently based on priorities of activities. In this paper, we assume that a suitable heuristic has been chosen to decide which activities should be performed immediately and which should be postponed and investigate the resource-constrained project scheduling problem (RCPSP) from the implementation point of view. We propose an efficient routine that, instead of shifting the activities, extends their duration. It makes it possible to break down their duration into active and sleeping subintervals. Then we can apply the classical Critical Path Method that needs only polynomial running time. This algorithm can simply be adapted for multiproject scheduling with limited resources.
[klicova_slova_en] => project management, resource-constrained scheduling, NP-hard problem, CPM, heuristic method
[vysledek_datum] => 2007-10-01T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 23814
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 68140
[vysledek_rok] => 2007
[nazev] => Novel types of equipment for off-gas cleaning
[nazev_orig] => Novel types of equipment for off-gas cleaning
[duvernost_udaju_id] => S
[popis] => This paper describes three new technologies/equipments, which effectively reduce the amount of pollutants in off-gases produced by incineration plants, refineries or various chemical and similar plants. These equipments have low investment and operational costs and effectively remove pollutants.
[popis_orig] => This paper describes three new technologies/equipments, which effectively reduce the amount of pollutants in off-gases produced by incineration plants, refineries or various chemical and similar plants. These equipments have low investment and operational costs and effectively remove pollutants.
[klicova_slova] => waste gas, off-gas, flue gas, air pollutants, emission reduction
[klicova_slova_orig] => waste gas, off-gas, flue gas, air pollutants, emission reduction
[url] =>
[oecd_obor_id] =>
[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] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => DVOŘÁK, R.; MÁŠA, V.; CHLÁPEK, P.; SOLODYANKIN, K.
[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] => 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-444-53158-2
[identifikator_popis] => ISBN - Computer-aided chemical engineering, 24
[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] => DVOŘÁK, R.; MÁŠA, V.; CHLÁPEK, P.; SOLODYANKIN, K. Novel types of equipment for off-gas cleaning. In Computer-aided chemical engineering, 24. Bukurešť, Rumunsko: 2007. p. 1-6. ISBN: 978-0-444-53158-2.
[citace_html] => DVOŘÁK, R.; MÁŠA, V.; CHLÁPEK, P.; SOLODYANKIN, K. Novel types of equipment for off-gas cleaning. In Computer-aided chemical engineering, 24. Bukurešť, Rumunsko: 2007. p. 1-6. ISBN: 978-0-444-53158-2.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT23814,
author="Radek {Dvořák} and Vítězslav {Máša} and Petr {Chlápek} and Kirill {Solodyankin}",
title="Novel types of equipment for off-gas cleaning",
booktitle="Computer-aided chemical engineering, 24",
year="2007",
pages="1--6",
address="Bukurešť, Rumunsko",
isbn="978-0-444-53158-2"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] =>
[oecd_tree_oblast_nazev] =>
[oecd_tree_obor_id] =>
[oecd_tree_obor_nazev] =>
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => Novel types of equipment for off-gas cleaning
[popis_en] => This paper describes three new technologies/equipments, which effectively reduce the amount of pollutants in off-gases produced by incineration plants, refineries or various chemical and similar plants. These equipments have low investment and operational costs and effectively remove pollutants.
[klicova_slova_en] => waste gas, off-gas, flue gas, air pollutants, emission reduction
[vysledek_datum] => 2007-05-27T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 23929
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 69667
[vysledek_rok] => 2007
[nazev] => Pressure Calculation from Experimentally Evaluated Lubricant Thickness within EHL Contacts
[nazev_orig] => Pressure Calculation from Experimentally Evaluated Lubricant Thickness within EHL Contacts
[duvernost_udaju_id] => S
[popis] => This paper is concerned with elastohydrodynamic lubrication, especially determination of lubricant film thickness and contact pressure within a point contact of friction surfaces of machine parts. A new solution technique for numerical determination of contact pressure is introduced. Direct measurement of contact pressure is very difficult. Hence, input data of lubricant film thickness obtained from the experiment based on colorimetric interferometry are used for calculation of pressure using the inverse elasticity theory. The algorithm is enhanced by convolution in order to increase calculation speed. The approach gives credible results on smooth contact and it is currently extended to enable the study of contact of friction surfaces with dents.
[popis_orig] => This paper is concerned with elastohydrodynamic lubrication, especially determination of lubricant film thickness and contact pressure within a point contact of friction surfaces of machine parts. A new solution technique for numerical determination of contact pressure is introduced. Direct measurement of contact pressure is very difficult. Hence, input data of lubricant film thickness obtained from the experiment based on colorimetric interferometry are used for calculation of pressure using the inverse elasticity theory. The algorithm is enhanced by convolution in order to increase calculation speed. The approach gives credible results on smooth contact and it is currently extended to enable the study of contact of friction surfaces with dents.
[klicova_slova] => Tribology, lubrication, lubricant film thickness, contact pressure, dent, inverse elasticity theory
[klicova_slova_orig] => Tribology, lubrication, lubricant film thickness, contact pressure, dent, inverse elasticity theory
[url] =>
[oecd_obor_id] => 20301
[odpovedny_utvar_id] => 168
[odpovedny_utvar_nazev] => Institute of Machine and Industrial Design
[odpovedny_utvar_zkratka] => IMID
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => VRBKA, M.; VAVERKA, M.; POLIŠČUK, R.; KŘUPKA, I.; HARTL, M.
[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] => 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-7918-4810-4
[identifikator_popis] => ISBN - Proceedings of the ASME/STLE International Joint Tribology Conference 2007
[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] => VRBKA, M.; VAVERKA, M.; POLIŠČUK, R.; KŘUPKA, I.; HARTL, M. Pressure Calculation from Experimentally Evaluated Lubricant Thickness within EHL Contacts. In Proceedings of the ASME/STLE International Joint Tribology Conference 2007. STLE/ASME. San Diego, California, USA: ASME/STLE, 2007. p. 1-3. ISBN: 978-0-7918-4810-4.
[citace_html] => VRBKA, M.; VAVERKA, M.; POLIŠČUK, R.; KŘUPKA, I.; HARTL, M. Pressure Calculation from Experimentally Evaluated Lubricant Thickness within EHL Contacts. In Proceedings of the ASME/STLE International Joint Tribology Conference 2007. STLE/ASME. San Diego, California, USA: ASME/STLE, 2007. p. 1-3. ISBN: 978-0-7918-4810-4.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT23929,
author="Martin {Vrbka} and Michal {Vaverka} and Radek {Poliščuk} and Ivan {Křupka} and Martin {Hartl}",
title="Pressure Calculation from Experimentally Evaluated Lubricant Thickness within EHL Contacts",
booktitle="Proceedings of the ASME/STLE International Joint Tribology Conference 2007",
year="2007",
series="STLE/ASME",
number="1",
pages="1--3",
publisher="ASME/STLE",
address="San Diego, California, USA",
isbn="978-0-7918-4810-4"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20300
[oecd_tree_obor_nazev] => 2.3 Mechanical engineering
[oecd_tree_podobor_id] => 20301
[oecd_tree_podobor_nazev] => Mechanical engineering
[poznamka_metriky] =>
[nazev_en] => Pressure Calculation from Experimentally Evaluated Lubricant Thickness within EHL Contacts
[popis_en] => This paper is concerned with elastohydrodynamic lubrication, especially determination of lubricant film thickness and contact pressure within a point contact of friction surfaces of machine parts. A new solution technique for numerical determination of contact pressure is introduced. Direct measurement of contact pressure is very difficult. Hence, input data of lubricant film thickness obtained from the experiment based on colorimetric interferometry are used for calculation of pressure using the inverse elasticity theory. The algorithm is enhanced by convolution in order to increase calculation speed. The approach gives credible results on smooth contact and it is currently extended to enable the study of contact of friction surfaces with dents.
[klicova_slova_en] => Tribology, lubrication, lubricant film thickness, contact pressure, dent, inverse elasticity theory
[vysledek_datum] => 2007-10-22T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 23994
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 68235
[vysledek_rok] => 2007
[nazev] => DETERMINATION OF PROBABILISTIC MODEL OF ROBOT MOTION
[nazev_orig] => DETERMINATION OF PROBABILISTIC MODEL OF ROBOT MOTION
[duvernost_udaju_id] => S
[popis] => This paper deals with the probabilistic model of wheel robot motion. Such probabilistic model is often used in navigation algorithms for prediction of the real position of the robot. We prepared a number of experiments with real robot called Bender and results were used for the verification of simulation model. The paper provides detail information about preparation and performing the experiments in real world environment.
[popis_orig] => This paper deals with the probabilistic model of wheel robot motion. Such probabilistic model is often used in navigation algorithms for prediction of the real position of the robot. We prepared a number of experiments with real robot called Bender and results were used for the verification of simulation model. The paper provides detail information about preparation and performing the experiments in real world environment.
[klicova_slova] => probabilistic model, mobile robotics, navigation
[klicova_slova_orig] => probabilistic model, mobile robotics, navigation
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => VĚCHET, S.; KREJSA, J.; ONDROUŠEK, V.
[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] => 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-80-87012-06-2
[identifikator_popis] => ISBN - Engineering Mechanics 2007
[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] => VĚCHET, S.; KREJSA, J.; ONDROUŠEK, V. DETERMINATION OF PROBABILISTIC MODEL OF ROBOT MOTION. In Engineering Mechanics 2007. 2007. Praha: Institute of Thermomechanics, Academy of Sciences of the Czech Republic, v.v.i., Prague, 2007. p. 311-312. ISBN: 978-80-87012-06-2.
[citace_html] => VĚCHET, S.; KREJSA, J.; ONDROUŠEK, V. DETERMINATION OF PROBABILISTIC MODEL OF ROBOT MOTION. In Engineering Mechanics 2007. 2007. Praha: Institute of Thermomechanics, Academy of Sciences of the Czech Republic, v.v.i., Prague, 2007. p. 311-312. ISBN: 978-80-87012-06-2.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT23994,
author="Stanislav {Věchet} and Jiří {Krejsa} and Vít {Ondroušek}",
title="DETERMINATION OF PROBABILISTIC MODEL OF ROBOT MOTION",
booktitle="Engineering Mechanics 2007",
year="2007",
series="2007",
number="1",
pages="311--312",
publisher="Institute of Thermomechanics, Academy of Sciences of the Czech Republic, v.v.i., Prague",
address="Praha",
isbn="978-80-87012-06-2"
}
[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] => DETERMINATION OF PROBABILISTIC MODEL OF ROBOT MOTION
[popis_en] => This paper deals with the probabilistic model of wheel robot motion. Such probabilistic model is often used in navigation algorithms for prediction of the real position of the robot. We prepared a number of experiments with real robot called Bender and results were used for the verification of simulation model. The paper provides detail information about preparation and performing the experiments in real world environment.
[klicova_slova_en] => probabilistic model, mobile robotics, navigation
[vysledek_datum] => 2007-05-14T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 24033
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 69002
[vysledek_rok] => 2007
[nazev] => ARTIFICIAL INTELLIGENCE TOOLS FOR E-LEARNING
[nazev_orig] => ARTIFICIAL INTELLIGENCE TOOLS FOR E-LEARNING
[duvernost_udaju_id] => S
[popis] => Modern methods of E-learning are integral part of the courses arranged by Dept. of Control and Instrumentation, FEEC BUT. Especially, in the artificial intelligence courses the advantages of blended learning come out. This paper describes the software tools co-developed by the students within the courses, used as an integral part of blended learning.
[popis_orig] => Modern methods of E-learning are integral part of the courses arranged by Dept. of Control and Instrumentation, FEEC BUT. Especially, in the artificial intelligence courses the advantages of blended learning come out. This paper describes the software tools co-developed by the students within the courses, used as an integral part of blended learning.
[klicova_slova] => E-learning; education tools; artificial intelligence; expert systems; neural networks; evolutionary algorithms
[klicova_slova_orig] => E-learning; education tools; artificial intelligence; expert systems; neural networks; evolutionary algorithms
[url] =>
[oecd_obor_id] => 20204
[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] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => PANÁČEK, T.; VALENTA, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (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-80-214-3473-8
[identifikator_popis] => ISBN - Proceedings of 13th International Conference on Soft Computing (MENDEL 2007)
[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] => PANÁČEK, T.; VALENTA, J. ARTIFICIAL INTELLIGENCE TOOLS FOR E-LEARNING. In Proceedings of 13th International Conference on Soft Computing (MENDEL 2007). 2007. p. 147-150. ISBN: 978-80-214-3473-8.
[citace_html] => PANÁČEK, T.; VALENTA, J. ARTIFICIAL INTELLIGENCE TOOLS FOR E-LEARNING. In Proceedings of 13th International Conference on Soft Computing (MENDEL 2007). 2007. p. 147-150. ISBN: 978-80-214-3473-8.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT24033,
author="Tomáš {Panáček} and Jan {Valenta}",
title="ARTIFICIAL INTELLIGENCE TOOLS FOR E-LEARNING",
booktitle="Proceedings of 13th International Conference on Soft Computing (MENDEL 2007)",
year="2007",
number="1",
pages="147--150",
isbn="978-80-214-3473-8"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => ARTIFICIAL INTELLIGENCE TOOLS FOR E-LEARNING
[popis_en] => Modern methods of E-learning are integral part of the courses arranged by Dept. of Control and Instrumentation, FEEC BUT. Especially, in the artificial intelligence courses the advantages of blended learning come out. This paper describes the software tools co-developed by the students within the courses, used as an integral part of blended learning.
[klicova_slova_en] => E-learning; education tools; artificial intelligence; expert systems; neural networks; evolutionary algorithms
[vysledek_datum] => 2007-07-03T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 24048
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 69025
[vysledek_rok] => 2007
[nazev] => CONTROL DESIGN OF ACTIVE MAGNETIC BEARING BY GENETIC ALGORITHMS
[nazev_orig] => CONTROL DESIGN OF ACTIVE MAGNETIC BEARING BY GENETIC ALGORITHMS
[duvernost_udaju_id] => S
[popis] => Control design of rotating shaft levitated by active magnetic bearing is described in this contribution. Genetic algorithm is used to design controller parameters. Dependence of controller parameters on rotational speed of shaft is studied.
[popis_orig] => Control design of rotating shaft levitated by active magnetic bearing is described in this contribution. Genetic algorithm is used to design controller parameters. Dependence of controller parameters on rotational speed of shaft is studied.
[klicova_slova] => active magnetic bearing control genetic algorithms
[klicova_slova_orig] => active magnetic bearing control genetic algorithms
[url] =>
[oecd_obor_id] => 20204
[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] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => TUREK, M.; BŘEZINA, T.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (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-80-87012-06-2
[identifikator_popis] => ISBN - Engineering Mechanics 2007 - Book of Extended Abstracts
[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] => TUREK, M.; BŘEZINA, T. CONTROL DESIGN OF ACTIVE MAGNETIC BEARING BY GENETIC ALGORITHMS. In Engineering Mechanics 2007 - Book of Extended Abstracts. 2007. p. 295-296. ISBN: 978-80-87012-06-2.
[citace_html] => TUREK, M.; BŘEZINA, T. CONTROL DESIGN OF ACTIVE MAGNETIC BEARING BY GENETIC ALGORITHMS. In Engineering Mechanics 2007 - Book of Extended Abstracts. 2007. p. 295-296. ISBN: 978-80-87012-06-2.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT24048,
author="Milan {Turek} and Tomáš {Březina}",
title="CONTROL DESIGN OF ACTIVE MAGNETIC BEARING BY GENETIC ALGORITHMS",
booktitle="Engineering Mechanics 2007 - Book of Extended Abstracts",
year="2007",
pages="295--296",
isbn="978-80-87012-06-2"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => CONTROL DESIGN OF ACTIVE MAGNETIC BEARING BY GENETIC ALGORITHMS
[popis_en] => Control design of rotating shaft levitated by active magnetic bearing is described in this contribution. Genetic algorithm is used to design controller parameters. Dependence of controller parameters on rotational speed of shaft is studied.
[klicova_slova_en] => active magnetic bearing control genetic algorithms
[vysledek_datum] => 2007-05-14T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 24078
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 63094
[vysledek_rok] => 2006
[nazev] => Back-Propagation and K-Means Algorithms Comparison
[nazev_orig] => Back-Propagation and K-Means Algorithms Comparison
[duvernost_udaju_id] => S
[popis] => The paper describes the application of algorithms for object classification by using artificial neural networks. The MLP (Multi Layer Perceptron) and RBF (Radial Basis Function) neural networks were used. We compared results obtained by a using of learning algorithms Back-Propagation (BP) and K-Means. The real technological scene for object classification was simulated with digitization of two-dimensional pictures. The principles and algorithms given below have been used in an application that was developed at Brno University of Technology.
[popis_orig] => The paper describes the application of algorithms for object classification by using artificial neural networks. The MLP (Multi Layer Perceptron) and RBF (Radial Basis Function) neural networks were used. We compared results obtained by a using of learning algorithms Back-Propagation (BP) and K-Means. The real technological scene for object classification was simulated with digitization of two-dimensional pictures. The principles and algorithms given below have been used in an application that was developed at Brno University of Technology.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠŤASTNÝ, J.; ŠKORPIL, V.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (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] =>
[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] => ŠŤASTNÝ, J.; ŠKORPIL, V. Back-Propagation and K-Means Algorithms Comparison. In International Conference on Signal Processing ICSP06. Guilin, China: The Chinese Institute of Electronics (CIE), 2006. 4 p.
[citace_html] => ŠŤASTNÝ, J.; ŠKORPIL, V. Back-Propagation and K-Means Algorithms Comparison. In International Conference on Signal Processing ICSP06. Guilin, China: The Chinese Institute of Electronics (CIE), 2006. 4 p.
[citace_rtf] =>
[citace_bibtex] =>
[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] => Back-Propagation and K-Means Algorithms Comparison
[popis_en] => The paper describes the application of algorithms for object classification by using artificial neural networks. The MLP (Multi Layer Perceptron) and RBF (Radial Basis Function) neural networks were used. We compared results obtained by a using of learning algorithms Back-Propagation (BP) and K-Means. The real technological scene for object classification was simulated with digitization of two-dimensional pictures. The principles and algorithms given below have been used in an application that was developed at Brno University of Technology.
[klicova_slova_en] => Image Processing, Back-Propagation Algorithm, K-Means Algorithm
[vysledek_datum] => 2006-11-16T00:00:00+01:00
)
[8] => Array
(
[vysledek_id] => 24079
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 63096
[vysledek_rok] => 2006
[nazev] => Using Case-Based Reasoning and Graph Searching Algorithms for Mobile Robot Path Planning
[nazev_orig] => Using Case-Based Reasoning and Graph Searching Algorithms for Mobile Robot Path Planning
[duvernost_udaju_id] => S
[popis] => In this paper, we deal with mobile robot path planning in a two-dimensional grid in which known static obstacles and hazardous areas are defined. The aim of the path planning is searching for a path from a start to a goal position without collisions with known obstacles minimizing length, difficulty and risk of the path. We propose path planning methods based on using a case graph, which is a structure composed of segments of already used paths. These methods try to construct a new path combining paths in the case graph with paths found by the A* algorithm. We present results of comparing proposed methods and methods based only on using Dijkstra's algorithm and the A* algorithm. We also propose modifications of these algorithms for nonholonomic robots.
[popis_orig] => In this paper, we deal with mobile robot path planning in a two-dimensional grid in which known static obstacles and hazardous areas are defined. The aim of the path planning is searching for a path from a start to a goal position without collisions with known obstacles minimizing length, difficulty and risk of the path. We propose path planning methods based on using a case graph, which is a structure composed of segments of already used paths. These methods try to construct a new path combining paths in the case graph with paths found by the A* algorithm. We present results of comparing proposed methods and methods based only on using Dijkstra's algorithm and the A* algorithm. We also propose modifications of these algorithms for nonholonomic robots.
[klicova_slova] => mobile robot, path planning, case-based reasoning, graph searching algorithms, nonholonomic constraints
[klicova_slova_orig] => mobile robot, path planning, case-based reasoning, graph searching algorithms, nonholonomic constraints
[url] =>
[oecd_obor_id] => 20204
[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] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => DVOŘÁK, J.; KRČEK, P.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => 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 80-214-3195-4
[identifikator_popis] => ISBN - Proceedings of the 12th International Conference on Soft Computing MENDEL 2006
[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] => DVOŘÁK, J.; KRČEK, P. Using Case-Based Reasoning and Graph Searching Algorithms for Mobile Robot Path Planning. In Proceedings of the 12th International Conference on Soft Computing MENDEL 2006. Brno: Brno University of Technology, Faculty of Mechanical Engineering, 2006. p. 151-156. ISBN: 80-214-3195-4.
[citace_html] => DVOŘÁK, J.; KRČEK, P. Using Case-Based Reasoning and Graph Searching Algorithms for Mobile Robot Path Planning. In Proceedings of the 12th International Conference on Soft Computing MENDEL 2006. Brno: Brno University of Technology, Faculty of Mechanical Engineering, 2006. p. 151-156. ISBN: 80-214-3195-4.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT24079,
author="Jiří {Dvořák} and Petr {Krček}",
title="Using Case-Based Reasoning and Graph Searching Algorithms for Mobile Robot Path Planning",
booktitle="Proceedings of the 12th International Conference on Soft Computing MENDEL 2006",
year="2006",
number="1",
pages="151--156",
publisher="Brno University of Technology, Faculty of Mechanical Engineering",
address="Brno",
isbn="80-214-3195-4"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => Using Case-Based Reasoning and Graph Searching Algorithms for Mobile Robot Path Planning
[popis_en] => In this paper, we deal with mobile robot path planning in a two-dimensional grid in which known static obstacles and hazardous areas are defined. The aim of the path planning is searching for a path from a start to a goal position without collisions with known obstacles minimizing length, difficulty and risk of the path. We propose path planning methods based on using a case graph, which is a structure composed of segments of already used paths. These methods try to construct a new path combining paths in the case graph with paths found by the A* algorithm. We present results of comparing proposed methods and methods based only on using Dijkstra's algorithm and the A* algorithm. We also propose modifications of these algorithms for nonholonomic robots.
[klicova_slova_en] => mobile robot, path planning, case-based reasoning, graph searching algorithms, nonholonomic constraints
[vysledek_datum] => 2006-05-30T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 49
[count] => 9
[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] => Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method
[typ] => PV
[year] => 2007
[id_vav] => 23386
)
[1] => Array
(
[quotations] => ŠEDA, M.
[title] => Flexible Heuristics for Project Scheduling with Limited Resources
[typ] => PV
[year] => 2007
[id_vav] => 23387
)
[2] => Array
(
[quotations] => DVOŘÁK, R.; MÁŠA, V.; CHLÁPEK, P.; SOLODYANKIN, K.
[title] => Novel types of equipment for off-gas cleaning
[typ] => PV
[year] => 2007
[id_vav] => 23814
)
[3] => Array
(
[quotations] => VRBKA, M.; VAVERKA, M.; POLIŠČUK, R.; KŘUPKA, I.; HARTL, M.
[title] => Pressure Calculation from Experimentally Evaluated Lubricant Thickness within EHL Contacts
[typ] => PV
[year] => 2007
[id_vav] => 23929
)
[4] => Array
(
[quotations] => VĚCHET, S.; KREJSA, J.; ONDROUŠEK, V.
[title] => DETERMINATION OF PROBABILISTIC MODEL OF ROBOT MOTION
[typ] => PV
[year] => 2007
[id_vav] => 23994
)
[5] => Array
(
[quotations] => PANÁČEK, T.; VALENTA, J.
[title] => ARTIFICIAL INTELLIGENCE TOOLS FOR E-LEARNING
[typ] => PV
[year] => 2007
[id_vav] => 24033
)
[6] => Array
(
[quotations] => TUREK, M.; BŘEZINA, T.
[title] => CONTROL DESIGN OF ACTIVE MAGNETIC BEARING BY GENETIC ALGORITHMS
[typ] => PV
[year] => 2007
[id_vav] => 24048
)
[7] => Array
(
[quotations] => ŠŤASTNÝ, J.; ŠKORPIL, V.
[title] => Back-Propagation and K-Means Algorithms Comparison
[typ] => PV
[year] => 2006
[id_vav] => 24078
)
[8] => Array
(
[quotations] => DVOŘÁK, J.; KRČEK, P.
[title] => Using Case-Based Reasoning and Graph Searching Algorithms for Mobile Robot Path Planning
[typ] => PV
[year] => 2006
[id_vav] => 24079
)
)
)