Institution
Brno University of Technology
Education•Brno, Czechia•
About: Brno University of Technology is a education organization based out in Brno, Czechia. It is known for research contribution in the topics: Computer science & Fracture mechanics. The organization has 6339 authors who have published 15226 publications receiving 194088 citations. The organization is also known as: Vysoké učení technické v Brně & BUT.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The results showed that the PV/WT/FC combination is the best combination in view of LSCS and LIPmax for supplying the RCC as a cost-effective and reliable combination and the use of hydrogen storage as a reserve power has well compensated the fluctuations in renewable sources production.
76 citations
••
TL;DR: A helical coupling plasma system for continuous surface treatment and modification (surface processing) of fiber bundles has been developed and tested for glass fibers as mentioned in this paper, which enables surface processing of single filaments and flat substrates as well.
Abstract: New helical coupling plasma system for continuous surface treatment and modification (surface processing) of fiber bundles has been developed and tested for glass fibers. The system enables surface processing of single filaments and flat substrates as well. Surface processed glass fibers and their bundles were examined as reinforcements for glass fiber/polyester composite systems. Processing of fibers comprised a surface treatment using argon gas and a surface modification using hexamethyldisiloxane and vinyltriethoxysilane monomers. Interfacial and interlaminar shear strengths of plasma processed glass fiber/polyester systems were compared with those of untreated and commercially sized fibers.
76 citations
••
TL;DR: This study proves that digital parameterization of pressure and altitude/tilt patterns in children with dysgraphia can be used for preliminary diagnosis of this writing disorder and estimation of difficulty level as determined by the handwriting proficiency screening questionnaire.
Abstract: Developmental dysgraphia, being observed among 10–30% of school-aged children, is a disturbance or difficulty in the production of written language that has to do with the mechanics of writing. The objective of this study is to propose a method that can be used for automated diagnosis of this disorder, as well as for estimation of difficulty level as determined by the handwriting proficiency screening questionnaire. We used a digitizing tablet to acquire handwriting and consequently employed a complex parameterization in order to quantify its kinematic aspects and hidden complexities. We also introduced a simple intrawriter normalization that increased dysgraphia discrimination and HPSQ estimation accuracies. Using a random forest classifier, we reached 96% sensitivity and specificity, while in the case of automated rating by the HPSQ total score, we reached 10% estimation error. This study proves that digital parameterization of pressure and altitude/tilt patterns in children with dysgraphia can be used for preliminary diagnosis of this writing disorder.
76 citations
••
TL;DR: In this article, the authors investigated the influence of heating rate on the formation of metakaolinite during the thermal treatment of kaolinite and showed that the activation energy required for the delamination, dehydroxylation and recombination of silica and alumina tetrahedron into metakolinite is 538, 195 and 143 kJ−mol−1, respectively.
75 citations
••
04 Apr 2005TL;DR: An automata-based approach is proposed for a symbolic verification of sequential, non-recursive programs manipulating 1-selector-linked structures such as traditional linked lists (possibly sharing their tails) and circular lists using the regular model checking framework.
Abstract: We address the problem of automatic verification of programs with dynamic data structures. We consider the case of sequential, non-recursive programs manipulating 1-selector-linked structures such as traditional linked lists (possibly sharing their tails) and circular lists. We propose an automata-based approach for a symbolic verification of such programs using the regular model checking framework. Given a program, the configurations of the memory are systematically encoded as words over a suitable finite alphabet, potentially infinite sets of configurations are represented by finite-state automata, and statements of the program are automatically translated into finite-state transducers defining regular relations between configurations. Then, abstract regular model checking techniques are applied in order to automatically check safety properties concerning the shape of the computed configurations or relating the input and output configurations. For this particular purpose, we introduce new techniques for the computation of abstractions of the set of reachable configurations and to refine these abstractions if spurious counterexamples are detected. Finally, we present experimental results showing the applicability of the approach and its efficiency.
75 citations
Authors
Showing all 6383 results
Name | H-index | Papers | Citations |
---|---|---|---|
Georg Kresse | 111 | 430 | 244729 |
Patrik Schmuki | 109 | 763 | 52669 |
Michael Schmid | 88 | 715 | 30874 |
Robert M. Malina | 88 | 691 | 38277 |
Jiří Jaromír Klemeš | 64 | 565 | 14892 |
Alessandro Piccolo | 62 | 284 | 14332 |
René Kizek | 61 | 672 | 16554 |
George Danezis | 59 | 209 | 11516 |
Stevo Stević | 58 | 374 | 9832 |
Edvin Lundgren | 57 | 286 | 10158 |
Franz Halberg | 55 | 750 | 15400 |
Vojtech Adam | 55 | 611 | 14442 |
Lukas Burget | 53 | 252 | 21375 |
Jan Cermak | 53 | 238 | 9563 |
Hynek Hermansky | 51 | 317 | 14372 |