Local smoothing property and Strichartz inequality for Schrödinger equations with potentials superquadratic at infinity

We study smoothing properties for time-dependent Schrödinger equations , , with potentials which satisfy V(x)=O(|x|^m) at infinity, m?2. We show that the solution u(t,x) is 1/m times differentiable with respect to x at almost all , and explain that this is the result of the fact that the sojourn time of classical particles with energy λ in arbitrary compact set is less than CTλ^−1/m during [0,T] when λ is very large. We also show Strichartz's inequality with derivative loss for such potentials and give its application to nonlinear Schrödinger equations.     

A diffusive predator-prey model in heterogeneous environment

In this paper, we demonstrate some special behavior of steady-state solutions to a predator-prey model due to the introduction of spatial heterogeneity. We show that positive steady-state solutions with certain prescribed spatial patterns can be obtained when the spatial environment is designed suitably. Moreover, we observe some essential differences of the behavior of our model from that of the classical Lotka-Volterra model that seem to arise only in the heterogeneous case.     

Boundary blow-up solutions with a spike layer

We prove that for large λ>0, the boundary blow-up problem

     

马尔可夫链模型在灾变预测中的应用

利用马尔可夫链模型的原理预测灾变，以郑州市旱涝等级的预测作为实例，介绍了使用这种模型的方法与步骤，预测结果表明，利用马尔可夫链模型预测灾变是可行的。     

Path connectivity of idempotents on a Hilbert space

Let and be two idempotents on a Hilbert space. In 2005, J. Giol in [Segments of bounded linear idempotents on a Hilbert space, J. Funct. Anal. 229(2005) 405-423] had established that, if is invertible, then and are homotopic with In this paper, we have given a necessary and sufficient condition that where denotes the minimal number of segments required to connect not only from to , but also from to in the set of idempotents.

     

Identification and control of nonlinear systems by a dissimilation particle swarm optimization-based Elman neural network

In this paper, we first present a learning algorithm for dynamic recurrent Elman neural networks based on a dissimilation particle swarm optimization. The proposed algorithm computes concurrently both the evolution of network structure, weights, initial inputs of the context units, and self-feedback coefficient of the modified Elman network. Thereafter, we introduce and discuss a novel control method based on the proposed algorithm. More specifically, a dynamic identifier is constructed to perform speed identification and a controller is designed to perform speed control for Ultrasonic Motors (USM). Numerical experiments show that the novel identifier and controller based on the proposed algorithm can both achieve higher convergence precision and speed than other state-of-the-art algorithms. In particular, our experiments show that the identifier can approximate the USM's nonlinear input–output mapping accurately. The effectiveness of the controller is verified using different kinds of speeds of constant, step, and sinusoidal types. Besides, a preliminary examination on a randomly perturbation also shows the robust characteristics of the two proposed models.     

A construction for optimal <Emphasis Type="Italic">c</Emphasis>-splitting authentication and secrecy codes

Authentication and secrecy codes which provide both secrecy and authentication have been intensively studied in the case where there is no splitting; however the results concerning the case where there is splitting are far fewer. In this paper, we focus on the case with c-splitting, and obtain a bound on the number of encoding rules required in order to obtain maximum levels of security. A c-splitting authentication and secrecy code is called optimal if it obtains maximum levels of security and has the minimum number of encoding rules. We define a new design, called an authentication perpendicular multi-array, and prove that the existence of authentication perpendicular multi-arrays implies the existence of optimal c-splitting authentication and secrecy codes. Further, we study the constructions and existence of authentication perpendicular multi-arrays, and then obtain two new infinite classes of optimal c-splitting authentication and secrecy codes.     

2-Arc-transitive cyclic covers of $$K_{n,n}$$

In this paper, a complete classification is achieved of all the regular covers of the complete bipartite graphs \(K_{n,n}\) with cyclic covering transformation group, whose fibre-preserving automorphism group acts 2-arc-transitively. All these covers consist of one threefold covers of \(K_{6,6}\), one twofold cover of \(K_{12, 12}\) and one infinite family X(r, p) of p-fold covers of \(K_{p^r,p^r}\) with p a prime and r an integer such that \(p^r\ge 3\). This infinite family X(r, p) can be derived by a very simple and nice voltage assignment f as follows: \(X(r, p)=K_{p^r, p^r}\times _f \mathbb {Z}_p\), where \(K_{p^r, p^r}\) is a complete bipartite graph with the bipartition \(V=\{ \alpha \bigm |\alpha \in V(r,p)\}\cup \{ \alpha '\bigm |\alpha \in V(r,p)\}\) for the r-dimensional vector space V(r, p) over the field of order p and \(f_{\alpha ,\beta '}=\sum _{i=1}^ra_ib_i,\,\, \mathrm{for\,\,all}\,\,\alpha =(a_i)_r, \beta =(b_i)_r\in V(r,p)\).     

Full characterization of the embedding relations between α-modulation spaces

In this paper, we consider the embedding relations between any two a-modulation spaces. Based on an observation that the a-modulation space with smaller a can be regarded as a corresponding decomposition space associated with a-covering for larger a, we give a complete characterization of the Fourier multipliers between a-modulation spaces with different a. Then we establish a full version of optimal embedding relations between a-modulation spaces.     

Pentavalent symmetric graphs admitting transitive non-abelian characteristically simple groups

Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G=T^l$ with $l\ge 1$. In this paper we prove that if every connected pentavalent symmetric $T$-vertex-transitive graph is $T$-normal, then every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal. This result, among others, implies that every connected pentavalent symmetric $G$-vertex-transitive graph is $G$-normal except $T$ is one of 57 simple groups. Furthermore, every connected pentavalent symmetric $G$-regular graph is $G$-normal except $T$ is one of 20 simple groups, and every connected pentavalent $G$-symmetric graph is $G$-normal except $T$ is one of 17 simple groups.