Further bounds for waiting time distributions and their means in the case ρ<1

In the paper exponential bounds for the instationary and stationary waiting time d.f.'s in GI/GI/1/∞, derived by several authors partly using martingale theory arguments, are improved with the help of monotonicity properties. Further it is shown that Ne?eptjrenko's bound for the rate of convergence of the mean waiting time in single server queues Is also valid for many server queues with ρ < 1.     

Evaluating nonlinear variability of mental fatigue behavioral indices during long‐term attentive task

This study investigates the behavioral indices of attention. A simple repetitive attentive task that resulted in mental fatigue was used consecutively in four trials. In the first step, reaction time and error responses were recorded to evaluate differences among trials. During the task, subjects showed different responses to stimulations. In the second part, to recognize the strategies, multiple clustering methods such as k‐means and fuzzy c‐means were performed in which behavioral indices and nonlinear features were used. In the last section, mental behavior was identified as a result of the chaotic properties of variations in reaction time. Therefore, the Lyapunov exponent of reaction times was evaluated. Results revealed that behavioral indices could distinguish attention from the occurrence of mental fatigue in trials. In addition, the three strategies used by subjects during the test protocol were assessed. Finally, variation of indices extracted from nonlinear analysis, that is, decrease in degree of chaotic behavior determined the transition from attention to mental fatigue. © 2012 Wiley Periodicals, Inc. Complexity, 2012     

Impact of Positional Isomerism on Pathway Complexity in Aqueous Media

Pathway complexity has become an important topic in recent years due to its relevance in the optimization of molecular assembly processes, which typically require precise sample preparation protocols. Alternatively, competing aggregation pathways can be controlled by molecular design, which primarily rely on geometrical changes of the building blocks. However, understanding how to control pathway complexity by molecular design remains elusive and new approaches are needed. Herein, we exploit positional isomerism as a new molecular design strategy for pathway control in aqueous self‐assembly. We compare the self‐assembly of two carboxyl‐functionalized amphiphilic BODIPY dyes that solely differ in the relative position of functional groups. Placement of the carboxyl group at the 2‐position enables efficient pairwise H‐bonding interactions into a single thermodynamic species, whereas meso‐substitution induces pathway complexity due to competing hydrophobic and hydrogen bonding interactions. Our results show the importance of positional engineering for pathway control in aqueous self‐assembly.     

Living Supramolecular Polymerization of an Aza‐BODIPY Dye Controlled by a Hydrogen‐Bond‐Accepting Triazole Unit Introduced by Click Chemistry

An aza‐BODIPY dye 1 bearing two hydrophobic fan‐shaped tridodecyloxybenzamide pendants through 1,2,3‐triazole linkages was synthesized by a click reaction and characterized. ¹H NMR studies indicated that dye 1 exhibited variable conformations through intramolecular H‐bonding interaction, which is beneficial for the polymorphism of aggregation. The thermodynamic, structural, and kinetic aspect of the supramolecular polymerization of dye 1 was investigated by UV/Vis absorption spectroscopy, IR spectroscopy, AFM, TEM, and SEM. Biphasic aggregation pathways of dye 1 , leads to the formation of off‐pathway, metastable Agg. I and thermodynamically stable Agg. II with distinct H‐aggregation spectra and nanoscale morphology. The living manner of the supramolecular polymerization of dye 1 was demonstrated in seeded polymerization experiments with temperature‐modulated successive cooling–heating cycles.     

Analyzing complex networks evolution through Information Theory quantifiers

A methodology to analyze dynamical changes in complex networks based on Information Theory quantifiers is proposed. The square root of the Jensen-Shannon divergence, a measure of dissimilarity between two probability distributions, and the MPR Statistical Complexity are used to quantify states in the network evolution process. Three cases are analyzed, the Watts-Strogatz model, a gene network during the progression of Alzheimer's disease and a climate network for the Tropical Pacific region to study the El Niño/Southern Oscillation (ENSO) dynamic. We find that the proposed quantifiers are able not only to capture changes in the dynamics of the processes but also to quantify and compare states in their evolution.     

Systems biology reveals biology of systems

In the last decades, genomic and postgenomic technologies obtained a great amount of information on molecular bases of cell physiology and organization. In spite of this, the knowledge of cells and living organisms in their entirety, is far from being achieved. In order to deal with biological complexity, Systems Biology uses a new approach to overcome this inadequacy. Despite different definitions, Systems Biology's view of biological phenomena highlights that a holistic perspective is needed to integrate and understand the huge amount of empirical data which have been collected. This is one of the aspects that makes Systems Biology so interesting, from a theoretical and epistemological point of view, and that renders it a useful tool to help students approach living beings' dynamics within a comprehensive framework of their biological features as well. © 2010 Wiley Periodicals, Inc. Complexity, 2010     

Examples of entropy generating sequence

We introduce the notion of entropy generating sequence for infinite words and define its dimension when it exists. We construct an entropy generating sequence for each symbolic example constructed by Cassaigne such that the dimension of the sequence is the same as its topological entropy dimension. Hence the complexity can be measured via the dimension of an entropy generating sequence. Moreover, we construct a weakly mixing example with subexponential growth rate.     

Path-following interior point algorithms for the Cartesian <Emphasis Type="Italic">P</Emphasis><Subscript>*</Subscript>(κ)-LCP over symmetric cones

In this paper, we establish a theoretical framework of path-following interior point algorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P _*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P _*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms. This work was supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)