Multi-scale Fractured Coal Gas–Solid Coupling Model and Its Applications in Engineering Projects

With coal mining entering the geological environment of “high stress, rich gas, strong adsorption and low permeability,” the difficulty of joint coal and gas extraction clearly augments, the risk of solid–gas coupling dynamic disasters greatly increases, and the underlying mechanisms become more complex. In this paper, based on the characteristics of coal’s multi-scale structure and spatiotemporal variation, the multi-scale fractured coal gas–solid coupling model (MSFM) was built. In this model, the interaction between coal matrix and its fractures and the mechanical characteristics of gas-bearing coal were considered, as well as their coupling relationship. By MATLAB software, the stress–damage–seepage numerical computation programs were developed, which were applied into Comsol Multiphysics to simulate gas flow caused by coal mining. The simulation results showed the spatial variability of coal elastic modulus and cross-flow behaviors of coal seam gas, which were superior to the results of traditional gas–solid coupling model. And the numerical results obtained from MSFM were closer to the measured results in field, while the computation results of traditional model were slightly higher than the measured results. Furthermore, the MSFM in a large scale was verified by field engineering project.     

Weak Morrey spaces and strong solutions to the Navier-Stokes equations

We consider the Cauchy problem of Navier-Stokes equations in weak Morrey spaces. We first define a class of weak Morrey type spaces Mp*,λ(Rn) on the basis of Lorentz space Lp,∞ = Lp*(Rn)(in particular, Mp*,0(Rn) = Lp,∞, if p ＞ 1), and study some fundamental properties of them; Second,bounded linear operators on weak Morrey spaces, and establish the bilinear estimate in weak Morrey spaces. Finally, by means of Kato's method and the contraction mapping principle, we prove that the Cauchy problem of Navier-Stokes equations in weak Morrey spaces Mp*,λ(Rn) (1＜p≤n) is time-global well-posed, provided that the initial data are sufficiently small. Moreover, we also obtain the existence and uniqueness of the self-similar solution for Navier-Stokes equations in these spaces, because the weak Morrey space Mp*,n-p(Rn) can admit the singular initial data with a self-similar structure. Hence this paper generalizes Kato's results.     

Algorithms with high order convergence speed for blind source extraction

A rigorous convergence analysis for the fixed point ICA algorithm of Hyvärinen and Oja is provided and a generalization of it involving cumulants of an arbitrary order is presented. We consider a specific optimization problem OP(p), p>3, integer, arising from a Blind Source Extraction problem (BSE) and prove that every local maximum of OP(p) is a solution of (BSE) in sense that it extracts one source signal from a linear mixture of unknown statistically independent signals. An algorithm for solving OP(p) is constructed, which has a rate of convergence p?1.     

One-Point Extensions of t-Koszul Algebras

We introduce the category of t-fold modules which is a full subcategory of graded modules over a graded algebra. We show that this subcategory and hence the subcategory of t-Koszul modules are both closed under extensions and cokernels of monomorphisms. We study the one-point extension algebras, and a necessary and sufficient condition for such an algebra to be t-Koszul is given. We also consider the conditions such that the category of t-Koszul modules and the category of quadratic modules coincide.     

Pole placement controllers for linear time-delay systems with commensurate point delays

This paper investigates the exact and approximate spectrum assignment properties associated with realizable output-feedback pole-placement type controllers for single-input single-output linear time-invariant time-delay systems with commensurate point delays. The controller synthesis problem is discussed through the solvability of a set of coupled diophantine equations of polynomials. An extra complexity is incorporated to the above design to cancel extra unsuitable dynamics being generated when solving the above diophantine equations. Thus, the complete controller tracks any arbitrary prefixed (either finite or delaydependent) closed-loop spectrum. However, if the controller is simplified by deleting the above mentioned extra complexity, then the robust stability and approximated spectrum assignment are still achievable for a certain sufficiently small amount of delayed dynamics. Finally, the approximate spectrum assignment and robust stability problems are revisited under plant disturbances if the nominal controller is maintained. In the current approach, the finite spectrum assignment is only considered as a particular case to the designer‘s choice of a (delay-dependent) arbitrary spectrum assignment objective.     

The duality between Morrey spaces and its pre-dual spaces characterized by heat kernel

Let L be an elliptic operator, we give arguments about the duality estimate between Morrey spaces and its pre-dual spaces characterized by the heat kernel associated to L that is given in [6],[8].     

The interior proximal extragradient method for solving equilibrium problems

In this article we present a new and efficient method for solving equilibrium problems on polyhedra. The method is based on an interior-quadratic proximal term which replaces the usual quadratic proximal term. This leads to an interior proximal type algorithm. Each iteration consists in a prediction step followed by a correction step as in the extragradient method. In a first algorithm each of these steps is obtained by solving an unconstrained minimization problem, while in a second algorithm the correction step is replaced by an Armijo-backtracking linesearch followed by an hyperplane projection step. We prove that our algorithms are convergent under mild assumptions: pseudomonotonicity for the two algorithms and a Lipschitz property for the first one. Finally we present some numerical experiments to illustrate the behavior of the proposed algorithms.     

Evolution of hypersurfaces by the mean curvature minus an external force field

In this paper, we study the evolution of hypersurface moving by the mean curvature minus an external force field. It is shown that the flow will blow up in a finite time if the mean curvature of the initial surface is larger than some constant depending on the boundness of derivatives of the external force field. For a linear force, we prove that the convexity of the hypersurface is preserved during the evolution and the flow has a unique smooth solution in any finite time and expands to infinity as the time tends to infinity if the initial curvature is smaller than the slope of the force.     

Towards a unified recurrent neural network theory: The uniformly pseudo-projection-anti-monotone net

In the past decades, various neural network models have been developed for modeling the behavior of human brain or performing problem-solving through simulating the behavior of human brain. The recurrent neural networks are the type of neural networks to model or simulate associative memory behavior of human being. A recurrent neural network (RNN) can be generally formalized as a dynamic system associated with two fundamental operators: one is the nonlinear activation operator deduced from the input-output properties of the involved neurons, and the other is the synaptic connections (a matrix) among the neurons. Through carefully examining properties of various activation functions used, we introduce a novel type of monotone operators, the uniformly pseudo-projectionanti-monotone (UPPAM) operators, to unify the various RNN models appeared in the literature. We develop a unified encoding and stability theory for the UPPAM network model when the time is discrete. The established model and theory not only unify but also jointly generalize the most known results of RNNs. The approach has lunched a visible step towards establishment of a unified mathematical theory of recurrent neural networks.     

A new modified remote user authentication scheme using smart cards

In 2000, a remote user authentication scheme using smart cards was proposed and the masquerade attacks were proved successful on this scheme. Recently, Kumar has suggested the idea of check digits to overcome the above attacks with a new scheme that removes these threats well. In this paper it is pointed out that the weakness still exists in Kumar＇s scheme, and the intruder can login to the remote system through having some information. A new scheme which can overcome these attacks and appears more secure and efficient than Kumar＇s is presented.