scispace - formally typeset
Search or ask a question
Institution

University of West Bohemia

EducationPilsen, Czechia
About: University of West Bohemia is a education organization based out in Pilsen, Czechia. It is known for research contribution in the topics: Sputter deposition & Band gap. The organization has 2587 authors who have published 7207 publications receiving 78537 citations. The organization is also known as: Západočeská Univerzita v Plzni & ZČU.


Papers
More filters
Book ChapterDOI
13 Sep 2000
TL;DR: Reports on perplexities, OOV rates and some speech recognition results obtained with new language model for language modelling of highly inflectional languages such as Czech, Russian an other Slavic languages.
Abstract: In our paper we propose new technique for language modelling of highly inflectional languages such as Czech, Russian an other Slavic languages. Our aim is to alleviate main problem encountered in these languages, which is enormous vocabulary growth caused by great number of different word forms derived from one word (lemma). We reduced the size of the vocabulary by decomposing words into stems and endings and storing these sub-word units (morphemes) in the vocabulary separately. Then we trained morpheme based language model on the decomposed corpus. This paper reports perplexities, OOV rates and some speech recognition results obtained with new language model.

35 citations

Journal ArticleDOI
TL;DR: In this article, the authors investigated the extraction of micro amounts of europium and americium by a nitrobenzene solution of hydrogen dicarbollylcobaltate (H+B−) in the presence of dibutyl diethyl carbamoylmethylene phosphonate (DBDECMP, L) has been investigated.
Abstract: Extraction of microamounts of europium and americium by a nitrobenzene solution of hydrogen dicarbollylcobaltate (H+B−) in the presence of dibutyl diethylcarbamoylmethylene phosphonate (DBDECMP, L) has been investigated The equilibrium data have been explained assuming that the complexes HL+, HL22+ ML33+ and ML43+ (M3+ = Eu3+, Am3+) are extracted into the organic phase The values of extraction and stability constants of the species in nitrobenzene saturated with water have been determined

35 citations

Journal ArticleDOI
TL;DR: Progress on closures made in the past (more than) twenty years is surveyed, finding that many authors developed other closure concepts for a variety of graph properties, or used closure techniques as a tool for obtaining deeper sufficiency results with respect to these properties.
Abstract: In this paper we survey results of the following type (known as closure results). Let P be a graph property, and let C(u,v) be a condition on two nonadjacent vertices u and v of a graph G. Then G+uv has property P if and only if G has property P. The first and now well-known result of this type was established by Bondy and Chvatal in a paper published in 1976: If u and v are two nonadjacent vertices with degree sum n in a graph G on n vertices, then G+uv is hamiltonian if and only if G is hamiltonian. Based on this result, they defined the n-closure cln (G) of a graph G on n vertices as the graph obtained from G by recursively joining pairs of nonadjacent vertices with degree sum n until no such pair remains. They showed that cln(G) is well-defined, and that G is hamiltonian if and only if cln(G) is hamiltonian. Moreover, they showed that cln(G) can be obtained by a polynomial algorithm, and that a Hamilton cycle in cln(G) can be transformed into a Hamilton cycle of G by a polynomial algorithm. As a consequence, for any graph G with cln(G)=Kn (and n≥3), a Hamilton cycle can be found in polynomial time, whereas this problem is NP-hard for general graphs. All classic sufficient degree conditions for hamiltonicity imply a complete n-closure, so the closure result yields a common generalization as well as an easy proof for these conditions. In their first paper on closures, Bondy and Chvatal gave similar closure results based on degree sum conditions for nonadjacent vertices for other graph properties. Inspired by their first results, many authors developed other closure concepts for a variety of graph properties, or used closure techniques as a tool for obtaining deeper sufficiency results with respect to these properties. Our aim is to survey this progress on closures made in the past (more than) twenty years.

35 citations

Journal ArticleDOI
TL;DR: In this paper, a self-standing humidity sensor was fabricated from sugarcane side streams using cellulose nanofibril (CNF) and polyethylene glycol (PEG) to improve the ductility of CNF films.
Abstract: Cellulose nanofibril (CNF) films were prepared from side streams generated by the sugarcane industry, that is, bagasse. Two fractionation processes were utilized for comparison purposes: (1) soda and (2) hot water and soda pretreatments. 2,2,6,6‐Tetramethylpiperidinyl‐1‐oxyl‐mediated oxidation was applied to facilitate the nanofibrillation of the bagasse fibers. Poly(ethylene glycol) (PEG) was chosen as plasticizer to improve the ductility of CNF films. The neat CNF and biocomposite films (CNF and 40% PEG) were used for fabrication of self‐standing humidity sensors. CNF‐based humidity sensors exhibited high change of impedance, within four orders of magnitude, in response to relative humidity (RH) from 20 to 90%. The use of plasticizer had an impact on sensor kinetics. While the biocomposite film sensors showed slightly longer response time, the recovery time of these plasticized sensors was two times shorter in comparison to sensors without PEG. This study demonstrated that agroindustrial side streams can form the basis for high‐end applications such as humidity sensors, with potential for, for example, packaging and wound dressing applications.

35 citations

Book ChapterDOI
25 Oct 2015
TL;DR: A novel face database composed of face images taken in real-world conditions and freely available for research purposes and to show the recognition accuracy of several state-of-the-art face recognition approaches on this dataset to provide a baseline score for further research.
Abstract: The objective of this paper is to introduce a novel face database. It is composed of face images taken in real-world conditions and is freely available for research purposes at http://ufi.kiv.zcu.cz. We have created this dataset in order to facilitate to researchers a straightforward comparison and evaluation of their face recognition approaches under “very difficult” conditions. It is composed of two partitions. The first one, called Cropped images, contains automatically detected faces from photographs. The number of individuals is 605. These images are cropped and resized to have approximately the same face size. Images in the second partition, called Large images, contain not only faces, however some background objects are also present. Therefore, it is necessary to include the face detection task before the face recognition itself. This partition contains images of 530 individuals. Another contribution of this paper is to show the recognition accuracy of several state-of-the-art face recognition approaches on this dataset to provide a baseline score for further research.

35 citations


Authors

Showing all 2635 results

NameH-indexPapersCitations
Alessandro Di Mattia502208042
Jan Mandel482008493
Jindřich Musil441807866
Ali H. Reshak444869898
Jiri Damborsky411966726
Uwe Glatzel382195742
Pavel Novák382765338
Miloš Marek381694106
David Rafaja353125366
Kalim Deshmukh341183615
Jaroslav Vlček341333906
Pavel Drábek332924534
Jan Minár332143711
Daniel Král302813719
Emanuel Makrlík301622963
Network Information
Related Institutions (5)
Vienna University of Technology
49.3K papers, 1.3M citations

86% related

Polytechnic University of Turin
41.3K papers, 789.3K citations

84% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

84% related

Technische Universität Darmstadt
40.6K papers, 937.9K citations

84% related

Royal Institute of Technology
68.4K papers, 1.9M citations

83% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202322
202284
2021461
2020512
2019486
2018550