Faculty and Staff

Readability formulas are used widely in education, and increasingly in business and government. Over 30 years of research on more than 200 readability formulas has demonstrated moderate to strong predictive correlations with reading comprehension. In this study, five well-known readability formulas correlated highly with each other when applied to selected recent historical articles (N = 22) from two music education research journals. The mean level of difficulty (readability) for all 22 articles was grade 14.04, near the beginning of the second year of college. Since research shows that most people read below their highest completed school grade and also prefer easier materials, this is probably an appropriate level of difficulty for the presumptive readers of these two journals (i.e., holders of undergraduate and graduate degrees). Professors, librarians, and others responsible for guiding students toward reading material at appropriate levels of readability could benefit from these results.

Poster about meeting the academic and cultural needs of international students at the Arizona State University Libraries and the University of Arizona Libraries. The poster presentation focuses on:

1. Strategies to promote information literacy skills of international students in the two university libraries.
2. What the libraries are doing to improve services to meet the needs and encourage library use among international students.
3. Partnerships that have been established with other academic departments or institutions.

Extreme events, a type of collective behavior in complex networked dynamical systems, often can have catastrophic consequences. To develop effective strategies to control extreme events is of fundamental importance and practical interest. Utilizing transportation dynamics on complex networks as a prototypical setting, we find that making the network “mobile” can effectively suppress extreme events. A striking, resonance-like phenomenon is uncovered, where an optimal degree of mobility exists for which the probability of extreme events is minimized. We derive an analytic theory to understand the mechanism of control at a detailed and quantitative level, and validate the theory numerically. Implications of our finding to current areas such as cybersecurity are discussed.

We develop a completely data-driven approach to reconstructing coupled neuronal networks that contain a small subset of chaotic neurons. Such chaotic elements can be the result of parameter shift in their individual dynamical systems and may lead to abnormal functions of the network. To accurately identify the chaotic neurons may thus be necessary and important, for example, applying appropriate controls to bring the network to a normal state. However, due to couplings among the nodes, the measured time series, even from non-chaotic neurons, would appear random, rendering inapplicable traditional nonlinear time-series analysis, such as the delay-coordinate embedding method, which yields information about the global dynamics of the entire network. Our method is based on compressive sensing. In particular, we demonstrate that identifying chaotic elements can be formulated as a general problem of reconstructing the nodal dynamical systems, network connections and all coupling functions, as well as their weights. The working and efficiency of the method are illustrated by using networks of non-identical FitzHugh–Nagumo neurons with randomly-distributed coupling weights.

The relation between flux and fluctuation is fundamental to complex physical systems that support and transport flows. A recently obtained law predicts monotonous enhancement of fluctuation as the average flux is increased, which in principle is valid but only for large systems. For realistic complex systems of small sizes, this law breaks down when both the average flux and fluctuation become large. Here we demonstrate the failure of this law in small systems using real data and model complex networked systems, derive analytically a modified flux-fluctuation law, and validate it through computations of a large number of complex networked systems. Our law is more general in that its predictions agree with numerics and it reduces naturally to the previous law in the limit of large system size, leading to new insights into the flow dynamics in small-size complex systems with significant implications for the statistical and scaling behaviors of small systems, a topic of great recent interest.

We develop a general framework to analyze the controllability of multiplex networks using multiple-relation networks and multiple-layer networks with interlayer couplings as two classes of prototypical systems. In the former, networks associated with different physical variables share the same set of nodes and in the latter, diffusion processes take place. We find that, for a multiple-relation network, a layer exists that dominantly determines the controllability of the whole network and, for a multiple-layer network, a small fraction of the interconnections can enhance the controllability remarkably. Our theory is generally applicable to other types of multiplex networks as well, leading to significant insights into the control of complex network systems with diverse structures and interacting patterns.