Living/controlled radical copolymerization of N‐substituted maleimides with styrene in 1‐butyl‐3‐methylimidazolium hexafluorophosphate and anisole

The atom transfer radical copolymerization of N‐substituted maleimides such as N‐phenylmaleimide (PhMI), N‐cyclohexylmaleimide (ChMI), and N‐butylmaleimide (NBMI) with styrene initiated with dendritic polyarylether 2‐bromoisobutyrates in an ionic liquid, 1‐butyl‐3‐methylimidazolium hexafluorophosphate ([bmim][PF₆]), at room temperature and anisole at 110 °C was investigated. The dendritic‐linear block copolymers obtained in ionic liquid possessed well‐defined molecular weight and low polydispersity (1.05 < M_w/M_n < 1.32) and could be used as a macroinitiator for chain‐extension polymerization, suggesting the living nature of the reaction system. The ionic liquids containing catalyst could be recycled in the atom transfer radical polymerization systems without further treatment. Compared with polymerization conducted in anisole, the polymerization in ionic liquid had a stronger tendency for alternation. The tendency for alternation decreased in the order PhMI > NBMI > ChMI in [bmim][PF₆] and PhMI > ChMI > NBMI in anisole. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 2156–2165, 2003     

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.     

新型菲涅尔线聚光太阳电池组件特性分析

以PMMA为材料,采用热压成型工艺加工线聚焦菲涅尔聚光棱镜,对在其聚光条件下不同入射角度情况下太阳电池的电流电压特性进行测试,结果表明:该菲涅尔线聚焦棱镜能有效提高太阳电池的单位输出功率,而且具有比较宽泛的集光角的特性,基本满足实际应用的要求.     

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.