ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.     

多结超导环在外磁场中的行为

分析和计算了双结超导环在无偏置电流时的磁通、环流、自由能与外磁场的关系.发现双结环与单结环在磁场中的行为有所不同.当两个结的Ic相等时，双结环在1＜β=2πLIcΦ0＜2时，若无偏置电流，总磁通Φ、环流I与外磁通Φe的关系仍然是非回滞的曲线.仅当β≥2时，曲线才出现回滞.另外双结环有两支解，并且每支解的周期为2Φ0. 关键词： 双结环 双支解 2Φ0周期 回滞     

Crystallographic report: Diiodo[tris(2‐pyridyl)amine]mercury(II), [(C5H4N)3N]HgI2

In mononuclear HgI₂[(C₅H₄N)₃N], mercury is tetrahedrally coordinated by two nitrogen atoms of a tris(2‐pyridyl)amine ligand and two iodides. The coordination moieties are connected by weak intermolecular Hg(II)···I interactions to give a one‐dimensional structure. Copyright © 2003 John Wiley & Sons, Ltd.     

Au(111)上烷烃硫醇SAMs表面应力的理论研究

应用已建立的关于金属表面吸附层中表面应力的统计热力学理论 ,计算了Au(111)上烷烃硫醇SAMs的表面应力及其与烷烃硫醇链长、吸附覆盖度的定量关系 .计算结果与实验相符 ,较好地解释了Berger等人的实验结果 ,特别是解决了在表面应力符号性质上理论与实验的矛盾 .在表面吸附层应力的多种物理起源中 ,通过底物的分子间作用力有着决定性的贡献 ,揭示了分子的吸附能间接地起着重要作用 .这与阴离子化学吸附体系Cl-/Au(111)的有关研究结果相同 .     

Reply to Nathan: How to reconstruct the causal argument

Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that, on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination, that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that, properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a modified mechanism for hallucinations is implausibly ad hoc.     

On the bounded version of Hilbert's tenth problem

 The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The theory I ⁵ E ₁ is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I ⁵ E ₁ cannot prove the MRDP theorem. On the other hand it is shown that I ¹ E ₁ proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I ⁰ E ₁ proves 𝒟 contains all predicates of the form (∀i≤b)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate, ≤₂, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions are definable in 𝒟 then 𝒟=N P. Received: 13 July 2001 / Revised version: 9 April 2002 / Published online: 19 December 2002 Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity     

Automorphisms with only infinite orbits on non-algebraic elements

 This paper generalizes results of F. K?rner from [4] where she established the existence of maximal automorphisms (i.e. automorphisms moving all non-algebraic elements). An ω-maximal automorphism is an automorphism whose powers are maximal automorphisms. We prove that any structure has an elementary extension with an ω-maximal automorphism. We also show the existence of ω-maximal automorphisms in all countable arithmetically saturated structures. Further we describe the pairs of tuples (ˉa,ˉb) for which there is an ω-maximal automorphism mapping ˉa to ˉb. Received: 12 December 2001 / Published online: 10 October 2002 Supported by the ``Fonds pour la Formation à la Recherche dans l'Industrie et dans l'Agriculture' Mathematics Subject Classification (2000): Primary: 03C50; Secondary: 03C57 Key words or phrases: Automorphism – Recursively saturated structure     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

Study on the Binding Characteristic of S-Naproxen Imprinted Polymer and the Interactions between Templates and Monomers

S-naproxen imprinted polymer was prepared with acrylamide as a functional monomer, 1,4-butanediyl diacrylate as a new kind of crossliner, and 2,4,6-trimethylbenzoylphenyl-phosphinic acid ethyl ester as photoinitiator. Their UV and IR spectra were applied to study the interactions between the template and the monomer. Binding experiments showed that the S-naproxen imprinted polymer had better recognition capability for the template than that of a blank polymer. The adsorption distribution coefficient KD of S-naproxen on molecularly-imprinted polymer was 153.2 g/mL, and the separation factor was 1.95 when the initial concentration of substrate was 2.0 mmol/L. Scatchard curves suggested that there were two classes of binding sites in the imprinted polymer and only one class in the blank polymer. Computer simulation using Hyperchem showed the existence of the interactions between the template and the functional monomer as well as the models of the complexes formed by the template and the monomer.