USING THE SKEW-SYMMETRIC ITERATIVE METHODS FOR SOLUTION OF AN INDEFINITE NONSYMMETRIC LINEAR SYSTEMS

The concept of the field of value to localize the spectrum of the iteration matrices of the skew-symmetric iterative methods is further exploited. Obtained formulas are derived to relate the fields of values of the original matrix and the iteration matrix. This allows us to determine theoretically that indefinite nonsymmetric linear systems can be solved by this class of iterative methods.     

THE STRUCTURE OF Ⅱ SPACES(Ⅰ)

The spectral theory of selfadjoint operators and unitary operators in Hilbert spacehas been successfully generalized to Π_k space.However,there are only a few results for thespectral theory of selfadjoint operators and unitary operators in Π space.One of theimportant reasons is that the structure of Π space is more complex than that of Π_k space.This paper and the forthcoming paper “The structure of Π space(Ⅱ)”will mainly be dealtwith the structure of Ⅱ spaces,which will be used to further study the operators in Ⅱspaces.     

The genus of a type of graph

Based on the joint tree model introduced by Liu, the genera of further types of graphs not necessary to have certain symmetry can be obtained. In this paper, we obtain the genus of a new type of graph with weak symmetry. As a corollary, the genus of complete tripartite graph K n,n,l (l≥n≥2) is also derived. The method used here is more direct than those methods, such as current graph, used to calculate the genus of a graph and can be realized in polynomial time.     

On discreteness of the Hopf equation

The principle aim of this essay is to illustrate how different phenomena is captured by different discretizations of the Hopf equation and general hyperbolic conservation laws. This includes dispersive schemes, shock capturing schemes as well as schemes for computing multi-valued solutions of the underlying equation. We introduce some model equations which describe the behavior of the discrete equation more accurate than the original equation. These model equations can either be conveniently discretized for producing novel numerical schemes or further analyzed to enrich the theory of nonlinear partial differential equations.     

Checking for normality in linear mixed models

Linear mixed models are popularly used to fit continuous longitudinal data,and the random effects are commonly assumed to have normal distribution.However,this assumption needs to be tested so that further analysis can be proceeded well.In this paper,we consider the Baringhaus-Henze-Epps-Pulley (BHEP) tests,which are based on an empirical characteristic function.Differing from their case,we consider the normality checking for the random effects which are unobservable and the test should be based on their predictors.The test is consistent against global alternatives,and is sensitive to the local alternatives converging to the null at a certain rate arbitrarily close to 1/√ n where n is sample size.Furthermore,to overcome the problem that the limiting null distribution of the test is not tractable,we suggest a new method: use a conditional Monte Carlo test (CMCT) to approximate the null distribution,and then to simulate p-values.The test is compared with existing methods,the power is examined,and several examples are applied to illustrate the usefulness of our test in the analysis of longitudinal data.     

A Biordered Set Representation of Regular Semigroups

In this paper, for an arbitrary regular biordered set E, by using biorder-isomorphisms between the w-ideals of E, we construct a fundamental regular semigroup WE called NH-semigroup of E, whose idempotent biordered set is isomorphic to E. We prove further that WE can be used to give a new representation of general regular semigroups in the sense that, for any regular semigroup S with the idempotent biordered set isomorphic to E, there exists a homomorphism from S to WE whose kernel is the greatest idempotent-separating congruence on S and the image is a full symmetric subsemigroup of WE. Moreover, when E is a biordered set of a semilattice Eo, WE is isomorphic to the Munn-semigroup TEo; and when E is the biordered set of a band B, WE is isomorphic to the Hall-semigroup WB.     

Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with even characteristic

This paper is devoted to counting the number of isomorphism classes of pointed hyperelliptic curves over finite fields. We deal with the genus 4 case and the finite fields are of even characteristics. The number of isomorphism classes is computed and the explicit formulae are given. This number can be represented as a polynomial in q of degree 7, where q is the order of the finite field. The result can be used in the classification problems and it is useful for further studies of hyperelliptic curve cryptosystems, e.g. it is of interest for research on implementing the arithmetics of curves of low genus for cryptographic purposes. It could also be of interest for point counting problems; both on moduli spaces of curves, and on finding the maximal number of points that a pointed hyperelliptic curve over a given finite field may have.     

Local automorphisms of semisimple algebras and group algebras

Let F be a field of characteristic not 2, and let A be a finite-dimensional semisimple F -algebra. All local automorphisms of A are characterized when all the degrees of A are larger than 1. If F is further assumed to be an algebraically closed field of characteristic zero, K a finite group, F K the group algebra of K over F , then all local automorphisms of F K are also characterized.     

STABILITY OF TIME VARYING SINGULAR DIFFERENTIAL SYSTEMS WITH DELAY

In this paper, stability of time varying singular differential systems with delay is considered. Based on variation formula and Gronwall-Bellman integral inequality, we obtain the exponential estimation of the solution and the sufficient conditions under which the considered system is stable and exponentially asymptotically stable. These results will be very useful to further research on Roust stability and control design of uncertain singular control systems with delay.     

Global Geometry of 3-Body Motions with Vanishing Angular Momentum Ⅰ

Following Jacobi＇s geometrization of Lagrange＇s least action principle, trajectories of classical mechanics can be characterized as geodesics on the configuration space M with respect to a suitable metric which is the conformal modification of the kinematic metric by the factor （U ＋ h）, where U and h are the potential function and the total energy, respectively. In the special case of 3-body motions with zero angular momentum, the global geometry of such trajectories can be reduced to that of their moduli curves, which record the change of size and shape, in the moduli space of oriented m-triangles, whose kinematic metric is, in fact, a Riemannian cone over the shape space M^＊≌S^2 （1/2）.
In this paper, it is shown that the moduli curve of such a motion is uniquely determined by its shape curve （which only records the change of shape） in the case of h≠0, while in the special case of h = 0 it is uniquely determined up to scaling. Thus, the study of the global geometry of such motions can be further reduced to that of the shape curves, which are time-parametrized curves on the 2-sphere characterized by a third order ODE. Moreover, these curves have two remarkable properties, namely the uniqueness of parametrization and the monotonieity, that constitute a solid foundation for a systematic study of their global geometry and naturally lead to the formulation of some pertinent problems.     

Trigonometrically fitted multi-step Runge-Kutta methods for solving oscillatory initial value problems

In this paper, trigonometrically fitted multi-step Runge-Kutta (TFMSRK) methods for the numerical integration of oscillatory initial value problems are proposed and studied. TFMSRK methods inherit the frame of multi-step Runge-Kutta (MSRK) methods and integrate exactly the problem whose solutions can be expressed as the linear combinations of functions from the set of \(\{\exp (\mathrm {i}wt),\exp (-\mathrm {i}wt)\},\) or equivalently the set \(\{\cos (wt),\sin (wt)\}\), where w represents an approximation of the main frequency of the problem. The general order conditions are given and four new explicit TFMSRK methods with order three and four, respectively, are constructed. Stability of the new methods is examined and the corresponding regions of stability are depicted. Numerical results show that our new methods are more efficient in comparison with other well-known high quality methods proposed in the scientific literature.     

A two-phase decision support framework for the automatic screening of digital fundus images

In this paper we give a brief review on the present status of automated detection systems describe for the screening of diabetic retinopathy. We further detail an enhanced detection procedure that consists of two steps. First, a pre-screening algorithm is considered to classify the input digital fundus images based on the severity of abnormalities. If an image is found to be seriously abnormal, it will not be analysed further with robust lesion detector algorithms. As a further improvement, we introduce a novel feature extraction approach based on clinical observations. The second step of the proposed method detects regions of interest with possible lesions on the images that previously passed the pre-screening step. These regions will serve as input to the specific lesion detectors for detailed analysis. This procedure can increase the computational performance of a screening system. Experimental results show that both two steps of the proposed approach are capable to efficiently exclude a large amount of data from further processing, thus, to decrease the computational burden of the automatic screening system.     

Prime and primitive algebras with prescribed growth types

Bartholdi and Smoktunowicz constructed in 2014 finitely generated monomial algebras with prescribed sufficiently fast growth types. We show that their construction need not result in a prime algebra, but it can be modified to provide prime algebras without further limitations on the growth type.Moreover, using a construction of an inverse system of monomial ideals which arise from this construction, we are able to further construct finitely generated primitive algebras without further limitations on the growth type.Then, inspired by Zelmanov’s example in 1979, we show how our prime algebras can be constructed such that they contain non-zero locally nilpotent ideals; this is the very opposite of the primitive constructions.     

关于正则余剩余格与对合BCK-格

进一步研究了余剩余格的一些性质,在此基础上证明了正则余剩余格与对合BCK-格是两个等价的代数系统。所得结果将有助于深入了解正则余剩余格的代数结构,也为相关多值逻辑系统的研究提供又一途径。     

Numerical control of kohonen neural network for scattered data approximation

Surface reconstruction from scattered data using Kohonen neural network is presented in this paper. The network produces a topologically predefined grid from the unordered data which can be applied as a rough approximation of the input set or as a base surface for further process. The quality and computing time of the approximation can be controlled by numerical parameters. As a further application, ruled surface is produced from a set of unordered lines by the network. AMS subject classification 68U07, 65D17, 68T20     

绿色混合产品市场下制造企业应对成本突增的策略

在绿色产品和非绿色产品并存的市场环境下,针对绿色产品和非绿色产品的生产成本突增的情况,研究了制造企业的生产调整策略.首先给出了常规环境下,制造企业对绿色产品和非绿色产品的生产策略;接着,研究了绿色产品和非绿色产品生产成本突然增加的情况下,制造企业的生产调整策略.最后,采用数值分析进一步证明了结论的正确性.研究表明:1)常规下的生产策略具有一定的鲁棒性,当突发事件引起生产成本扰动比较小时,应保持常规下的生产策略不变.2)当产品的生产成本突然增加时,会减少产品的市场规模,导致企业的利润受损.3)当产品的生产成本增加幅度比较大时,应该首先适度上调产品的销售价格,同时还要适度调整产品的产量:当其中一类产品的生产成本增加比较大,而另一类产品的生产成本增加比较小(扰动幅度在一定的范围内)时,对成本增加幅度大的产品,应减少产量;对成本增加幅度比较小的产品,应保持常规下的产量不变.随着两类产品的生产成本进一步增加,对成本增加幅度比较大的产品,应进一步减少产量,对成本增加幅度比较小的产品,应适度增加产量.当两类产品的生产成本增加都比较大时,不仅应增加两类产品的销售价格,而且还要减少两类产品的产量,尽管如此,企业的利润还是会大幅度减少.研究结论进一步丰富发展了企业应急管理的理论基础,为企业有效应对突发事件提供了理论指导的作用.     

Polynomial preserving recovery for quadratic elements on anisotropic meshes

Polynomial preserving gradient recovery technique under anisotropic meshes is further studied for quadratic elements. The analysis is performed for highly anisotropic meshes where the aspect ratios of element sides are unbounded. When the mesh is adapted to the solution that has significant changes in one direction but very little, if any, in another direction, the recovered gradient can be superconvergent. The results further explain why recovery type error estimator is robust even under nonstandard and highly distorted meshes. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

A Physics-Based Metaphysics is a Metaphysics-Based Metaphysics

The common practice of advancing arguments based on current physics in support of metaphysical conclusions has been criticized on the grounds that current physics may well be wrong. A further criticism is leveled here: current physics itself depends on metaphysical assumptions, so arguing from current physics is in fact arguing from yet more metaphysics. It is shown that the metaphysical assumptions underlying current physics are often deeply embedded in the formalism in which theories are presented, and hence impossible to dismiss as mere motivational or interpretative speculation. It is then shown that such assumptions, when made explicit, can wreck havoc on otherwise-sensible philosophical arguments. It is argued in conclusion that this situation is both unlikely to be reparable just by being more careful, and unlikely to go away as further, presumably more subtle physical theories are developed.     

Inexact inner–outer Golub–Kahan bidiagonalization method: A relaxation strategy

We study an inexact inner–outer generalized Golub–Kahan algorithm for the solution of saddle-point problems with a two-times-two block structure. In each outer iteration, an inner system has to be solved which in theory has to be done exactly. Whenever the system is getting large, an inner exact solver is, however, no longer efficient or even feasible and iterative methods must be used. We focus this article on a numerical study showing the influence of the accuracy of an inner iterative solution on the accuracy of the solution of the block system. Emphasis is further given on reducing the computational cost, which is defined as the total number of inner iterations. We develop relaxation techniques intended to dynamically change the inner tolerance for each outer iteration to further minimize the total number of inner iterations. We illustrate our findings on a Stokes problem and validate them on a mixed formulation of the Poisson problem.