Syntactic characterization of closure under connected limits

Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.     

静磁场伴随有静电场存在

阐述检测物体是否产生了电场的方法；通过实际检测证实立方体永磁体既产生了负静电场，也产生了正静电场，并测定了具体的场强．     

A novel and efficient synthesis of porphine

meso-Tetra(n-hexyloxycarbonyl)porphyrin was found to be converted into porphine, the mother compound of porphyrins, in a 77% yield when heated in aqueous sulfuric acid at 180 °C over 30 min under an inert atmosphere. The observation demonstrates that the substituted porphyrin serves as a novel and useful precursor for porphine.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例

Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例．     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002