CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: problem solving styles</title> <meta name="description" content="Search results for: problem solving styles"> <meta name="keywords" content="problem solving styles"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="problem solving styles" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="problem solving styles"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 8168</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: problem solving styles</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7898</span> Homosexuality in Burundi and Homosexuals Rights</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ciza%20Didier">Ciza Didier</a> </p> <p class="card-text"><strong>Abstract:</strong></p> By definition, homosexuality designates the sexual or amorous attraction towards a person of the same sex or of the same gender as one's own. The Burundi country has superficially 27834km2 with 13 millions of population. There are groups of certain people assuming that they are homosexual and that they want to claim their rights. Burundian homosexuals often organise seminars in the premises of the National Health Security Agency (NHSA) located at Kigobe quarter, in Bujumbura, this is the place where they meet to try to exchange and create their association for claim their rights. There are 2 categories of homosexuals: - gays: homosexuality between men (male sex) - lesbians: homosexuality between women (female sex) In the gay couple, there is one who behaves like a woman and often wears feminine styles while the other always remains like a man and always wears masculine styles. In the lesbian couple, there is one who behaves like a man and wears men's styles while the other remains as she is like a woman. In general, Burundian society is against homosexuality. Our society sees them as pariahs carrying a curse. According to Burundian culture and customs, homosexuality is satanic, therefore it is a great sin. In April 2011, Burundian President Pierre Nkurunziza signed a law criminalizing homosexual acts and providing for a sentence of three months to two years in prison, as well as a fine of BIF 50,000 to BIF 100,000 for any homosexual behavior. The investigation recently done shows that out of 300 people questioned, 299 were against homosexuality saying that it is against Burundian culture and 1 was for homosexuality. All Burundians are not against homosexuality. Their country must therefore take into consideration the small party of people who are for homosexuality. Homosexuals, too, need to live like others. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=homosexuality" title="homosexuality">homosexuality</a>, <a href="https://publications.waset.org/abstracts/search?q=lesbian" title=" lesbian"> lesbian</a>, <a href="https://publications.waset.org/abstracts/search?q=gay" title=" gay"> gay</a>, <a href="https://publications.waset.org/abstracts/search?q=law" title=" law"> law</a> </p> <a href="https://publications.waset.org/abstracts/167341/homosexuality-in-burundi-and-homosexuals-rights" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167341.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">70</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7897</span> An Ensemble Learning Method for Applying Particle Swarm Optimization Algorithms to Systems Engineering Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ken%20Hampshire">Ken Hampshire</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Mazzuchi"> Thomas Mazzuchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahram%20Sarkani"> Shahram Sarkani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As a subset of metaheuristics, nature-inspired optimization algorithms such as particle swarm optimization (PSO) have shown promise both in solving intractable problems and in their extensibility to novel problem formulations due to their general approach requiring few assumptions. Unfortunately, single instantiations of algorithms require detailed tuning of parameters and cannot be proven to be best suited to a particular illustrative problem on account of the “no free lunch” (NFL) theorem. Using these algorithms in real-world problems requires exquisite knowledge of the many techniques and is not conducive to reconciling the various approaches to given classes of problems. This research aims to present a unified view of PSO-based approaches from the perspective of relevant systems engineering problems, with the express purpose of then eliciting the best solution for any problem formulation in an ensemble learning bucket of models approach. The central hypothesis of the research is that extending the PSO algorithms found in the literature to real-world optimization problems requires a general ensemble-based method for all problem formulations but a specific implementation and solution for any instance. The main results are a problem-based literature survey and a general method to find more globally optimal solutions for any systems engineering optimization problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title="particle swarm optimization">particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=nature-inspired%20optimization" title=" nature-inspired optimization"> nature-inspired optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20engineering" title=" systems engineering"> systems engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=ensemble%20learning" title=" ensemble learning"> ensemble learning</a> </p> <a href="https://publications.waset.org/abstracts/167097/an-ensemble-learning-method-for-applying-particle-swarm-optimization-algorithms-to-systems-engineering-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167097.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">99</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7896</span> Communication Styles of Business Students: A Comparison of Four National Cultures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tiina%20Brandt">Tiina Brandt</a>, <a href="https://publications.waset.org/abstracts/search?q=Isaac%20Wanasika"> Isaac Wanasika</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Culturally diverse global companies need to understand cultural differences between leaders and employees from different backgrounds. Communication is culturally contingent and has a significant impact on effective execution of leadership goals. The awareness of cultural variations related to communication and interactions will help leaders modify their own behavior, and consequently improve the execution of goals and avoid unnecessary faux pas. Our focus is on young adults that have experienced cultural integration, culturally diverse surroundings in schools and universities, and cultural travels. Our central research problem is to understand the impact of different national cultures on communication. We focus on four countries with distinct national cultures and spatial distribution. The countries are Finland, Indonesia, Russia and USA. Our sample is based on business students (n = 225) from various backgrounds in the four countries. Their responses of communication and leadership styles were analyzed using ANOVA and post-hoc test. Results indicate that culture impacts on communication behavior. Even young culturally-exposed adults with cultural awareness and experience demonstrate cultural differences in their behavior. Apparently, culture is a deeply seated trait that cannot be completely neutralized by environmental variables. Our study offers valuable input for leadership training programs and for expatriates when recognizing specific differences on leaders’ behavior due to culture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=communication" title="communication">communication</a>, <a href="https://publications.waset.org/abstracts/search?q=culture" title=" culture"> culture</a>, <a href="https://publications.waset.org/abstracts/search?q=interaction" title=" interaction"> interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=leadership" title=" leadership"> leadership</a> </p> <a href="https://publications.waset.org/abstracts/127193/communication-styles-of-business-students-a-comparison-of-four-national-cultures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127193.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">113</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7895</span> Educational Engineering Tool on Smartphone</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maya%20Saade">Maya Saade</a>, <a href="https://publications.waset.org/abstracts/search?q=Rafic%20Younes"> Rafic Younes</a>, <a href="https://publications.waset.org/abstracts/search?q=Pascal%20Lafon"> Pascal Lafon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper explores the transformative impact of smartphones on pedagogy and presents a smartphone application developed specifically for engineering problem-solving and educational purposes. The widespread availability and advanced capabilities of smartphones have revolutionized the way we interact with technology, including in education. The ubiquity of smartphones allows learners to access educational resources anytime and anywhere, promoting personalized and self-directed learning. The first part of this paper discusses the overall influence of smartphones on pedagogy, emphasizing their potential to improve learning experiences through mobile technology. In the context of engineering education, this paper focuses on the development of a dedicated smartphone application that serves as a powerful tool for both engineering problem-solving and education. The application features an intuitive and user-friendly interface, allowing engineering students and professionals to perform complex calculations and analyses on their smartphones. The smartphone application primarily focuses on beam calculations and serves as a comprehensive beam calculator tailored to engineering education. It caters to various engineering disciplines by offering interactive modules that allow students to learn key concepts through hands-on activities and simulations. With a primary emphasis on beam analysis, this application empowers users to perform calculations for statically determinate beams, statically indeterminate beams, and beam buckling phenomena. Furthermore, the app includes a comprehensive library of engineering formulas and reference materials, facilitating a deeper understanding and practical application of the fundamental principles in beam analysis. By offering a wide range of features specifically tailored for beam calculation, this application provides an invaluable tool for engineering students and professionals looking to enhance their understanding and proficiency in this crucial aspect of a structural engineer. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20devices%20in%20education" title="mobile devices in education">mobile devices in education</a>, <a href="https://publications.waset.org/abstracts/search?q=solving%20engineering%20problems" title=" solving engineering problems"> solving engineering problems</a>, <a href="https://publications.waset.org/abstracts/search?q=smartphone%20application" title=" smartphone application"> smartphone application</a>, <a href="https://publications.waset.org/abstracts/search?q=engineering%20education" title=" engineering education"> engineering education</a> </p> <a href="https://publications.waset.org/abstracts/168735/educational-engineering-tool-on-smartphone" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168735.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">66</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7894</span> Bi-Criteria Vehicle Routing Problem for Possibility Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bezhan%20Ghvaberidze">Bezhan Ghvaberidze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A multiple criteria optimization approach for the solution of the Fuzzy Vehicle Routing Problem (FVRP) is proposed. For the possibility environment the levels of movements between customers are calculated by the constructed simulation interactive algorithm. The first criterion of the bi-criteria optimization problem - minimization of the expectation of total fuzzy travel time on closed routes is constructed for the FVRP. A new, second criterion – maximization of feasibility of movement on the closed routes is constructed by the Choquet finite averaging operator. The FVRP is reduced to the bi-criteria partitioning problem for the so called “promising” routes which were selected from the all admissible closed routes. The convenient selection of the “promising” routes allows us to solve the reduced problem in the real-time computing. For the numerical solution of the bi-criteria partitioning problem the -constraint approach is used. An exact algorithm is implemented based on D. Knuth’s Dancing Links technique and the algorithm DLX. The Main objective was to present the new approach for FVRP, when there are some difficulties while moving on the roads. This approach is called FVRP for extreme conditions (FVRP-EC) on the roads. Also, the aim of this paper was to construct the solving model of the constructed FVRP. Results are illustrated on the numerical example where all Pareto-optimal solutions are found. Also, an approach for more complex model FVRP with time windows was developed. A numerical example is presented in which optimal routes are constructed for extreme conditions on the roads. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title="combinatorial optimization">combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Fuzzy%20Vehicle%20routing%20problem" title=" Fuzzy Vehicle routing problem"> Fuzzy Vehicle routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20objective%20programming" title=" multiple objective programming"> multiple objective programming</a>, <a href="https://publications.waset.org/abstracts/search?q=possibility%20theory" title=" possibility theory"> possibility theory</a> </p> <a href="https://publications.waset.org/abstracts/59577/bi-criteria-vehicle-routing-problem-for-possibility-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59577.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">485</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7893</span> A Block World Problem Based Sudoku Solver</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Luciana%20Abednego">Luciana Abednego</a>, <a href="https://publications.waset.org/abstracts/search?q=Cecilia%20Nugraheni"> Cecilia Nugraheni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are many approaches proposed for solving Sudoku puzzles. One of them is by modelling the puzzles as block world problems. There have been three model for Sudoku solvers based on this approach. Each model expresses Sudoku solver as a parameterized multi agent systems. In this work, we propose a new model which is an improvement over the existing models. This paper presents the development of a Sudoku solver that implements all the proposed models. Some experiments have been conducted to determine the performance of each model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sudoku%20puzzle" title="Sudoku puzzle">Sudoku puzzle</a>, <a href="https://publications.waset.org/abstracts/search?q=Sudoku%20solver" title=" Sudoku solver"> Sudoku solver</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20world%20problem" title=" block world problem"> block world problem</a>, <a href="https://publications.waset.org/abstracts/search?q=parameterized%20multi%20agent%20systems" title=" parameterized multi agent systems"> parameterized multi agent systems</a> </p> <a href="https://publications.waset.org/abstracts/12770/a-block-world-problem-based-sudoku-solver" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12770.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">341</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7892</span> A Hybrid Based Algorithm to Solve the Multi-objective Minimum Spanning Tree Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boumesbah%20Asma">Boumesbah Asma</a>, <a href="https://publications.waset.org/abstracts/search?q=Chergui%20Mohamed%20El-amine"> Chergui Mohamed El-amine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since it has been shown that the multi-objective minimum spanning tree problem (MOST) is NP-hard even with two criteria, we propose in this study a hybrid NSGA-II algorithm with an exact mutation operator, which is only used with low probability, to find an approximation to the Pareto front of the problem. In a connected graph G, a spanning tree T of G being a connected and cycle-free graph, if k edges of G\T are added to T, we obtain a partial graph H of G inducing a reduced size multi-objective spanning tree problem compared to the initial one. With a weak probability for the mutation operator, an exact method for solving the reduced MOST problem considering the graph H is then used to give birth to several mutated solutions from a spanning tree T. Then, the selection operator of NSGA-II is activated to obtain the Pareto front approximation. Finally, an adaptation of the VNS metaheuristic is called for further improvements on this front. It allows finding good individuals to counterbalance the diversification and the intensification during the optimization search process. Experimental comparison studies with an exact method show promising results and indicate that the proposed algorithm is efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=minimum%20spanning%20tree" title="minimum spanning tree">minimum spanning tree</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20objective%20linear%20optimization" title=" multiple objective linear optimization"> multiple objective linear optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title=" combinatorial optimization"> combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=non-sorting%20genetic%20algorithm" title=" non-sorting genetic algorithm"> non-sorting genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20neighborhood%20search" title=" variable neighborhood search"> variable neighborhood search</a> </p> <a href="https://publications.waset.org/abstracts/157395/a-hybrid-based-algorithm-to-solve-the-multi-objective-minimum-spanning-tree-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157395.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">91</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7891</span> Solving the Refugee Problem in the Modern State System: The Philosophical Dilemma of Sovereignty and Human Right</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xiaoman%20Dong">Xiaoman Dong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The refugee problem has a long history, but the scale and severity of modern refugee crises demand us to consider if the progress of political history exacerbates the refugee problem. This paper argues that although sovereignty owes its legitimacy to the protection of human rights, the modern state system complicates the refugee problem by first introducing then blurring the line between human rights and civil rights, and making national identity indispensable to basic livelihood and dignity. This paper first explains the source of the modern state system’s legitimacy by putting it in the context of social contract theories and the politics of nation-building. It then discusses how states create the concept of statelessness, which leads to more violations on human rights. Using historical records of the League of Nations High Commission for Refugees and the United Nations High Commissioner for Refugees, this paper reveals that neither the refugee problem of the Cold-War period nor the current refugee crisis is collateral damage of war, but rather the consequence of intentional exclusionary policies produced out of political interests. Finally, it contends that if the modern state system is to sustain, it cannot prioritize the protection of civil rights of a particular group over the protection of basic human rights of all. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=burden%20sharing" title="burden sharing">burden sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20rights" title=" human rights"> human rights</a>, <a href="https://publications.waset.org/abstracts/search?q=legitimacy%20of%20state" title=" legitimacy of state"> legitimacy of state</a>, <a href="https://publications.waset.org/abstracts/search?q=positive%20externality" title=" positive externality"> positive externality</a>, <a href="https://publications.waset.org/abstracts/search?q=sovereignty" title=" sovereignty"> sovereignty</a> </p> <a href="https://publications.waset.org/abstracts/94256/solving-the-refugee-problem-in-the-modern-state-system-the-philosophical-dilemma-of-sovereignty-and-human-right" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94256.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">190</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7890</span> Building a Performance Outline for Health Care Workers at Teaching Hospitals, Nigeria: The Role of Different Leadership Styles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Osuagwu%20Justine%20Ugochukwu">Osuagwu Justine Ugochukwu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Investigating the effects of transformational and transactional leadership styles on the performance of healthcare employees at the University Teaching Hospital (UNTH) in Enugu, Nigeria, was the goal of the research. The respondents were asked to fill out a structured questionnaire. The respondents were chosen using a straightforward random sampling technique and consisted of 370 health workers at the hospital. The result of the analysis revealed that transactional and transformational leadership style has a positive while ambidextrous leadership has a negative effect on healthcare workers' performance in UNTH, Enugu. Therefore, the management of public hospitals that have the capacity to change their top management approach to leadership styles will gain substantial support from their employees’ thereby increasing organizational commitment and performance among health workers. This will have remarkable social implications, one of which is a change in the work culture and attitude of medical personnel from the seemingly anti-community of patients to friendly engagement and treatment of patients leading to a harmonious coexistence among these individuals in society. Investigating ambidextrous leadership and the use of nonparametric analysis is unique and has brought brand-new knowledge to leadership literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=workers%20performance" title="workers performance">workers performance</a>, <a href="https://publications.waset.org/abstracts/search?q=transformational%20leadership" title=" transformational leadership"> transformational leadership</a>, <a href="https://publications.waset.org/abstracts/search?q=transactional%20leadership" title=" transactional leadership"> transactional leadership</a>, <a href="https://publications.waset.org/abstracts/search?q=governance%20quality" title=" governance quality"> governance quality</a>, <a href="https://publications.waset.org/abstracts/search?q=ambidextrous%20leadership" title=" ambidextrous leadership"> ambidextrous leadership</a> </p> <a href="https://publications.waset.org/abstracts/161715/building-a-performance-outline-for-health-care-workers-at-teaching-hospitals-nigeria-the-role-of-different-leadership-styles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/161715.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">91</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7889</span> Math Word Problems: Context and Achievement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Irena%20Smetackova">Irena Smetackova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The important part of school mathematics are word problems which represent the connection between school knowledge and life reality. To find the reasons why students consider word problems to be difficult, it is necessary to take into consideration the motivational settings, besides mathematical knowledge and reading skills. Our goal is to identify whether the familiar or unfamiliar context of math word problem influences solving success rate and if so, whether the reasons are motivational or cognitive. For this purpose, we conducted three steps study in group of fifty pupils 9-10 years old. In the first step, we asked pupils to create ‘the best’ word problems for entered numerical formula. The set of 19 word problems with different contexts were selected. In the second step, pupils were asked to evaluate (without solving) how they like each item and how easy it is for them. The 6 word problems with low preference and low estimated success rate were selected and combined with other 6 problems with high preference and success rate. In the third step, the same pupils were asked to solve the word problems. The analysis showed that pupils attitudes and solving toward word problems varied by the context. The strong gender patterns both in preferred contexts and in estimated success rates were identified however the real success rate did not differ so strongly. The success gap between word problems with and without preferred contexts were stronger than the gap between problems with and without real experience with the context. The hypothesis that motivational factors are more important than cognitive factors was confirmed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mathematics" title="mathematics">mathematics</a>, <a href="https://publications.waset.org/abstracts/search?q=context%20of%20reality" title=" context of reality"> context of reality</a>, <a href="https://publications.waset.org/abstracts/search?q=motivation" title=" motivation"> motivation</a>, <a href="https://publications.waset.org/abstracts/search?q=cognition" title=" cognition"> cognition</a>, <a href="https://publications.waset.org/abstracts/search?q=word%20problems" title=" word problems"> word problems</a> </p> <a href="https://publications.waset.org/abstracts/84849/math-word-problems-context-and-achievement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84849.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">198</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7888</span> Extension of a Competitive Location Model Considering a Given Number of Servers and Proposing a Heuristic for Solving</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehdi%20Seifbarghy">Mehdi Seifbarghy</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Nasiri"> Zahra Nasiri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Competitive location problem deals with locating new facilities to provide a service (or goods) to the customers of a given geographical area where other facilities (competitors) offering the same service are already present. The new facilities will have to compete with the existing facilities for capturing the market share. This paper proposes a new model to maximize the market share in which customers choose the facilities based on traveling time, waiting time and attractiveness. The attractiveness of a facility is considered as a parameter in the model. A heuristic is proposed to solve the problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=competitive%20location" title="competitive location">competitive location</a>, <a href="https://publications.waset.org/abstracts/search?q=market%20share" title=" market share"> market share</a>, <a href="https://publications.waset.org/abstracts/search?q=facility%20attractiveness" title=" facility attractiveness"> facility attractiveness</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a> </p> <a href="https://publications.waset.org/abstracts/31377/extension-of-a-competitive-location-model-considering-a-given-number-of-servers-and-proposing-a-heuristic-for-solving" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31377.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">523</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7887</span> Adapting the Chemical Reaction Optimization Algorithm to the Printed Circuit Board Drilling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Taisir%20Eldos">Taisir Eldos</a>, <a href="https://publications.waset.org/abstracts/search?q=Aws%20Kanan"> Aws Kanan</a>, <a href="https://publications.waset.org/abstracts/search?q=Waleed%20Nazih"> Waleed Nazih</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Khatatbih"> Ahmad Khatatbih</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Chemical Reaction Optimization (CRO) is an optimization metaheuristic inspired by the nature of chemical reactions as a natural process of transforming the substances from unstable to stable states. Starting with some unstable molecules with excessive energy, a sequence of interactions takes the set to a state of minimum energy. Researchers reported successful application of the algorithm in solving some engineering problems, like the quadratic assignment problem, with superior performance when compared with other optimization algorithms. We adapted this optimization algorithm to the Printed Circuit Board Drilling Problem (PCBDP) towards reducing the drilling time and hence improving the PCB manufacturing throughput. Although the PCBDP can be viewed as instance of the popular Traveling Salesman Problem (TSP), it has some characteristics that would require special attention to the transactions that explore the solution landscape. Experimental test results using the standard CROToolBox are not promising for practically sized problems, while it could find optimal solutions for artificial problems and small benchmarks as a proof of concept. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20algorithms" title="evolutionary algorithms">evolutionary algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=chemical%20reaction%20optimization" title=" chemical reaction optimization"> chemical reaction optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman" title=" traveling salesman"> traveling salesman</a>, <a href="https://publications.waset.org/abstracts/search?q=board%20drilling" title=" board drilling"> board drilling</a> </p> <a href="https://publications.waset.org/abstracts/20797/adapting-the-chemical-reaction-optimization-algorithm-to-the-printed-circuit-board-drilling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20797.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">519</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7886</span> Development of Algorithms for Solving and Analyzing Special Problems Transports Type</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dmitri%20Terzi">Dmitri Terzi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article presents the results of an algorithmic study of a special optimization problem of the transport type (traveling salesman problem): 1) To solve the problem, a new natural algorithm has been developed based on the decomposition of the initial data into convex hulls, which has a number of advantages; it is applicable for a fairly large dimension, does not require a large amount of memory, and has fairly good performance. The relevance of the algorithm lies in the fact that, in practice, programs for problems with the number of traversal points of no more than twenty are widely used. For large-scale problems, the availability of algorithms and programs of this kind is difficult. The proposed algorithm is natural because the optimal solution found by the exact algorithm is not always feasible due to the presence of many other factors that may require some additional restrictions. 2) Another inverse problem solved here is to describe a class of traveling salesman problems that have a predetermined optimal solution. The constructed algorithm 2 allows us to characterize the structure of traveling salesman problems, as well as construct test problems to evaluate the effectiveness of algorithms and other purposes. 3) The appendix presents a software implementation of Algorithm 1 (in MATLAB), which can be used to solve practical problems, as well as in the educational process on operations research and optimization methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title="traveling salesman problem">traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=solution%20construction%20algorithm" title=" solution construction algorithm"> solution construction algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20hulls" title=" convex hulls"> convex hulls</a>, <a href="https://publications.waset.org/abstracts/search?q=optimality%20verification" title=" optimality verification"> optimality verification</a> </p> <a href="https://publications.waset.org/abstracts/179041/development-of-algorithms-for-solving-and-analyzing-special-problems-transports-type" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/179041.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">74</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7885</span> Trends in Solving Assembly Job Shop Scheduling Problem: A Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Midhun%20Paul">Midhun Paul</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Radha%20Ramanan"> T. Radha Ramanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this work is to present a state-of-the-art literature review highlighting the challenges in the research of the scheduling of assembly job shop problem and providing an insight on how the future directions of the research would be. The number of work has been substantial that it requires a review to enable one to understand the origin of the research and how it is getting evolved. This review paper presents a comprehensive review of the literature dealing with various studies carried on assembly job shop scheduling. The review details the evolution of the AJS from the perspective of other scheduling problems and also presents a classification scheme. The work also identifies the potential directions for future research, which we believe to be worthwhile considering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assembly%20job%20shop" title="assembly job shop">assembly job shop</a>, <a href="https://publications.waset.org/abstracts/search?q=future%20directions" title=" future directions"> future directions</a>, <a href="https://publications.waset.org/abstracts/search?q=manufacturing" title=" manufacturing"> manufacturing</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/2449/trends-in-solving-assembly-job-shop-scheduling-problem-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2449.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">413</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7884</span> The Role of Principals’ Emotional Intelligence on School Leadership Effectiveness</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Gebreslassie%20Mekonnen">Daniel Gebreslassie Mekonnen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Effective leadership has a crucial role in excelling in the overall success of a school. Today there is much attention given to school leadership, without which schools can never be successful. Therefore, the study was aimed at investigating the role of principals’ leadership styles and their emotional intelligence on the work motivation and job performance of teachers in Addis Ababa, Ethiopia. The study, thus, first examined the relationship between work motivation and job performance of the teachers in relation to the perceived leadership styles and emotional intelligence of principals. Second, it assessed the mean differences and the interaction effects of the principals’ leadership styles and emotional intelligence on the work motivation and job performance of the teachers. Finally, the study investigated whether principals’ leadership styles and emotional intelligence variables had significantly predicted the work motivation and job performance of teachers. As a means, a quantitative approach and descriptive research design were employed to conduct the study. Three hundred sixteen teachers were selected using multistage sampling techniques as participants of the study from the eight sub-cities in Addis Ababa. The main data-gathering instruments used in this study were the path-goal leadership questionnaire, emotional competence inventory, multidimensional work motivation scale, and job performance appraisal scale. The quantitative data were analyzed by using the statistical techniques of Pearson–product-moment correlation analysis, two-way analysis of variance, and stepwise multiple regression analysis. Major findings of the study have revealed that the work motivation and job performance of the teachers were significantly correlated with the perceived participative leadership style, achievement-oriented leadership style, and emotional intelligence of principals. Moreover, the emotional intelligence of the principals was found to be the best predictor of the teachers’ work motivation, whereas the achievement-oriented leadership style of the principals was identified as the best predictor of the job performance of the teachers. Furthermore, the interaction effects of all four path-goal leadership styles vis-a-vis the emotional intelligence of the principals have shown differential effects on the work motivation and job performance of teachers. Thus, it is reasonable to conclude that emotional intelligence is the sine qua non of effective school leadership. Hence, this study would be useful for policymakers and educational leaders to come up with policies that would enhance the role of emotional intelligence on school leadership effectiveness. Finally, pertinent recommendations were drawn from the findings and the conclusions of the study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=emotional%20intelligence" title="emotional intelligence">emotional intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=leadership%20style" title=" leadership style"> leadership style</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20performance" title=" job performance"> job performance</a>, <a href="https://publications.waset.org/abstracts/search?q=work%20motivation" title=" work motivation"> work motivation</a> </p> <a href="https://publications.waset.org/abstracts/160115/the-role-of-principals-emotional-intelligence-on-school-leadership-effectiveness" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160115.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">100</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7883</span> Solving Single Machine Total Weighted Tardiness Problem Using Gaussian Process Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wanatchapong%20Kongkaew">Wanatchapong Kongkaew</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an application of probabilistic technique, namely Gaussian process regression, for estimating an optimal sequence of the single machine with total weighted tardiness (SMTWT) scheduling problem. In this work, the Gaussian process regression (GPR) model is utilized to predict an optimal sequence of the SMTWT problem, and its solution is improved by using an iterated local search based on simulated annealing scheme, called GPRISA algorithm. The results show that the proposed GPRISA method achieves a very good performance and a reasonable trade-off between solution quality and time consumption. Moreover, in the comparison of deviation from the best-known solution, the proposed mechanism noticeably outperforms the recently existing approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20process%20regression" title="Gaussian process regression">Gaussian process regression</a>, <a href="https://publications.waset.org/abstracts/search?q=iterated%20local%20search" title=" iterated local search"> iterated local search</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20machine%20total%20weighted%20tardiness" title=" single machine total weighted tardiness"> single machine total weighted tardiness</a> </p> <a href="https://publications.waset.org/abstracts/6433/solving-single-machine-total-weighted-tardiness-problem-using-gaussian-process-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6433.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">309</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7882</span> The Possibility of Solving a 3x3 Rubik’s Cube under 3 Seconds</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chung%20To%20Kong">Chung To Kong</a>, <a href="https://publications.waset.org/abstracts/search?q=Siu%20Ming%20Yiu"> Siu Ming Yiu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Rubik's cube was invented in 1974. Since then, speedcubers all over the world try their best to break the world record again and again. The newest record is 3.47 seconds. There are many factors that affect the timing, including turns per second (tps), algorithm, finger trick, hardware of the cube. In this paper, the lower bound of the cube solving time will be discussed using convex optimization. Extended analysis of the world records will be used to understand how to improve the timing. With the understanding of each part of the solving step, the paper suggests a list of speed improvement techniques. Based on the analysis of the world record, there is a high possibility that the 3 seconds mark will be broken soon. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rubik%27s%20Cube" title="Rubik's Cube">Rubik's Cube</a>, <a href="https://publications.waset.org/abstracts/search?q=speed" title=" speed"> speed</a>, <a href="https://publications.waset.org/abstracts/search?q=finger%20trick" title=" finger trick"> finger trick</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/138171/the-possibility-of-solving-a-3x3-rubiks-cube-under-3-seconds" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138171.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">206</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7881</span> Development of Industry Oriented Undergraduate Research Program</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sung%20Ryong%20Kim">Sung Ryong Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyung%20Sup%20Han"> Hyung Sup Han</a>, <a href="https://publications.waset.org/abstracts/search?q=Jae-Yup%20Kim"> Jae-Yup Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many engineering students feel uncomfortable in solving the industry related problems. There are many ways to strengthen the engineering student’s ability to solve the assigned problem when they get a job. Korea National University of Transportation has developed an industry-oriented undergraduate research program (URP). An URP program is designed for engineering students to provide an experience of solving a company’s research problem. The URP project is carried out for 6 months. Each URP team consisted of 1 company mentor, 1 professor, and 3-4 engineering students. A team of different majors is strongly encouraged to integrate different perspectives of multidisciplinary background. The corporate research projects proposed by companies are chosen by the major-related student teams. A company mentor gives the detailed technical background of the project to the students, and he/she also provides a basic data, raw materials and so forth. The company allows students to use the company's research equipment. An assigned professor has adjusted the project scope and level to the student’s ability after discussing with a company mentor. Monthly meeting is used to check the progress, to exchange ideas, and to help the students. It is proven as an effective engineering education program not only to provide an experience of company research but also to motivate the students in their course work. This program provides a premier interdisciplinary platform for undergraduate students to perform the practical challenges encountered in their major-related companies and it is especially helpful for students who want to get a job from a company that proposed the project. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=company%20mentor" title="company mentor">company mentor</a>, <a href="https://publications.waset.org/abstracts/search?q=industry%20oriented" title=" industry oriented"> industry oriented</a>, <a href="https://publications.waset.org/abstracts/search?q=interdisciplinary%20platform" title=" interdisciplinary platform"> interdisciplinary platform</a>, <a href="https://publications.waset.org/abstracts/search?q=undergraduate%20research%20program" title=" undergraduate research program"> undergraduate research program</a> </p> <a href="https://publications.waset.org/abstracts/74494/development-of-industry-oriented-undergraduate-research-program" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74494.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">245</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7880</span> Teaching, Learning and Evaluation Enhancement of Information Communication Technology Education in Schools through Pedagogical and E-Learning Techniques in the Sri Lankan Context</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20G.%20N.%20A.%20S.%20Fernando">M. G. N. A. S. Fernando</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study uses a researchable framework to improve the quality of ICT education and the Teaching Learning Assessment/ Evaluation (TLA/TLE) process. It utilizes existing resources while improving the methodologies along with pedagogical techniques and e-Learning approaches used in the secondary schools of Sri Lanka. The study was carried out in two phases. Phase I focused on investigating the factors which affect the quality of ICT education. Based on the key factors of phase I, the Phase II focused on the design of an Experimental Application Model with 6 activity levels. Each Level in the Activity Model covers one or more levels in the Revised Bloom’s Taxonomy. Towards further enhancement of activity levels, other pedagogical techniques (activity based learning, e-learning techniques, problem solving activities and peer discussions etc.) were incorporated to each level in the activity model as appropriate. The application model was validated by a panel of teachers including a domain expert and was tested in the school environment too. The validity of performance was proved using 6 hypotheses testing and other methodologies. The analysis shows that student performance with problem solving activities increased by 19.5% due to the different treatment levels used. Compared to existing process it was also proved that the embedded techniques (mixture of traditional and modern pedagogical methods and their applications) are more effective with skills development of teachers and students. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=activity%20models" title="activity models">activity models</a>, <a href="https://publications.waset.org/abstracts/search?q=Bloom%E2%80%99s%20taxonomy" title=" Bloom’s taxonomy"> Bloom’s taxonomy</a>, <a href="https://publications.waset.org/abstracts/search?q=ICT%20education" title=" ICT education"> ICT education</a>, <a href="https://publications.waset.org/abstracts/search?q=pedagogies" title=" pedagogies"> pedagogies</a> </p> <a href="https://publications.waset.org/abstracts/83380/teaching-learning-and-evaluation-enhancement-of-information-communication-technology-education-in-schools-through-pedagogical-and-e-learning-techniques-in-the-sri-lankan-context" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83380.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">163</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7879</span> Parallel Pipelined Conjugate Gradient Algorithm on Heterogeneous Platforms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sergey%20Kopysov">Sergey Kopysov</a>, <a href="https://publications.waset.org/abstracts/search?q=Nikita%20Nedozhogin"> Nikita Nedozhogin</a>, <a href="https://publications.waset.org/abstracts/search?q=Leonid%20Tonkov"> Leonid Tonkov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article presents a parallel iterative solver for large sparse linear systems which can be used on a heterogeneous platform. Traditionally, the problem of solving linear systems does not scale well on multi-CPU/multi-GPUs clusters. For example, most of the attempts to implement the classical conjugate gradient method were at best counted in the same amount of time as the problem was enlarged. The paper proposes the pipelined variant of the conjugate gradient method (PCG), a formulation that is potentially better suited for hybrid CPU/GPU computing since it requires only one synchronization point per one iteration instead of two for standard CG. The standard and pipelined CG methods need the vector entries generated by the current GPU and other GPUs for matrix-vector products. So the communication between GPUs becomes a major performance bottleneck on multi GPU cluster. The article presents an approach to minimize the communications between parallel parts of algorithms. Additionally, computation and communication can be overlapped to reduce the impact of data exchange. Using the pipelined version of the CG method with one synchronization point, the possibility of asynchronous calculations and communications, load balancing between the CPU and GPU for solving the large linear systems allows for scalability. The algorithm is implemented with the combined use of technologies: MPI, OpenMP, and CUDA. We show that almost optimum speed up on 8-CPU/2GPU may be reached (relatively to a one GPU execution). The parallelized solver achieves a speedup of up to 5.49 times on 16 NVIDIA Tesla GPUs, as compared to one GPU. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient" title="conjugate gradient">conjugate gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU" title=" GPU"> GPU</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20programming" title=" parallel programming"> parallel programming</a>, <a href="https://publications.waset.org/abstracts/search?q=pipelined%20algorithm" title=" pipelined algorithm"> pipelined algorithm</a> </p> <a href="https://publications.waset.org/abstracts/141808/parallel-pipelined-conjugate-gradient-algorithm-on-heterogeneous-platforms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141808.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">165</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7878</span> Comparison of the Boundary Element Method and the Method of Fundamental Solutions for Analysis of Potential and Elasticity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Zenhari">S. Zenhari</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20R.%20Hematiyan"> M. R. Hematiyan</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Khosravifard"> A. Khosravifard</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20R.%20Feizi"> M. R. Feizi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The boundary element method (BEM) and the method of fundamental solutions (MFS) are well-known fundamental solution-based methods for solving a variety of problems. Both methods are boundary-type techniques and can provide accurate results. In comparison to the finite element method (FEM), which is a domain-type method, the BEM and the MFS need less manual effort to solve a problem. The aim of this study is to compare the accuracy and reliability of the BEM and the MFS. This comparison is made for 2D potential and elasticity problems with different boundary and loading conditions. In the comparisons, both convex and concave domains are considered. Both linear and quadratic elements are employed for boundary element analysis of the examples. The discretization of the problem domain in the BEM, i.e., converting the boundary of the problem into boundary elements, is relatively simple; however, in the MFS, obtaining appropriate locations of collocation and source points needs more attention to obtain reliable solutions. The results obtained from the presented examples show that both methods lead to accurate solutions for convex domains, whereas the BEM is more suitable than the MFS for concave domains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=boundary%20element%20method" title="boundary element method">boundary element method</a>, <a href="https://publications.waset.org/abstracts/search?q=method%20of%20fundamental%20solutions" title=" method of fundamental solutions"> method of fundamental solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=elasticity" title=" elasticity"> elasticity</a>, <a href="https://publications.waset.org/abstracts/search?q=potential%20problem" title=" potential problem"> potential problem</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20domain" title=" convex domain"> convex domain</a>, <a href="https://publications.waset.org/abstracts/search?q=concave%20domain" title=" concave domain"> concave domain</a> </p> <a href="https://publications.waset.org/abstracts/163380/comparison-of-the-boundary-element-method-and-the-method-of-fundamental-solutions-for-analysis-of-potential-and-elasticity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163380.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">90</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7877</span> Model Updating-Based Approach for Damage Prognosis in Frames via Modal Residual Force</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gholamreza%20Ghodrati%20Amiri">Gholamreza Ghodrati Amiri</a>, <a href="https://publications.waset.org/abstracts/search?q=Mojtaba%20Jafarian%20Abyaneh"> Mojtaba Jafarian Abyaneh</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Zare%20Hosseinzadeh"> Ali Zare Hosseinzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an effective model updating strategy for damage localization and quantification in frames by defining damage detection problem as an optimization issue. A generalized version of the Modal Residual Force (MRF) is employed for presenting a new damage-sensitive cost function. Then, Grey Wolf Optimization (GWO) algorithm is utilized for solving suggested inverse problem and the global extremums are reported as damage detection results. The applicability of the presented method is investigated by studying different damage patterns on the benchmark problem of the IASC-ASCE, as well as a planar shear frame structure. The obtained results emphasize good performance of the method not only in free-noise cases, but also when the input data are contaminated with different levels of noises. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frame" title="frame">frame</a>, <a href="https://publications.waset.org/abstracts/search?q=grey%20wolf%20optimization%20algorithm" title=" grey wolf optimization algorithm"> grey wolf optimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=modal%20residual%20force" title=" modal residual force"> modal residual force</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20damage%20detection" title=" structural damage detection"> structural damage detection</a> </p> <a href="https://publications.waset.org/abstracts/47524/model-updating-based-approach-for-damage-prognosis-in-frames-via-modal-residual-force" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47524.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">389</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7876</span> Comparison of Parallel CUDA and OpenMP Implementations of Memetic Algorithms for Solving Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jason%20Digalakis">Jason Digalakis</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Cotronis"> John Cotronis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Memetic algorithms (MAs) are useful for solving optimization problems. It is quite difficult to search the search space of the optimization problem with large dimensions. There is a challenge to use all the cores of the system. In this study, a sequential implementation of the memetic algorithm is converted into a concurrent version, which is executed on the cores of both CPU and GPU. For this reason, CUDA and OpenMP libraries are operated on the parallel algorithm to make a concurrent execution on CPU and GPU, respectively. The aim of this study is to compare CPU and GPU implementation of the memetic algorithm. For this purpose, fourteen benchmark functions are selected as test problems. The obtained results indicate that our approach leads to speedups up to five thousand times higher compared to one CPU thread while maintaining a reasonable results quality. This clearly shows that GPUs have the potential to acceleration of MAs and allow them to solve much more complex tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=memetic%20algorithm" title="memetic algorithm">memetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=CUDA" title=" CUDA"> CUDA</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU-based%20memetic%20algorithm" title=" GPU-based memetic algorithm"> GPU-based memetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=open%20multi%20processing" title=" open multi processing"> open multi processing</a>, <a href="https://publications.waset.org/abstracts/search?q=multimodal%20functions" title=" multimodal functions"> multimodal functions</a>, <a href="https://publications.waset.org/abstracts/search?q=unimodal%20functions" title=" unimodal functions"> unimodal functions</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20optimization%20problems" title=" non-linear optimization problems"> non-linear optimization problems</a> </p> <a href="https://publications.waset.org/abstracts/162791/comparison-of-parallel-cuda-and-openmp-implementations-of-memetic-algorithms-for-solving-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162791.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">101</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7875</span> Curve Fitting by Cubic Bezier Curves Using Migrating Birds Optimization Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mitat%20Uysal">Mitat Uysal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new met heuristic optimization algorithm called as Migrating Birds Optimization is used for curve fitting by rational cubic Bezier Curves. This requires solving a complicated multivariate optimization problem. In this study, the solution of this optimization problem is achieved by Migrating Birds Optimization algorithm that is a powerful met heuristic nature-inspired algorithm well appropriate for optimization. The results of this study show that the proposed method performs very well and being able to fit the data points to cubic Bezier Curves with a high degree of accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithms" title="algorithms">algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Bezier%20curves" title=" Bezier curves"> Bezier curves</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20optimization" title=" heuristic optimization"> heuristic optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=migrating%20birds%20optimization" title=" migrating birds optimization"> migrating birds optimization</a> </p> <a href="https://publications.waset.org/abstracts/78026/curve-fitting-by-cubic-bezier-curves-using-migrating-birds-optimization-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78026.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7874</span> Advanced Combinatorial Method for Solving Complex Fault Trees</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jos%C3%A9%20de%20Jes%C3%BAs%20Rivero%20Oliva">José de Jesús Rivero Oliva</a>, <a href="https://publications.waset.org/abstracts/search?q=Jes%C3%BAs%20Salom%C3%B3n%20Llanes"> Jesús Salomón Llanes</a>, <a href="https://publications.waset.org/abstracts/search?q=Manuel%20Perdomo%20Ojeda"> Manuel Perdomo Ojeda</a>, <a href="https://publications.waset.org/abstracts/search?q=Antonio%20Torres%20Valle"> Antonio Torres Valle</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Combinatorial explosion is a common problem to both predominant methods for solving fault trees: Minimal Cut Set (MCS) approach and Binary Decision Diagram (BDD). High memory consumption impedes the complete solution of very complex fault trees. Only approximated non-conservative solutions are possible in these cases using truncation or other simplification techniques. The paper proposes a method (CSolv+) for solving complex fault trees, without any possibility of combinatorial explosion. Each individual MCS is immediately discarded after its contribution to the basic events importance measures and the Top gate Upper Bound Probability (TUBP) has been accounted. An estimation of the Top gate Exact Probability (TEP) is also provided. Therefore, running in a computer cluster, CSolv+ will guarantee the complete solution of complex fault trees. It was successfully applied to 40 fault trees from the Aralia fault trees database, performing the evaluation of the top gate probability, the 1000 Significant MCSs (SMCS), and the Fussell-Vesely, RRW and RAW importance measures for all basic events. The high complexity fault tree nus9601 was solved with truncation probabilities from 10-²¹ to 10-²⁷ just to limit the execution time. The solution corresponding to 10-²⁷ evaluated 3.530.592.796 MCSs in 3 hours and 15 minutes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=system%20reliability%20analysis" title="system reliability analysis">system reliability analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20risk%20assessment" title=" probabilistic risk assessment"> probabilistic risk assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tree%20analysis" title=" fault tree analysis"> fault tree analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=basic%20events%20importance%20measures" title=" basic events importance measures"> basic events importance measures</a> </p> <a href="https://publications.waset.org/abstracts/186780/advanced-combinatorial-method-for-solving-complex-fault-trees" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186780.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">45</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7873</span> Solving LWE by Pregressive Pumps and Its Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Leizhang%20Wang">Leizhang Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Baocang%20Wang"> Baocang Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> General Sieve Kernel (G6K) is considered as currently the fastest algorithm for the shortest vector problem (SVP) and record holder of open SVP challenge. We study the lattice basis quality improvement effects of the Workout proposed in G6K, which is composed of a series of pumps to solve SVP. Firstly, we use a low-dimensional pump output basis to propose a predictor to predict the quality of high-dimensional Pumps output basis. Both theoretical analysis and experimental tests are performed to illustrate that it is more computationally expensive to solve the LWE problems by using a G6K default SVP solving strategy (Workout) than these lattice reduction algorithms (e.g. BKZ 2.0, Progressive BKZ, Pump, and Jump BKZ) with sieving as their SVP oracle. Secondly, the default Workout in G6K is optimized to achieve a stronger reduction and lower computational cost. Thirdly, we combine the optimized Workout and the Pump output basis quality predictor to further reduce the computational cost by optimizing LWE instances selection strategy. In fact, we can solve the TU LWE challenge (n = 65, q = 4225, = 0:005) 13.6 times faster than the G6K default Workout. Fourthly, we consider a combined two-stage (Preprocessing by BKZ- and a big Pump) LWE solving strategy. Both stages use dimension for free technology to give new theoretical security estimations of several LWE-based cryptographic schemes. The security estimations show that the securities of these schemes with the conservative Newhope’s core-SVP model are somewhat overestimated. In addition, in the case of LAC scheme, LWE instances selection strategy can be optimized to further improve the LWE-solving efficiency even by 15% and 57%. Finally, some experiments are implemented to examine the effects of our strategies on the Normal Form LWE problems, and the results demonstrate that the combined strategy is four times faster than that of Newhope. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LWE" title="LWE">LWE</a>, <a href="https://publications.waset.org/abstracts/search?q=G6K" title=" G6K"> G6K</a>, <a href="https://publications.waset.org/abstracts/search?q=pump%20estimator" title=" pump estimator"> pump estimator</a>, <a href="https://publications.waset.org/abstracts/search?q=LWE%20instances%20selection%20strategy" title=" LWE instances selection strategy"> LWE instances selection strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=dimension%20for%20free" title=" dimension for free"> dimension for free</a> </p> <a href="https://publications.waset.org/abstracts/147782/solving-lwe-by-pregressive-pumps-and-its-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147782.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">60</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7872</span> Online Handwritten Character Recognition for South Indian Scripts Using Support Vector Machines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Steffy%20Maria%20Joseph">Steffy Maria Joseph</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdu%20Rahiman%20V"> Abdu Rahiman V</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Hameed%20K.%20M."> Abdul Hameed K. M.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Online handwritten character recognition is a challenging field in Artificial Intelligence. The classification success rate of current techniques decreases when the dataset involves similarity and complexity in stroke styles, number of strokes and stroke characteristics variations. Malayalam is a complex south indian language spoken by about 35 million people especially in Kerala and Lakshadweep islands. In this paper, we consider the significant feature extraction for the similar stroke styles of Malayalam. This extracted feature set are suitable for the recognition of other handwritten south indian languages like Tamil, Telugu and Kannada. A classification scheme based on support vector machines (SVM) is proposed to improve the accuracy in classification and recognition of online malayalam handwritten characters. SVM Classifiers are the best for real world applications. The contribution of various features towards the accuracy in recognition is analysed. Performance for different kernels of SVM are also studied. A graphical user interface has developed for reading and displaying the character. Different writing styles are taken for each of the 44 alphabets. Various features are extracted and used for classification after the preprocessing of input data samples. Highest recognition accuracy of 97% is obtained experimentally at the best feature combination with polynomial kernel in SVM. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SVM" title="SVM">SVM</a>, <a href="https://publications.waset.org/abstracts/search?q=matlab" title=" matlab"> matlab</a>, <a href="https://publications.waset.org/abstracts/search?q=malayalam" title=" malayalam"> malayalam</a>, <a href="https://publications.waset.org/abstracts/search?q=South%20Indian%20scripts" title=" South Indian scripts"> South Indian scripts</a>, <a href="https://publications.waset.org/abstracts/search?q=onlinehandwritten%20character%20recognition" title=" onlinehandwritten character recognition"> onlinehandwritten character recognition</a> </p> <a href="https://publications.waset.org/abstracts/30826/online-handwritten-character-recognition-for-south-indian-scripts-using-support-vector-machines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30826.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">574</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7871</span> Existing Situation on Labour Use, Health Management and Problems of Buffalo Farming in Thailand</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chonlawit%20Yuwajitaa">Chonlawit Yuwajitaa</a>, <a href="https://publications.waset.org/abstracts/search?q=Suttipong%20Pruangkab"> Suttipong Pruangkab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Existing situation on labour use, health management and problems, and ancillary work done along with buffalo farming in Thailand was studied, There were 52 farms had been interviewed during August to September 2014. The study revealed that 100 percent of labor use was family labors themselves and all of farmers reared their buffaloes and grew rice simultaneously. The farmers valued veterinary service and advice as the most important problem (40.40%) and buffalo farming health problems was found 7.69% of dystocia, retain placenta and abortion. The major problem that should be taken into account was officials involved and buffalo farming should be continually promoted by government sectors to help solving economic problems as a whole. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=buffalo" title="buffalo">buffalo</a>, <a href="https://publications.waset.org/abstracts/search?q=labor%20use" title=" labor use"> labor use</a>, <a href="https://publications.waset.org/abstracts/search?q=health%20management" title=" health management"> health management</a>, <a href="https://publications.waset.org/abstracts/search?q=Thailand" title=" Thailand"> Thailand</a> </p> <a href="https://publications.waset.org/abstracts/34301/existing-situation-on-labour-use-health-management-and-problems-of-buffalo-farming-in-thailand" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34301.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">460</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7870</span> Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salami%20Akeem%20Olanrewaju">Salami Akeem Olanrewaju</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The transportation models or problems are primarily concerned with the optimal (best possible) way in which a product produced at different factories or plants (called supply origins) can be transported to a number of warehouses or customers (called demand destinations). The objective in a transportation problem is to fully satisfy the destination requirements within the operating production capacity constraints at the minimum possible cost. The objective of this study is to determine ways of minimizing transport cost in order to maximum profit. Data were gathered from the records of the Distribution Department of 7-Up Bottling Company Plc. Ilorin, Kwara State, Nigeria. The data were analyzed using SPSS (Statistical Package for Social Sciences) while applying the three methods of solving a transportation problem. The three methods produced the same results; therefore, any of the method can be adopted by the company in transporting its final products to the wholesale dealers in order to minimize total production cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title="cost minimization">cost minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=resources%20utilization" title=" resources utilization"> resources utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=distribution%20system" title=" distribution system"> distribution system</a>, <a href="https://publications.waset.org/abstracts/search?q=allocation%20problem" title=" allocation problem"> allocation problem</a> </p> <a href="https://publications.waset.org/abstracts/2450/application-of-transportation-linear-programming-algorithms-to-cost-reduction-in-nigeria-soft-drinks-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2450.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">257</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7869</span> Social Media Data Analysis for Personality Modelling and Learning Styles Prediction Using Educational Data Mining </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Srushti%20Patil">Srushti Patil</a>, <a href="https://publications.waset.org/abstracts/search?q=Preethi%20Baligar"> Preethi Baligar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gopalkrishna%20Joshi"> Gopalkrishna Joshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Gururaj%20N.%20Bhadri"> Gururaj N. Bhadri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In designing learning environments, the instructional strategies can be tailored to suit the learning style of an individual to ensure effective learning. In this study, the information shared on social media like Facebook is being used to predict learning style of a learner. Previous research studies have shown that Facebook data can be used to predict user personality. Users with a particular personality exhibit an inherent pattern in their digital footprint on Facebook. The proposed work aims to correlate the user's’ personality, predicted from Facebook data to the learning styles, predicted through questionnaires. For Millennial learners, Facebook has become a primary means for information sharing and interaction with peers. Thus, it can serve as a rich bed for research and direct the design of learning environments. The authors have conducted this study in an undergraduate freshman engineering course. Data from 320 freshmen Facebook users was collected. The same users also participated in the learning style and personality prediction survey. The Kolb’s Learning style questionnaires and Big 5 personality Inventory were adopted for the survey. The users have agreed to participate in this research and have signed individual consent forms. A specific page was created on Facebook to collect user data like personal details, status updates, comments, demographic characteristics and egocentric network parameters. This data was captured by an application created using Python program. The data captured from Facebook was subjected to text analysis process using the Linguistic Inquiry and Word Count dictionary. An analysis of the data collected from the questionnaires performed reveals individual student personality and learning style. The results obtained from analysis of Facebook, learning style and personality data were then fed into an automatic classifier that was trained by using the data mining techniques like Rule-based classifiers and Decision trees. This helps to predict the user personality and learning styles by analysing the common patterns. Rule-based classifiers applied for text analysis helps to categorize Facebook data into positive, negative and neutral. There were totally two models trained, one to predict the personality from Facebook data; another one to predict the learning styles from the personalities. The results show that the classifier model has high accuracy which makes the proposed method to be a reliable one for predicting the user personality and learning styles. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=educational%20data%20mining" title="educational data mining">educational data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=Facebook" title=" Facebook"> Facebook</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20styles" title=" learning styles"> learning styles</a>, <a href="https://publications.waset.org/abstracts/search?q=personality%20traits" title=" personality traits"> personality traits</a> </p> <a href="https://publications.waset.org/abstracts/85697/social-media-data-analysis-for-personality-modelling-and-learning-styles-prediction-using-educational-data-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85697.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">231</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=9" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=2">2</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=9">9</a></li> <li class="page-item active"><span class="page-link">10</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=12">12</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=13">13</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=272">272</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=273">273</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles&page=11" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>