Dynamic analysis on generalized linear elastic body subjected to large scale rigid rotations

The dynamic analysis of a generalized linear elastic body undergoing large rigid rotations is investigated. The generalized linear elastic body is described in kine-matics through translational and rot...     

Stable categories of higher preprojective algebras

We introduce (n+1)$(n+1)$-preprojective algebras of algebras of global dimension n$n$. We show that if an algebra is n$n$-representation-finite then its (n+1)$(n+1)$-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)$(n+1)$-preprojective algebra is (n+1)$(n+1)$-Calabi–Yau, and, more precisely, it is the (n+1)$(n+1)$-Amiot cluster category of the stable n$n$-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)$(n+1)$-cluster tilting object. We show that even if the (n+1)$(n+1)$-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}$n\in \{1,2\}$) the results above still hold for the stable category of Cohen–Macaulay modules.     

The bit‐economy: An artificial model of open‐ended technology discovery

We describe and demonstrate an artificial model of technology discovery called the Bit‐Economy. The model is built from a minimal set of fundamental hallmarks of technology and develops under an open‐ended evolutionary operator which rewards new technology which is able to coordinate both spatially and temporally with the existing technology set. The Bit‐Economy, is able to replicate several features of real technology development including nonmonotonic growth, bunching of creation and destruction events, qualitative topologies of patent networks, and efficiency and waste‐management gains. In contrast to related works, we do not apply an exogenous fitness landscape and so are able to study the process of technology discovery as a self‐guided search toward more complex outcomes. © 2013 Wiley Periodicals, Inc. Complexity 18: 57–67, 2013     

An Alternative Way to Generalize the Pentagon

We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties of ordinary polygons. In short, a pentagonal geometry is a regular partial linear space in which for all points x, the points not collinear with the point x, form a line. We compute bounds on their parameters, give some constructions, obtain some nonexistence results for seemingly feasible parameters and suggest a cryptographic application related to identifying codes of partial linear spaces.     

Split least‐squares finite element methods for non‐Fickian flow in porous media

In this article, we introduce two least‐squares finite element procedures for parabolic integro‐differential equations arising in the modeling of non‐Fickian flow in porous media. By selecting the least‐squares functional properly the presented procedure can be split into two independent subprocedures, one subprocedure is for the primitive unknown and the other is for the flux. The optimal order convergence analysis is established. Numerical examples are given to show the efficiency of the introduced schemes. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Superconvergence of a full‐discrete combined mixed finite element and discontinuous Galerkin method for a compressible miscible displacement problem

An efficient time‐stepping procedure is investigated for a two‐dimensional compressible miscible displacement problem in porous media in which the mixed finite element method with Raviart‐Thomas space is applied to the flow equation, and the transport one is solved by the symmetric interior penalty discontinuous Galerkin approximation on Cartesian meshes. Based on the projection interpolations and the induction hypotheses, a superconvergence error estimate is obtained. During the analysis, an extension of the Darcy velocity along the Gauss line is also used in the evaluation of the coefficients in the Galerkin procedure for the concentration. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A second‐order finite difference approximation for a mathematical model of erythropoiesis

We present a second‐order finite difference scheme for approximating solutions of a mathematical model of erythropoiesis, which consists of two nonlinear partial differential equations and one nonlinear ordinary differential equation. We show that the scheme achieves second‐order accuracy for smooth solutions. We compare this scheme to a previously developed first‐order method and show that the first order method requires significantly more computational time to provide solutions with similar accuracy. We also compare this numerical scheme with other well‐known second‐order methods and show that it has better capability in approximating discontinuous solutions. Finally, we present an application to recovery after blood loss. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

ZL-amenability and characters for the restricted direct products of finite groups

Let G   be a restricted direct product of finite groups _{Gi}i∈I${\{G_i\}}_{i\in I}$, and let Z?¹(G)${\mathrm{Z}?}^1(G)$ denote the centre of its group algebra. We show that Z?¹(G)${\mathrm{Z}?}^1(G)$ is amenable if and only if _Gi$G_i$ is abelian for all but finitely many i  , and characterize the maximal ideals of Z?¹(G)${\mathrm{Z}?}^1(G)$ which have bounded approximate identities. We also study when an algebra character of Z?¹(G)${\mathrm{Z}?}^1(G)$ belongs to _c0$c_0$ or ?^p${?}^p$ and provide a variety of examples.