Traveling wave solutions of Lotka–Volterra type two predators‐one prey model

In this work, we consider a model with one basal resource and two species of predators feeding by the same resource. There are three non‐trivial boundary equilibria. One is the saturated state E_K of the prey without any predator. Other two equilibria, E₁ and E₂, are the coexistence states of the prey with only one species of predators. Using a high‐dimensional shooting method, the Wazewski' principle, we establish the conditions for the existence of traveling wave solutions from E_K to E₂ and from E₁ to E₂. These results show that the advantageous species v₂ always win in the competition and exclude species v₁ eventually. Finally, some numerical simulations are presented, and biological interpretations are given. Copyright © 2016 John Wiley & Sons, Ltd.     

On the security analysis of an image scrambling encryption of pixel bit and its improved scheme based on self-correlation encryption

An image scrambling encryption scheme for pixel bits was presented by Ye [Ye GD. Image scrambling encryption algorithm of pixel bit based on chaos map. Pattern Recognit Lett 2010;31:347-54], which can be seen as one kind of typical binary image scrambling encryption considering from the bit-plain of size M × (8N). However, recently, some defects existing in the original image encryption scheme, i.e., Ye’s scheme, have been observed by Li and Lo [Li CQ, Lo KT. Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks. Signal Process 2011;91:949-54]. In the attack proposed by Li and Lo at least 3 + ⌈log₂(MN)⌉ plain images of size M × N are used to reveal the permutation matrix W = [w(i, k)] (i ∈ {1, 2, … , M}; k ∈ {1, 2, … , 8N}) which can be applied to recover the exact plain image. In the current paper, at first, one type of special plain image/cipher image is used to analyze the security weakness of the original image scrambling scheme under study. The final encryption vectors TM and TN or the decryption vectors TM′ and TN′ are revealed completely according to our attack. To demonstrate the performance of our attack, a quantified comparison is drawn between our attack and the attack proposed by Li and Lo. Compared with Li and Lo’s attack, our attack is more efficient in the general conditions. In particular, when the sizes of images satisfy the condition M = N or M ? 8N, the number of the used plain images/cipher images is at most 9, which is sharply less than 3 + ⌈log₂(MN)⌉ when M and N are of large size. To overcome the weaknesses of the original scheme, in this paper, an improved image scrambling encryption scheme is proposed. In the improved scheme, the idea of the “self-correlation” method is used to resist the chosen-plaintext attack/known-plaintext attack. The corresponding simulations and analyses illustrate that the improved encryption method has good cryptographic properties, and can overcome the weakness of the original image encryption scheme. Finally, farther improvement is briefly presented for the future work.     

Prior influence in linear regression when the number of covariates increases to infinity

It is becoming more typical in regression problems today to have the situation where “p>n”, that is, where the number of covariates is greater than the number of observations. Approaches to this problem include such strategies as model selection and dimension reduction, and, of course, a Bayesian approach. However, the discrepancy between p and n can be so large, especially in genomic data, that examining the limiting case where p→∞ can be a relevant calculation. Here we look at the effect of a prior distribution on the coefficients, and in particular characterize the conditions under which, as p→∞, the prior does not overwhelm the data. Specifically, we find that the prior variance on the growing number of covariates must approach zero at rate 1/p, otherwise the prior will overwhelm the data and the posterior distribution of the regression coefficient will equal the prior distribution.     

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

For problems SAT and MAX SAT, local search algorithms are widely acknowledged as one of the most effective approaches. Most of the local search algorithms are based on the 1-flip neighborhood, which is the set of solutions obtainable by flipping the truth assignment of one variable. In this paper, we consider r-flip neighborhoods for r = 2, 3, and examine their effectiveness by computational experiments. In the accompanying paper, we proposed new implementations of these neighborhoods, and showed that the expected size of 2-flip neighborhood is O(n + m) and that of 3-flip neighborhood is O(m + t ² n), compared to their original size O(n ²) andO(n ³), respectively, where n is the number of variables, m is the number of clauses and t is the maximum number of appearances of one variable. These are used in this paper under the framework of tabu search and other metaheuristic methods, and compared with other existing algorithms with 1-flip neighborhood. The results exhibit good prospects of larger neighborhoods.     

三维动边值问题的迎风差分方法

可压缩可混溶油、水三维渗流动边值问题的研究,对重建盆地发育中油气资源运移、聚集的历史和评估油气资源的勘探与开发有重要的价值, 其数学模型是一组非线性耦合偏微分方程组的动边值问题. 该文对有界域的动边值问题提出一类新的二阶修正迎风差分格式, 应用区域变换、 变分形式、能量方法、差分算子乘积交换性理论、高阶差分算子的分解、微分方程先验估计的理论和技巧, 得到了最佳 $l^2$ 误差估计结果. 该方法已成功应用到油资评估的数值模拟中. 它对这一领域的模型分析, 数值方法和软件研制均有重要的价值.     

Multivariate Liouville distributions

A random vector (X₁, …, X_n), with positive components, has a Liouville distribution if its joint probability density function is of the formf(x₁ + … + x_n)x₁^a₁.1 … x_n^a_n.1 with thea_i all positive. Examples of these are the Dirichlet and inverted Dirichlet distributions. In this paper, a comprehensive treatment of the Liouville distributions is provided. The results pertain to stochastic representations, transformation properties, complete neutrality, marginal and conditional distributions, regression functions, and total positivity and reverse rule properties. Further, these topics are utilized in various characterizations of the Dirichlet and inverted Dirichlet distributions. Matrix analogs of the Liouville distributions are also treated, and many of the results obtained in the vector setting are extended appropriately.     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part I. Maehly Type Approximants

Laurent Padé–Chebyshev rational approximants, A _m (z,z ^–1)/B _n (z,z ^–1), whose Laurent series expansions match that of a given function f(z,z ^–1) up to as high a degree in z,z ^–1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z ^–1)B _n (z,z ^–1) and A _m (z,z ^–1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé–Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé–Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé–Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé–Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent–Chebyshev series on a variety of functions. In part II of this paper [7] Padé–Chebyshev approximants of Clenshaw–Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

On the characteristic polynomial of a special class of graphs and spectra of balanced trees

Let H be a simple graph with n vertices and G be a sequence of n rooted graphs G₁,G₂,…,G_n. Godsil and McKay [C.D. Godsil, B.D. McKay, A new graph product and its spectrum, Bull. Austral. Math. Soc. 18 (1978) 21-28] defined the rooted product H(G), of H by G by identifying the root vertex of G_i with the ith vertex of H, and determined the characteristic polynomial of H(G). In this paper we prove a general result on the determinants of some special matrices and, as a corollary, determine the characteristic polynomials of adjacency and Laplacian matrices of H(G).Rojo and Soto [O. Rojo, R. Soto, The spectra of the adjacency matrix and Laplacian matrix for some balanced trees, Linear Algebra Appl. 403 (2005) 97-117] computed the characteristic polynomials and the spectrum of adjacency and Laplacian matrices of a class of balanced trees. As an application of our results, we obtain their conclusions by a simple method.     

Certain fractional derivative formulae involving the product of a general class of polynomials and the multivariableH-function

In the present paper, we obtain three unified fractional derivative formulae (FDF). The first involves the product of a general class of polynomials and the multivariableH-function. The second involves the product of a general class of polynomials and two multivariableH-functions and has been obtained with the help of the generalized Leibniz rule for fractional derivatives. The last FDF also involves the product of a general class of polynomials and the multivariableH-function but it is obtained by the application of the first FDF twice and it involves two independent variables instead of one. The polynomials and the functions involved in all our fractional derivative formulae as well as their arguments which are of the typex ^ρ Π _i=1 ^s (x ^t _i +α _i ) ^σ _i are quite general in nature. These formulae, besides being of very general character have been put in a compact form avoiding the occurrence of infinite series and thus making them useful in applications. Our findings provide interesting unifications and extensions of a number of (new and known) results. For the sake of illustration, we give here exact references to the results (in essence) of five research papers [2, 3,10, 12, 13] that follow as particular cases of our findings. In the end, we record a new fractional derivative formula involving the product of the Hermite polynomials, the Laguerre polynomials and the product ofr different Whittaker functions as a simple special case of our first formula.     

RN中一类拟线性椭圆方程组非负解的存在性和多重性

利用极小极大原理和Lj usternik-Schnirelmann畴数理论,研究了RN中一类拟线性椭圆方程组.当2≤p,q＜N时,α≥0,β≥0满足α+β+2＞max{p,q}和α+1/p*+β+1/q*≤1,通过建立解的个数与正连续函数V和W达到极小值集合的拓扑量之间的关系,得到拟线性方程组至少存在catMδ (M)个不同的非负解.     

On the interpolation of some generalized function spaces of different anisotropy

In the paper, the interpolation properties of the spacesH _p ^s (v; ℝ _n ) of Sobolev-Liouville type and the spacesB _{p, q} ^s (μ ℝ _n ) of Nikol'skii-Besov type generated by functions of polynomial growth that are infinitely differentiable outside of the origin are studied. Interpolation formulas for the pairs {H(v _o ),H(v ₁)} and {B(μ₀),B(μ₁)} of spaces of the above types for which the anisotropies of the interpolated spaces do not depend on each other are proved. The investigated spaces, for certain specification of the generating functions, coincide with the classical (isotropic and anisotropic) Sobolev-Liouville and Nikol'skii-Besov spaces. Translated fromMatematicheskie Zametki, Vol. 62, No. 5, pp. 666–672, November, 1997. Translated by A. I. Shtern     

Uncomputability and undecidability in economic theory

Economic theory, game theory and mathematical statistics have all increasingly become algorithmic sciences. Computable Economics, Algorithmic Game Theory[Noam Nisan, Tim Roiughgarden, Éva Tardos, Vijay V. Vazirani (Eds.), Algorithmic Game Theory, Cambridge University Press, Cambridge, 2007] and Algorithmic Statistics[Péter Gács, John T. Tromp, Paul M.B. Vitányi, Algorithmic statistics, IEEE Transactions on Information Theory 47 (6) (2001) 2443-2463] are frontier research subjects. All of them, each in its own way, are underpinned by (classical) recursion theory - and its applied branches, say computational complexity theory or algorithmic information theory - and, occasionally, proof theory. These research paradigms have posed new mathematical and metamathematical questions and, inadvertently, undermined the traditional mathematical foundations of economic theory. A concise, but partial, pathway into these new frontiers is the subject matter of this paper. Interpreting the core of mathematical economic theory to be defined by General Equilibrium Theory and Game Theory, a general - but concise - analysis of the computable and decidable content of the implications of these two areas are discussed. Issues at the frontiers of macroeconomics, now dominated by Recursive Macroeconomic Theory (The qualification ‘recursive’ here has nothing to do with ‘recursion theory’. Instead, this is a reference to the mathematical formalizations of the rational economic agent’s intertemporal optimization problems, in terms of Markov Decision Processes, (Kalman) Filtering and Dynamic Programming, where a kind of ‘recursion’ is invoked in the solution methods. The metaphor of the rational economic agent as a ‘signal processor’ underpins the recursive macroeconomic paradigm.), are also tackled, albeit ultra briefly. The point of view adopted is that of classical recursion theory and varieties of constructive mathematics.     

Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub‐tournaments

Ao and Hanson, and Guiduli, Gyárfás, Thomassé and Weidl independently, proved the following result: For any tournament score sequence S = (s₁, s₂, … ,s_n) with s₁≤s₂ ≤ … ≤ s_n, there exists a tournament T on vertex set {1,2, …, n} such that the score of each vertex i is s_i and the sub‐tournaments of T on both the even and the odd indexed vertices are transitive in the given order; that is, i dominates j whenever i > j and i ≡ j (mod 2). In this note, we give a much shorter proof of the result. In the course of doing so, we show that the score sequence of a tournament satisfies a set of inequalities which are individually stronger than the well‐known set of inequalities of Landau, but collectively the two sets of inequalities are equivalent. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 244–254, 2001     

Homoclinic bifurcations at the onset of pulse self-replication

We establish a series of properties of symmetric, N-pulse, homoclinic solutions of the reduced Gray-Scott system: u^″=uv², v^″=v−uv², which play a pivotal role in questions concerning the existence and self-replication of pulse solutions of the full Gray-Scott model. Specifically, we establish the existence, and study properties, of solution branches in the (α,β)-plane that represent multi-pulse homoclinic orbits, where α and β are the central values of u(x) and v(x), respectively. We prove bounds for these solution branches, study their behavior as α→∞, and establish a series of geometric properties of these branches which are valid throughout the (α,β)-plane. We also establish qualitative properties of multi-pulse solutions and study how they bifurcate, i.e., how they change along the solution branches.     

ω-非常凸空间与ω-非常光滑空间

本文研究了ω-非常凸空间和ω-非常光滑空间的问题.利用局部自反原理和切片证明了ω-非常凸空间和ω-非常光滑空间的对偶关系,讨论了ω-非常凸空间和ω-非常光滑空间与其它凸性和光滑性的关系,给出了ω-非常凸空间与ω-非常光滑空间的若干特征刻画,所得结果完善了关于Banach空间凸性与光滑性理论的研究.     

Lattice tensor products. III - Congruences

G. Grätzer and F. Wehrung introduced the lattice tensor product, A?B, of the lattices Aand B. In Part I of this paper, we showed that for any finite lattice A, we can "coordinatize" A?B, that is, represent A?,B as a subset A of B ^A, and provide an effective criteria to recognize the A-tuples of elements of B that occur in this representation. To show the utility of this coordinatization, we prove, for a finite lattice A and a bounded lattice B, the isomorphism Con A ≌ (Con A)B>, which is a special case of a recent result of G. Grätzer and F. Wehrung and a generalization of a 1981 result of G. Grätzer, H. Lakser, and R.W. Quackenbush.     

On <Emphasis Type="Italic">n</Emphasis> × <Emphasis Type="Italic">m</Emphasis>-valued Łukasiewicz-Moisil algebras

n×m-valued Łukasiewicz algebras with negation were introduced and investigated in [20, 22, 23]. These algebras constitute a non trivial generalization of n-valued Łukasiewicz-Moisil algebras and in what follows, we shall call them n×m-valued Łukasiewicz-Moisil algebras (or LM _n×m -algebras). In this paper, the study of this new class of algebras is continued. More precisely, a topological duality for these algebras is described and a characterization of LM _n×m -congruences in terms of special subsets of the associated space is shown. Besides, it is determined which of these subsets correspond to principal congruences. In addition, it is proved that the variety of LM _n×m -algebras is a discriminator variety and as a consequence, certain properties of the congruences are obtained. Finally, the number of congruences of a finite LM _n×m -algebra is computed.      

On proper secrets, (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-bases and linear codes

This paper contains three parts where each part triggered and motivated the subsequent one. In the first part (Proper Secrets) we study the Shamir’s “k-out-of-n” threshold secret sharing scheme. In that scheme, the dealer generates a random polynomial of degree k−1 whose free coefficient is the secret and the private shares are point values of that polynomial. We show that the secret may, equivalently, be chosen as any other point value of the polynomial (including the point at infinity), but, on the other hand, setting the secret to be any other linear combination of the polynomial coefficients may result in an imperfect scheme. In the second part ((t, k)-bases) we define, for every pair of integers t and k such that 1 ≤ t ≤ k−1, the concepts of (t, k)-spanning sets, (t, k)-independent sets and (t, k)-bases as generalizations of the usual concepts of spanning sets, independent sets and bases in a finite-dimensional vector space. We study the relations between those notions and derive upper and lower bounds for the size of such sets. In the third part (Linear Codes) we show the relations between those notions and linear codes. Our main notion of a (t, k)-base bridges between two well-known structures: (1, k)-bases are just projective geometries, while (k−1, k)-bases correspond to maximal MDS-codes. We show how the properties of (t, k)-independence and (t, k)-spanning relate to the notions of minimum distance and covering radius of linear codes and how our results regarding the size of such sets relate to known bounds in coding theory. We conclude by comparing between the notions that we introduce here and some well known objects from projective geometry.      

Convexity of trace functionals and Schrödinger operators

Let H be a semi-bounded self-adjoint operator on a separable Hilbert space. For a certain class of positive, continuous, decreasing, and convex functions F we show the convexity of trace functionals of the form tr(F(H+U−ε(U)))−ε(U), where U is a bounded, self-adjoint operator and ε(U) is a normalizing real function—the Fermi level—which may be identical zero. If additionally F is continuously differentiable, then the corresponding trace functional is Fréchet differentiable and there is an expression of its gradient in terms of the derivative of F. The proof of the differentiability of the trace functional is based upon Birman and Solomyak's theory of double Stieltjes operator integrals. If, in particular, H is a Schrödinger-type operator and U a real-valued function, then the gradient of the trace functional is the quantum mechanical expression of the particle density with respect to an equilibrium distribution function f=−F^′. Thus, the monotonicity of the particle density in its dependence on the potential U of Schrödinger's operator—which has been understood since the late 1980s—follows as a special case.