Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Heng-Lei Su"'
Autor:
Heng-Lei SU, 蘇恆磊
99
This research was divided into three parts to study the effect of solvent basicity, kinetics and structure studies, and application of N,N’-bismaleimide-4,4’- diphenylmethane (BMI) polymerization reacted with barbituric acid (BTA). In the
This research was divided into three parts to study the effect of solvent basicity, kinetics and structure studies, and application of N,N’-bismaleimide-4,4’- diphenylmethane (BMI) polymerization reacted with barbituric acid (BTA). In the
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/60714549565026835581
Publikováno v:
Polymer Engineering & Science. 51:1188-1197
Both the isothermal and non-isothermal polymerizations of N,N′-bismaleimide-4,4′-diphenylmethane (BMI) with barbituric acid (BTA) were investigated by the differential scanning calorimeter. The experimental results showed that the polymerizations
Publikováno v:
Journal of Applied Polymer Science. 103:3600-3608
The synthesis and characterization of the vinyltriethoxysilane-modified silica nanoparticles were investigated. It was shown that the vinyltriethoxysilane molecules had been successfully grafted onto the silica nanoparticles. The native and silane-mo
Publikováno v:
Journal of Applied Polymer Science.
The polymerizations of N,N′-bismaleimide-4,4′-diphenylmethane (BMI) initiated by barbituric acid (BTA) carried out in a variety of solvents at 130°C were studied. The nitrogen-containing cyclic solvents such as N-methyl-2-pyrrolidinone acted as
Publikováno v:
Polymer Engineering & Science; Jun2011, Vol. 51 Issue 6, p1188-1197, 10p, 3 Diagrams, 2 Charts, 9 Graphs
Autor:
Heng-Lei ,Su, 蘇恆磊
90
The job-shop scheduling problem is an important problem in the operation production management. During the last few decades, an efficient algorithm hasn’t been found yet for optimizing it in polynomial time. Based on the genetic algorithms
The job-shop scheduling problem is an important problem in the operation production management. During the last few decades, an efficient algorithm hasn’t been found yet for optimizing it in polynomial time. Based on the genetic algorithms
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/23996197435893773713