ASU Scholarship Showcase

Background:
Ketogenic diets are high fat and low carbohydrate or very low carbohydrate diets, which render high production of ketones upon consumption known as nutritional ketosis (NK). Ketosis is also produced during fasting periods, which is known as fasting ketosis (FK). Recently, the combinations of NK and FK, as well as NK alone, have been used as resources for weight loss management and treatment of epilepsy.

Methods:
A crossover study design was applied to 11 healthy individuals, who maintained moderately sedentary lifestyle, and consumed three types of diet randomly assigned over a three-week period. All participants completed the diets in a randomized and counterbalanced fashion. Each weekly diet protocol included three phases: Phase 1 - A mixed diet with ratio of fat: (carbohydrate + protein) by mass of 0.18 or the equivalence of 29% energy from fat from Day 1 to Day 5. Phase 2- A mixed or a high-fat diet with ratio of fat: (carbohydrate + protein) by mass of approximately 0.18, 1.63, or 3.80 on Day 6 or the equivalence of 29%, 79%, or 90% energy from fat, respectively. Phase 3 - A fasting diet with no calorie intake on Day 7. Caloric intake from diets on Day 1 to Day 6 was equal to each individual’s energy expenditure. On Day 7, ketone buildup from FK was measured.

Results:
A statistically significant effect of Phase 2 (Day 6) diet was found on FK of Day 7, as indicated by repeated analysis of variance (ANOVA), F(2,20) = 6.73, p < 0.0058. Using a Fisher LDS pair-wise comparison, higher significant levels of acetone buildup were found for diets with 79% fat content and 90% fat content vs. 29% fat content (with p = 0.00159**, and 0.04435**, respectively), with no significant difference between diets with 79% fat content and 90% fat content. In addition, independent of the diet, a significantly higher ketone buildup capability of subjects with higher resting energy expenditure (R[superscript 2] = 0.92), and lower body mass index (R[superscript 2] = 0.71) was observed during FK.

It is known that in classical fluids turbulence typically occurs at high Reynolds numbers. But can turbulence occur at low Reynolds numbers? Here we investigate the transition to turbulence in the classic Taylor-Couette system in which the rotating fluids are manufactured ferrofluids with magnetized nanoparticles embedded in liquid carriers. We find that, in the presence of a magnetic field transverse to the symmetry axis of the system, turbulence can occur at Reynolds numbers that are at least one order of magnitude smaller than those in conventional fluids. This is established by extensive computational ferrohydrodynamics through a detailed investigation of transitions in the flow structure, and characterization of behaviors of physical quantities such as the energy, the wave number, and the angular momentum through the bifurcations. A finding is that, as the magnetic field is increased, onset of turbulence can be determined accurately and reliably. Our results imply that experimental investigation of turbulence may be feasible by using ferrofluids. Our study of transition to and evolution of turbulence in the Taylor-Couette ferrofluidic flow system provides insights into the challenging problem of turbulence control.

A relatively unexplored issue in cybersecurity science and engineering is whether there exist intrinsic patterns of cyberattacks. Conventional wisdom favors absence of such patterns due to the overwhelming complexity of the modern cyberspace. Surprisingly, through a detailed analysis of an extensive data set that records the time-dependent frequencies of attacks over a relatively wide range of consecutive IP addresses, we successfully uncover intrinsic spatiotemporal patterns underlying cyberattacks, where the term “spatio” refers to the IP address space. In particular, we focus on analyzing macroscopic properties of the attack traffic flows and identify two main patterns with distinct spatiotemporal characteristics: deterministic and stochastic. Strikingly, there are very few sets of major attackers committing almost all the attacks, since their attack “fingerprints” and target selection scheme can be unequivocally identified according to the very limited number of unique spatiotemporal characteristics, each of which only exists on a consecutive IP region and differs significantly from the others. We utilize a number of quantitative measures, including the flux-fluctuation law, the Markov state transition probability matrix, and predictability measures, to characterize the attack patterns in a comprehensive manner. A general finding is that the attack patterns possess high degrees of predictability, potentially paving the way to anticipating and, consequently, mitigating or even preventing large-scale cyberattacks using macroscopic approaches.

Supply-demand processes take place on a large variety of real-world networked systems ranging from power grids and the internet to social networking and urban systems. In a modern infrastructure, supply-demand systems are constantly expanding, leading to constant increase in load requirement for resources and consequently, to problems such as low efficiency, resource scarcity, and partial system failures. Under certain conditions global catastrophe on the scale of the whole system can occur through the dynamical process of cascading failures. We investigate optimization and resilience of time-varying supply-demand systems by constructing network models of such systems, where resources are transported from the supplier sites to users through various links. Here by optimization we mean minimization of the maximum load on links, and system resilience can be characterized using the cascading failure size of users who fail to connect with suppliers.

We consider two representative classes of supply schemes: load driven supply and fix fraction supply. Our findings are: (1) optimized systems are more robust since relatively smaller cascading failures occur when triggered by external perturbation to the links; (2) a large fraction of links can be free of load if resources are directed to transport through the shortest paths; (3) redundant links in the performance of the system can help to reroute the traffic but may undesirably transmit and enlarge the failure size of the system; (4) the patterns of cascading failures depend strongly upon the capacity of links; (5) the specific location of the trigger determines the specific route of cascading failure, but has little effect on the final cascading size; (6) system expansion typically reduces the efficiency; and (7) when the locations of the suppliers are optimized over a long expanding period, fewer suppliers are required. These results hold for heterogeneous networks in general, providing insights into designing optimal and resilient complex supply-demand systems that expand constantly in time.

Many drugs are effective in the early stage of treatment, but patients develop drug resistance after a certain period of treatment, causing failure of the therapy. An important example is Herceptin, a popular monoclonal antibody drug for breast cancer by specifically targeting human epidermal growth factor receptor 2 (Her2). Here we demonstrate a quantitative binding kinetics analysis of drug-target interactions to investigate the molecular scale origin of drug resistance. Using a surface plasmon resonance imaging, we measured the in situ Herceptin-Her2 binding kinetics in single intact cancer cells for the first time, and observed significantly weakened Herceptin-Her2 interactions in Herceptin-resistant cells, compared to those in Herceptin-sensitive cells. We further showed that the steric hindrance of Mucin-4, a membrane protein, was responsible for the altered drug-receptor binding. This effect of a third molecule on drug-receptor interactions cannot be studied using traditional purified protein methods, demonstrating the importance of the present intact cell-based binding kinetics analysis.

Quantifying the interactions of bacteria with external ligands is fundamental to the understanding of pathogenesis, antibiotic resistance, immune evasion, and mechanism of antimicrobial action. Due to inherent cell-to-cell heterogeneity in a microbial population, each bacterium interacts differently with its environment. This large variability is washed out in bulk assays, and there is a need of techniques that can quantify interactions of bacteria with ligands at the single bacterium level. In this work, we present a label-free and real-time plasmonic imaging technique to measure the binding kinetics of ligand interactions with single bacteria, and perform statistical analysis of the heterogeneity. Using the technique, we have studied interactions of antibodies with single Escherichia coli O157:H7 cells and demonstrated a capability of determining the binding kinetic constants of single live bacteria with ligands, and quantify heterogeneity in a microbial population.

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified.

We develop a framework to uncover and analyse dynamical anomalies from massive, nonlinear and non-stationary time series data. The framework consists of three steps: preprocessing of massive datasets to eliminate erroneous data segments, application of the empirical mode decomposition and Hilbert transform paradigm to obtain the fundamental components embedded in the time series at distinct time scales, and statistical/scaling analysis of the components. As a case study, we apply our framework to detecting and characterizing high-frequency oscillations (HFOs) from a big database of rat electroencephalogram recordings. We find a striking phenomenon: HFOs exhibit on–off intermittency that can be quantified by algebraic scaling laws. Our framework can be generalized to big data-related problems in other fields such as large-scale sensor data and seismic data analysis.

Recent works revealed that the energy required to control a complex network depends on the number of driving signals and the energy distribution follows an algebraic scaling law. If one implements control using a small number of drivers, e.g. as determined by the structural controllability theory, there is a high probability that the energy will diverge. We develop a physical theory to explain the scaling behaviour through identification of the fundamental structural elements, the longest control chains (LCCs), that dominate the control energy. Based on the LCCs, we articulate a strategy to drastically reduce the control energy (e.g. in a large number of real-world networks). Owing to their structural nature, the LCCs may shed light on energy issues associated with control of nonlinear dynamical networks.

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.