ZnPO-CJ40, has been hydrothermal synthesized using the pure chiral metalcomplex l-Co(en)3I3 as the structure-directing agent. Structural elucidation revealsthat there exist stereo-specific correspondence between the metal complex templateand the structure of the inorganic host. ZnPO-CJ40 possesses 4×6 ring topologicalstructure, with ABCDEF packing style.

We first study the LDLPT algorithm and indicate why the algorithm performs poorly for certain situations. We then propose a new algorithm, the Bin Packing Style algorithm (BPA), and show that the BPA algorithm complements the LDLPT algorithm.

我们研究 L DL PT算法并指出为什么这种算法对一些实例具有最差的逼近度 ,然后提出一种类似装箱算法的新算法— BPA算法 ,证明该算法和 L DL PT算法在相互最差逼近度中具有互补性质 .

In engineering design problems, layout design is often of the key, and layout is also often the main representation of creative work of the design result. Therefore the significance of design automation for engineering layout problem is obvious. But because of the NP-hard property of the layout problem, its complete solution needs long distance research. Presently, most solvent methods for layout problem are of heuristic and controlled stochastic methods. Most stochastic methods designate certain kind of filling...

In engineering design problems, layout design is often of the key, and layout is also often the main representation of creative work of the design result. Therefore the significance of design automation for engineering layout problem is obvious. But because of the NP-hard property of the layout problem, its complete solution needs long distance research. Presently, most solvent methods for layout problem are of heuristic and controlled stochastic methods. Most stochastic methods designate certain kind of filling or loading rules that generate layout styles. But the rationality of these rules can not be proved, and the optimum degree of the solution is also relatively not stable. As for the controlled stochastic methods, such as the simulated annealing and gene methods, their execution time is usually very long. Expansion method is a new solution method for layout problem that we devised during our research process on engineering layout problems. Its main idea is to find each layout item's suitable location by making each layout item compete for its own space. We applied this method to circle packing and gear layout problems, and got good results. In this paper, after explanation of the general theory of the expansion method, three examples are given. The first example is the problem of 'packing n equivalent circles in a square' (usually n=3 to 50 and more). This is a vastly researched problem in the field of optimization. For this problem, our programming practice shows that the best known packing styles can be easily acquired in a short time by expansion method. The second example is the layout problem of complex gear transmission system. This problem is much complicated, because there are complex meshing constrains between driving-driven gear pairs. Our programming practice demonstrates that expansion method is also suitable for these kinds of problems. The third example is a contrasting example. It is of the packing problem of unequal circles in a circle. We do performance contrast between expansion method and other methods named as physicalification and personification method. The result shows that the efficiency and stability of expansion method are better.

In this paper, we study the problem of multi processor job scheduling on hypercube networks. We first study the LDLPT algorithm and indicate why the algorithm performs poorly for certain situations. We then propose a new algorithm, the Bin Packing Style algorithm (BPA), and show that the BPA algorithm complements the LDLPT algorithm. Finally we combine the ideas in the two algorithms and develop a new algorithm CBPA for the problem. We show that the new algorithm performs better than the LDLPT algorithm....

In this paper, we study the problem of multi processor job scheduling on hypercube networks. We first study the LDLPT algorithm and indicate why the algorithm performs poorly for certain situations. We then propose a new algorithm, the Bin Packing Style algorithm (BPA), and show that the BPA algorithm complements the LDLPT algorithm. Finally we combine the ideas in the two algorithms and develop a new algorithm CBPA for the problem. We show that the new algorithm performs better than the LDLPT algorithm.

本文研究超立方体中的多处理器任务调度问题 .我们研究 L DL PT算法并指出为什么这种算法对一些实例具有最差的逼近度 ,然后提出一种类似装箱算法的新算法— BPA算法 ,证明该算法和 L DL PT算法在相互最差逼近度中具有互补性质 .最后 ,组合这两种算法的基本方法提出了一种求解问题的新算法— CBPA算法 ,并证明新算法具有比L DL PT算法更好的逼近度

C reactive protein (CRP), one of the most characteristic acute phase proteins, is composed of five identical non covalently linked monomers.In current work, using CRP subunits isolated from CRP stock by size exclusion chromatography, two types of two dimensional (2D) monomeric crystals were obtained on negatively charged lipid monolayers composed of egg PC, lysoPC and DMPS.One (MI) is as reported previously and the other one (MII) is discovered for the first time.Electron crystallographic analysis of MII...

C reactive protein (CRP), one of the most characteristic acute phase proteins, is composed of five identical non covalently linked monomers.In current work, using CRP subunits isolated from CRP stock by size exclusion chromatography, two types of two dimensional (2D) monomeric crystals were obtained on negatively charged lipid monolayers composed of egg PC, lysoPC and DMPS.One (MI) is as reported previously and the other one (MII) is discovered for the first time.Electron crystallographic analysis of MII crystal shows a lattice with parameters of a =20 6(±0 1) nm, b =16 1(±0 1) nm and γ = 90(±1)°, and the projection map with P2 symmetry is produced at the resolution of 2 06 nm.The comparison of the packing styles and formation conditions of the two types of crystals indicates that the separated CRP subunits may be the major form of modified CRP previously reported.