Let Γm，n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtour...Let Γm，n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtournament. Let t ( m, n, k, l ) = max{t( Tm,n，k, l ) : Tm,n∈Γm，n^*}, where t ( Tm,n, k, l ) is the number of k × l(k≥2,l≥2) transitive bipartite subtournaments contained in Tm,n∈Γm，n^*. We obtain a method of graph theory for solving some integral programmings, investigate the upper bounds of a(m,n) and obtain t (m,n, k，l).展开更多
Let T=(V,A)be a tournament of order n and T_i,…,T_m be diconnectedcomponents in T.If uv ∈A and P is a directed path of length k-1(k≥3)from u to v,We call P ∪{uv}a 1-antidirected cycle of length k.Let k be an integ...Let T=(V,A)be a tournament of order n and T_i,…,T_m be diconnectedcomponents in T.If uv ∈A and P is a directed path of length k-1(k≥3)from u to v,We call P ∪{uv}a 1-antidirected cycle of length k.Let k be an integer satisfying 3≤k≤n.If every arc e∈A is contained in a 1-antidirected cycle of length k,we will refer toT as arc k 1-antidirected cyclic.If T is arc k 1-antidirected cyclic for k=3,4,…,n,T iscalled arc 1-antidirected pancyclic.In this paper,we prove that T is arc 1-antidirectedpancyclic if and only if T satisfies one of the following conditions:(i)2≤m≤3 and forany T_i,every arc e∈T_i is contained in a Hamilton path in T_i;(ii)m=1,except some spe-cial tournaments which are to be shown.展开更多
In this paper,we present a new sufficient condition on degrees for a bipartite tournament to be Hamiltonian,that is,if an n×n bipartite tournament T satisfies the condition W(n-3),then T is Hamiltonian,except for...In this paper,we present a new sufficient condition on degrees for a bipartite tournament to be Hamiltonian,that is,if an n×n bipartite tournament T satisfies the condition W(n-3),then T is Hamiltonian,except for four exceptional graphs.This result is shown to be best possible in a sense.展开更多
The story tells how a Chinese village hit a home run by building its future around baseball,transforming the sport into a powerful engine for rural revitalization.XUJIADAI is an administrative village in Lindai Town o...The story tells how a Chinese village hit a home run by building its future around baseball,transforming the sport into a powerful engine for rural revitalization.XUJIADAI is an administrative village in Lindai Town of Jiaxing City,east China’s Zhejiang Province.It is in this small village that over 100 baseball and softball tournaments have been held,a record that has crowned it China’s top baseball village.展开更多
Gutin and Rafiey（Australas J. Combin. 34（2006）, 17-21） provided an example of an n-partite tournament with exactly n-m ＋ 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question....Gutin and Rafiey（Australas J. Combin. 34（2006）, 17-21） provided an example of an n-partite tournament with exactly n-m ＋ 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question. Let 3 ≤ m ≤n and n ≥ 4. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n-m ＋ 1 cycles of length m for two values of m？ In the same paper,they showed that this question has a negative answer for two values n-1 and n. In this paper, we prove that a strong n-partite tournament with exactly two cycles of length n-1 must contain some given multipartite tournament as subdigraph. As a corollary, we also show that the above question has a negative answer for two values n-1 and any l with 3 ≤ l ≤ n and l ≠n-1.展开更多
A tournament is an orientation of the complete graph.Tournaments form perhaps the most interesting class of digraphs and it has a great potential for application.Tournaments provide a model of the statistical techniqu...A tournament is an orientation of the complete graph.Tournaments form perhaps the most interesting class of digraphs and it has a great potential for application.Tournaments provide a model of the statistical technique called the method of paired comparisons and they have also been studied in connection with sociometric relations in small groups.In this paper,we investigate disjoint cycles of the same length in tournaments.In 2010,Lichiardopol conjectured that for given integers l≥3 and k≥1,any tournament with minimum out-degree at least(l-1)k-1 contains k disjoint l-cycles,where an l-cycle is a cycle of order l.Bang-Jensen et al.verified the conjecture for l=3 and Ma et al.proved that it also holds for l≥10.This paper provides a proof of the conjecture for the case of 9≥l≥4.展开更多
The problem of complementary cycles in tournaments and bipartite tournaments was completely solved. However, the problem of complementary cycles in semicomplete n-partite digraphs with n 〉 3 is still open. Based on t...The problem of complementary cycles in tournaments and bipartite tournaments was completely solved. However, the problem of complementary cycles in semicomplete n-partite digraphs with n 〉 3 is still open. Based on the definition of componentwise complementary cycles, we get the following result. Let D be a 2-strong n-partite （n 〉 6） tournament that is not a tournament. Let C be a 3-cycle of D and D ／ V（C） be nonstrong. For the unique acyclic sequence D1, D2,..., Da of D ／ V（C）, where a 〉 2, let Dc = {Di｜Di contains cycles, i = 1,2,...,a}, Dc = {D1,D2,...,Da} ／ De. If Dc≠ 0, then D contains a pair of componentwise complementary cycles.展开更多
In this paper, we generate all nonisomorphic tournaments of order at mostnine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regulartournaments of order 11. For each of these tournamen...In this paper, we generate all nonisomorphic tournaments of order at mostnine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regulartournaments of order 11. For each of these tournaments, we have given its score-list, connectivity,diameter, the minimal number of feedbacks, automorphisms and spectra. Moreover, we have verified thewell-known Kelly's Conjecture for n = 2k + 1 ≤ 11. And we also determine the n-universaltournaments for n ≤ 6. However, several related results are given and some related open problemsare raised.展开更多
In this paper we prove that if T is a regular n-partite tournament with n ≥ 4, then each arc of T lies on a cycle whose vertices are from exactly k partite sets for k = 4, 5, . . . ,n. Our result, in a sense, general...In this paper we prove that if T is a regular n-partite tournament with n ≥ 4, then each arc of T lies on a cycle whose vertices are from exactly k partite sets for k = 4, 5, . . . ,n. Our result, in a sense, generalizes a theorem due to Alspach.展开更多
In this paper we prove that if T is a regular n-partite tournament with n≥>6, then each arc of T lies on a k-cycle for k=4,5,…,n. Our result generalizes theorems due to Alspach and Guo respectively.
A k-outpath of an arc xy in a multipartite tournament is a directed path with length k starting from xy such that x does not dominate the end vertex of the directed path. This concept is a generalization of a directed...A k-outpath of an arc xy in a multipartite tournament is a directed path with length k starting from xy such that x does not dominate the end vertex of the directed path. This concept is a generalization of a directed cycle. We show that if T is an almost regular n-partite (n>8) tournament with each partite set having at least two vertices, then every are of T has a k-outpath for all k, 3＜k＜n-1.展开更多
It is proved that for given integer k≥2, almost all k-hypertournaments are strong and in almost all k-hypertournaments, every pair of vertices lies on a 3-cycle.
In 1978, K. B. Reid proposed a conjecture as follows: 'Every finite and nonempty set S of positive integers is a set of scores for some tournaments'. And he proved that the conjecture is true for |S|=1, 2, 3. ...In 1978, K. B. Reid proposed a conjecture as follows: 'Every finite and nonempty set S of positive integers is a set of scores for some tournaments'. And he proved that the conjecture is true for |S|=1, 2, 3. In 1984, M. Hager展开更多
This paper gives integer linear programming models for scheduling doubles tennis group competitions. The goal is to build a fair and competitive schedule for all players. Our basic model achieves that for each player ...This paper gives integer linear programming models for scheduling doubles tennis group competitions. The goal is to build a fair and competitive schedule for all players. Our basic model achieves that for each player the average ranking of his partners in all matches is as close as possible to the average ranking of his opponents in all matches. One of the variations of the basic model provides that each matchup is fair and competitive. We also give models for the case when the number of players is 4n<span style="font-family:;" "=""> </span><span style="font-family:;" "="">+</span><span style="font-family:;" "=""> </span><span style="font-family:;" "="">2, and thus one of the matches has to be singles. Our models were implemented and tested using optimization software AMPL. Computational results along with schedules for some typical situations are also given the paper.</span>展开更多
An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effecti...An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.展开更多
Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved ...Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.展开更多
Software test case optimization improves the efficiency of the software by proper structure and reduces the fault in the software.The existing research applies various optimization methods such as Genetic Algorithm,Cr...Software test case optimization improves the efficiency of the software by proper structure and reduces the fault in the software.The existing research applies various optimization methods such as Genetic Algorithm,Crow Search Algorithm,Ant Colony Optimization,etc.,for test case optimization.The existing methods have limitations of lower efficiency in fault diagnosis,higher computa-tional time,and high memory requirement.The existing methods have lower effi-ciency in software test case optimization when the number of test cases is high.This research proposes the Tournament Winner Genetic Algorithm(TW-GA)method to improve the efficiency of software test case optimization.Hospital Information System(HIS)software was used to evaluate TW-GA model perfor-mance in test case optimization.The tournament Winner in the proposed method selects the instances with the best fitness values and increases the exploitation of the search to find the optimal solution.The TW-GA method has higher exploita-tion that helps to find the mutant and equivalent mutation that significantly increases fault diagnosis in the software.The TW-GA method discards the infor-mation with a lower fitness value that reduces the computational time and mem-ory requirement.The TW-GA method requires 5.47 s and the MOCSFO method requires 30 s for software test case optimization.展开更多
An optimization approach based on Artificial Bee Colony(ABC)algorithm is proposed for structural local damage detection in this study.The objective function for the damage identification problem is established by stru...An optimization approach based on Artificial Bee Colony(ABC)algorithm is proposed for structural local damage detection in this study.The objective function for the damage identification problem is established by structural parameters and modal assurance criteria(MAC).The ABC algorithm is presented to solve the certain objective function.Then the Tournament Selection Strategy and chaotic search mechanism is adopted to enhance global search ability of the certain algorithm.A coupled double-beam system is studied as numerical example to illustrate the correctness and efficiency of the propose method.The simulation results show that the modified ABC algorithm can identify the local damage of the structural system efficiently even under measurement noise,which demonstrates the proposed algorithm has a higher damage diagnosis precision.展开更多
Too high energy consumption is widely recognized to be a critical problem in large-scale parallel computing systems.The LogP-based energy-saving model and the frequency scaling method were proposed to reduce energy co...Too high energy consumption is widely recognized to be a critical problem in large-scale parallel computing systems.The LogP-based energy-saving model and the frequency scaling method were proposed to reduce energy consumption analytically and systematically for other two representative barrier algorithms:tournament barrier and central counter barrier.Furthermore,energy optimization methods of these two barrier algorithms were implemented on parallel computing platform.The experimental results validate the effectiveness of the energy optimization methods.67.12% and 70.95% energy savings are obtained respectively for tournament barrier and central counter barrier on platforms with 2048 processes with 1.55%?8.80% performance loss.Furthermore,LogP-based energy-saving analytical model for these two barrier algorithms is highly accurate as the predicted energy savings are within 9.67% of the results obtained by simulation.展开更多
To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, o...To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, optimum solutions are obtained by sequencing A small job shop scheduling problem is solved in DNA computing, and the ＂operations＂ of the computation were performed with standard protocols, as ligation, synthesis, electrophoresis etc. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.展开更多
文摘Let Γm，n^* denote all m × n strongly connected bipartite tournaments and a(m, n) the maximal integer k such that every m × n bipartite tournament contains at least a k × k transitive bipartite subtournament. Let t ( m, n, k, l ) = max{t( Tm,n，k, l ) : Tm,n∈Γm，n^*}, where t ( Tm,n, k, l ) is the number of k × l(k≥2,l≥2) transitive bipartite subtournaments contained in Tm,n∈Γm，n^*. We obtain a method of graph theory for solving some integral programmings, investigate the upper bounds of a(m,n) and obtain t (m,n, k，l).
文摘Let T=(V,A)be a tournament of order n and T_i,…,T_m be diconnectedcomponents in T.If uv ∈A and P is a directed path of length k-1(k≥3)from u to v,We call P ∪{uv}a 1-antidirected cycle of length k.Let k be an integer satisfying 3≤k≤n.If every arc e∈A is contained in a 1-antidirected cycle of length k,we will refer toT as arc k 1-antidirected cyclic.If T is arc k 1-antidirected cyclic for k=3,4,…,n,T iscalled arc 1-antidirected pancyclic.In this paper,we prove that T is arc 1-antidirectedpancyclic if and only if T satisfies one of the following conditions:(i)2≤m≤3 and forany T_i,every arc e∈T_i is contained in a Hamilton path in T_i;(ii)m=1,except some spe-cial tournaments which are to be shown.
文摘In this paper,we present a new sufficient condition on degrees for a bipartite tournament to be Hamiltonian,that is,if an n×n bipartite tournament T satisfies the condition W(n-3),then T is Hamiltonian,except for four exceptional graphs.This result is shown to be best possible in a sense.
文摘The story tells how a Chinese village hit a home run by building its future around baseball,transforming the sport into a powerful engine for rural revitalization.XUJIADAI is an administrative village in Lindai Town of Jiaxing City,east China’s Zhejiang Province.It is in this small village that over 100 baseball and softball tournaments have been held,a record that has crowned it China’s top baseball village.
基金supported by the Natural Science Young Foundation of China(No.11701349)by the Natural Science Foundation of Shanxi Province,China(No.201601D011005)by Shanxi Scholarship Council of China(2017-018)
文摘Gutin and Rafiey（Australas J. Combin. 34（2006）, 17-21） provided an example of an n-partite tournament with exactly n-m ＋ 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question. Let 3 ≤ m ≤n and n ≥ 4. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n-m ＋ 1 cycles of length m for two values of m？ In the same paper,they showed that this question has a negative answer for two values n-1 and n. In this paper, we prove that a strong n-partite tournament with exactly two cycles of length n-1 must contain some given multipartite tournament as subdigraph. As a corollary, we also show that the above question has a negative answer for two values n-1 and any l with 3 ≤ l ≤ n and l ≠n-1.
基金supported by the National Natural Science Foundation of China(Nos.12071260,11671232)。
文摘A tournament is an orientation of the complete graph.Tournaments form perhaps the most interesting class of digraphs and it has a great potential for application.Tournaments provide a model of the statistical technique called the method of paired comparisons and they have also been studied in connection with sociometric relations in small groups.In this paper,we investigate disjoint cycles of the same length in tournaments.In 2010,Lichiardopol conjectured that for given integers l≥3 and k≥1,any tournament with minimum out-degree at least(l-1)k-1 contains k disjoint l-cycles,where an l-cycle is a cycle of order l.Bang-Jensen et al.verified the conjecture for l=3 and Ma et al.proved that it also holds for l≥10.This paper provides a proof of the conjecture for the case of 9≥l≥4.
基金Supported by the National Natural Science Foundation of China (No. 10801114)the Nature Science Foundation of Shandong Province, China (No. ZR2011AL019 No. ZR2011AM005)
文摘The problem of complementary cycles in tournaments and bipartite tournaments was completely solved. However, the problem of complementary cycles in semicomplete n-partite digraphs with n 〉 3 is still open. Based on the definition of componentwise complementary cycles, we get the following result. Let D be a 2-strong n-partite （n 〉 6） tournament that is not a tournament. Let C be a 3-cycle of D and D ／ V（C） be nonstrong. For the unique acyclic sequence D1, D2,..., Da of D ／ V（C）, where a 〉 2, let Dc = {Di｜Di contains cycles, i = 1,2,...,a}, Dc = {D1,D2,...,Da} ／ De. If Dc≠ 0, then D contains a pair of componentwise complementary cycles.
文摘In this paper, we generate all nonisomorphic tournaments of order at mostnine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regulartournaments of order 11. For each of these tournaments, we have given its score-list, connectivity,diameter, the minimal number of feedbacks, automorphisms and spectra. Moreover, we have verified thewell-known Kelly's Conjecture for n = 2k + 1 ≤ 11. And we also determine the n-universaltournaments for n ≤ 6. However, several related results are given and some related open problemsare raised.
基金supported by Chinese Postdoctoral Science FoundationNational Natural Science Foundation of China(Grant Nos.60103021,10171062 and 19871040)Huazhong University of Science and Technology Foundation
文摘In this paper we prove that if T is a regular n-partite tournament with n ≥ 4, then each arc of T lies on a cycle whose vertices are from exactly k partite sets for k = 4, 5, . . . ,n. Our result, in a sense, generalizes a theorem due to Alspach.
文摘In this paper we prove that if T is a regular n-partite tournament with n≥>6, then each arc of T lies on a k-cycle for k=4,5,…,n. Our result generalizes theorems due to Alspach and Guo respectively.
基金the National Natural Science Foundation of China and NSFJC.
文摘A k-outpath of an arc xy in a multipartite tournament is a directed path with length k starting from xy such that x does not dominate the end vertex of the directed path. This concept is a generalization of a directed cycle. We show that if T is an almost regular n-partite (n>8) tournament with each partite set having at least two vertices, then every are of T has a k-outpath for all k, 3＜k＜n-1.
文摘It is proved that for given integer k≥2, almost all k-hypertournaments are strong and in almost all k-hypertournaments, every pair of vertices lies on a 3-cycle.
文摘In 1978, K. B. Reid proposed a conjecture as follows: 'Every finite and nonempty set S of positive integers is a set of scores for some tournaments'. And he proved that the conjecture is true for |S|=1, 2, 3. In 1984, M. Hager
文摘This paper gives integer linear programming models for scheduling doubles tennis group competitions. The goal is to build a fair and competitive schedule for all players. Our basic model achieves that for each player the average ranking of his partners in all matches is as close as possible to the average ranking of his opponents in all matches. One of the variations of the basic model provides that each matchup is fair and competitive. We also give models for the case when the number of players is 4n<span style="font-family:;" "=""> </span><span style="font-family:;" "="">+</span><span style="font-family:;" "=""> </span><span style="font-family:;" "="">2, and thus one of the matches has to be singles. Our models were implemented and tested using optimization software AMPL. Computational results along with schedules for some typical situations are also given the paper.</span>
基金Projects(61174040,61104178,61374136) supported by the National Natural Science Foundation of ChinaProject(12JC1403400) supported by Shanghai Commission of Science and Technology,ChinaProject supported by the Fundamental Research Funds for the Central Universities,China
文摘An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.
文摘Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.
文摘Software test case optimization improves the efficiency of the software by proper structure and reduces the fault in the software.The existing research applies various optimization methods such as Genetic Algorithm,Crow Search Algorithm,Ant Colony Optimization,etc.,for test case optimization.The existing methods have limitations of lower efficiency in fault diagnosis,higher computa-tional time,and high memory requirement.The existing methods have lower effi-ciency in software test case optimization when the number of test cases is high.This research proposes the Tournament Winner Genetic Algorithm(TW-GA)method to improve the efficiency of software test case optimization.Hospital Information System(HIS)software was used to evaluate TW-GA model perfor-mance in test case optimization.The tournament Winner in the proposed method selects the instances with the best fitness values and increases the exploitation of the search to find the optimal solution.The TW-GA method has higher exploita-tion that helps to find the mutant and equivalent mutation that significantly increases fault diagnosis in the software.The TW-GA method discards the infor-mation with a lower fitness value that reduces the computational time and mem-ory requirement.The TW-GA method requires 5.47 s and the MOCSFO method requires 30 s for software test case optimization.
基金the National Natural Science Foundation of China(11172333,11272361)the Fundamental Research Funds for the Central Universities(13lgzd06)+1 种基金Doctoral Program Foundation of Ministry of Education of China(20130171110039)the Guangdong Province Science and Technology Program(2012A030200011)。
文摘An optimization approach based on Artificial Bee Colony(ABC)algorithm is proposed for structural local damage detection in this study.The objective function for the damage identification problem is established by structural parameters and modal assurance criteria(MAC).The ABC algorithm is presented to solve the certain objective function.Then the Tournament Selection Strategy and chaotic search mechanism is adopted to enhance global search ability of the certain algorithm.A coupled double-beam system is studied as numerical example to illustrate the correctness and efficiency of the propose method.The simulation results show that the modified ABC algorithm can identify the local damage of the structural system efficiently even under measurement noise,which demonstrates the proposed algorithm has a higher damage diagnosis precision.
基金Projects(60903044,61170049) supported by National Natural Science Foundation of China
文摘Too high energy consumption is widely recognized to be a critical problem in large-scale parallel computing systems.The LogP-based energy-saving model and the frequency scaling method were proposed to reduce energy consumption analytically and systematically for other two representative barrier algorithms:tournament barrier and central counter barrier.Furthermore,energy optimization methods of these two barrier algorithms were implemented on parallel computing platform.The experimental results validate the effectiveness of the energy optimization methods.67.12% and 70.95% energy savings are obtained respectively for tournament barrier and central counter barrier on platforms with 2048 processes with 1.55%?8.80% performance loss.Furthermore,LogP-based energy-saving analytical model for these two barrier algorithms is highly accurate as the predicted energy savings are within 9.67% of the results obtained by simulation.
基金This Project was supported by the National Nature Science Foundation (60274026 ,30570431) China Postdoctoral Sci-ence Foundation Natural +1 种基金Science Foundation of Educational Government of Anhui Province of China Excellent Youth Scienceand Technology Foundation of Anhui Province of China (06042088) and Doctoral Foundation of Anhui University of Scienceand Technology
文摘To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, optimum solutions are obtained by sequencing A small job shop scheduling problem is solved in DNA computing, and the ＂operations＂ of the computation were performed with standard protocols, as ligation, synthesis, electrophoresis etc. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
