The synthesis route was investigated and optimized for the preparation of iminodiacetic acid-polyethylene glycol (IDA-PEG) for immobilized metal ion affinity partitioning in aqueous two-phase systems. IDA-PEG was synt...The synthesis route was investigated and optimized for the preparation of iminodiacetic acid-polyethylene glycol (IDA-PEG) for immobilized metal ion affinity partitioning in aqueous two-phase systems. IDA-PEG was synthesized from PEG in two steps by the reaction of iminodiacetic acid with a monosubstituted derivative of epichlorohydrin-activated PEG. The Cu2+ content combined with IDA-PEG was determined by atomic absorption spectrometry as 0.5 mol·mol^-1 (PEG). Furthermore, the affinity partitioning behavior of lactate dehydrogenase in polyethylene glycol/hydroxypropyl starch aqueous two-phase systems was studied to clarify the affinity effect of the Cu(Ⅱ)-IDA-PEG.展开更多
Recently a new clustering algorithm called 'affinity propagation' (AP) has been proposed, which efficiently clustered sparsely related data by passing messages between data points. However, we want to cluster ...Recently a new clustering algorithm called 'affinity propagation' (AP) has been proposed, which efficiently clustered sparsely related data by passing messages between data points. However, we want to cluster large scale data where the similarities are not sparse in many cases. This paper presents two variants of AP for grouping large scale data with a dense similarity matrix. The local approach is partition affinity propagation (PAP) and the global method is landmark affinity propagation (LAP). PAP passes messages in the subsets of data first and then merges them as the number of initial step of iterations; it can effectively reduce the number of iterations of clustering. LAP passes messages between the landmark data points first and then clusters non-landmark data points; it is a large global approximation method to speed up clustering. Experiments are conducted on many datasets, such as random data points, manifold subspaces, images of faces and Chinese calligraphy, and the results demonstrate that the two ap-proaches are feasible and practicable.展开更多
基金Supported by the National Natural Science Foundation of China(No.29736180).
文摘The synthesis route was investigated and optimized for the preparation of iminodiacetic acid-polyethylene glycol (IDA-PEG) for immobilized metal ion affinity partitioning in aqueous two-phase systems. IDA-PEG was synthesized from PEG in two steps by the reaction of iminodiacetic acid with a monosubstituted derivative of epichlorohydrin-activated PEG. The Cu2+ content combined with IDA-PEG was determined by atomic absorption spectrometry as 0.5 mol·mol^-1 (PEG). Furthermore, the affinity partitioning behavior of lactate dehydrogenase in polyethylene glycol/hydroxypropyl starch aqueous two-phase systems was studied to clarify the affinity effect of the Cu(Ⅱ)-IDA-PEG.
基金the National Natural Science Foundation of China (Nos. 60533090 and 60603096)the National Hi-Tech Research and Development Program (863) of China (No. 2006AA010107)+2 种基金the Key Technology R&D Program of China (No. 2006BAH02A13-4)the Program for Changjiang Scholars and Innovative Research Team in University of China (No. IRT0652)the Cultivation Fund of the Key Scientific and Technical Innovation Project of MOE, China (No. 706033)
文摘Recently a new clustering algorithm called 'affinity propagation' (AP) has been proposed, which efficiently clustered sparsely related data by passing messages between data points. However, we want to cluster large scale data where the similarities are not sparse in many cases. This paper presents two variants of AP for grouping large scale data with a dense similarity matrix. The local approach is partition affinity propagation (PAP) and the global method is landmark affinity propagation (LAP). PAP passes messages in the subsets of data first and then merges them as the number of initial step of iterations; it can effectively reduce the number of iterations of clustering. LAP passes messages between the landmark data points first and then clusters non-landmark data points; it is a large global approximation method to speed up clustering. Experiments are conducted on many datasets, such as random data points, manifold subspaces, images of faces and Chinese calligraphy, and the results demonstrate that the two ap-proaches are feasible and practicable.