scispace - formally typeset
Search or ask a question
Institution

Brno University of Technology

EducationBrno, 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
More filters
Book ChapterDOI
01 Jan 2000
TL;DR: The aim of this paper is to propose the parallel version of this Bayesian Optimization Algorithm, where the optimization time decreases linearly with the number of processors.
Abstract: In the last few years there has been a growing interest in the field of Estimation of Distribution Algorithms (EDAs), where crossover and mutation genetic operators are replaced by probability estimation and sampling techniques. The Bayesian Optimization Algorithm incorporates methods for learning Bayesian networks and uses these to model the promising solutions and generate new ones. The aim of this paper is to propose the parallel version of this algorithm, where the optimization time decreases linearly with the number of processors. During the parallel construction of network, the explicit topological ordering of variables is used to keep the model acyclic. The performance of the optimization process seems to be not affected by this constraint and our version of algorithm was successfully tested for the discrete combinatorial problem represented by graph partitioning as well as for deceptive functions.

54 citations

Journal ArticleDOI
TL;DR: In this paper, the authors modeled the semiconductor as a resistor sandwiched between two identical head-to-head Schottky barriers and found that the voltage drop across the reverse-biased barrier is dominating at low bias voltage, and the dominant range depends on the value of the resistor.
Abstract: Symmetrical, non-linear and current–voltage (I–V) characteristics of a metal–semiconductor–metal (M-S-M) structure of two metallic Schottky contacts fabricated to a p-type semiconductor were modeled by treating the semiconductor as a resistor sandwiched between two identical head-to-head Schottky barriers. The voltage distributions along the M-S-M structure were numerically determined and found that the voltage drop across the reverse-biased Schottky barrier is dominating at the low bias voltage, and the dominant range depends on the value of the resistor of the semiconductor bulk. The field dependence of barrier height due to the image force was proposed to be the mechanism for the current through the M-S-M structure when the voltage drop across the reverse-biased barrier is dominating. The proposed model was applied to the I–V curves measured at different temperatures on low-resistivity p-type CdTe with Au contacts and the density of the effective acceptors calculated, and the zero-field Schottky barrier height and the Richardson constant were extracted using the activation energy method. The extracted parameters fitted well with that published for the same material structure.

54 citations

Proceedings ArticleDOI
01 Dec 2013
TL;DR: With this approach, it is possible to recover 40-55% of the difference between partially and fully transcribed data (3 to 5% absolute improvement over NN trained on supervised data only) and to recover 70-85% of automatically transcribed segments with the highest confidence.
Abstract: This paper presents bootstrapping approach for neural network training The neural networks serve as bottle-neck feature extractor for subsequent GMM-HMM recognizer The recognizer is also used for transcription and confidence assignment of untranscribed data Based on the confidence, segments are selected and mixed with supervised data and new NNs are trained With this approach, it is possible to recover 40-55% of the difference between partially and fully transcribed data (3 to 5% absolute improvement over NN trained on supervised data only) Using 70-85% of automatically transcribed segments with the highest confidence was found optimal to achieve this result

54 citations

Proceedings ArticleDOI
23 Jun 2013
TL;DR: Online, incremental solutions, which take full advantage of the sparseblock structure of the problems in robotics, are introduced and the implementation outperforms the state of the art SLAM implementations on all the tested datasets.
Abstract: Efficiently solving nonlinear least squares (NLS) problems is crucial for many applications in robotics. In online applications, solving the associated nolinear systems every step may become very expensive. This paper introduces online, incremental solutions, which take full advantage of the sparseblock structure of the problems in robotics. In general, the solution of the nonlinear system is approximated by incrementally solving a series of linearized problems. The most computationally demanding part is to assemble and solve the linearized system at each iteration. In our solution, this is mitigated by incrementally updating the factorized form of the linear system and changing the linearization point only if needed. The incremental updates are done using a resumed factorization only on the parts affected by the new information added to the system at every step. The sparsity of the factorized form directly affects the efficiency. In order to obtain an incremental factorization with persistent reduced fill-in, a new incremental ordering scheme is proposed. Furthermore, the implementation exploits the block structure of the problems and offers efficient solutions to manipulate block matrices, including a highly efficient Cholesky factorization on sparse block matrices. In this work, we focus our efforts on testing the method on SLAM applications, but the applicability of the technique remains general. The experimental results show that our implementation outperforms the state of the art SLAM implementations on all the tested datasets.

54 citations

Journal ArticleDOI
TL;DR: The results indicate that powdered or granulated metakaolin geopolymer might have practical potential for removal and possible recovery of from municipal wastewaters and the simple and low-energy preparation method for MK-GP further increases the significance of the results.
Abstract: Ammonium removal from municipal wastewater poses challenges with the commonly used biological processes. Especially at low wastewater temperatures, the process is frequently ineffective and difficult to control. One alternative is to use ion-exchange. In the present study, a novel ion-exchanger, metakaolin geopolymer (MK-GP), was prepared, characterised, and tested. Batch experiments with powdered MK-GP indicated that the maximum exchange capacities were 31.79, 28.77, and 17.75 mg/g in synthetic, screened, and pre-sedimented municipal wastewater, respectively, according to the Sips isotherm (R2 ≥ 0.91). Kinetics followed the pseudo-second-order rate equation in all cases (kp2 = 0.04–0.24 g mg−1 min−1, R2 ≥ 0.97) and the equilibrium was reached within 30–90 min. Granulated MK-GP proved to be suitable for a continuous column mode use. Granules were high-strength, porous at the surface and could be regenerated multiple times with NaCl/NaOH. A bench-scale pilot test further confirmed the feasibility o...

54 citations


Authors

Showing all 6383 results

NameH-indexPapersCitations
Georg Kresse111430244729
Patrik Schmuki10976352669
Michael Schmid8871530874
Robert M. Malina8869138277
Jiří Jaromír Klemeš6456514892
Alessandro Piccolo6228414332
René Kizek6167216554
George Danezis5920911516
Stevo Stević583749832
Edvin Lundgren5728610158
Franz Halberg5575015400
Vojtech Adam5561114442
Lukas Burget5325221375
Jan Cermak532389563
Hynek Hermansky5131714372
Network Information
Related Institutions (5)
Vienna University of Technology
49.3K papers, 1.3M citations

87% related

Polytechnic University of Catalonia
45.3K papers, 949.3K citations

86% related

Fraunhofer Society
40.1K papers, 820.8K citations

86% related

Polytechnic University of Milan
58.4K papers, 1.2M citations

86% related

Aalto University
32.6K papers, 829.6K citations

85% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202328
2022106
20211,053
20201,010
20191,214
20181,131