Synthesis of Cationic PEM Emulsion and Application in Waste Water Treatment

Cationic polymer as a kind of flocculant is widely applied in purification treatment of waste water. Because it has positive charge group, it is able to connect strongly the suspended matters, short cellulose and other microparticles. The research on synthesis of cationic polymer and application in treatment of waste water is very universal abroad. But domestic research on those is not general. The technology of synthesis of PEM is simple, and the production cost is low. It is easy to apply in treatment of waste water.Synthesis of PEM Emulsion FlocculantSome distilled water, PVA(poly(vinyl alcohol)), EA(ethyl acrylate), and K2S2O8(potassium persulfate) were put into reaction vessel. Kept stirring up under nitrogen. When heated the solution to 40℃, dropped the water solution of MTA[(2-methacryloxylethyl)trimethyl ammonium].Maintained the temperature at 70℃, reacted about 7-8 hours. Then got the PEM emulsion. Changed the ratio of EA and MTA. Obtained a series of PEM emulsions.Stability and Convertibility of PEM EmulsionThe test results showed that when the EA/MTA was 85/15, the PEM emulsion was most stable.When the total monomer quantity was 35%, the convertibility of PEM emulsion was the highest,i.e.98.6%.The MTA Copolymerization Ratio and Morphology of PEM EmulsionWhen the monomers EA/MTA=85/15 and total monomer quantity was 35%, the MTA copolymerization ratio of PEM emulsion was 95.15%(the highest), and the PEM emulsion was some microspheres with 100-180nm of diameter.The Test Results of PEM Emulsion in Treatment of Waste Water The PEM emulsion flocculant was applied in treatment of waste water of paper mill, and measured the precipitation time(t) and transmittancy(T). The test results were showed in table 1. The optimum value of PEM which was able to make the waste water of paper mill into clear water was 0.008%.     

Synthesis of Novel Monomeric Dyes with Anthraquinone Residue

Two novel polymerizable dyes with anthraquinone residue have been prepared, and their structures were characterized by FTIR, ^1HNMR and EA.     

On many‐sorted algebraic closure operators

A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Kuratowski Convergence of Holomorphic Functions

The notion of Kuratowski convergence is applied to describe a kind of convergence in the context of holomorphic functions. We associate it to a convenient topology, explore its relation with the compact-open topology, thus providing a new set theoretic point of view of this classic topology, and present it in the framework of set-valued mappings.     

Synthesis of paramagnetic BODIPY dyes as new double (spin and fluorescence) sensors

Paramagnetic pyrroline and 1,2,3,6-tetrahydropyridine derivatives of BODIPY and their diamagnetic analogs have been synthesized and characterized as novel redox double sensor and cation sensitive reagents.     

高速色散补偿系统中喇曼放大器性能研究

利用喇曼放大器的非线性偏微分耦合方程组,对带喇曼放大器的色散补偿系统进行了仿真,并与传统的仿真方法进行了比较.结果表明:在色散完全补偿系统中,当传输速率较高时,忽略色散后的传统仿真方法的结果,与采用色散补偿技术后使整个系统色散为零的仿真结果有一定偏差,此时不能忽略色散的作用.还对前补偿系统和后补偿系统进行了研究,利用Q值性能判别法,分别得到了信号光脉冲的最佳占空比和最佳脉冲阶数.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

A constructive characterization of the split closure of a mixed integer linear program

Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.