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.     

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     

A Large Conformational Change of a Bridged b-Cyclodextrin Dimer in Aqueous Solution

As artificial enzymes, the binding constants of cyclodextrins (CDs) and their substrates are expected to be high1. For this purpose, many kinds of bridged cyclodextrin dimers2 whose two cyclodextrins are linked by various spacers have been constructed. It was of interest to make the dimers, whose binding constants would exceed 108dm3/mol3. Up to date, the bridged cyclodextrin dimers have been extensively studied as enzyme models and as molecular receptors4-6. Recently, we synthesized a brid…     

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.     

Internet中的物理资源

对Internet中的物理资源进行了较系统的介绍，主要内容有：综合物理网站、物理期刊网站和物理教学网站，其中重点介绍了美国和欧洲主要国家的物理网站和物理期刊网站，利用这些物理站点，可以方便的进行文献检索、物理会议查询，物理教学相关资料的查询和世界各大学物理系的查询；可以方便快捷的了解当今世界各国的物理教学学科研的最新进展，文中对各个物理站点的使用方法都一一做了详细的介绍，以方便读者使用。     

FAST ACCURATE PREDICTION OF BLANK SHAPE IN SHEET METAL FORMING

By using the Finite Element Inverse Approach based on the Hill quadratic anisotrop-ically yield criterion and the quadrilateral element, a fast analyzing software-FASTAMP for the sheet metal forming is developed. The blank shapes of three typical stampings are simulated and compared with numerical results given by the AUTOFORM software and experimental results, respectively. The comparison shows that the FASTAMP can predict blank shape and strain distribution of the stamping more precisely and quickly than those given by the traditional methods and the AUTOFORM.     

A laser Doppler anemometry technique for Reynolds stresses measurement

A technique is described for the measurement of all components of mean velocity and Reynolds stresses, in a complex turbulent flow where achieving coincidence data acquisition is difficult. The method is based on data recorded using four orientations of the laser probe. It is shown that the measurement errors are not the same for all the components of the Reynolds tensor, but they are sufficiently small to give a good accuracy. An application to a turbomachinery flow is given to illustrate the method.