Spelling suggestions: "subject:"taikymai"" "subject:"taikymais""
1 |
Statistiniai taikymai moksleivių matematiniams gebėjimams tirti / Statictical approach in research of students' mathematical skillsŠilanskienė, Marija 10 June 2004 (has links)
Mathematical education reform in Lithuania has already been carried out of about 15 years. Trying to fulfil this reform effective as it is possible it is importan to estimate the situation. Various reseaches are done (e.g.TIMSS). It‘s a pitty while analysing the results of TIMSS only perfunctory anglysis of data was done. It becomes important the wider use of the statistic methods. The work is devoted to the search of the methods mentioned above. The reseach in Kaunas was carried out in order to estimate the changes in the study of mathematics. The aim of the work is to find the statistic criteria and apply them to the evoluation of the students mathematical achievements. The abilities of girls and boys were compared and those living in the sities and in the country ��� side. After the anglysis of data and the fitting of the statistic criteria to them the following conclusions were made: · Not enough attention is paid to the new aspects while teaching maths. · The abilities in mathematics among the girls an boys are the same. · The abilities in maths of those living in the cities are more developed than the students living in the country – side. On that ground some recommendations are given: · In the process of training a teacher should become the assistant of student. · More visual training appliances should be used in order to develop student‘s spatial thinking. · Induce the use of IT, so that the calculation would become easier.
|
2 |
Medžių vizualizacijos algoritmai ir jų taikymas / Application of tree drawing algorithmsSabaliauskas, Martynas 01 July 2014 (has links)
Šiame darbe, remiantis radialiniu medžių vaizdavimu, Maple programos aplinkoje buvo realizuotas algoritmas, skirtas numeruotųjų medžių vizualizacijai plokštumoje. Po to, atsitiktinai generuojant tūkstančius įvairios eilės medžių, empiriškai nustatyta, jog ne visais atvejais tenkinami estetiniai reikalavimai. Iškilusi problema spręsta įvedant papildomus parametrus, suteikiančius medžiui lankstumo, ilgiausius takus vaizduojant vienoje iš koncentrinių elipsių, medį „užtempiant“ ant erdvinių spiralinių paviršių. Taigi mes apibendrinome radialino medžių vaizdavimo algoritmą; pasiūlėme medžio centro paieškos metodą taikyti ilgiausių takų radimui; sukūrėme iki šiol neaprašytą laurų vainiko algoritmą, skirtą vaizduoti įvairiems medžiams plokštumoje; patogumo dėlei pritaikėme Priuferio sugalvotą kodą medžiams generuoti bei išvesti apibrėžto medžio Priuferio kodą; modifikuodami radialinį medžių vizualizacijos algoritmą pavaizdavome medžius koncentrinių elipsoidų sistemoje. Darbe pasiūlyta originali idėja vizualizuoti paiešką į plotį ir į gylį įterpiant papildomas procedūras, tam tikruose algoritmo realizacijos etapuose vaizduojančias grafus bei keičiančias jų briaunų ir viršūnių spalvas. / In this paper, referring to radial tree drawing, through the medium of Maple program, an algorithm has been realized. It was meant to carry out the visualization of rooted trees on a plane. After that, randomly generating thousands of trees of a different order, it has been empirically identified that aesthetic requirements are not suitable in all cases. The arisen problem has been tackled by introducing additional parameters: they have added flexibility to trees, the longest paths representing in one of the concentric ellipsis, pulling the tree on dimensional spiral surfaces. So we have summarized the algorithm of radial tree drawing, we have suggested to apply the method of finding the tree centre in identifying the longest trails. We have created a not described yet method of the algorithm of the laurel wreath, which is meant for portraying various trees on a plane. For ease of application we have also adjusted the code introduced by Prüfer: it is meant for generating trees and for deducing Prüfer‘s code of a determined tree. By modifying the algorithm of radial tree drawing, we have pictured the trees in a system of concentric ellipsoids. The paper suggests an original idea to visualize the breadth first search and the depth first search by inserting additional procedures, showing graphs and changing the colors of their edges and summits at certain stages of the realization of the algorithm.
|
Page generated in 0.0195 seconds