33 research outputs found

    New genetic algorithms for constrained optimisation and applications to design of composite laminates

    Get PDF
    A general purpose constraint handling technique for genetic algorithms (GA) is developed by borrowing principles from multi-objective optimisation. This is in view of the many issues still facing constraint handling in GA, particularly in the number of control parameters that overwhelms the user, as well as other GA parameters, which are currently lacking in heuristics to guide successful implementations. Constraints may be handled as individual objectives of decreasing priorities or by a weighted-sum measurement of normalised violation, as would be done in multi-objective scenarios, with full consideration of the main cost function. Rather than the unnecessary specialisation seen in many new heuristics proposed for GA, the simplicity, generality and flexibility of the technique is maintained, where several options such as partial or full constraint evaluation, tangible or Pareto-ranked fitness, and implicit dominance evaluation are presented. By reducing the number of constraint evaluations, these options increase the probability of discovering optimal regions, and hence increase GA efficiency. Studies in applications to a constrained numerical problem, and to the design of realistic composite laminate plates and structures, serve to demonstrate the ease of implementation and general reliability in heavily constrained problems. The difference in the dynamics of partial or full violation knowledge showed that while the former reduced the overall number of constraint evaluations performed, the latter compromises for the expense of full constraint evaluations in the reduced number of GA generations, whether in terms of discovering feasible regions or optimal solutions. The benefit of partial or full constraint evaluations is subjective, as it ultimately depends on the trade-off in the computational cost of constraint evaluations and GA search.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

    New genetic algorithms for constrained optimisation and applications to design of composite laminates

    Get PDF
    A general purpose constraint handling technique for genetic algorithms (GA) is developed by borrowing principles from multi-objective optimisation. This is in view of the many issues still facing constraint handling in GA, particularly in the number of control parameters that overwhelms the user, as well as other GA parameters, which are currently lacking in heuristics to guide successful implementations. Constraints may be handled as individual objectives of decreasing priorities or by a weighted-sum measurement of normalised violation, as would be done in multi-objective scenarios, with full consideration of the main cost function. Rather than the unnecessary specialisation seen in many new heuristics proposed for GA, the simplicity, generality and flexibility of the technique is maintained, where several options such as partial or full constraint evaluation, tangible or Pareto-ranked fitness, and implicit dominance evaluation are presented. By reducing the number of constraint evaluations, these options increase the probability of discovering optimal regions, and hence increase GA efficiency. Studies in applications to a constrained numerical problem, and to the design of realistic composite laminate plates and structures, serve to demonstrate the ease of implementation and general reliability in heavily constrained problems. The difference in the dynamics of partial or full violation knowledge showed that while the former reduced the overall number of constraint evaluations performed, the latter compromises for the expense of full constraint evaluations in the reduced number of GA generations, whether in terms of discovering feasible regions or optimal solutions. The benefit of partial or full constraint evaluations is subjective, as it ultimately depends on the trade-off in the computational cost of constraint evaluations and GA search

    Multi-model fitting based on minimum spanning tree

    Get PDF
    This paper presents a novel approach to the computation of primitive geometrical structures, where no prior knowledge about the visual scene is available and a high level of noise is expected. We based our work on the grouping principles of proximity and similarity, of points and preliminary models. The former was realized using Minimum Spanning Trees (MST), on which we apply a stable alignment and goodness of fit criteria. As for the latter, we used spectral clustering of preliminary models. The algorithm can be generalized to various model fitting settings, without tuning of run parameters. Experiments demonstrate the significant improvement in the localization accuracy of models in plane, homography and motion segmentation examples. The efficiency of the algorithm is not dependent on fine tuning of run parameters like most others in the field

    Adventist Heritage - Vol. 08, No. 1

    Get PDF
    In this issue: 2 | Editor\u27s Stump 3 | Oberlin College and Adventist Educational Reforms 10 | Heirloom: Where Apollo Tunes His Harp -- Walla Walla in the 1890\u27s 18 | William W. Prescott (1955-1944) -- Architect of a Bible-Centered Curriculum 25 | Celebrating the Centennials of Atlantic Union College and Pacific Union College 30 | When Oregon Outlawed Church Schools 40 | Flirting with the World -- How Adventist Colleges in North America Got Accredited 52 | To the Dragon Gate -- Adventist Schools in South China and Hong Kong (1903-1941) 61 | Bookmarks: School Bells and Gospel Trumpets by Maurice Hodgenhttps://scholarsrepository.llu.edu/advent-heritage/1014/thumbnail.jp

    CHINA’S DIGITAL SILK ROAD

    Get PDF
    China’s Digital Silk Road (DSR) is a technology subset of the Belt and Road Initiative which represents a focal point of China’s foreign policy. It aims to create markets for Chinese tech companies, establish international technological influence, and shape technical standards favoring Chinese data practices. This thesis employs two case studies to investigate factors influencing reception to the DSR. Analyzing the overall success of the BRI in Pakistan and Malaysia provides context for understanding similarities and differences in DSR reception patterns. This thesis finds that initial BRI success in Pakistan can be attributed to geopolitical ties and economic needs, but insecurity and debt problems have dramatically stalled progress. The DSR in Pakistan saw early and sustained success due to military influence in domestic politics and the general public’s support of the initiative. In Malaysia, the BRI’s reception was influenced by Sino-Malay relations, the need for investment, and a high-profile corruption scandal. When the corruption scandal surfaced, public backlash resulted in a foundational change in Malaysian domestic politics as well as opposition to Chinese BRI investment. The DSR found early success in Malaysia’s booming digital economy, but reception waned as public sentiment toward China shifted, its political system became more democratic, and Malaysia undertook measures to diversify its technology investment, thus taking a more selective approach to the DSR.Approved for public release. Distribution is unlimited.Major, United States Marine Corp

    The Evening Herald (Albuquerque, N.M.), 02-19-1917

    Get PDF
    https://digitalrepository.unm.edu/abq_eh_news/1955/thumbnail.jp

    An application of robust parameter design using an alternative to Taguchi methods

    Full text link
    corecore