11. Searching for information on the internet: how do elementary school students use search engines on the webUroš Drnovšek, 2009, izvirni znanstveni članek Opis: The Internet has become one of the most popular sources of finding diverse information, even among elementary school students. One of the primary goals of our research was to closely observe students' web searching strategies while they searched for knowledge about life science. We then analyzed different variables, such as the number of keywords students used when they were searching, time spent browsing different web pages, time spent selecting web pages, etc. We measured students' success in completing different web searching tasks and tried to find some factors that are important that led to this success. Students had the most success with the fact-finding task, while research-oriented and semi self-generated tasks proved to be much challenging. Most students were satisfied with the information they got within the first two search attempts and, on average, they browsed only three websites per task. Age was an important factor in determining students' overall success and time for browsing the web.
Ključne besede: internet, search engines, seeking information, elementary school students, educational technology
Objavljeno v DKUM: 21.09.2017; Ogledov: 1252; Prenosov: 120
 Celotno besedilo (748,87 KB)
Gradivo ima več datotek! Več... |
12. The number of moves of the largest disc in shortest paths on Hanoi graphsSimon Aumann, Katharina Götz, Andreas Hinz, Ciril Petr, 2014, izvirni znanstveni članek Opis: In contrast to the widespread interest in the Frame-Stewart conjecture (FSC) about the optimal number of moves in the classical Tower of Hanoi task with more than three pegs, this is the first study of the question of investigating shortest paths in Hanoi graphs ▫$H_p^n$▫ in a more general setting. Here ▫$p$▫ stands for the number of pegs and ▫$n$▫ for the number of discs in the Tower of Hanoi interpretation of these graphs. The analysis depends crucially on the number of largest disc moves (LDMs). The patterns of these LDMs will be coded as binary strings of length ▫$p-1$▫ assigned to each pair of starting and goal states individually. This will be approached both analytically and numerically. The main theoretical achievement is the existence, at least for all ▫$n \geqslant p(p-2)$▫, of optimal paths where ▫$p-1$▫ LDMs are necessary. Numerical results, obtained by an algorithm based on a modified breadth-first search making use of symmetries of the graphs, lead to a couple of conjectures about some cases not covered by our ascertained results. These, in turn, may shed some light on the notoriously open FSC.
Ključne besede: graph theory, Tower of Hanoi, Hanoi graphs, shortest paths, symmetries, breadth-first search
Objavljeno v DKUM: 14.08.2017; Ogledov: 1714; Prenosov: 247
Celotno besedilo (376,70 KB)
Gradivo ima več datotek! Več... |
13. Die Authentizität in Maja Haderlaps Roman Engel des VergessensMiša Glišič, 2014, izvirni znanstveni članek Opis: This article analyses the authenticity of memories in the second half of the 20th century in Carinthia. The segmentation of historical authenticity is visible in the historical reminiscence of traumatic historical events in relation to social interaction. The combination of social, political und cultural elements affects the divergent experience of individuals in determinated environment. The complexity of the novel is seen in the inner feelings, which characterization relates to emotions and the subconscious of the population. The article focuses on the female perspective as well as on the role of women in the story. The author proves with her experience of unconsciously the unsolved problematic of her own literalizing of history. The personality of the writer is shown in the examples of double literary, personal and lingual identity.
Ključne besede: Austrian literature, Slovene literature, literalizing of history, role of women, multiculturalism, search of identity, question of minority
Objavljeno v DKUM: 18.05.2017; Ogledov: 1278; Prenosov: 193
Celotno besedilo (767,10 KB)
Gradivo ima več datotek! Več... |
14. Hybridization of stochastic local search and genetic algorithm for human resource planning managementAndrej Škraba, Vladimir Stanovov, Eugene Semenkin, Davorin Kofjač, 2016, izvirni znanstveni članek Opis: Background and Purpose: The restructuring of human resources in an organization is addressed in this paper, because human resource planning is a crucial process in every organization. Here, a strict hierarchical structure of the organization is of concern here, for which a change in a particular class of the structure influences classes that follow it. Furthermore, a quick adaptation of the structure to the desired state is required, where oscillations in transitions between classes are not desired, because they slow down the process of adaptation. Therefore, optimization of such a structure is highly complex, and heuristic methods are needed to approach such problems to address them properly.
Design/Methodology/Approach: The hierarchical human resources structure is modeled according to the principles of System Dynamics. Optimization of the structure is performed with an algorithm that combines stochastic local search and genetic algorithms.
Results: The developed algorithm was tested on three scenarios; each scenario exhibits a different dynamic in achieving the desired state of the human resource structure. The results show that the developed algorithm has successfully optimized the model parameters to achieve the desired structure of human resources quickly.
Conclusion: We have presented the mathematical model and optimization algorithm to tackle the restructuring of human resources for strict hierarchical organizations. With the developed algorithm, we have successfully achieved the desired organizational structure in all three cases, without the undesired oscillations in the transitions between classes and in the shortest possible time.
Ključne besede: stochastic local search, system dynamics, human resources, simulation
Objavljeno v DKUM: 04.04.2017; Ogledov: 1158; Prenosov: 353
Celotno besedilo (474,90 KB)
Gradivo ima več datotek! Več... |
15. Domination game: extremal families of graphs for 3/5-conjecturesBoštjan Brešar, Sandi Klavžar, Gašper Košmrlj, Douglas F. Rall, 2013, izvirni znanstveni članek Opis: Igralca, Dominator in Zavlačevalka, izmenoma izbirata vozlišča grafa ▫$G$▫, takoda vsako izbrano vozlišče poveča množico do sedaj dominiranih vozlišč. Cilj Dominatorja je končati igro čim hitreje, medtem ko je Zavlačevalkin cilj ravno nasprotno. Igralno dominacijsko število ▫$gamma_g(G)$▫ je skupno število izbranih vozlišč v igri, ko Dominator naredi prvo potezo in oba igralca igrata optimalno. Postavljena je bila domneva [W.B. Kinnersley, D.B. West, R. Zemani, Extremal problems for game domination number, Manuscript, 2012], da velja ▫$gamma_g(G) leq frac{3|V(G)|}{5}$▫ za poljuben graf ▫$G$▫ brez izoliranih vozlišč. V posebnem je domneva odprta tudi, ko je ▫$G$▫ gozd. V tem članku predstavimo konstrukcije, ki nam dajo velike družine dreves, ki dosežejo domnevno mejo ▫$3/5$▫. Leplenje dreves iz nekaterih izmed teh družin napoljuben graf nam da konstrukcijo grafov ▫$G$▫, ki imajo igralno dominacijsko število enako ▫$3|V(G)|/5$▫. Z računalnikom smo poiskali vsa ekstremna drevesa znajveč 20 vozlišči. V posebnem, na 20 vozliščih obstaja natanko deset dreves ▫$T$▫, za katere velja ▫$gamma_g(T) = 12$▫, in vsa pripadajo skonstruiranim družinam.
Ključne besede: matematika, teorija grafov, dominacijska igra, igralno dominacijsko številko, 3/5-domneva, računalniško iskanje, mathematics, graph theory, domination game, game domination number, 3/5-conjecture, computer search
Objavljeno v DKUM: 10.07.2015; Ogledov: 1488; Prenosov: 95
 Povezava na celotno besedilo |
16. A modular hybrid approach to employee timetablingDrago Bokal, Gašper Fijavž, Bor Harej, Andrej Taranenko, Klemen Žagar, 2008, objavljeni znanstveni prispevek na konferenci Opis: We consider a classical employee timetabling problem: a set of employees with various skill levels, qualifications, workload and availability distributions has to be assigned to a set of shifts, each requiring a prescribed number of qualified employees and spanning a given time period. The novelty of our approach is a hybrid combination of the methods proposed in bibliography, such that we leverage the advantages of known methods while minimizing their disadvantages. Thus, we first apply the generalized local hill-climbing with randomized neighborhoods to quickly reach the vicinity of local optima, and then use the tabu search to explore more of the search space around those solutions. Our experiments show that the resulting hybrid technique performs better than the comparable approaches presented in bibliography due to the hybrid nature of the technique. In addition, we propose a modular design that utilizes dependency injection to compose the the search algorithm. Together with careful modeling, this approach allows for constant-time evaluation of each possible step in the neighborhood and for an easy evaluation of different hybrid combinations that can be combined and parameterized at runtime.
Ključne besede: operacijsko raziskovanje, razporejanje zaposlenih, urniki, lokalna optimizacija, operations research, employee timetabling, generalized local hill-climbing, tabu search, hybrid local optimization
Objavljeno v DKUM: 10.07.2015; Ogledov: 1268; Prenosov: 58
Povezava na celotno besedilo |
17. |
18. |
19. Symmetry preserving algorithm for large displacement frictionless contact by the pre-discretization penalty methodDušan Gabriel, Jiři Plešek, Miran Ulbin, 2004, izvirni znanstveni članek Opis: A three-dimensional contact algorithm based on the pre-discretization penalty method is presented. Using the pre-discretization formulation gives rise to contact searching performed at the surface Gaussian integration points. It is shown that the proposed method is consistent with the continuum formulation ofthe problem and allows an easy incorporation of higher-order elements with midside nodes to the analysis. Moreover, a symmetric treatment of mutually contacting surfaces is preserved even under large displacement increments. Theproposed algorithm utilizes the BFGS method modified for constrained non-linear systems. The effectiveness of quadratic isoparametric elements in contact analysis is tested in terms of numerical examples verified by analytical solutions and experimental measurements. The symmetry of the algorithm is clearly manifested in the problem of impact of two elastic cylinders.
Ključne besede: mechanics, numerical methods, contacting surfaces, contact problems, 3D contact algorithm, discretization, higher order elements, finite element method, Gauss point search, pre-discretization penalty method
Objavljeno v DKUM: 01.06.2012; Ogledov: 2552; Prenosov: 89
Povezava na celotno besedilo |
20. Text analysis with sequence matchingMarko Ferme, Milan Ojsteršek, 2011, izvirni znanstveni članek Opis: This article describes some common problems faced in natural language processing. The main problem consist of a user given sentence, which has to be matched against an existing knowledge base, consisting of semantically described words or phrases. Some main problems in this process are outlined and the most common solutions used in natural language processing are overviewed. A sequence matching algorithm is introduced as an alternative solution and its advantages over the existing approaches are explained. The algorithm is explained in detail where the longest subsequences discovery algorithm is explained first. Then the major components of the similarity measure are defined and the computation of concurrence and dispersion measure is presented. Results of the algorithms performance on a test set are then shown and different implementations of algorithm usage are discussed. The work is concluded with some ideas for the future and some examples where our approach can be practically used.
Ključne besede: sequence matching, subsequence analysis, similarity measure, fuzzy string search, phrase detection
Objavljeno v DKUM: 01.06.2012; Ogledov: 2212; Prenosov: 62
Povezava na celotno besedilo |
