Existence and asymptotics of traveling waves for nonlocal diffusion systems

In this paper, we deal with the existence and asymptotic behavior of traveling waves for nonlocal diffusion systems with delayed monostable reaction terms. We obtain the existence of traveling wave front by using upper-lower solutions method and Schauder’s fixed point theorem for c > c₁(τ) and using a limiting argument for c = c₁(τ). Moreover, we find a priori asymptotic behavior of traveling waves with the help of Ikehara’s Theorem by constructing a Laplace transform representation of a solution. Especially, the delay can slow the minimal wave speed for ?₂f(0, 0) > 0 and the delay is independent of the minimal wave speed for ?₂f(0, 0) = 0.     

On “P” property and the column-W property

P-matrices play an important role in the well-posedness of a linear complementarity problem (LCP). Similarly, the well-posedness of a horizontal linear complementarity problem (HLCP) is closely related to the column-W property of a matrix k-tuple.In this paper we first consider the problem of generating P-matrices from a given pair of matrices. Given a matrix pair (D, F) where D is a square matrix of order m and matrix F has m rows, “what are the conditions under which there exists a matrix G such that (D + FG) is a P-matrix?”. We obtain necessary and sufficient conditions for the special case when the column rank of F is m ? 1. A decision algorithm of complexity O(m²) to check whether the given pair of matrices (D, F) is P-matrisable is obtained. We also obtain a necessary and an independent sufficient condition for the general case when rank(F) is less than m ? 1.We then generalise the P-matrix generating problem to the generation of matrix k-tuples satisfying the column-W property from a given matrix (k + 1)-tuple. That is, given a matrix (k + 1)-tuple (D₁, … ,D_k, F), where D_js are square matrices of order m and F is a matrix having m rows, we determine the conditions under which the matrix k-tuple (D₁ + FG₁, … ,D_k + FG_k) satisfies the column-W property. As in the case of P-matrices we obtain necessary and sufficient conditions for the case when rank(F) = m ? 1. Using these conditions a decision algorithm of complexity O(km²) to check whether the given matrix (k + 1)-tuple is column-W matrisable is obtained. Then for the case when rank(F) is less than m ? 1, we obtain a necessary and an independent sufficient condition.For a special sub-class of P-matrices we give a polynomial time decision algorithm for P-matrisability. Finally, we obtain a geometric characterisation of column-W property by generalising the well known separation theorem for P-matrices.     

Bounds of the hyper-chaotic Lorenz–Stenflo system

To estimate the ultimate bound and positively invariant set for a dynamical system is an important but quite challenging task in general. This paper attempts to investigate the ultimate bounds and positively invariant sets of the hyper-chaotic Lorenz–Stenflo (L–S) system, which is based on the optimization method and the comparison principle. A family of ellipsoidal bounds for all the positive parameters values a, b, c, dand a cylindrical bound for a > 0, b > 1, c > 0, d > 0 are derived. Numerical results show the effectiveness and advantage of our methods.     

On Certain C-Test Words for Free Groups

Let F_m be a free group of a finite rank m ≥ 2 and let X_i, Y_j be elements in F_m. A non-empty word w(x₁,…,x_n) is called a C-test word in n letters for F_m if, whenever (X₁,…,X_n) = w(Y₁,…,Y_n) ≠ 1, the two n-typles (X₁,…,X_n) and (Y₁,…,Y_n) are conjugate in F_m. In this paper we construct, for each n ≥ 2, a C-test word v_n(x₁,…,x_n) with the additional property that v_n(X₁,…,X_n) = 1 if and only if the subgroup of F_m generated by X₁,…,X_n is cyclic. Making use of such words v_m(x₁,…,x_m) and v_m + 1(x₁,…,x_m + 1), we provide a positive solution to the following problem raised by Shpilrain: There exist two elements u₁, u₂ ∈ F_m such that every endomorphism ψ of F_m with non-cyclic image is completely determined by ψ(u₁), ψ(u₂).     

New exact solitary-wave special solutions for the nonlinear dispersive K(m, n) equations

In this paper, we study the nonlinear dispersive K(m, n) equations: u_t + (u^m)_x − (uⁿ)_xxx = 0 which exhibit solutions with solitary patterns. New exact solitary solutions are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. The nonlinear equations K(m, n) are studied for two different cases, namely when m = n being odd and even integers. General formulas for the solutions of K(m, n) equations are established.     

Inverse dynamics of underactuated mechanical systems: A simple case study and experimental verification

Underactuated systems are featured by fewer control inputs than the degrees-of-freedom, m < n. The determination of an input control strategy that forces such a system to complete a set of m specified motion tasks is a challenging task, and the explicit solution existence is conditioned to differential flatness of the problem. The flatness-based solution denotes that all the 2n states and m control inputs can be algebraically expressed in terms of the m specified outputs and their time derivatives up to a certain order, which is in practice attainable only for simple systems. In this contribution the problem is posed in a more practical way as a set of index-three differential–algebraic equations, and the solution is obtained numerically. The formulation is then illustrated by a two-degree-of-freedom underactuated system composed of two rotating discs connected by a torsional spring, in which the pre-specified motion of one of the discs is actuated by the torque applied to the other disc, n = 2 and m = 1. Experimental verification of the inverse simulation control methodology is reported.     

New exact solution profiles of the nonlinear dispersion Drinfel’d–Sokolov (D(m, n)) system

In this paper, to understand the role of nonlinear dispersion in the coupled systems, the nonlinear dispersion Drinfel’d–Sokolov system (called D(m, n) system) is investigated. As a consequence, many types of compacton and solitary pattern solutions are obtained. Moreover, some solitary wave solutions are also deduced for differential parameters m, n. When n = 1, the D(m, 1) system with linear dispersion is shown to possess also compacton and solitary pattern solutions, which contain the known results. Moreover, some rational solutions of D(m, n) system are also deduced.     

Comment on the 3+1 dimensional Kadomtsev–Petviashvili equations

We comment on traveling wave solutions and rational solutions to the 3+1 dimensional Kadomtsev–Petviashvili (KP) equations: (u_t + 6uu_x + u_xxx)_x ± 3u_yy ± 3u_zz = 0. We also show that both of the 3+1 dimensional KP equations do not possess the three-soliton solution. This suggests that none of the 3+1 dimensional KP equations should be integrable, and partially explains why they do not pass the Painlevé test. As by-products, the one-soliton and two-soliton solutions and four classes of specific three-soliton solutions are explicitly presented.     

Fast Rectangular Matrix Multiplication and Applications

First we study asymptotically fast algorithms for rectangular matrix multiplication. We begin with new algorithms for multiplication of ann×nmatrix by ann×n²matrix in arithmetic timeO(n^ω),ω=3.333953…, which is less by 0.041 than the previous record 3.375477…. Then we present fast multiplication algorithms for matrix pairs of arbitrary dimensions, estimate the asymptotic running time as a function of the dimensions, and optimize the exponents of the complexity estimates. For a large class of input matrix pairs, we improve the known exponents. Finally we show three applications of our results:   (a) we decrease from 2.851 to 2.837 the known exponent of the work bounds for fast deterministic (NC) parallel evaluation of the determinant, the characteristic polynomial, and the inverse of ann×nmatrix, as well as for the solution to a nonsingular linear system ofnequations,   (b) we asymptotically accelerate the known sequential algorithms for the univariate polynomial composition mod xⁿ, yielding the complexity boundO(n^1.667) versus the old record ofO(n^1.688), and for the univariate polynomial factorization over a finite field, and   (c) we improve slightly the known complexity estimates for computing basic solutions to the linear programming problem withmconstraints andnvariables.     

Free convection heat and mass transfer in a power law fluid past an inclined surface with thermophoresis

The problem of heat and mass transfer in a power law, two-dimensional, laminar, boundary layer flow of a viscous incompressible fluid over an inclined plate with heat generation and thermophoresis is investigated by the characteristic function method. The governing non-linear partial differential equations describing the flow and heat transfer problem are transformed into a set of coupled non-linear ordinary differential equation which was solved using Runge–Kutta shooting method. Exact solutions for the dimensionless temperature and concentration profiles, are presented graphically for different physical parameters and for the different power law exponents 0 < n < 0.5 and for n > 0.5.     

Exact special solitary solutions with compact support for the nonlinear dispersive K(m, n) equations

The nonlinear dispersive K(m, n) equations, u_t−(u^m)_x−(uⁿ)_xxx = 0 which exhibit compactons: solitons with compact support, are studied. New exact solitary solutions with compact support are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. General formulas for the solutions of K(m, n) equations are established.     

Backbone fractal dimension and fractal hybrid orbital of protein structure

Fractal geometry analysis provides a useful and desirable tool to characterize the configuration and structure of proteins. In this paper we examined the fractal properties of 750 folded proteins from four different structural classes, namely (1) the α-class (dominated by α-helices), (2) the β-class (dominated by β-pleated sheets), (3) the (α/β)-class (α-helices and β-sheets alternately mixed) and (4) the (α + β)-class (α-helices and β-sheets largely segregated) by using two fractal dimension methods, i.e. “the local fractal dimension” and “the backbone fractal dimension” (a new and useful quantitative parameter). The results showed that the protein molecules exhibit a fractal behavior in the range of 1 ? N ? 15 (N is the number of the interval between two adjacent amino acid residues), and the value of backbone fractal dimension is distinctly greater than that of local fractal dimension for the same protein. The average value of two fractal dimensions decreased in order of α > α/β > α + β > β. Moreover, the mathematical formula for the hybrid orbital model of protein based on the concept of backbone fractal dimension is in good coincidence with that of the similarity dimension. So it is a very accurate and simple method to analyze the hybrid orbital model of protein by using the backbone fractal dimension.     

Structurally unstable regular dynamics in 1D piecewise smooth maps,and circle maps

In this work we consider a simple system of piecewise linear discontinuous 1D map with two discontinuity points: X′ = aX if ∣X∣ < z, X′ = bX if ∣X∣ > z, where a and b can take any real value, and may have several applications. We show that its dynamic behaviors are those of a linear rotation: either periodic or quasiperiodic, and always structurally unstable. A generalization to piecewise monotone functions X′ = F(X) if ∣X∣ < z, X′ = G(X) if ∣X∣ > z is also given, proving the conditions leading to a homeomorphism of the circle.     

Computing best-possible bounds for the distribution of a sum of several variables is NP-hard

In many real-life situations, we know the probability distribution of two random variables x₁ and x₂, but we have no information about the correlation between x₁ and x₂; what are the possible probability distributions for the sum x₁ + x₂? This question was originally raised by A.N. Kolmogorov. Algorithms exist that provide best-possible bounds for the distribution of x₁ + x₂; these algorithms have been implemented as a part of the efficient software for handling probabilistic uncertainty. A natural question is: what if we have several (n > 2) variables with known distribution, we have no information about their correlation, and we are interested in possible probability distribution for the sum y = x₁ + ⋯ + x_n? Known formulas for the case n = 2 can be (and have been) extended to this case. However, as we prove in this paper, not only are these formulas not best-possible anymore, but in general, computing the best-possible bounds for arbitrary n is an NP-hard (computationally intractable) problem.     

The average path length of scale free networks

In this paper, the exact solution of average path length in Barabási–Albert model is given. The average path length is an important property of networks and attracts much attention in many areas. The Barabási–Albert model, also called scale free model, is a popular model used in modeling real systems. Hence it is valuable for us to examine the average path length of scale free model. There are two answers, regarding the exact solution for the average path length of scale free networks, already provided by Newman and Bollobas respectively. As Newman proposed, the average path length grows as log(n) with the network size n. However, Bollobas suggested that while it was true when m = 1, the answer changed to log(n)/log(log(n)) when m > 1. In this paper, as we propose, the exact solution of average path length of BA model should approach log(n)/log(log(n)) regardless the value of m. Finally, the simulation is presented to show the validity of our result.     

Dynamics of landslide model with time delay and periodic parameter perturbations

In present paper, we analyze the dynamics of a single-block model on an inclined slope with Dieterich–Ruina friction law under the variation of two new introduced parameters: time delay T_d and initial shear stress μ. It is assumed that this phenomenological model qualitatively simulates the motion along the infinite creeping slope. The introduction of time delay is proposed to mimic the memory effect of the sliding surface and it is generally considered as a function of history of sliding. On the other hand, periodic perturbation of initial shear stress emulates external triggering effect of long-distant earthquakes or some non-natural vibration source. The effects of variation of a single observed parameter, T_d or μ, as well as their co-action, are estimated for three different sliding regimes: β < 1, β = 1 and β > 1, where β stands for the ratio of long-term to short-term stress changes. The results of standard local bifurcation analysis indicate the onset of complex dynamics for very low values of time delay. On the other side, numerical approach confirms an additional complexity that was not observed by local analysis, due to the possible effect of global bifurcations. The most complex dynamics is detected for β < 1, with a complete Ruelle–Takens–Newhouse route to chaos under the variation of T_d, or the co-action of both parameters T_d and μ. These results correspond well with the previous experimental observations on clay and siltstone with low clay fraction. In the same regime, the perturbation of only a single parameter, μ, renders the oscillatory motion of the block. Within the velocity-independent regime, β = 1, the inclusion and variation of T_d generates a transition to equilibrium state, whereas the small oscillations of μ induce oscillatory motion with decreasing amplitude. The co-action of both parameters, in the same regime, causes the decrease of block’s velocity. As for β > 1, highly-frequent, limit-amplitude oscillations of initial stress give rise to oscillatory motion. Also for β > 1, in case of perturbing only the initial shear stress, with smaller amplitude, velocity of the block changes exponentially fast. If the time delay is introduced, besides the stress perturbation, within the same regime, the co-action of T_d (T_d < 0.1) and small oscillations of μ induce the onset of deterministic chaos.     

Multi-server machine repair problems under a (V, R) synchronous single vacation policy

This paper considers a machine repair problem with M operating machines and S standbys, in which R repairmen are responsible for supervising these machines and operate a (V, R) vacation policy. With such policy, if the number of the failed machines is reduced to R − V (R > V) (there exists V idle repairmen) at a service completion, these V idle servers will together take a synchronous vacation (or leave for other secondary job). Upon returning from the vacation, they do not take a vacation again and remain idle until the first arriving failed machine arrives. The steady-state probabilities are solved in terms of matrix forms and the system performance measures are obtained. Algorithmic procedures are provided to deal with the optimization problem of discrete/continuous decision variables while maintaining a minimum specified level of system availability.     

A semi-Markov process with an inverse Gaussian distribution as sojourn time

Let X_n denote the state of a device after n repairs. We assume that the time between two repairs is the time τ taken by a Wiener process {W(t), t ? 0}, starting from w₀ and with drift μ < 0, to reach c ∈ [0, w₀). After the nth repair, the process takes on either the value X_n?1 + 1 or X_n?1 + 2. The probability that X_n = X_n?1 + j, for j = 1, 2, depends on whether τ ? t₀ (a fixed constant) or τ > t₀. The device is considered to be worn out when X_n ? k, where k ∈ {1, 2, …}. This model is based on the ones proposed by Rishel (1991) [1] and Tseng and Peng (2007) [2]. We obtain an explicit expression for the mean lifetime of the device. Numerical methods are used to illustrate the analytical findings.     

Magnetohydrodynamic stationary and oscillatory convective stability in a mushy layer during binary alloy solidification

For the case of solidification of a bottom cooled binary alloy, the magnetohydrodynamic stationary and oscillatory convective stability in the mushy layer is investigated analytically using normal mode linear stability analysis. In the limit of large Stefan number (S_t), a near–eutectic approximation with large far field temperature is considered in the present research. To ascertain the instability in the mushy layer, the strength of the superimposed magnetic field is so chosen that it corresponds to a given mush Hartmann number (Ha_m) of the problem. The results are presented for various values of mush Hartmann numbers in the range, 0 ≤ Ha_m ≤ 50. The critical Rayleigh number for stationary convection shows a linear relationship with increasing Ha_m. The magnetohydrodynamic effect imparts a stabilizing influence during stationary convection. In comparison to that of the stationary convective mode, the oscillatory mode appears to be critically susceptible at higher values of β (β = S_t/℘² ϒ², ℘ is the compositional ratio, ϒ = 1 + S_t/℘), and vice versa for lower β values. Analogous to the behavior for stationary convection, the magnetic field also offers a stabilizing effect in oscillatory convection and thus influences global stability of the mushy layer. Increasing magnetic strength shows reduction in the wavenumber and in the number of rolls formed in the mushy layer.     

Cooperation in spatial prisoner’s dilemma game with delayed decisions

Phenomena that time delays of information lead to delayed decisions are extensive in reality. The effect of delayed decisions on the evolution of cooperation in the spatial prisoner’s dilemma game is explored in this work. Players with memory are located on a two dimensional square lattice, and they can keep the payoff information of his neighbors and his own in every historic generation in memory. Every player uses the payoff information in some generation from his memory and the strategy information in current generation to determine which strategy to choose in next generation. The time interval between two generations is set by the parameter m. For the payoff information is used to determine the role model for the focal player when changing strategies, the focal player’s decision to learn from which neighbor is delayed by m generations. Simulations show that cooperation can be enhanced with the increase of m. In addition, just like the original evolutionary game model (m = 0), pretty dynamic fractal patterns featuring symmetry can be obtained when m > 0 if we simulate the invasion of a single defector in world of cooperators on square lattice.