Review: Use of EEG on Measuring Stress Levels When Painting and Programming

For years, brain activity, stress level during programming and painting have been analyzed separately. As the world gets more digital and human life gets more dependent on technology, it has become more important to analyse the relationship between programming, software developers’ brain activity, creative practices (i.e painting) and stress level. In this paper, we present the results of a systematic literature review whereby the research questions are centred around analysing the relationship between stress levels and brain activity when a person is painting or writing a piece of software. The search for relevant studies was done on google scholar and IEEE Xplore. The results of our review show that: (1) EEG can be used to accurately measure stress levels, (2) there is limited research in the analysis of stress level pattern of the stress level when people paint depending on different situations and styles of painting. In light of the systematic literature review result, using EEG we plan to conduct experiments to measure the stress level when a person is painting a picture or programming

Topology and seasonal evolution of the network of extreme precipitation over the Indian subcontinent and Sri Lanka

Peer reviewedPublisher PD

Quantifying the rise and fall of scientific fields

Science advances by pushing the boundaries of the adjacent possible. While the global scientific enterprise grows at an exponential pace, at the mesoscopic level the exploration and exploitation of research ideas is reflected through the rise and fall of research fields. The empirical literature has largely studied such dynamics on a case-by-case basis, with a focus on explaining how and why communities of knowledge production evolve. Although fields rise and fall on different temporal and population scales, they are generally argued to pass through a common set of evolutionary stages. To understand the social processes that drive these stages beyond case studies, we need a way to quantify and compare different fields on the same terms. In this paper we develop techniques for identifying scale-invariant patterns in the evolution of scientific fields, and demonstrate their usefulness using 1.5 million preprints from the arXiv repository covering 175 research fields spanning Physics, Mathematics, Computer Science, Quantitative Biology and Quantitative Finance. We show that fields consistently follows a rise and fall pattern captured by a two parameters right-tailed Gumbel temporal distribution. We introduce a field-specific rescaled time and explore the generic properties shared by articles and authors at the creation, adoption, peak, and decay evolutionary phases. We find that the early phase of a field is characterized by the mixing of cognitively distant fields by small teams of interdisciplinary authors, while late phases exhibit the role of specialized, large teams building on the previous works in the field. This method provides foundations to quantitatively explore the generic patterns underlying the evolution of research fields in science, with general implications in innovation studies.Comment: 18 pages, 4 figures, 8 SI figure

On the influence of spatial sampling on climate networks

Peer reviewedPublisher PD

Characterizing the evolution of climate networks

Complex network theory has been successfully applied to understand the structural and functional topology of many dynamical systems from nature, society and technology. Many properties of these systems change over time, and, consequently, networks reconstructed from them will, too. However, although static and temporally changing networks have been studied extensively, methods to quantify their robustness as they evolve in time are lacking. In this paper we develop a theory to investigate how networks are changing within time based on the quantitative analysis of dissimilarities in the network structure. Our main result is the common component evolution function (CCEF) which characterizes network development over time. To test our approach we apply it to several model systems, ErdA's-Rényi networks, analytically derived flow-based networks, and transient simulations from the START model for which we control the change of single parameters over time. Then we construct annual climate networks from NCEP/NCAR reanalysis data for the Asian monsoon domain for the time period of 1970-2011 CE and use the CCEF to characterize the temporal evolution in this region. While this real-world CCEF displays a high degree of network persistence over large time lags, there are distinct time periods when common links break down. This phasing of these events coincides with years of strong El Niño/Southern Oscillation phenomena, confirming previous studies. The proposed method can be applied for any type of evolving network where the link but not the node set is changing, and may be particularly useful to characterize nonstationary evolving systems using complex networks

Transport collapse in dynamically evolving networks

Transport in complex networks can describe a variety of natural and human-engineered processes including biological, societal and technological ones. However, how the properties of the source and drain nodes can affect transport subject to random failures, attacks or maintenance optimization in the network remain unknown. In this paper, the effects of both the distance between the source and drain nodes and of the degree of the source node on the time of transport collapse are studied in scale-free and lattice-based transport networks. These effects are numerically evaluated for two strategies, which employ either transport-based or random link removal. Scale-free networks with small distances are found to result in larger times of collapse. In lattice-based networks, both the dimension and boundary conditions are shown to have a major effect on the time of collapse. We also show that adding a direct link between the source and the drain increases the robustness of scale-free networks when subject to random link removals. Interestingly, the distribution of the times of collapse is then similar to the one of lattice-based networks