Two-stage Turing model for generating pigment patterns on the leopard and the jaguar

Based on the results of phylogenetic analysis, which showed that flecks are the primitive pattern of the felid family and all other patterns including rosettes and blotches develop from it, we construct a Turing reaction-diffusion model which generates spot patterns initially. Starting from this spotted pattern, we successfully generate patterns of adult leopards and jaguars by tuning parameters of the model in the subsequent phase of patterning

The Impact of User Effects on the Performance of Dual Receive Antenna Diversity Systems in Flat Rayleigh Fading Channels

In this paper we study the impact of user effects on the performance of receive antenna diversity systems in flat Rayleigh fading channels. Three diversity combining techniques are compared: maximal ratio combining (MRC), equal gain combining (EGC), and selection combining (SC). User effects are considered in two scenarios: 1) body loss (the reduction of effective antenna gain due to user effects) on a single antenna, and 2) equal body loss on both antennas. The system performance is assessed in terms of mean SNR, link reliability, bit error rate of BPSK, diversity order and ergodic capacity. Our results show that body loss on a single antenna has limited (bounded) impact on system performance. In comparison, body loss on both antennas has unlimited (unbounded) impact and can severely degrade system performance. Our results also show that with increasing body loss on a single antenna the performance of EGC drops faster than that of MRC and SC. When body loss on a single antenna is larger than a certain level, EGC is not a “sub-optimal” method anymore and has worse performance than SC

Oscillatory Turing Patterns in a Simple Reaction-Diffusion System

Turing suggested that, under certain conditions, chemicals can react and diffuse in such a way as to produce steady-state inhomogeneous spatial patterns of chemical concentrations. We consider a simple two-variable reaction-diffusion system and find there is a spatio-temporally oscillating solution (STOS) in parameter regions where linear analysis predicts a pure Turing instability and no Hopf instability. We compute the boundary of the STOS and spatially non-uniform solution (SSNS) regions and investigate what features control its behavior

Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm

We propose a new algorithm MARINLINGA for reverse line graph computation, i.e., constructing the original graph from a given line graph. Based on the completely new and simpler principle of link relabeling and endnode recognition, MARINLINGA does not rely on Whitney's theorem while all previous algorithms do. MARINLINGA has a worst case complexity of O(N^2), where N denotes the number of nodes of the line graph. We demonstrate that MARINLINGA is more time-efficient compared to Roussopoulos's algorithm, which is well-known for its efficiency.Comment: 30 pages, 24 figure

Inner product computation for sparse iterative solvers on\ud distributed supercomputer

Recent years have witnessed that iterative Krylov methods without re-designing are not suitable for distribute supercomputers because of intensive global communications. It is well accepted that re-engineering Krylov methods for prescribed computer architecture is necessary and important to achieve higher performance and scalability. The paper focuses on simple and practical ways to re-organize Krylov methods and improve their performance for current heterogeneous distributed supercomputers. In construct with most of current software development of Krylov methods which usually focuses on efficient matrix vector multiplications, the paper focuses on the way to compute inner products on supercomputers and explains why inner product computation on current heterogeneous distributed supercomputers is crucial for scalable Krylov methods. Communication complexity analysis shows that how the inner product computation can be the bottleneck of performance of (inner) product-type iterative solvers on distributed supercomputers due to global communications. Principles of reducing such global communications are discussed. The importance of minimizing communications is demonstrated by experiments using up to 900 processors. The experiments were carried on a Dawning 5000A, one of the fastest and earliest heterogeneous supercomputers in the world. Both the analysis and experiments indicates that inner product computation is very likely to be the most challenging kernel for inner product-based iterative solvers to achieve exascale