Probabilism,entropies and strictly proper scoring rules

Accuracy arguments are the en vogue route in epistemic justifications of probabilism and further norms governing rational belief. These arguments often depend on the fact that the employed inaccuracy measure is strictly proper. I argue controversially that it is ill-advised to assume that the employed inaccuracy measures are strictly proper and that strictly proper statistical scoring rules are a more natural class of measures of inaccuracy. Building on work in belief elicitation I show how strictly proper statistical scoring rules can be used to give an epistemic justification of probabilism.An agent's evidence does not play any role in these justifications of probabilism. Principles demanding the maximisation of a generalised entropy depend on the agent's evidence. In the second part of the paper I show how to simultaneously justify probabilism and such a principle. I also investigate scoring rules which have traditionally been linked with entropies.     

ON THE INCOMPLETENESS OF A DESCENDING CHAIN OF EXTENSIONS OF IMPLICATIONAL S5

C5.ω is obtained by adding, schematically, to the strict-implicational fragment C5 of S5 the axiom ((p → q) → (q → p)) → (q → p). This paper presents a fully general proof that neither C5.ω nor any of a descending chain of its extensions is complete with respect to any class of frames, correcting the garbled details of a version skeched in an earlier paper (same Zeitschrift 31 (1985), 201-208).     

无严格互补松驰条件的序列线性方程组新算法

该文通过构造特殊形式的有效集来逼近KKT点处的有效集，给出了一个任意初始点下的序列线性方程组新算法，并证明了该算法在没有严格互补松驰条件的情况下具有全局收敛性和一步超线性收敛性。      

The variational Lyapunov function and strict stability theory for differential systems

In this paper, we investigate strict stability of differential systems by variational Lyapunov function. We obtain some sufficient conditions and comparison theorems.     

反超图的笛卡儿积的上色数

讨论反超图的笛卡儿积的着色理论 ,求出了满足一定条件的反超图的笛卡儿积的上色数 .     

Strict Stability of Impulsive Differential Equations

In this paper, we will extend the strict stability to impulsive differential equations. By using Lyapunov functions, we will get some criteria for the strict stability of impulsive differential equations, and we can see that impulses do contribute to the system＇s strict stability behavior. An example is also given in this paper to illustrate the efficiency of the obtained results.     

Dynamic behavior of discrete-time multiagent systems with general communication structures

In this paper, we discuss the dynamic behavior of networks of dynamic agents with general communication topologies. We first analyze the basic case: systems with communication topologies that have spanning trees, i.e., the systems that solve consensus problems. We establish an algebraic condition to characterize each agent's contributions to the final state. And we also study the influence of time-delays on each agent's contributions. Then, we investigate the general case: systems with weakly connected topologies. By using matrix theory, we prove that the states of internal agents will converge to a convex combination of boundary agents in the absence or presence of communication time-delays, and we also show that the coefficients of the convex combination are independent of time-delays even if the delays are time-varying. These results have broad applications in other areas, e.g., study of swarm behavior, formation control of vehicles, etc.     

Superized Troesch complexes and cohomology for strict polynomial superfunctors

We adapt a construction due to Troesch to the category of strict polynomial superfunctors in order to construct complexes of injective objects whose cohomology is isomorphic to Frobenius twists of the (super)symmetric power functors. We apply these complexes to construct injective resolutions of the even and odd Frobenius twist functors, to investigate the structure of the Yoneda algebra of the Frobenius twist functor, and to compute other extension groups between strict polynomial superfunctors. By an equivalence of categories, this also provides cohomology calculations in the category of left modules over Schur superalgebras.     

6元素集合上T0拓扑总数的计算

文中证明了有限预序集与有限偏序集的一些性质,并基于有限集上的拓扑和其上预序的一一对应关系,利用这些性质通过对极小元和极大元个数进行分类讨论,以一种有别于计算机算法而又容易理解的计算方法得出6元素集合上的T₀拓扑总数为130023.     

Supramolecular architectures with ladder and lamellar topologies using metal-ligand coordination units via C–H···Cl and O–H···Cl hydrogen bonding

New Mn^II/Cu^II/Zn^II complexes [(L¹)MnCl₂] (1), [(L²)CuCl₂]·0.5H₂O (2) and [(L²)ZnCl(H₂O)][ClO₄] (3), containing (2-pyridyl)alkylamine ligands, N-methyl-N,N-bis(2-pyridylmethyl)amine (L¹) and methyl[2-(2-pyridyl)ethyl](2-pyridylmethyl)amine (L²), have been prepared and characterized, including X-ray crystallography. The most striking feature of the structures of these complexes is the formation of molecular ladder and lamellar topology through the crystal packing arrangement, determined by both strong O–H···Cl and weak (however, multiple) C–H···Cl hydrogen-bonding interactions, to maintain the neutral/cationic metal-ligand coordination units linked to each other. In 3, additional secondary interactions are observed involving coordinated solvent and the counter-ion. The results presented here demonstrate that (i) the choice of organic ligands to provide flexibility and inherent potential to participate in hydrogen-bonding interactions, (ii) the coordination geometry preferences of metal ions, (iii) the number of metal-bound chloride ion and (iv) the presence of solvent/counter-anion have a great influence on supramolecular network topology.