Hereditary atomicity in integral domains

If every subring of an integral domain is atomic, we say that the latter is hereditarily atomic. In this paper, we study hereditarily atomic domains. First, we characterize when certain direct limits of Dedekind domains are Dedekind domains in terms of atomic overrings. Then we use this characterization to determine the fields that are hereditarily atomic. On the other hand, we investigate hereditary atomicity in the context of rings of polynomials and rings of Laurent polynomials, characterizing the fields and rings whose rings of polynomials and rings of Laurent polynomials, respectively, are hereditarily atomic. As a result, we obtain two classes of hereditarily atomic domains that cannot be embedded into any hereditarily atomic field. By contrast, we show that rings of power series are never hereditarily atomic. Finally, we make some progress on the still open question of whether every subring of a hereditarily atomic domain satisfies ACCP.     

构造高分辨率格式的反扩散混合法

In this paper we study a kind of mixed anti-diffusion method for partial differntial equations. Firstly, we use the method to construct some difference schemes for the conservation laws. The schemes are of second order accuracy and are total variation decreasing (TVD). In particular, there are only three knots involved in the schemes. Secondly, we extend the method to construct a few high accuracy difference schemes for elliptic and parabolic equations. Numerical experiments are carried out to illustrate the efficiency of the method.     

Algorithmic inference: From information granules to subtending functions

To get a true hybrid framework for taking operational decisions from data, we extend the Algorithmic Inference approach to the Granular Computing paradigm. The key idea is that whether or not we need to make decisions instead of mere computations depends on the fact that collected data are not sufficiently definite; rather, they are representative of whole sets of data that could be virtually observed, and we need to manage this indeterminacy. The distinguishing feature is that we face indeterminacy exactly where it affects the quality of the decision. This gives rise to a family of inference algorithms which can be tailored to many specific decisional problems that are generally solved only in approximate ways. In the paper we discuss the bases of the paradigm and provide some examples of its implementation.     

GLOBAL DYNAMICS OF A PREDATOR-PREY MODEL WITH PREY REFUGE AND DISEASE

In this paper, we study a predator-prey model with prey refuge and disease. We study the local asymptotic stability of the equilibriums of the system. Further, we show that the equilibria are globally asymptotically stable if the equilibria are locally asymptotically stable. Some examples are presented to verify our main results. Finally, we give a brief discussion.     

ON THE CONVERGENCE OF PARALLEL BFGS METHOD

ＯＮＴＨＥＣＯＮＶＥＲＧＥＮＣＥＯＦＰＡＲＡＬＬＥＬＢＦＧＳＭＥＴＨＯＤＣｈｅｎＺｈｏｎｇＦｅｉＰｕｓｈｅｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＷｕｈａｎＵｎｉｖｅｒｓｉｔｙ，Ｗｕｈａｎ４３００７２，Ｃｈｉｎａ．）ＺｈｏｕＹｕｎｃａｉ...     

Dealing with external actions in belief causal networks

Graphical models are efficient and simple ways to represent dependencies between variables. We introduce in this paper the so-called belief causal networks where dependencies are uncertain causal links and where the uncertainty is represented by belief masses. Through these networks, we propose to represent the results of passively observing the spontaneous behavior of the system and also evaluate the effects of external actions. Interventions are very useful for representing causal relations, we propose to compute their effects using a generalization of the “do” operator. Even if the belief chain rule is different from the Bayesian chain rule, we show that the joint distributions of the altered structures to graphically describe interventions are equivalent. This paper also addresses new issues that are arisen when handling interventions: we argue that in real world applications, external manipulations may be imprecise and show that they have a natural encoding under the belief function framework.     

The equivalence on classical metrics

In this paper we study the complete invariant metrics on Cartan-Hartogs domains which are the special types of Hua domains. Firstly, we introduce a class of new complete invariant metrics on these domains, and prove that these metrics are equivalent to the Bergman metric. Secondly, the Ricci curvatures under these new metrics are bounded from above and below by the negative constants. Thirdly, we estimate the holomorphic sectional curvatures of the new metrics, and prove that the holomorphic sectional curvatures are bounded from above and below by the negative constants. Finally, by using these new metrics and Yau's Schwarz lemma we prove that the new metrics are equivalent to the Einstein-Kahler metric. That means that the Yau's conjecture is true on Cartan-Hartogs domains.     

Some Observations on the Theory of Cryptographic Hash Functions

In this paper, we study issues related to the notion of “secure” hash functions. Several necessary conditions are considered, as well as a popular sufficient condition (the so-called random oracle model). We study the security of various problems that are motivated by the notion of a secure hash function. These problems are analyzed in the random oracle model, and we prove that the obvious trivial algorithms are optimal. As well, we look closely at reductions between various problems. In particular, we consider the important question “does collision resistance imply preimage resistance?”. We provide partial answers to this question – both positive and negative! – based on uniformity properties of the hash function under consideration.     

Free martingale polynomials

In this paper we investigate the properties of free Sheffer systems, which are certain families of martingale polynomials with respect to the free Lévy processes. First, we classify such families that consist of orthogonal polynomials; these are the free analogs of the Meixner systems. Next, we show that the fluctuations around free convolution semigroups have as principal directions the polynomials whose derivatives are martingale polynomials. Finally, we indicate how Rota's finite operator calculus can be modified for the free context.     

Early Abortion and Personal Ontology

We are beings endowed with “personal capacities”—the capacity for reason, for a concept of self, perhaps more. Among ontologically salient views about what else we are, I focus on the “Big Three.” According to animalism, we are animals that have psychological properties only contingently. According to psychologistic materialism, we are material beings; according to substance dualism, we are either immaterial beings or composites of immaterial and material ones; but according to both psychologistic materialism and substance dualism, we essentially have some psychological properties. I argue that—contrary to what has been argued and is natural to think—none of the Big Three yields different assignments of moral status to early fetuses from any of the others, and consequently the moral status of early abortion doesn’t depend on which (if any) of these views of personal ontology is correct.     

Optimal Investment in a Levy Market

In this paper we consider the optimal investment problem in a market where the stock price process is modeled by a geometric Levy process (taking into account jumps). Except for the geometric Brownian model and the geometric Poissonian model, the resulting models are incomplete and there are many equivalent martingale measures. However, the model can be completed by the so-called power-jump assets. By doing this we allow investment in these new assets and we can try to maximize the expected utility of these portfolios. As particular cases we obtain the optimal portfolios based in stocks and bonds, showing that the new assets are superfluous for certain martingale measures that depend on the utility function we use.     

Characterizations of the strongly unique best approximations

The purpose of this paper is two folded. First, we present some results on strongly Kolmogorov sets, some of which parallel those for Kolmogorov sets. Secondly, we give two conditions which are sufficient for an element of a strongly Kolmogorov set to be a strongly unique best approximation. Then these conditions are shown to be necessary if additional conditions are imposed on either the norm or the set which we approximate from.     

导出匹配,极大导出匹配可扩图和导出匹配数

目前我们已知的极大导出匹配可扩图只有Kn,n和K2n.为了研究它们是否是仅有的极大导出匹配可扩图,我们考虑了匹配数,导出匹配数,极大导出匹配可扩图以及一个相关的猜想,并得出了若干相关的结果.     

估计的和理论的保证以及启动Ⅲ期试验的概率

预期的Ⅱ期试验通常会导致Ⅲ期试验失败.对于随机分为两个治疗组的随机对照的Ⅱ期和Ⅲ期试验,在假设正态分布响应的方差已知的情况下,我们解析性地获得了这三种情况下的估计的和理论的保证(无、加性和乘性偏差调整).在一些较小的假设下,我们证明了对这三种情况下的估计保证分别是Ⅱ期试验的每组患者数和Ⅱ期试验观察到的治疗效果的增加函数...     

Nash equilibria in all-optical networks

We consider the problem of routing a number of communication requests in WDM (wavelength division multiplexing) all-optical networks from the standpoint of game theory. If we view each routing request (pair of source-target nodes) as a player, then a strategy consists of a path from the source to the target and a frequency (color). To reflect the restriction that two requests must not use the same frequency on the same edge, conflicting strategies are assigned a prohibitively high cost.Under this formulation, we consider several natural cost functions, each one reflecting a different aspect of restriction in the available bandwidth. For each cost function we examine the problem of the existence of pure Nash equilibria, the complexity of recognizing and computing them and finally, the problem in which we are given a Nash equilibrium and we are asked to find a better one in the sense that the total bandwidth used is less. As it turns out some of these problems are tractable and others are NP-hard.     

基于仿酉矩阵的紧支撑二元正交小波滤波器组的构造

高维小波是处理多维信号的有力工具,张量积和栅格结构的小波有其自身的特点,但在实际应用中,我们仍需要构造小波滤波器来满足特定情形下的需要以提高滤波的效果,而构造正交滤波器,在多相域里就等价于构造仿酉阵,在本文中,我们通过对仿酉矩阵的研究,证明二元一次对称的仿酉阵一定能够块对角化,利用这种性质,给出了不可分离的二元正交小波滤波器组及线性相位小波滤波器的构造,并给出了相应的例子．     

Non-crossing matchings of points with geometric objects

Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point–object pairs. In this paper, we address the algorithmic problem of determining whether a non-crossing matching exists between a given point–object pair. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their size is at most 2. When the objects are line segments, we show that the problem is NP-complete in general, and polynomial when the segments form a convex polygon or are all on a line. Finally, for objects that are straight lines, we show that the problem of finding a min-max non-crossing matching is NP-complete.     

Mark-recapture techniques in statistical tests for imprecise data

We aim to construct suitable tests when we have imprecise information about a sample. More specifically, we assume that we get a collection of n sets of values, each one characterizing an imprecise measurement. Each set specifies where the true sample value is (and where it is not) with full confidence, but it does not provide any additional information.Our main objectives are twofold: first we will review different kinds of tests in the literature about inferential statistics with random sets and discuss the approach that best suits our definition of imprecise data. Secondly, we will show that we can take advantage from mark and recapture techniques to improve the accuracy of our decisions. These techniques will be specially important when the population is small enough (with respect to the sample size) that recaptures are common. They also seem to be useful when resampling techniques are involved in the decision process.     

Geometric structures encoded in the lie structure of an Atiyah algebroid

We investigate Atiyah algebroids, i.e. the infinitesimal objects of principal bundles, from the viewpoint of the Lie algebraic approach to space. First we show that if the Lie algebras of smooth sections of two Atiyah algebroids are isomorphic, then the corresponding base manifolds are necessarily diffeomorphic. Further, we give two characterizations of the isomorphisms of the Lie algebras of sections for Atiyah algebroids associated to principal bundles with semisimple structure groups. For instance we prove that in the semisimple case the Lie algebras of sections are isomorphic if and only if the corresponding Lie algebroids are, or, as well, if and only if the integrating principal bundles are locally isomorphic. Finally, we apply these results to describe the isomorphisms of sections in the case of reductive structure groups—surprisingly enough they are no longer determined by vector bundle isomorphisms and involve dive rgences on the base manifolds.     

Optimal control of parabolic problems with state constraints: a penalization method for optimality conditions

In this paper state constrained optimal control problems governed by parabolic evolution equations are studied. Our purpose is to obtain a (first-order) decoupled optimality system (that ensures the Lagrange multipliers existence). In a first step we are led to Slater-like assumptions and we are then allowed to extend the application field of the decoupled system we obtain. With a weaker assumption the existence of Lagrange multipliers (that are measures) for nonqualified problems may be established.