In the present research, artificial artificial networks hare be applied to establish the constitutive rela- tionship model of Ti - 5Al - 2Sn - 2Zr - 4Mo - 4Cr (wt - % ) alloy. In the first stage of the re- search...In the present research, artificial artificial networks hare be applied to establish the constitutive rela- tionship model of Ti - 5Al - 2Sn - 2Zr - 4Mo - 4Cr (wt - % ) alloy. In the first stage of the re- search, an isothermal compressive experiment using Thermecmastor - Z hot simulator is studied to ac- quire the flow stress at different deformation temperature,equivalent strain and equivalent strain rate. Then,a feed - forward neural network is trained by using the experimental data.After the training process is finished, the neural networks become a knowledge-based constitutive relationship system. Comparison of the predicted and experimental results results shows that the neural network model has good le- arning precision and good generalization.The neural neural network methods are found to show much better agreement than existing methods with the experiment data, and have the advantage of being able to deal with noisy for or data with strong non - linear reationships. At last, this model can be aused to simulate the flow behavior of Ti - 5Al - 2Sn - 2Zr - 4Mo - 4Ca alloy.展开更多
Let P（G,A） be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P（H, λ） = P（G, λ） implies H is isomorphic to G. Liu et al. [Liu, R. Y., Zhao, H. X., Ye, C. F.： A com...Let P（G,A） be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P（H, λ） = P（G, λ） implies H is isomorphic to G. Liu et al. [Liu, R. Y., Zhao, H. X., Ye, C. F.： A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. Discrete Math., 289, 175 179 （2004）], and Lau and Peng [Lau, G. C., Peng, Y. H.： Chromatic uniqueness of certain complete t-partite graphs. Ars Comb., 92, 353-376 （2009）] show that K（p - k,p - i,p） for i = 0, 1 are chromatically unique if p ≥ k ＋ 2 ≥ 4. In this paper, we show that if 2 〈 i 〈 4, the complete tripartite graph K（p - k,p - i,p） is chromatically unique for integers k ≥ i and p 〉 k2/4 ＋ i ＋ 1.展开更多
文摘In the present research, artificial artificial networks hare be applied to establish the constitutive rela- tionship model of Ti - 5Al - 2Sn - 2Zr - 4Mo - 4Cr (wt - % ) alloy. In the first stage of the re- search, an isothermal compressive experiment using Thermecmastor - Z hot simulator is studied to ac- quire the flow stress at different deformation temperature,equivalent strain and equivalent strain rate. Then,a feed - forward neural network is trained by using the experimental data.After the training process is finished, the neural networks become a knowledge-based constitutive relationship system. Comparison of the predicted and experimental results results shows that the neural network model has good le- arning precision and good generalization.The neural neural network methods are found to show much better agreement than existing methods with the experiment data, and have the advantage of being able to deal with noisy for or data with strong non - linear reationships. At last, this model can be aused to simulate the flow behavior of Ti - 5Al - 2Sn - 2Zr - 4Mo - 4Ca alloy.
文摘Let P（G,A） be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P（H, λ） = P（G, λ） implies H is isomorphic to G. Liu et al. [Liu, R. Y., Zhao, H. X., Ye, C. F.： A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. Discrete Math., 289, 175 179 （2004）], and Lau and Peng [Lau, G. C., Peng, Y. H.： Chromatic uniqueness of certain complete t-partite graphs. Ars Comb., 92, 353-376 （2009）] show that K（p - k,p - i,p） for i = 0, 1 are chromatically unique if p ≥ k ＋ 2 ≥ 4. In this paper, we show that if 2 〈 i 〈 4, the complete tripartite graph K（p - k,p - i,p） is chromatically unique for integers k ≥ i and p 〉 k2/4 ＋ i ＋ 1.
