Search the digital library catalog

Abstract: Background and purpose: The purpose of the article is to analyse results of entrance exams and of regularly exams for foreign students in the Czech language undergraduate study programs at four faculties of University of Economics, Prague (UEP) with the intention to investigate the dependency between the results of Entrance exams from English and mathematics and (1) results of regularly exams during the study and between (2) completion rate of the study. Design/Methodology/Approach: We have analysed 4.381 records for applicants from foreign countries who applied for studies between years 2009 and 2015. We used standard statistics methods and the method of logistic regression in the form of logit model. Results: We identified weak statistical correlation between entrance exam results from mathematics and results of regular exams. The correlation coefficient varies between 0.078 – 0.283 for investigated faculties of UEP. The same indicator for English language exams presents better values and it varies between 0.218 – 0.312. If an entrance exam result is higher by one point, the probability of successful completion of studies is multiplied by values between 1.017 - 1.042 for individual faculty per one additional point. Conclusion: The results of the research in mathematics and English language show that excellent results in entrance exam cannot not guarantee successful regularly exams. Conclusion for the probability of completing studies is that the acceptable level of points for admission foreign students is between 150 and 170 points, depending on the faculty.
Keywords: knowledge, foreign student, university, english language, mathematics
Published: 10.10.2018; Views: 503; Downloads: 226
Full text (479,79 KB)
This document has many files! More...

Abstract: Nowadays, we are facing a large number of varied educational projects which aim to direct and modernize mathematics education. Many institutions (from university bodies and institutes to individual secondary and elementary schools, networks of schools and private enterprises) make an appearance on the project market and contribute their ideas. Such quantity can cause confusion among teachers. Encouraged by the article, a mathematician's lament, by Paul Lockhard, we present some simple principles for classroom work that, in our opinion, would enhance the efficiency of mathematics classes in the long term. Thus we try to help mathematics teachers build a strategy for a fruitful approach to the ideas, recommendations and advertisements on the educational market. Showing the respect towards the quality mathematics teachers and avoiding discouraging and confusing them are some of the leading ideas that we should pursue in our attempt to improve mathematics education. At the end, we also offer some recommendations about the teacher training system.
Keywords: education, mathematics education, pedagogical approach, ICT
Published: 15.12.2017; Views: 603; Downloads: 58
Full text (1,24 MB)
This document has many files! More...

Abstract: The booklet contains the abstracts of the talks given at the 30th Ljubljana-Leoben Graph Theory Seminar that was held at the Faculty of Natural Sciences and Mathematics in Maribor between 13-15 September, 2017. The seminar attracted more than 30 participants from eight countries, all of which are researchers in different areas of graph theory. The topics of the talks encompass a wide range of contemporary graph theory research, notably, various types of graph colorings (b-coloring, packing coloring, edge colorings), graph domination (rainbow domination, Grundy domination, graph security), distinguishing problems, algebraic graph theory, graph algorithms, chemical graph theory, coverings, matchings and also some classical extremal problems. Beside the abstracts of the four invited speakers (Csilla Bujtás, Premysl Holub, Jakub Przybyło, Zsolt Tuza), the booklet contains also the abstracts of 18 contributed talks given at the event.
Keywords: mathematics, discrete mathematics, graph theory, Ljubljana-Leoben seminar, Maribor, Slovenia
Published: 08.12.2017; Views: 555; Downloads: 60
Full text (457,62 KB)
This document has many files! More...

Abstract: Recently Nikolić, Trinajstić and Randić put forward a novel modification ▫$^mW(G)$▫ of the Wiener number ▫$W(G)$▫, called modified Wiener index, which definition was generalized later by Gutman and the present authors. Here we study another class of modified indices defined as ▫$W_{min,λ}(G) = ∑(V(G)^λm_G(u,ν)^λ−m_G(u,ν)^{2λ})$▫ and show that some of the important properties of ▫$W(G)$▫, ▫$^mW(G)$▫ and ▫$^λW(G)$▫ are also properties of ▫$W_{min,λ}(G)$▫, valid for most values of the parameter λ. In particular, if ▫$T_n$▫ is any n-vertex tree, different from the n-vertex path ▫$P_n$▫ and the n-vertex star ▫$S_n$▫, then for any λ ≥ 1 or λ < 0, ▫$^W_{min,λ}(P_n) > W_{min,λ}(T_n)>W_{min,λ}(S_n)$▫. Thus for these values of the parameter λ, ▫$W_{min,λ}(G)$▫ provides a novel class of structure-descriptors, suitable for modeling branching-dependent properties of organic compounds, applicable in QSPR and QSAR studies. We also demonstrate that if trees are ordered with regard to ▫$W_{min,λ}(G)$▫ then, in the general case, this ordering is different for different λ.
Keywords: mathematics, chemical graph theory, Wiener index, modified Wiener index
Published: 17.08.2017; Views: 440; Downloads: 75
Full text (991,46 KB)
This document has many files! More...

Abstract: Formulas for the Wiener number and the Hosoya-Wiener polynomial of edge and vertex weighted graphs are given in terms of edge and path contributions. For a rooted tree, the Hosoya-Wiener polynomial is expressed as a sum of vertex contributions. Finally, a recursive formula for computing the Hosoya-Wiener polynomial of a weighted tree is given.
Keywords: mathematics, graph theory, Hosoya-Wiener polynomial, weighted tree, vertex weighted graphs
Published: 05.07.2017; Views: 526; Downloads: 56
Full text (182,69 KB)
This document has many files! More...