Experimental quasi-static crushing tests were conducted by using a universal testing machine format kenaf-epoxy composite elliptical cones. The work focused on the vertex angle's effects on energy absorption capab...Experimental quasi-static crushing tests were conducted by using a universal testing machine format kenaf-epoxy composite elliptical cones. The work focused on the vertex angle's effects on energy absorption capability; the vertex angles vary from 0° to 24° in 6 increments. The failure modes of the kenaf fibre epoxy composite elliptical cones were observed utilising delegate photos taken during the quasistatic crushing test. Load-deformation curves and deformation histories of typical specimens are presented and discussed. Moreover, the effects of cone vertex angles on the load carrying capacity and the energy absorption capability are also discussed. The results show that the energy absorption abilities significantly influence the ellipticity vertex angle as the load carrying capacity. We concluded that the quasi-static axial crushing behaviour of elliptical mat laminated composite cones is strongly affected by their structural geometry and the specific energy absorbed by the composite elliptical cones with vertex angles of 6°, 12°, 18°, and 24°, which is more than an elliptical cone with the vertex angle of 0°(the elliptical tube) at any given deformation. However, the specific energy absorption for the elliptical composite cone showed a positive correlation, i.e., the more the angle increased, the more energy was absorbed. In this regard, an elliptical composite cone with a 24° angle exhibited the best energy absorption capability.展开更多
This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are ...This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are used to perform global exploration in a population, while neighborhood search methods are used to perform local exploitation around the chromosomes. The experimental results indicate that hybrid genetic algorithms can obtain solutions of excellent quality to the problem instances with different sizes. The pure genetic algorithms are outperformed by the neighborhood search heuristics procedures combined with genetic algorithms.展开更多
Breadth-first search(BFS) is an important kernel for graph traversal and has been used by many graph processing applications. Extensive studies have been devoted in boosting the performance of BFS. As the most effecti...Breadth-first search(BFS) is an important kernel for graph traversal and has been used by many graph processing applications. Extensive studies have been devoted in boosting the performance of BFS. As the most effective solution, GPU-acceleration achieves the state-of-the-art result of 3.3×109 traversed edges per second on a NVIDIA Tesla C2050 GPU. A novel vertex frontier based GPU BFS algorithm is proposed, and its main features are three-fold. Firstly, to obtain a better workload balance for irregular graphs, a virtual-queue task decomposition and mapping strategy is introduced for vertex frontier expanding. Secondly, a global deduplicate detection scheme is proposed to remove reduplicative vertices from vertex frontier effectively. Finally, a GPU-based bottom-up BFS approach is employed to process large frontier. The experimental results demonstrate that the algorithm can achieve 10% improvement over the state-of-the-art method on diverse graphs. Especially, it exhibits 2-3 times speedup on low-diameter and scale-free graphs over the state-of-the-art on a NVIDIA Tesla K20 c GPU, reaching a peak traversal rate of 11.2×109 edges/s.展开更多
基金the Universiti Putra Malaysia for the financial support for this research programme using HiCoE Grant,Ministry of Higher Education,Malaysia
文摘Experimental quasi-static crushing tests were conducted by using a universal testing machine format kenaf-epoxy composite elliptical cones. The work focused on the vertex angle's effects on energy absorption capability; the vertex angles vary from 0° to 24° in 6 increments. The failure modes of the kenaf fibre epoxy composite elliptical cones were observed utilising delegate photos taken during the quasistatic crushing test. Load-deformation curves and deformation histories of typical specimens are presented and discussed. Moreover, the effects of cone vertex angles on the load carrying capacity and the energy absorption capability are also discussed. The results show that the energy absorption abilities significantly influence the ellipticity vertex angle as the load carrying capacity. We concluded that the quasi-static axial crushing behaviour of elliptical mat laminated composite cones is strongly affected by their structural geometry and the specific energy absorbed by the composite elliptical cones with vertex angles of 6°, 12°, 18°, and 24°, which is more than an elliptical cone with the vertex angle of 0°(the elliptical tube) at any given deformation. However, the specific energy absorption for the elliptical composite cone showed a positive correlation, i.e., the more the angle increased, the more energy was absorbed. In this regard, an elliptical composite cone with a 24° angle exhibited the best energy absorption capability.
基金This project was supported by the National Natural Science Foundation of China the Open Project Foundation of Comput-er Software New Technique National Key Laboratory of Nanjing University.
文摘This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are used to perform global exploration in a population, while neighborhood search methods are used to perform local exploitation around the chromosomes. The experimental results indicate that hybrid genetic algorithms can obtain solutions of excellent quality to the problem instances with different sizes. The pure genetic algorithms are outperformed by the neighborhood search heuristics procedures combined with genetic algorithms.
基金Projects(61272142,61103082,61003075,61170261,61103193)supported by the National Natural Science Foundation of ChinaProject supported by the Program for New Century Excellent Talents in University of ChinaProjects(2012AA01A301,2012AA010901)supported by the National High Technology Research and Development Program of China
文摘Breadth-first search(BFS) is an important kernel for graph traversal and has been used by many graph processing applications. Extensive studies have been devoted in boosting the performance of BFS. As the most effective solution, GPU-acceleration achieves the state-of-the-art result of 3.3×109 traversed edges per second on a NVIDIA Tesla C2050 GPU. A novel vertex frontier based GPU BFS algorithm is proposed, and its main features are three-fold. Firstly, to obtain a better workload balance for irregular graphs, a virtual-queue task decomposition and mapping strategy is introduced for vertex frontier expanding. Secondly, a global deduplicate detection scheme is proposed to remove reduplicative vertices from vertex frontier effectively. Finally, a GPU-based bottom-up BFS approach is employed to process large frontier. The experimental results demonstrate that the algorithm can achieve 10% improvement over the state-of-the-art method on diverse graphs. Especially, it exhibits 2-3 times speedup on low-diameter and scale-free graphs over the state-of-the-art on a NVIDIA Tesla K20 c GPU, reaching a peak traversal rate of 11.2×109 edges/s.
