Archimedean ordered semigroups as ideal extensions

The main result of the paper is a structure theorem concerning the ideal extensions of archimedean ordered semigroups. We prove that an archimedean ordered semigroup which contains an idempotent is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup. Conversely, if an ordered semigroup S is an ideal extension of a simple ordered semigroup by a nil ordered semigroup, then S is archimedean. As a consequence, an ordered semigroup is archimedean and contains an idempotent if and only if it is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup.     

格蕴涵代数中的扩张滤子

在格蕴涵代数中提出了扩张滤子的概念,讨论了扩张滤子与滤子,扩张滤子与素滤子,扩张滤子与滤子的根,扩张滤子与准素滤子,扩张滤子与最大滤子之间的关系.得到了扩张滤子的一些性质.最后,证明了在格H蕴涵代数中,扩张滤子与扩张滤子的根相等.     

pth Power Lagrangian Method for Integer Programming

When does there exist an optimal generating Lagrangian multiplier vector (that generates an optimal solution of an integer programming problem in a Lagrangian relaxation formulation), and in cases of nonexistence, can we produce the existence in some other equivalent representation space? Under what conditions does there exist an optimal primal-dual pair in integer programming? This paper considers both questions. A theoretical characterization of the perturbation function in integer programming yields a new insight on the existence of an optimal generating Lagrangian multiplier vector, the existence of an optimal primal-dual pair, and the duality gap. The proposed pth power Lagrangian method convexifies the perturbation function and guarantees the existence of an optimal generating Lagrangian multiplier vector. A condition for the existence of an optimal primal-dual pair is given for the Lagrangian relaxation method to be successful in identifying an optimal solution of the primal problem via the maximization of the Lagrangian dual. The existence of an optimal primal-dual pair is assured for cases with a single Lagrangian constraint, while adopting the pth power Lagrangian method. This paper then shows that an integer programming problem with multiple constraints can be always converted into an equivalent form with a single surrogate constraint. Therefore, success of a dual search is guaranteed for a general class of finite integer programming problems with a prominent feature of a one-dimensional dual search.     

B-Construction and C-Construction

B-construction is a way of obtaining a graded algebra from the triple consisting of an additive category, an object, and an autoequivalence, while C-construction is a way of obtaining an algebra (without unity) from the pair consisting of an additive category and a set of objects. In this article, we study and compare three important classes of algebras in noncommutative algebraic geometry and representation theory of finite dimensional algebras, namely, quantum polynomial algebras, preprojetive algebras and trivial extensions, via these constructions.     

保等价部分变换半群的变种半群上的正则元

在现有的保等价部分变换半群的基础上,引入了一个新的运算,得出保等价部分变换半群的变种半群的概念,利用格林关系及幂等元的正则性,讨论了这类半群中元素的正则性,给出了保等价部分变换半群的变种半群中一个元是正则元的充要条件     

One Property of the Renormalization Group Operator

We use an isotropic ferromagnet as an example to show that the renormalization group operator can be interpreted as an evolution operator for a system of spins evolving with an increase of the reduced temperature, i.e., as the order operator of the system.     

Estimation of the degree of differencing of an ARIMA process

Summary A method of estimating the degree of differencing of an ARIMA process is proposed. This is based on fitting an AR model to the original and to each differenced series and calculating the residual sum of squares. As an application, we suggest an identification method of an ARI (p, d) process combining our method of estimating the degree of differencing with Akaike's Information Criterion.     

Optimality of Balanced Proper Orthogonal Decomposition for Data Reconstruction

Proper orthogonal decomposition (POD) finds an orthonormal basis yielding an optimal reconstruction of a given dataset. We consider an optimal data reconstruction problem for two general datasets related to balanced POD, which is an algorithm for balanced truncation model reduction for linear systems. We consider balanced POD outside of the linear systems framework, and prove that it solves the optimal data reconstruction problem. The theoretical result is illustrated with an example.     

Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)

An XML schema is a set of rules for defining the allowed sub-elements of any element in an XML document. These rules use regular expressions to define the language of the element's children. Updates to an XML schema are updates to the regular expressions defined by the schema rules. We consider an interactive, data administration tool for XML databases. In this tool, changes on an XML schema are activated by updates that violate the validity of an XML document. Our schema validator is a Datalog program, resulting from the translation of a given XML schema. Changing the schema implies changing the validator.The main contribution of this paper is an algorithm allowing the evolution of XML schemas. This algorithm is based on the computation of new regular expressions to extend a given regular language in a conservative way, trying to foresee the needs of an application. A translation function from schema constraints to Datalog programs is introduced. The validation of an XML tree corresponds to the evaluation of the Datalog program over the tree. Our method allows the maintenance of the Datalog program in an incremental way, i.e., without redoing the entire translation.     

L-Fuzzy拟序集的理想完备化

建立[4]中定义的L-fuzzy拟序集的一种理想完备化,即证明了L-fuzzy拟序集上的所有L-fuzzy理想组成的集合,赋以合适的程度映射构成L-fuzzydomain,任意从L-fuzzy拟序集到L-fuzzydomain的L-fuzzy单调映射都可以扩张成为一个L-fuzzyScott连续映射。     

An internal language for autonomous categories

We present an internal language for symmetric monoidal closed (autonomous) categories analogous to the typed lambda calculus as an internal language for cartesian closed categories. The language we propose is the term assignment to the multiplicative fragment of Intuitionistic Linear Logic, which possesses exactly the right structure for an autonomous theory. We prove that this language is an internal language and show as an application the coherence theorem of Kelly and Mac Lane, which becomes straightforward to state and prove. Finally, we extend the language with the natural numbers and show that this corresponds to a weak Natural Numbers Object in an autonomous category.     

The Turaev genus of an adequate knot

The Turaev genus of a knot is an obstruction to the knot being alternating. An adequate knot is a generalization of an alternating knot. A natural problem is a characterization of the Turaev genus of an adequate knot. In this paper, we show that the Turaev genus of an adequate knot is realized by the genus of the Turaev surface associated to an adequate diagram of the knot using the Khovanov homology. As a result, we obtain the additivity of the Turaev genus of adequate knots, and show that the Turaev genus of an adequate knot is “often” preserved under mutation. We also show that an n-semi-alternating knot is of Turaev genus n. This is the first examples of adequate knots of Turaev genus two or more.     

Carleman estimates for second-order hyperbolic systems in anisotropic cases and applications. Part II: an inverse source problem

In this paper, we consider Carleman-type estimate and consider an inverse problem for second order hyperbolic systems in an anisotropic case. In the previous Part I paper, we established a Carleman-type estimate for hyperbolic systems in which the coefficient matrices satisfy suitable conditions. We apply a Carleman estimate in the previous Part I paper to an inverse source problem for second-order hyperbolic systems in an anisotropic case and prove an estimate of the Hölder type.     

带对称齐次核的级数算子的范数刻画及其应用

对带对称齐次核K(m,n)的级数算子T:T{an}=Σ_(n=1)~∞ K(m,n)an,{an}∈lω(n),l={{an)| an≥0,Σ_(n=1)~∞ω(n)an<+∞},本文研究了T的范数刻画,并讨论其应用.     

Eigenvector method,consistency test and inconsistency repairing for an incomplete fuzzy preference relation

In this paper, we extend the eigenvector method (EM) to priority for an incomplete fuzzy preference relation. We give a reasonable definition of multiplicative consistency for an incomplete fuzzy preference relation. We also give an approach to judge whether an incomplete fuzzy relation is acceptable or not. We develop the acceptable consistency ratio for an incomplete multiplicative fuzzy preference relation, which is simple and similar to Saaty’s consistency ratio (CR) for the multiplicative preference relation. If the incomplete fuzzy preference relation is not of acceptable consistency, we define a criterion to find the unusual and false element (UFE) in the preference relation, and present an algorithm to repair an inconsistent fuzzy preference relation until its consistency is satisfied with the consistency ratio. As a result, our improvement method cannot only satisfy the consistency requirement, but also preserve the initial preference information as much as possible. Finally, an example is illustrated to show that our method is simple, efficiency, and can be performed on computer easily.     

Bounded decomposition in the Brieskorn lattice and Pfaffian Picard-Fuchs systems for Abelian integrals

We suggest an algorithm for derivation of the Picard-Puchs system of Pfaffian equations for Abelian integrals corresponding to semiquasihomogeneous Hamiltonians. It is based on an effective decomposition of polynomial forms in the Brieskorn lattice. The construction allows for an explicit upper bound on the norms of the polynomial coefficients, an important ingredient in studying zeros of these integrals.     

Pricing policies under direct vs. indirect channel competition and national vs. store brand competition

This paper analyzes channel pricing in multiple distribution channels under competition between a national brand (NB) and a store brand (SB), where an NB can be distributed both through a direct channel (e-channel) and an indirect channel (local stores) but an SB can be distributed only through an indirect channel. We first explore cross-brand and cross-channel pricing policies. Formulating the problem as a Nash pricing game, we reach two findings: (1) brand loyalty building is profitable for both an NB and an SB; and (2) marketing decisions are more restrictive for an NB channel than they are for the SB channel. We next assess supply chain coordination and reach two findings: (1) wholesale price change does not coordinate the supply chain and (2) an appropriate combination of markup and markdown prices can achieve both supply chain coordination and a win–win outcome for each channel.     

Exact calculation of inverse functions

We represent continuous functions on compact intervals by sequences of functions defined on finite sets of rational numbers. We call this an exact representation. This enables us to calculate the values of the function arbitrarily exactly, without roundoff errors. As an application we develop a procedure to transfer an exact representation of an increasing function into an exact representation of the corresponding inverse function. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Variance optimal hedging for continuous time additive processes and applications

For a large class of vanilla contingent claims, we establish an explicit Föllmer–Schweizer decomposition when the underlying is an exponential of an additive process. This allows to provide an efficient algorithm for solving the mean variance hedging problem. Applications to models derived from the electricity market are performed.     

ON THE SPECTRAL PROPERTIES OF M-MATRICES AND ITS APPLICATIONS

1.IntroductionAndPreliminariesThespectralpropertiesofM-matricesplayanimportantroleinnonnegativemainstheory,andhavebeenappliedtostudythenumericalsolutionoflinearsystems.Recentlylmanyarticleshavediscussedwiththistopics(see[l--5]).ThepurposeofthispaperistoestablishthespectralinequalitiesofsingularM-matrices.ByapplyingthesepropertiesweanswerpartiallyanopenproblemandsolveanopenproblemposedbySchneiderin[4,5],somerecelltresultI2'4'6]onsplittingsofanM-matrixarealsoimproved.Allnotationsanddefinitio…