Multi-component mooring systems become widely used in deep water position-keeping of drilling and production platforms. However, versatile materials make it difficult to design appropriate mooring lines made of severa...Multi-component mooring systems become widely used in deep water position-keeping of drilling and production platforms. However, versatile materials make it difficult to design appropriate mooring lines made of several segments. Based on catenary equations of a multi-component mooring line at a specific water depth, this paper establishes a minimum model for designing this kind of lines. The model is solved by Genetic Algorithm and Multi-Objective Planning respectively. The model is verified by its application to a practical mooring design assignment—a quasi-static analysis for a large semi-submersible. The optimal result is finally obtained with the aid of design graphs.展开更多
Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.
In this paper, we discuss the G-decomposition of λKv （G-GD）, （v）） into five graphs with six vertices and eight edges. We present some recursive structures and a number of G-designs of small orders, holey G- desi...In this paper, we discuss the G-decomposition of λKv （G-GD）, （v）） into five graphs with six vertices and eight edges. We present some recursive structures and a number of G-designs of small orders, holey G- designs, and incomplete G-designs are constructed. Finally, the spectrum of the existence of G-GD）λ（v） is determined.展开更多
In this paper, we give a unified method to construct G-designs and solve the existence of [C（2k-1）^（r）]-GD（v） for v=1（mod 4k）, where the graph C10^（r）,1≤r≤k-2, denotes a circle of length 2k - 1 with one c...In this paper, we give a unified method to construct G-designs and solve the existence of [C（2k-1）^（r）]-GD（v） for v=1（mod 4k）, where the graph C10^（r）,1≤r≤k-2, denotes a circle of length 2k - 1 with one chord and r is the number of vertices between the ends of the chord.展开更多
In this paper, we discuss the G-decomposition of λKv into 6-circuits with two chords. We construct some holey G-designs using sharply 2-transitive group, and present the recursive structure by PBD. We also give a uni...In this paper, we discuss the G-decomposition of λKv into 6-circuits with two chords. We construct some holey G-designs using sharply 2-transitive group, and present the recursive structure by PBD. We also give a unified method to construct G-designs when the index equals the edge number of the discussed graph. Finally, the existence of G-GDλ（v） is given.展开更多
文摘Multi-component mooring systems become widely used in deep water position-keeping of drilling and production platforms. However, versatile materials make it difficult to design appropriate mooring lines made of several segments. Based on catenary equations of a multi-component mooring line at a specific water depth, this paper establishes a minimum model for designing this kind of lines. The model is solved by Genetic Algorithm and Multi-Objective Planning respectively. The model is verified by its application to a practical mooring design assignment—a quasi-static analysis for a large semi-submersible. The optimal result is finally obtained with the aid of design graphs.
基金Supported by the Natural Science Foundation of China （No.10371031） and Natural Science Foundation of Hebei （No.103146）.
文摘Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.
基金Supported by National Natural Science Foundation of China Grant 10971051,11171089Natural Science Foundation of Hebei Province Grant A2010000353
文摘In this paper, we discuss the G-decomposition of λKv （G-GD）, （v）） into five graphs with six vertices and eight edges. We present some recursive structures and a number of G-designs of small orders, holey G- designs, and incomplete G-designs are constructed. Finally, the spectrum of the existence of G-GD）λ（v） is determined.
基金the Natural Science Foundation of Hebei Province (103146) and Doctoral Research Fund for Hebei Higher Learning Institutions
文摘In this paper, we give a unified method to construct G-designs and solve the existence of [C（2k-1）^（r）]-GD（v） for v=1（mod 4k）, where the graph C10^（r）,1≤r≤k-2, denotes a circle of length 2k - 1 with one chord and r is the number of vertices between the ends of the chord.
基金Foundation item： the National Natural Science Foundation of China （No. 10671055） the Natural Science Foundation of Hebei Province （No. A2007000230） the Foundation of Hebei Normal University （No. L2007B22）.
文摘In this paper, we discuss the G-decomposition of λKv into 6-circuits with two chords. We construct some holey G-designs using sharply 2-transitive group, and present the recursive structure by PBD. We also give a unified method to construct G-designs when the index equals the edge number of the discussed graph. Finally, the existence of G-GDλ（v） is given.
