The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n2 + O(n), that is, the diameter of REn is ...The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n2 + O(n), that is, the diameter of REn is not more than (3/8)n2 + O(n). This improves on a (1/2)n2 + O(n) routing algorithm proposed earlier.展开更多
In this paper, we consider existence of single or multiple positive solutions of three-point boundary value problems involving one-dimensional p-Laplacian. We then study existence of solutions when the problems are in...In this paper, we consider existence of single or multiple positive solutions of three-point boundary value problems involving one-dimensional p-Laplacian. We then study existence of solutions when the problems are in resonance cases. The proposed approach is based on the Krasnoselskii＇s fixed point theorem and the coincidence degree.展开更多
In this paper, a new routing algorithm is given for the shuffle-exchange permutation network （SEPn）. The length of the path between any two nodes given by our algorithm is not more than 11/16n^2＋O（n）, i.e., the d...In this paper, a new routing algorithm is given for the shuffle-exchange permutation network （SEPn）. The length of the path between any two nodes given by our algorithm is not more than 11/16n^2＋O（n）, i.e., the diameter of SEPn is at most 11/16n^2＋ O（n）. This improves on a 1/8（9n^2- 22n＋24） routing algorithm described earlier by S. Latifi and P. K. Srimani. We also show that the diameter of SEPn is more than 1/2n^2-n.展开更多
基金Supported by the Natural Science Foundation of Fujian Province(No.F0110012) and theScientific Research Foundation of Fujian Provincial Education Department(No.JA03142).
文摘The paper proposes a new routing algorithm for the Rotation-Exchange (REn) network. The length of the path between any two nodes given by the algorithm is not more than (3/8)n2 + O(n), that is, the diameter of REn is not more than (3/8)n2 + O(n). This improves on a (1/2)n2 + O(n) routing algorithm proposed earlier.
基金Project supported by Foundation of Major Project of ScienceTechnology of Chinese Education Ministy,NSF of Education Committee of Jiangsu Province
文摘In this paper, we consider existence of single or multiple positive solutions of three-point boundary value problems involving one-dimensional p-Laplacian. We then study existence of solutions when the problems are in resonance cases. The proposed approach is based on the Krasnoselskii＇s fixed point theorem and the coincidence degree.
基金This work was supported by the NatLiral Science Foundation of Fujian Provmce(No.Z0511035)the Scientific Research Foundation of Fujian Provincial Education Department(No.JA04249)
文摘In this paper, a new routing algorithm is given for the shuffle-exchange permutation network （SEPn）. The length of the path between any two nodes given by our algorithm is not more than 11/16n^2＋O（n）, i.e., the diameter of SEPn is at most 11/16n^2＋ O（n）. This improves on a 1/8（9n^2- 22n＋24） routing algorithm described earlier by S. Latifi and P. K. Srimani. We also show that the diameter of SEPn is more than 1/2n^2-n.
