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.     

Affine-scaling for linear programs with free variables

The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual.     

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.     

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.     

磷钼杂多化合物脱硫热力学可行性与硫磺生成机理研究

长期以来杂多化合物一直被用作特定反应的催化剂 ,尚无直接利用其氧化还原性能进行污染物治理研究的先例 [1] .由于磷和钼在我国均为丰产元素 ,相应的杂多化合物又具有稳定的化学性能 ,寻找其新的应用领域无疑具有特别重要的意义 .本文对与此相关的脱硫热力学可行性与硫磺生成机理问题进行研究 ,以期为应用开发奠定理论基础 .1　实验部分1 .1　仪器和试剂　 31 4型硫离子选择电极 (江苏电分析仪器厂 ) ;DSC- 7型微分量热仪 (美国 Perkin-Elmer公司 ) ;Finber 1 0 0 0型能谱分析仪 (配置 Pioneer KYKY2 80 0型扫描电镜 ) ;UJ33a型电位…