Limit distribution of the coefficients of polynomials with only unit roots

We consider sequences of random variables whose probability generating functions have only roots on the unit circle, which has only been sporadically studied in the literature. We show that the random variables are asymptotically normally distributed if and only if the fourth central and normalized (by the standard deviation) moment tends to 3, in contrast to the common scenario for polynomials with only real roots for which a central limit theorem holds if and only if the variance is unbounded. We also derive a representation theorem for all possible limit laws and apply our results to many concrete examples in the literature, ranging from combinatorial structures to numerical analysis, and from probability to analysis of algorithms. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46,707–738, 2015     

MULTI-DIMENSIONAL MARKOV CHAIN–BASED ANALYSIS OF CONFLICT PROBABILITY FOR SPECTRUM RESOURCE SHARING

In this paper, we consider the optimal problem of channels sharing with heterogeneous traffic(real-time service and non-real-time service) to reduce the data conflict probability of users. Moreover, a multi-dimensional Markov chain model is developed to analyze the performance of the proposed scheme. Meanwhile, performance metrics are derived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.     

Modeling and analysis of a marine plankton system with nutrient recycling and diffusion

This article describes a nutrient‐phytoplankton‐zooplankton system with nutrient recycling in the presence of toxicity. We have studied the dynamical behavior of the system with delayed nutrient recycling in the first part of the article. Uniform persistent of the system is examined. In the second part of the article, we have incorporated diffusion of the plankton population to the system and dynamical behavior of the system is analyzed with instantaneous nutrient recycling. The condition of the diffusion driven instability is obtained. The conditions for the occurrence of Hopf and Turing bifurcation critical line in a spatial domain are derived. Variation of the system with small periodicity of diffusive coefficient has been studied. Stability condition of the plankton system subject to the periodic diffusion coefficient of the zooplankton is derived. It is observed that nutrient‐phytoplankton‐zooplankton interactions are very complex and situation specific. Moreover, we have obtained different exciting results, ranging from stable situation to cyclic oscillatory behavior may occur under different favorable conditions, which may give some insights for predictive management. © 2014 Wiley Periodicals, Inc. Complexity 21: 229–241, 2015     

On a problem of Hornik

In 1991,Hornik proved that the collection of single hidden layer feedforward neural networks(SLFNs)with continuous,bounded,and non-constant activation functionσis dense in C(K)where K is a compact set in R~s(see Neural Networks,4(2),251-257(1991)).Meanwhile,he pointed out"Whether or not the continuity assumption can entirely be dropped is still an open quite challenging problem".This paper replies in the affirmative to the problem and proves that for bounded and continuous almost everywhere(a.e.)activation functionσon R,the collection of SLFNs is dense in C(K)if and only ifσis un-constant a.e..     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

On strong solutions to the compressible Hall-magnetohydrodynamic system

In this paper, we consider strong/classical solutions to the 3D compressible Hall-magnetohydrodynamic system. First, we prove the existence of local strong solutions with positive density. Then the existence of global small solutions with small initial data is proved. Optimal time decay rate is also established.     

A simulation method of aircraft plumes for real-time imaging

Real-time infrared simulation technology can provide a large number of infrared images under different conditions to support the design, test and evaluation of a system having infrared imaging equipment with very low costs. By synthesizing heat transfer, infrared physics, fluid mechanics and computer graphics, a real-time infrared simulation method is proposed based on the method of characteristics to predict the infrared feature of aircraft plumes, which tries to obtain a good balance between simulation precision and computation efficiency. The temperature and pressure distribution in the under-expansion status can be rapidly solved with dynamically changing flight statuses and engine working states. And a modified C–G (Curtis–Godson) spectral band model that combines the plume streamlines with the conventional C–G spectral band model was implemented to calculate the non-uniformly distributed radiation parameters inside a plume field. The simulation result was analyzed and compared with the CFD++, which validates the credibility and efficiency of the proposed simulation method.