含氟碳菁染料聚集行为的研究

本文对五种不同结构的含氟碳菁染料的甲醇溶液及吸附在碘溴化银T 颗粒表面的聚集行为进行了研究 ,测定了照相性能 ,计算了增感倍率。Dye1 ,Dye2 ,Dye3在甲醇溶液中测得的单分子态吸收曲线 ,当取代基从C2 H5→CH3→无取代基时 ,最大吸收峰对应的波长向短波方向移动 ;乙基取代基的增感染料 (Dye1 )吸附在碘溴化银表面形成的J 聚集态峰值较高 ,对应的增感倍率也高。没有取代基的增感染料 (Dye3)不形成J 聚集 ,增感倍率低 ,有减感作用。Dye4与Dye5相比 ,Dye4具有尖而窄的J 聚集反射光谱 ,增感倍率高。结果表明 :不同结构的增感染料吸附在卤化银颗粒上形成的J 聚集态不同 ,吸收谱带窄的J 聚集态增感染料具有较高的增感倍率。     

ADSORBENTS USED IN THE CLEARANCE OF ENDOTOXIN

1.INTRODUCTION[()-227.3()]Endotoxinislipopolysaccharide(LPS)derivedfromthecellmembranesofgram-negativebacteria.Endotoxincancausefebrilereactionsinanimalswithsymptomsofhighfever,vasodilation,diarrheaandfetalshockwheninjectedeveninaverysmallamount[1].Iftheconcentrationofendotoxininpatients?bloodishighenoughitcancauseseveresepsis,whichisamajorcauseofdeathinpatientsandcontinuestohaveahighmortalitydespiteappropriatesurgery,potentantibiotic,andintensivesupportivetherapy[2~5].LipidAisthemaintox…     

Loading aircraft for military operations

In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented.     

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.     

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.     

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

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