Contexts for questioning: Two zones of teaching and learning in undergraduate science

This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ Springer Science+Business Media B.V. 2012.Higher education institutions are currently undertaking a challenging process in moving from teacher-orientated to student-focused approaches. Students’ ability to asking questions is fundamental to developing critical reasoning, and to the process of scientific enquiry itself. Our premise is that questioning competences should become a central focus of current reforms in higher education. This study, part of a broader naturalistic research project, aims at developing a theoretical framework for conceptualizing different contexts for questioning, illustrating the application of the proposed framework (contextual questioning zones) and reflecting about some of the dimensions of teaching and learning, for overcoming some of the challenges that higher education institutions are facing presently. The discussion of two ‘opposite’ contexts of enquiry is based on qualitative data, gathered through close collaboration with four teachers of undergraduate biology at a Portuguese university. These teachers were observed during their ‘daily activity’ during an academic year. Data was also gathered by interviewing these teachers and 8 selected students, at the end of the year, and used to sustain the argumentation. The paper concludes with some reflections and suggestions to promote authentic enquiry-based learning experiences.Portuguese Fundação para a Ciência e a Tecnologi

Spreading and shortest paths in systems with sparse long-range connections

Spreading according to simple rules (e.g. of fire or diseases), and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections (``Small-World'' lattices). The volume V(t) covered by the spreading quantity on an infinite system is exactly calculated in all dimensions. We find that V(t) grows initially as t^d/d for t>t^*$, generalizing a previous result in one dimension. Using the properties of V(t), the average shortest-path distance \ell(r) can be calculated as a function of Euclidean distance r. It is found that \ell(r) = r for r<r_c=(2p \Gamma_d (d-1)!)^{-1/d} log(2p \Gamma_d L^d), and \ell(r) = r_c for r>r_c. The characteristic length r_c, which governs the behavior of shortest-path lengths, diverges with system size for all p>0. Therefore the mean separation s \sim p^{-1/d} between shortcut-ends is not a relevant internal length-scale for shortest-path lengths. We notice however that the globally averaged shortest-path length, divided by L, is a function of L/s only.Comment: 4 pages, 1 eps fig. Uses psfi

Topological Properties of Citation and Metabolic Networks

Topological properties of "scale-free" networks are investigated by determining their spectral dimensions $d_S$, which reflect a diffusion process in the corresponding graphs. Data bases for citation networks and metabolic networks together with simulation results from the growing network model \cite{barab} are probed. For completeness and comparisons lattice, random, small-world models are also investigated. We find that $d_S$ is around 3 for citation and metabolic networks, which is significantly different from the growing network model, for which $d_S$ is approximately 7.5. This signals a substantial difference in network topology despite the observed similarities in vertex order distributions. In addition, the diffusion analysis indicates that whereas the citation networks are tree-like in structure, the metabolic networks contain many loops.Comment: 11 pages, 3 figure

A measurement of the cosmic ray elements C to Fe in the two energy intervals 0.5-2.0 GeV/n and 20-60 GeV/n

The study of the cosmic ray abundances beyond 20 GeV/n provides additional information on the propagation and containment of the cosmic rays in the galaxy. Since the average amount of interstellar material traversed by cosmic rays decreases as its energy increases, the source composition undergoes less distortion in this higher energy region. However, data over a wide energy range is necessary to study propagation parameters. Some measurements of some of the primary cosmic ray abundance ratios at both low (near 2 GeV/n) and high (above 20 GeV/n) energy are given and compared to the predictions of the leaky box mode. In particular, the integrated values (above 23.7 GeV/n) for the more abundant cosmic ray elements in the interval C through Fe and the differential flux for carbon, oxygen, and the Ne, Mg, Si group are presented. Limited statistics prevented the inclusion of the odd Z elements

Mountain trail formation and the active walker model

We extend the active walker model to address the formation of paths on gradients, which have been observed to have a zigzag form. Our extension includes a new rule which prohibits direct descent or ascent on steep inclines, simulating aversion to falling. Further augmentation of the model stops walkers from changing direction very rapidly as that would likely lead to a fall. The extended model predicts paths with qualitatively similar forms to the observed trails, but only if the terms suppressing sudden direction changes are included. The need to include terms into the model that stop rapid direction change when simulating mountain trails indicates that a similar rule should also be included in the standard active walker model.Comment: Introduction improved. Analysis of discretization errors added. Calculations from alternative scheme include

Evolutionary Dynamics on Small-Order Graphs

Abstract. We study the stochastic birth-death model for structured finite populations popularized by Lieberman et al. [Lieberman, E., Hauert, C., Nowak, M.A., 2005. Evolutionary dynamics on graphs. Nature 433, 312-316]. We consider all possible connected undirected graphs of orders three through eight. For each graph, using the Monte Carlo Markov Chain simulations, we determine the fixation probability of a mutant introduced at every possible vertex. We show that the fixation probability depends on the vertex and on the graph. A randomly placed mutant has the highest chances of fixation in a star graph, closely followed by star-like graphs. The fixation probability was lowest for regular and almost regular graphs. We also find that within a fixed graph, the fixation probability of a mutant has a negative correlation with the degree of the starting vertex. 1

Comment on "Ising model on a small world network"

In the recent study of the Ising model on a small-world network by A. P\c{e}kalski [Phys. Rev. E {\bf 64}, 057104 (2001)], a surprisingly small value of the critical exponent $\beta \approx 0.0001$ has been obtained for the temperature dependence of the magnetization. We perform extensive Monte Carlo simulations of the same model and conclude, via the standard finite-size scaling of various quantities,that the phase transition in the model is of the mean-field nature, in contrast to the work by A. P\c{e}kalski but in accord with other existing studies.Comment: to be published in PR

WiFi Epidemiology: Can Your Neighbors' Router Make Yours Sick?

In densely populated urban areas WiFi routers form a tightly interconnected proximity network that can be exploited as a substrate for the spreading of malware able to launch massive fraudulent attack and affect entire urban areas WiFi networks. In this paper we consider several scenarios for the deployment of malware that spreads solely over the wireless channel of major urban areas in the US. We develop an epidemiological model that takes into consideration prevalent security flaws on these routers. The spread of such a contagion is simulated on real-world data for geo-referenced wireless routers. We uncover a major weakness of WiFi networks in that most of the simulated scenarios show tens of thousands of routers infected in as little time as two weeks, with the majority of the infections occurring in the first 24 to 48 hours. We indicate possible containment and prevention measure to limit the eventual harm of such an attack.Comment: 22 pages, 1 table, 4 figure

Classes of behavior of small-world networks

Small-world networks are the focus of recent interest because they appear to circumvent many of the limitations of either random networks or regular lattices as frameworks for the study of interaction networks of complex systems. Here, we report an empirical study of the statistical properties of a variety of diverse real-world networks. We present evidence of the occurrence of three classes of small-world networks: (a) scale-free networks, characterized by a vertex connectivity distribution that decays as a power law; (b) broad-scale networks, characterized by a connectivity distribution that has a power-law regime followed by a sharp cut-off; (c) single-scale networks, characterized by a connectivity distribution with a fast decaying tail. Moreover, we note for the classes of broad-scale and single-scale networks that there are constraints limiting the addition of new links. Our results suggest that the nature of such constraints may be the controlling factor for the emergence of different classes of networks