arXiv subjects

F. P. Fernandes

Publications and source records attributed to F. P. Fernandes.

3 recordsLinked to original sources

arXiv2024

On conceptualisation and an overview of learning path recommender systems in e-learning

The use of e-learning systems has a long tradition, where students can study online helped by a system. In this context, the use of recommender systems is relatively new. In our research project, we investigated various ways to create a recommender system. They all aim at facilitating the learning and understanding of a student. We present a common concept of the learning path and its learning indicators and embed 5 different recommenders in this context.

cs.IR↗

arXiv2010

Blume-Capel model on directed and undirected Small-World Voronoi-Delaunay random lattices

The critical properties of the spin-1 two-dimensional Blume-Capel model on directed and undi- rected random lattices with quenched connectivity disorder is studied through Monte Carlo simulations. The critical temperature, as well as the critical point exponents are obtained. For the undi- rected case this random system belongs to the same universality class as the regular two-dimensional model. However, for the directed random lattice one has a second-order phase transition for q < qc and a first-order phase transition for q > qc, where qc is the critical rewiring probability. The critical exponents for q < qc was calculated and they do not belong to the same universality class as the regular two-dimensional ferromagnetic model.

cond-mat.stat-mech↗

arXiv2008

Persistence in the zero-temperature dynamics of the $Q$-states Potts model on undirected-directed Barabási-Albert networks and Erdös-Rényi random graphs

The zero-temperature Glauber dynamics is used to investigate the persistence probability $P(t)$ in the Potts model with $Q=3,4,5,7,9,12,24,64, 128$, $256, 512, 1024,4096,16384 $,..., $2^{30}$ states on {\it directed} and {\it undirected} Barabási-Albert networks and Erdös-Rényi random graphs. In this model it is found that $P(t)$ decays exponentially to zero in short times for {\it directed} and {\it undirected} Erdös-Rényi random graphs. For {\it directed} and {\it undirected} Barabási-Albert networks, in contrast it decays exponentially to a constant value for long times, i.e, $P(\infty)$ is different from zero for all $Q$ values (here studied) from $Q=3,4,5,..., 2^{30}$; this shows "blocking" for all these $Q$ values. Except that for $Q=2^{30}$ in the {\it undirected} case $P(t)$ tends exponentially to zero; this could be just a finite-size effect since in the other "blocking" cases you may have only a few unchanged spins.

cond-mat.stat-mech↗