Nonautonomous Exponential Dichotomy

In this note we generalize the strongly continuous bisemigroups generated by exponentially dichotomous operators to so-called bievolution families. These families are then related to strongly continuous bisemigroups on certain Banach spaces of continuous and measurable vector-valued functions. The research leading to this note was supported by the Italian Ministry of Education and Research (MIUR) under PRIN grant no. 2006017542-003, and by INdAM-GNCS.     

Dominant strategies and restricted ballots with variable electorate

This paper considers dominant (uniformly best) voting strategies in a variable-electorate model for social choice with restricted ballot sets. A voter can have any weak preference order on the alternatives. A voter who partitions the alternatives into three or more indifference classes never has a dominant strategy. The paper specifies conditions on a social choice function that are necessary and sufficient for a voter who partitions the alternatives into two indifference classes to have a dominant strategy.     

抽象边值问题中的双半群方法

研究了如下形式的抽象边值问题{T(e)ψ(x,μ)/(e)x=-Aψ(x,μ) 0<x<∞ ψ(0,μ)=(ψ)+ μ>0 lim x→∞‖ψ‖<∞ 其中,对任意x∈(0,∞)、μ∈[-1,1],ψ(x,μ)为Hilbert空间H=L2([-1,1])中的元,T为H上的有界自伴算子,ker{T}={0},A=I-B,B为有界算子.利用双半群的扰动理论,我们证明了上述边值问题的适定性.     

加性二值噪声激励下Duffing系统的随机分岔

研究了Duffing系统在加性二值噪声作用下的随机分岔现象.首先,根据二值噪声的统计特性,推导得到二值噪声状态间的跃迁概率,据此对二值噪声进行了数值模拟.其次,利用四阶Runge-Kutta(龙格-库塔)数值算法得到该系统位移和速率的稳态联合概率密度及位移的稳态概率密度.然后,通过对位移稳态概率密度单双峰结构变化的研究,发现加性二值噪声的状态和强度能够诱导系统产生随机分岔现象.最后,观察到随着系统非对称参数的逐渐变化,系统同样产生了随机分岔现象.     

On the errors of misclassification based on dichotomous and normal variables

Summary The distribution of the errors of misclassification in procedures based on dichotomous and normal variables is derived. The expressions forE(e ₁₂) andE(e ₂₁) are also obtained. The results in the paper extend those of Chang and Afifi (1974,J. Amer. Statist. Ass.,69, 336–339), using the earlier papers due to John (1961,Ann. Math. Statist.,32, 1125–1144), Subrahmaniam and Chinganda (1978,J. Statist. Plann. Inf.,2, 79–91).     

Optimality of the Expert Rule Under Partial Information

We study the uncertain dichotomous choice model. In this model a group of decision makers is required to select one of two alternatives. The applications of this model are relevant to a wide variety of areas, such as medicine, management and banking. The decision rule may be the simple majority rule; however, it is also possible to assign more weight to the opinion of members known to be more qualified. The extreme example of such a rule is the expert decision rule. We are concerned with the probability of the expert rule to be optimal. Our purpose is to investigate the behaviour of this probability as a function of the group size for several rather general types of distributions. One such family of distributions is that where the density function of the correctness probability is a polynomial (on the interval [1/2,1]). Our main result is an explicit formula for the probability in question. This contains formerly known results as very special cases.     

格蕴涵代数中的扩张滤子

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

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.     

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.     

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

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

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.     

On essential sets and essential components of efficient solutions for vector optimization problems

In this paper, we first introduce the notions of an essential set and an essential component of the set of efficient solutions for continuous vector optimizations on a nonempty compact subset of a metric space. Then we show that for each of these vector optimizations, each set of all efficient solutions corresponding to the same optimal values is essential. Basing on this result, we give full characterizations of an essential point, an essential set and an essential component, respectively. As an application, we prove that for continuous quasiconvex vector optimization problems on a nonempty compact subset of a metric vector space, each component of the set of efficient solutions is essential even though the efficient solution set is not connected.     

Reversible and Bijectively Related Posets

Call a poset reversible if every of its order-preserving self-bijections is an automorphism. Call two posets bijectively related if from each of the two posets exists an order-preserving bijection to the other. We present two examples of pairs of non-isomorphic, bijectively related posets and an example of a non-reversible poset that is bijectively related only to itself. Also, three classes of reversible posets are described and a sufficient condition for an order-preserving bijection to be an isomorphism is presented.     

The maximum spectral radius of uniform hypergraphs with given number of pendant edges

In this paper, we introduce the operations of grafting an edge and subdividing an edge on hypergraphs, and consider how spectral radius of a hypergraph behaves by grafting an edge or subdividing an edge. As an application, we determine the unique hypergraphs with the maximum spectral radius among all the uniform supertrees and all the connected uniform unicyclic hypergraphs with given number of pendant edges, respectively. Moreover, we determine the unique uniform supertree which attains the maximum spectral radius among all the uniform supertrees with given number of pendant vertices.     

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

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

Optimal boundedness criteria for extended-real-valued functions

The notion of genuinely bounded below function is introduced and characterized by means of the concept of co-equilibrated function. As an application, we state two boundedness criteria for extended-real-valued functions, both optimal in a clearly defined sense. The first one says that an extended-real-valued function minorized by an affine map and coinciding from some value up with a co-equilibrated function is bounded below. The second criterion states that an extended-real-valued function minorized by an affine map is bounded below provided that one of its sub-level sets is co-equilibrated.     

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…     

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

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

Nonexistence of invariant semigroups in affine symmetric spaces

Let be an affine symmetric space with a simple Lie group, an involutive automorphism of and an open subgroup of the -fixed point group . It is proved here that the existence of a proper semigroup with and implies that is of Hermitian type, as conjectured by Hilgert and Neeb [4]. When exists, it turns out that it leaves invariant an open -orbit in a minimal flag manifold of . A byproduct of our approach is an alternate proof of the maximality of the compression semigroup of an open orbit (see Hilgert and Neeb [31]). Received: 10 September 1999 / Published online: 23 July 2001     

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.