基于超支化温敏聚合物制备温敏金纳米粒子

通过对不同分子量的超支化聚乙烯亚胺(hyperbranched polyethyleni mine,HPEI)的端基进行部分或完全异丁酰胺(isobutyric amide,IBAm)化,可以制备一系列具有不同低临界溶解温度(Lower Critical SolutionTemperature,LCST)的超支化温敏聚合物HPEI-IBAm。通过离子键或氢键之间的相互作用,所得超支化温敏聚合物可以吸附于柠檬酸钠还原并稳定的14nm的金纳米粒子(AuNP)的表面,从而得到具有温敏性质的金纳米粒子。所得温敏金的LCST都低于其相应的温敏聚合物,其差值在0.8至6℃之间。在pH值为9.18的缓冲溶液中,通过改变所用聚合物的分子量以及异丁酰胺基团的取代度,所得温敏金的LCST可控制在21.7~48.2℃之间。此外,所得温敏金的LCST也是pH值敏感的,通过溶液pH值的改变,所得温敏金的LCST值可以在更宽的范围内调节。增加溶液的碱性,LCST可能变化不大或降低,减小溶液的碱性会使LCST升高,直到消失。在偏酸的条件下,所得金复合物通常发生聚集,变得不稳定。此外,溶液中的盐度对所得温敏金的LCST也有影响,氯化钠和硫酸钠会降低其LCST,尤其是硫酸钠的效果更显著。     

Thermosensitive gels incorporating polythioether units for the selective extraction of class b metal ions

Novel temperature-responsive copolymers of N-isopropylacrylamide and monoaza-tetrathioether derivative, were synthesized for the selective extraction of soft metal ions such as silver(I), copper(I), gold(III) and palladium(II) ion. The ratio between N-isopropylacrylamide group and monoaza-tetrathioether group in the copolymer was determined. The ratio between N-isopropylacrylamide group and monoaza-tetrathioether group varied in the range of 66:1–187:1. Each lower critical solution temperature (LCST) of the polymer solution was determined spectrophotometrically by the relative absorbance change at 750 nm via temperature of the polymer solution. Metal ion extraction using the copolymer with appropriate counter anions such as picrate ion, nitrate or perchlorate ion was examined. Soft metal ions such as silver(I), copper(I), gold(III) and palladium(II) ion were extracted selectively into the solid polymer phase. The extraction efficiency of a metal ion such as silver ion increased as the increase of the ratio of the monoaza-tetrathioether group to N-isopropylacrylamide group in the polymer. The quantitative extraction of class b metal ions as well as the liquid–liquid extraction of metal ions with monoaza-tetrathioether molecule was performed.     

Lower bounds for the security of modified coherent-one-way quantum key distribution against one-pulse-attack

Upper bounds for the security of coherent-one-way (COW) quantum key distribution protocols have been analyzed by considering the one-pulse-attack [Branciard C, Gisin N and Scarani V (BGS) New J.Phys. (2008) 10 013031]. However, their security analysis was based on long distance case, and the typical value of the transmission distance is larger than 50 km. Applying the sharp continuity for the von Neumann entropy and some basic inequalities, we provide lower bounds for the security of modified coherent-one-way quantum key distribution protocol against the most general one-pulse-attack by only considering photon number resolved detectors that will be used in the receiver's side. Comparing with BGS's security analysis, our security analysis can be satisfied with arbitrary distance case.     

Lower Bounds on the (Laplacian) Spectral Radius of Weighted Graphs

The weighted graphs, where the edge weights are positive numbers, are considered. The authors obtain some lower bounds on the spectral radius and the Laplacian spectral radius of weighted graphs, and characterize the graphs for which the bounds are attained. Moreover, some known lower bounds on the spectral radius and the Laplacian spectral radius of unweighted graphs can be deduced from the bounds.     

Traveling wave solutions in a diffusive system with two preys and one predator

This paper is concerned with the traveling wave solutions in a diffusive system with two preys and one predator. By constructing upper and lower solutions, the existence of nontrivial traveling wave solutions is established. The asymptotic behavior of traveling wave solutions is also confirmed by combining the asymptotic spreading with the contracting rectangles. Applying the theory of asymptotic spreading, the nonexistence of traveling wave solutions is proved.     

A separation theorem for the weak s-convex orders

The present paper extends to higher degrees the well-known separation theorem decomposing a shift in the increasing convex order into a combination of a shift in the usual stochastic order followed by another shift in the convex order. An application in decision making under risk is provided to illustrate the interest of the result.     

Mizoguchi–Takahashi’s type common fixed point theorem

Recently Kamran extended the result of Mizoguchi and Takahashi for closed multi-valued mappings and proved a fixed point theorem. In this paper we further extend the result concluded by Kamran and prove a common fixed point theorem by using the concept of lower semi-continuity.     

Lower semicontinuity of solution mapping to parametric generalized strong vector equilibrium problems

In this paper, the lower semicontinuity of solution mapping to parametric generalized strong vector equilibrium problems without the assumptions of monotonicity and compactness is established by using a new proof method which is different from the ones used in the literature.     

Optimal broadcast on parallel locality models

In this paper matching upper and lower bounds for broadcast on general purpose parallel computation models that exploit network locality are proven. These models try to capture both the general purpose properties of models like the PRAM or BSP on the one hand, and to exploit network locality of special purpose models like meshes, hypercubes, etc., on the other hand. They do so by charging a cost l(|i−j|) for a communication between processors i and j, where l is a suitably chosen latency function.An upper bound T(p)=∑_i=0^loglogp2ⁱ·l(p^1/2i) on the runtime of a broadcast on a p processor H-PRAM is given, for an arbitrary latency function l(k).The main contribution of the paper is a matching lower bound, holding for all latency functions in the range from l(k)=Ω(logk/loglogk) to l(k)=O(log²k). This is not a severe restriction since for latency functions l(k)=O(logk/log¹⁺log(k)) with arbitrary >0, the runtime of the algorithm matches the trivial lower bound Ω(logp) and for l(k)=Θ(log¹⁺k) or l(k)=Θ(k), the runtime matches the other trivial lower bound Ω(l(p)). Both upper and lower bounds apply for other parallel locality models like Y-PRAM, D-BSP and E-BSP, too.