CONTINUOUS L-DOMAINS

61.IntroductionConiinuousDCPOisoneofthemostimportantstructuresin-domaintheory.Unfor-tunatelythecategoryofcolltinuousDCPOandtheScottcontinuousfunctionsfailstobeCartesianclosed,soitisaverysignificantproblemtofinditsmakimalCartesianclosedfullsubcategories.ThecategoryofL-domain'swasdiscoveredbyA.JungwhilesolvingtheproblemoffindingmtalmalCartesianclosedcategoriesofalgebraicDCPO's[1l,andrecentworksbyA.JungandG.Gund.r[2]showsthatthecategoryofL-domain'sisaninterestingcategoryOntheotherhand,i…     

POLES OF ZETA FUNCTIONS OF COMPLETE INTERSECTIONS

51.IntroductionLetF.beafinitefieldofqele~swithcharederisticp.LetXbeanThdilnensionalalgebraicsetdeadedoverF..ThezetafunctionofX/F.isdennedbywhereXOdenotesthesetofclosedpointsOfX/F.and#X(F.d)denotesthenUInberof.F.d-rationalpointsonX.ItiseasytoseethatZ(X,T)isapowerserieswithintegercoefficients.Dwork'srationalltytheoremIg]showsthatthezetafunctionZ(X,T)isrationalinT.ThuS,therearealgebraicintegerspll'.3Pr,pl,'3basuchthatThereisagoodreasonthatwemoantheabovezetafunctionbythepower(--1)"-…     

Improvement of convergence to steady state solutions of Euler equations with weighted compact nonlinear schemes

The convergence to steady state solutions of the Euler equations for weighted compact nonlinear schemes (WCNS) [Deng X. and Zhang H. (2000), J. Comput. Phys. 165, 22-44 and Zhang S., Jiang S. and Shu C.-W. (2008), J. Comput. Phys. 227, 7294-7321] is studied through numerical tests. Like most other shock capturing schemes, WCNS also suffers from the problem that the residue can not settle down to machine zero for the computation of the steady state solution which contains shock waves but hangs at the truncation error level. In this paper, the techniques studied in [Zhang S. and Shu. C.-W. (2007), J. Sci. Comput. 31, 273-305 and Zhang S., Jiang S and Shu. C.-W. (2011), J. Sci. Comput. 47, 216-238], to improve the convergence to steady state solutions for WENO schemes, are generalized to the WCNS. Detailed numerical studies in one and two dimensional cases are performed. Numerical tests demonstrate the effectiveness of these techniques when applied to WCNS. The residue of various order WCNS can settle down to machine zero for typical cases while the small post-shock oscillations can be removed.     

A THEOREM ON PLURICANONICAL MAPS OF NONSINGULAR MINIMAL THREEFOLDS OF GENERAL TYPE

51.IntroductionandtheMainTheoremLetXbeacomplexnonsingularminimalprojectivethreefoldofgeneraltype.ThenatureofpluricanonicalmapsofXisveryimportanttotheclassificationtheory.Itiswell-knownfrom[10]that4linK.lisabirationalmapform27.In[3],itisprovedthat6-canonicalmapofXisabirationalmapontoitsimage.Inthispaper,wemainlystudythefollowingproblem:Problem.WhatisthegreatestpositiveintegercosuchthatImoKxliscomposedOjapencilOjsudecesforsomeX,i.e.,dim4Im.H.I(X)=1?Benv.ni,te[1]provedthatmo53.Wecaneasily…     

(伪)单调集值映射拟均衡问题

主要讨论G-凸上的广义向量拟均衡问题,推广W.O ettli,D.Sch l ger,Q.H.A nsari,I.V.K onnov,和J.C.Y ao的一些主要结果.     

Fuzzy Ordered Filters in Implicative Semigroups

Animplicativesemilatticeisanalgebraicsystemhavingasmodelslogicalsystemsequippedwithimplicationandconjunction,butnotpossessingadisjunction.ImplicativesemilatticeswerestudiedbyW.C.Nemitz[5].In[2],T.S.BlythgeneralizedsomeresultsofW.C.Nemitz[5]byintroducingthenotionofaBrouweriansemigroup.FollowingtheideasofNemitzandBlyth,M.W.ChanandK.P.Shum[3]introducedthenotionofnegativelypartiallyorderedimplicativesemigroupsandgeneralizedsomeresultofNemitzonimplicativesemilatticestoim-plicativesemigroups…     

TYPE K MONOTONE SYSTEMS WITH AN ORDER-INCREASING INVARIANT FUNCTION

51.IntroductionBeginingwiththepath-breakingworkofM.W.HirschI1-4]forcooperativesystemsandmonotonesemiflows,thereisnowanextensiveliteratureoncooperativesystemsandmoncatonedynamicalsystems.Assumingthatthesystemiscooperativeandirreducible,HirschshowedthataImosteveryforwardorbitwithcompactclosure,inthesenseofLebesguemeasure,tendstoequilibriaast- oc(see2,Theorem4.l]).Asimilarresultholdsforastronglymonotonesemifiowonastronglyorderspace(see[4,Theoremo.1]).Manypeoplehavegivensomeadditionalconditio…     

Uniqueness of entire functions sharing one value

We deal with the problem of entire functions sharing one value weakly. Moreover, we improve and generalize some former results obtained by J.-F.Chen, et al. [6], Y.Xu and H.L.Qiu [4], M.L. Fang [5], C.C. Yang, and X.H. Hua [3].     

CONVERGENCE RATE OFDISTRIBUTIONS OF TRIMMED SUMS

1.IntroductionLet{Xn,n2l}beasequenceofi.i.d.randomvariableswithnondegeneratedistributionF.Fornonnegativeintegersk.andrn,k. rn相似文献   

PARAMETERS OF DARBOUX TRANSFORMATION FOR REDUCED AKNS, KAUP-NEWELL AND PCF SYSTEMS

51.IntroductionDarbouxtransformationisapowerfulmethodtogetexplicitsollltionsofnonlinearPDEs.In1 1dimensions,itgivesauniversalalgorithmtogetaseriesofsolutionsbysolvinglinearODEsonlyonce.TheconstructionsofDarbouxtransformationshavebeenwidelyinvestigated(see,e.g.[1,3,5,7,8,9,10,11,13]).In1 1dimensions,aDarbouxtransformationisusuallygivenbyaDarbouxmatrixwhichisapolynomialofthespectralparameter.ThemostfundamentalDarbouxmatrixisaDarbouxmatrixofdegreeone,whichislinearinthespectralparameter.Letg…     

Algorithms for improving efficiency of discrete Markov chains

Sampling from an intractable probability distribution is a common and important problem in scientific computing. A popular approach to solve this problem is to construct a Markov chain which converges to the desired probability distribution, and run this Markov chain to obtain an approximate sample. In this paper, we provide two methods to improve the performance of a given discrete reversible Markov chain. These methods require the knowledge of the stationary distribution only up to a normalizing constant. Each of these methods produces a reversible Markov chain which has the same stationary distribution as the original chain, and dominates the original chain in the ordering introduced by Peskun [11]. We illustrate these methods on two Markov chains, one connected to hidden Markov models and one connected to card shuffling. We also prove a result which shows that the Metropolis-Hastings algorithm preserves the Peskun ordering for Markov transition matrices.     

Comparison of Three Web Search Algorithms

In this paper we discuss three important kinds of Markov chains used in Web search algorithms-the maximal irreducible Markov chain, the miuimal irreducible Markov chain and the middle irreducible Markov chain, We discuss the stationary distributions, the convergence rates and the Maclaurin series of the stationary distributions of the three kinds of Markov chains. Among other things, our results show that the maximal and minimal Markov chains have the same stationary distribution and that the stationary distribution of the middle Markov chain reflects the real Web structure more objectively. Our results also prove that the maximal and middle Markov chains have the same convergence rate and that the maximal Markov chain converges faster than the minimal Markov chain when the damping factor α 〉1/√2.     

Uniqueness of quantum Markov chains associated with an XY-model on a cayley tree of order 2

We propose the construction of a quantum Markov chain that corresponds to a “forward” quantum Markov chain. In the given construction, the quantum Markov chain is defined as the limit of finite-dimensional states depending on the boundary conditions. A similar construction is widely used in the definition of Gibbs states in classical statistical mechanics. Using this construction, we study the quantum Markov chain associated with an XY-model on a Cayley tree. For this model, within the framework of the given construction, we prove the uniqueness of the quantum Markov chain, i.e., we show that the state is independent of the boundary conditions.     

Weak convergence of Markov-modulated random sequences

This work is concerned with weak convergence of non-Markov random processes modulated by a Markov chain. The motivation of our study stems from a wide variety of applications in actuarial science, communication networks, production planning, manufacturing and financial engineering. Owing to various modelling considerations, the modulating Markov chain often has a large state space. Aiming at reduction of computational complexity, a two-time-scale formulation is used. Under this setup, the Markov chain belongs to the class of nearly completely decomposable class, where the state space is split into several subspaces. Within each subspace, the transitions of the Markov chain varies rapidly, and among different subspaces, the Markov chain moves relatively infrequently. Aggregating all the states of the Markov chain in each subspace to a single super state leads to a new process. It is shown that under such aggregation schemes, a suitably scaled random sequence converges to a switching diffusion process.     

客户回报随机过程的Markov性和时间齐次性

在客户发展关系的Markov链模型的基础上，构建了企业的客户回报随机过程．证明了：在适当假设下，客户回报过程是Markov链。甚至是时间齐次的Markov链．本文求出了该链的转移概率．通过转移概率得到了客户给企业期望回报的一些计算公式，从而为企业选定发展客户关系策略提供了有效的量化基础．     

Studying an overload system using rotation

1. IntroductionThe motivation of writing this paper was from calculating the blocking probability foran overloaded finite system. Our numerical experiments suggested that this probability canbe approximated efficiently by rotating the transition matrix by 180". Some preliminaryresults were obtained and can be found in [11 and [2]. Rotating the transition matrix definesa new Markov chain, which is often called the dual process in the literature, for example,[3--7]. For a finite Markov chain, …     

Stability and monotonicity for interactive Markov chains

In a Markov chain model of a social process, interest often centers on the distribution of the population by state. One question, the stability question, is whether this distribution converges to an equilibrium value. For an ordinary Markov chain (a chain with constant transition probabilities), complete answers are available. For an interactive Markov chain (a chain which allows the transition probabilities governing each individual to depend on the locations by state of the rest of the population), few stability results are available. This paper presents new results. Roughly, the main result is that an interactive Markov chain with unique equilibrium will be stable if the chain satisfies a certain monotonicity property. The property is a generalization to interactive Markov chains of the standard definition of monotonicity for ordinary Markov chains.     

Markov chain test for time dependence and homogeneity: An analytical and empirical evaluation

This paper evaluates the small and large sample properties of Markov chain time-dependence and time-homogeneity tests. First, we present the Markov chain methodology to investigate various statistical properties of time series. Considering an auto-regressive time series and its associated Markov chain representation, we derive analytical measures of the statistical power of the Markov chain time-dependence and time-homogeneity tests. We later use Monte Carlo simulations to examine the small-sample properties of these tests. It is found that although Markov chain time-dependence test has desirable size and power properties, time-homogeneity test does not perform well in statistical size and power calculations.     

树上二重非齐次马氏链随机转移概率的极限性质

研究树上二重非齐次马氏链随机转移概率的调和平均极限性质,作为推论,得到了树上非齐次马氏链以及非齐次马氏链上的随机转移概率调和平均极限性质.     

Computing the nearest reversible Markov chain

Reversible Markov chains are the basis of many applications. However, computing transition probabilities by a finite sampling of a Markov chain can lead to truncation errors. Even if the original Markov chain is reversible, the approximated Markov chain might be non‐reversible and will lose important properties, like the real‐valued spectrum. In this paper, we show how to find the closest reversible Markov chain to a given transition matrix. It turns out that this matrix can be computed by solving a convex minimization problem. Copyright © 2015 John Wiley & Sons, Ltd.