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: simulation constraint</title> <meta name="description" content="Search results for: simulation constraint"> <meta name="keywords" content="simulation constraint"> <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="simulation constraint" 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="simulation constraint"> <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> 5345</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: simulation constraint</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5345</span> A Survey on Constraint Solving Approaches Using Parallel Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nebras%20Gharbi">Nebras Gharbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Itebeddine%20Ghorbel"> Itebeddine Ghorbel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we propose a survey of the different proposed approaches to solve Constraint Satisfaction Problems using parallel architectures. These approaches use in a different way a parallel architecture: the problem itself could be solved differently by several solvers or could be split over solvers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20programming" title="constraint programming">constraint programming</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=constraint%20satisfaction%20problem" title=" constraint satisfaction problem"> constraint satisfaction problem</a>, <a href="https://publications.waset.org/abstracts/search?q=speed-up" title=" speed-up"> speed-up</a> </p> <a href="https://publications.waset.org/abstracts/50394/a-survey-on-constraint-solving-approaches-using-parallel-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50394.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">319</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">5344</span> Three-Stage Multivariate Stratified Sample Surveys with Probabilistic Cost Constraint and Random Variance </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanam%20Haseen">Sanam Haseen</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Bari"> Abdul Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a three stage multivariate programming problem with random survey cost and variances as random variables has been formulated as a non-linear stochastic programming problem. The problem has been converted into an equivalent deterministic form using chance constraint programming and modified E-modeling. An empirical study of the problem has been done at the end of the paper using R-simulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chance%20constraint%20programming" title="chance constraint programming">chance constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20E-model" title=" modified E-model"> modified E-model</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=stratified%20sample%20surveys" title=" stratified sample surveys"> stratified sample surveys</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20stage%20sample%20surveys" title=" three stage sample surveys"> three stage sample surveys</a> </p> <a href="https://publications.waset.org/abstracts/14515/three-stage-multivariate-stratified-sample-surveys-with-probabilistic-cost-constraint-and-random-variance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14515.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">458</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">5343</span> Quality-Of-Service-Aware Green Bandwidth Allocation in Ethernet Passive Optical Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tzu-Yang%20Lin">Tzu-Yang Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Chuan-Ching%20Sue"> Chuan-Ching Sue </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sleep mechanisms are commonly used to ensure the energy efficiency of each optical network unit (ONU) that concerns a single class delay constraint in the Ethernet Passive Optical Network (EPON). How long the ONUs can sleep without violating the delay constraint has become a research problem. Particularly, we can derive an analytical model to determine the optimal sleep time of ONUs in every cycle without violating the maximum class delay constraint. The bandwidth allocation considering such optimal sleep time is called Green Bandwidth Allocation (GBA). Although the GBA mechanism guarantees that the different class delay constraints do not violate the maximum class delay constraint, packets with a more relaxed delay constraint will be treated as those with the most stringent delay constraint and may be sent early. This means that the ONU will waste energy in active mode to send packets in advance which did not need to be sent at the current time. Accordingly, we proposed a QoS-aware GBA using a novel intra-ONU scheduling to control the packets to be sent according to their respective delay constraints, thereby enhancing energy efficiency without deteriorating delay performance. If packets are not explicitly classified but with different packet delay constraints, we can modify the intra-ONU scheduling to classify packets according to their packet delay constraints rather than their classes. Moreover, we propose the switchable ONU architecture in which the ONU can switch the architecture according to the sleep time length, thus improving energy efficiency in the QoS-aware GBA. The simulation results show that the QoS-aware GBA ensures that packets in different classes or with different delay constraints do not violate their respective delay constraints and consume less power than the original GBA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Passive%20Optical%20Networks" title="Passive Optical Networks">Passive Optical Networks</a>, <a href="https://publications.waset.org/abstracts/search?q=PONs" title=" PONs"> PONs</a>, <a href="https://publications.waset.org/abstracts/search?q=Optical%20Network%20Unit" title=" Optical Network Unit"> Optical Network Unit</a>, <a href="https://publications.waset.org/abstracts/search?q=ONU" title=" ONU"> ONU</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20efficiency" title=" energy efficiency"> energy efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=delay%20constraint" title=" delay constraint"> delay constraint</a> </p> <a href="https://publications.waset.org/abstracts/94624/quality-of-service-aware-green-bandwidth-allocation-in-ethernet-passive-optical-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94624.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">284</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">5342</span> Resource Constrained Time-Cost Trade-Off Analysis in Construction Project Planning and Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sangwon%20Han">Sangwon Han</a>, <a href="https://publications.waset.org/abstracts/search?q=Chengquan%20Jin"> Chengquan Jin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Time-cost trade-off (TCTO) is one of the most significant part of construction project management. Despite the significance, current TCTO analysis, based on the Critical Path Method, does not consider resource constraint, and accordingly sometimes generates an impractical and/or infeasible schedule planning in terms of resource availability. Therefore, resource constraint needs to be considered when doing TCTO analysis. In this research, genetic algorithms (GA) based optimization model is created in order to find the optimal schedule. This model is utilized to compare four distinct scenarios (i.e., 1) initial CPM, 2) TCTO without considering resource constraint, 3) resource allocation after TCTO, and 4) TCTO with considering resource constraint) in terms of duration, cost, and resource utilization. The comparison results identify that ‘TCTO with considering resource constraint’ generates the optimal schedule with the respect of duration, cost, and resource. This verifies the need for consideration of resource constraint when doing TCTO analysis. It is expected that the proposed model will produce more feasible and optimal schedule. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=time-cost%20trade-off" title="time-cost trade-off">time-cost trade-off</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithms" title=" genetic algorithms"> genetic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20path" title=" critical path"> critical path</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20availability" title=" resource availability"> resource availability</a> </p> <a href="https://publications.waset.org/abstracts/91630/resource-constrained-time-cost-trade-off-analysis-in-construction-project-planning-and-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91630.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">187</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">5341</span> Optimal Cropping Pattern in an Irrigation Project: A Hybrid Model of Artificial Neural Network and Modified Simplex Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safayat%20Ali%20Shaikh">Safayat Ali Shaikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Software has been developed for optimal cropping pattern in an irrigation project considering land constraint, water availability constraint and pick up flow constraint using modified Simplex Algorithm. Artificial Neural Network Models (ANN) have been developed to predict rainfall. AR (1) model used to generate 1000 years rainfall data to train the ANN. Simulation has been done with expected rainfall data. Eight number crops and three types of soil class have been considered for optimization model. Area under each crop and each soil class have been quantified using Modified Simplex Algorithm to get optimum net return. Efficacy of the software has been tested using data of large irrigation project in India. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20network" title="artificial neural network">artificial neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20irrigation%20project" title=" large irrigation project"> large irrigation project</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20simplex%20algorithm" title=" modified simplex algorithm"> modified simplex algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20cropping%20pattern" title=" optimal cropping pattern"> optimal cropping pattern</a> </p> <a href="https://publications.waset.org/abstracts/71956/optimal-cropping-pattern-in-an-irrigation-project-a-hybrid-model-of-artificial-neural-network-and-modified-simplex-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71956.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">203</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">5340</span> Bi-Directional Evolutionary Topology Optimization Based on Critical Fatigue Constraint </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khodamorad%20Nabaki">Khodamorad Nabaki</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianhu%20Shen"> Jianhu Shen</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaodong%20Huang"> Xiaodong Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper develops a method for considering the critical fatigue stress as a constraint in the Bi-directional Evolutionary Structural Optimization (BESO) method. Our aim is to reach an optimal design in which high cycle fatigue failure does not occur for a specific life time. The critical fatigue stress is calculated based on modified Goodman criteria and used as a stress constraint in our topology optimization problem. Since fatigue generally does not occur for compressive stresses, we use the p-norm approach of the stress measurement that considers the highest tensile principal stress in each point as stress measure to calculate the sensitivity numbers. The BESO method has been extended to minimize volume an object subjected to the critical fatigue stress constraint. The optimization results are compared with the results from the compliance minimization problem which shows clearly the merits of our newly developed approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=topology%20optimization" title="topology optimization">topology optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=BESO%20method" title=" BESO method"> BESO method</a>, <a href="https://publications.waset.org/abstracts/search?q=p-norm" title=" p-norm"> p-norm</a>, <a href="https://publications.waset.org/abstracts/search?q=fatigue%20constraint" title=" fatigue constraint"> fatigue constraint</a> </p> <a href="https://publications.waset.org/abstracts/78086/bi-directional-evolutionary-topology-optimization-based-on-critical-fatigue-constraint" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78086.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">295</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">5339</span> The Rupture Potential of Nerve Tissue Constrained Intracranial Saccular Aneurysm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Alam">M. Alam</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Seshaiyer"> P. Seshaiyer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rupture predictability of intracranial aneurysm is one of the most important parameters for physicians in surgical treatment. As most of the intracranial aneurysms are asymptomatic, still the rupture potential of both symptomatic and asymptomatic lesions is relatively unknown. Moreover, an intracranial aneurysm constrained by a nerve tissue might be a common scenario for a physician to deal with during the treatment process. Here, we perform a computational modeling of nerve tissue constrained intracranial saccular aneurysm to show a protective role of constrained tissue on the aneurysm. A comparative parametric study of the model also performs taking long constraint, medium constraint, short constraint, point contact, narrow neck aneurysm, wide neck aneurysm as parameters for the analysis. Results show that contact constraint aneurysm generates less stress near the fundus compared to no constraint aneurysm, hence works as a protective wall for the aneurysm not to be ruptured. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rupture%20potential" title="rupture potential">rupture potential</a>, <a href="https://publications.waset.org/abstracts/search?q=intracranial%20saccular%20aneurysm" title=" intracranial saccular aneurysm"> intracranial saccular aneurysm</a>, <a href="https://publications.waset.org/abstracts/search?q=anisotropic%20hyper-elastic%20material" title=" anisotropic hyper-elastic material"> anisotropic hyper-elastic material</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20analysis" title=" finite element analysis"> finite element analysis</a> </p> <a href="https://publications.waset.org/abstracts/82839/the-rupture-potential-of-nerve-tissue-constrained-intracranial-saccular-aneurysm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82839.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">211</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">5338</span> A Genetic Algorithm Approach for Multi Constraint Team Orienteering Problem with Time Windows </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Uyanga%20Sukhbaatar">Uyanga Sukhbaatar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Lbath"> Ahmed Lbath</a>, <a href="https://publications.waset.org/abstracts/search?q=Mendamar%20Majig"> Mendamar Majig</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Orienteering Problem is the most known example to start modeling tourist trip design problem. In order to meet tourist’s interest and constraint the OP is becoming more and more complicate to solve. The Multi Constraint Team Orienteering Problem with Time Windows is the last extension of the OP which differentiates from other extensions by including more extra associated constraints. The goal of the MCTOPTW is maximizing tourist’s satisfaction score in same time not to violate any of these constraints. This paper presents a genetic algorithmic approach to tackle the MCTOPTW. The benchmark data from literature is tested by our algorithm and the performance results are compared. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi%20constraint%20team%20orienteering%20problem%20with%20time%20windows" title="multi constraint team orienteering problem with time windows">multi constraint team orienteering problem with time windows</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=tour%20planning%20system" title=" tour planning system"> tour planning system</a> </p> <a href="https://publications.waset.org/abstracts/29951/a-genetic-algorithm-approach-for-multi-constraint-team-orienteering-problem-with-time-windows" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29951.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">626</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">5337</span> Exhaustive Study of Essential Constraint Satisfaction Problem Techniques Based on N-Queens Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Md.%20Ahsan%20Ayub">Md. Ahsan Ayub</a>, <a href="https://publications.waset.org/abstracts/search?q=Kazi%20A.%20Kalpoma"> Kazi A. Kalpoma</a>, <a href="https://publications.waset.org/abstracts/search?q=Humaira%20Tasnim%20Proma"> Humaira Tasnim Proma</a>, <a href="https://publications.waset.org/abstracts/search?q=Syed%20Mehrab%20Kabir"> Syed Mehrab Kabir</a>, <a href="https://publications.waset.org/abstracts/search?q=Rakib%20Ibna%20Hamid%20Chowdhury"> Rakib Ibna Hamid Chowdhury</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Constraint Satisfaction Problem (CSP) is observed in various applications, i.e., scheduling problems, timetabling problems, assignment problems, etc. Researchers adopt a CSP technique to tackle a certain problem; however, each technique follows different approaches and ways to solve a problem network. In our exhaustive study, it has been possible to visualize the processes of essential CSP algorithms from a very concrete constraint satisfaction example, NQueens Problem, in order to possess a deep understanding about how a particular constraint satisfaction problem will be dealt with by our studied and implemented techniques. Besides, benchmark results - time vs. value of N in N-Queens - have been generated from our implemented approaches, which help understand at what factor each algorithm produces solutions; especially, in N-Queens puzzle. Thus, extended decisions can be made to instantiate a real life problem within CSP’s framework. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arc%20consistency%20%28AC%29" title="arc consistency (AC)">arc consistency (AC)</a>, <a href="https://publications.waset.org/abstracts/search?q=backjumping%20algorithm%20%28BJ%29" title=" backjumping algorithm (BJ)"> backjumping algorithm (BJ)</a>, <a href="https://publications.waset.org/abstracts/search?q=backtracking%20algorithm%20%28BT%29" title=" backtracking algorithm (BT)"> backtracking algorithm (BT)</a>, <a href="https://publications.waset.org/abstracts/search?q=constraint%20satisfaction%20problem%20%28CSP%29" title=" constraint satisfaction problem (CSP)"> constraint satisfaction problem (CSP)</a>, <a href="https://publications.waset.org/abstracts/search?q=forward%20checking%20%28FC%29" title=" forward checking (FC)"> forward checking (FC)</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20constrained%20values%20%28LCV%29" title=" least constrained values (LCV)"> least constrained values (LCV)</a>, <a href="https://publications.waset.org/abstracts/search?q=maintaining%20arc%20consistency%20%28MAC%29" title=" maintaining arc consistency (MAC)"> maintaining arc consistency (MAC)</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20remaining%20values%20%28MRV%29" title=" minimum remaining values (MRV)"> minimum remaining values (MRV)</a>, <a href="https://publications.waset.org/abstracts/search?q=N-Queens%20problem" title=" N-Queens problem"> N-Queens problem</a> </p> <a href="https://publications.waset.org/abstracts/69933/exhaustive-study-of-essential-constraint-satisfaction-problem-techniques-based-on-n-queens-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69933.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">364</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">5336</span> Airport Check-In Optimization by IP and Simulation in Combination</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Al-Sultan">Ahmed Al-Sultan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The check-in area of airport terminal is one of the busiest sections at airports at certain periods. The passengers are subjected to queues and delays during the check-in process. These delays and queues are due to constraints in the capacity of service facilities. In this project, the airport terminal is decomposed into several check-in areas. The airport check-in scheduling problem requires both a deterministic (integer programming) and stochastic (simulation) approach. Integer programming formulations are provided to minimize the total number of counters in each check-in area under the realistic constraint that counters for one and the same flight should be adjacent and the desired number of counters remaining in each area should be fixed during check-in operations. By using simulation, the airport system can be modeled to study the effects of various parameters such as number of passengers on a flight and check-in counter opening and closing time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=airport%20terminal" title="airport terminal">airport terminal</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title=" integer programming"> integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/14259/airport-check-in-optimization-by-ip-and-simulation-in-combination" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14259.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">5335</span> Generalized Mean-Field Theory of Phase Unwrapping via Multiple Interferograms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yohei%20Saika">Yohei Saika</a> </p> <p class="card-text"><strong>Abstract:</strong></p> On the basis of Bayesian inference using the maximizer of the posterior marginal estimate, we carry out phase unwrapping using multiple interferograms via generalized mean-field theory. Numerical calculations for a typical wave-front in remote sensing using the synthetic aperture radar interferometry, phase diagram in hyper-parameter space clarifies that the present method succeeds in phase unwrapping perfectly under the constraint of surface- consistency condition, if the interferograms are not corrupted by any noises. Also, we find that prior is useful for extending a phase in which phase unwrapping under the constraint of the surface-consistency condition. These results are quantitatively confirmed by the Monte Carlo simulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bayesian%20inference" title="Bayesian inference">Bayesian inference</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20mean-field%20theory" title=" generalized mean-field theory"> generalized mean-field theory</a>, <a href="https://publications.waset.org/abstracts/search?q=phase%20unwrapping" title=" phase unwrapping"> phase unwrapping</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20interferograms" title=" multiple interferograms"> multiple interferograms</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20mechanics" title=" statistical mechanics"> statistical mechanics</a> </p> <a href="https://publications.waset.org/abstracts/11354/generalized-mean-field-theory-of-phase-unwrapping-via-multiple-interferograms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11354.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">479</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">5334</span> Hydraulic Resources Management under Imperfect Competition with Thermal Plants in the Wholesale Electricity Market</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdessalem%20Abbassi">Abdessalem Abbassi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahlem%20Dakhlaoui"> Ahlem Dakhlaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=Lota%20D.%20Tamini"> Lota D. Tamini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we analyze infinite discrete-time games between hydraulic and thermal power operators in the wholesale electricity market under Cournot competition. We consider a deregulated electrical industry where certain demand is satisfied by hydraulic and thermal technologies. The hydraulic operator decides the production in each season of each period that maximizes the sum of expected profits from power generation with respect to the stochastic dynamic constraint on the water stored in the dam, the environmental constraint and the non-negative output constraint. In contrast, the thermal plant is operated with quadratic cost function, with respect to the capacity production constraint and the non-negativity output constraint. We show that under imperfect competition, the hydraulic operator has a strategic storage of water in the peak season. Then, we quantify the strategic inter-annual and intra-annual water transfer and compare the numerical results. Finally, we show that the thermal operator can restrict the hydraulic output without compensation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asymmetric%20risk%20aversion" title="asymmetric risk aversion">asymmetric risk aversion</a>, <a href="https://publications.waset.org/abstracts/search?q=electricity%20wholesale%20market" title=" electricity wholesale market"> electricity wholesale market</a>, <a href="https://publications.waset.org/abstracts/search?q=hydropower%20dams" title=" hydropower dams"> hydropower dams</a>, <a href="https://publications.waset.org/abstracts/search?q=imperfect%20competition" title=" imperfect competition"> imperfect competition</a> </p> <a href="https://publications.waset.org/abstracts/38733/hydraulic-resources-management-under-imperfect-competition-with-thermal-plants-in-the-wholesale-electricity-market" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38733.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">359</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">5333</span> Share Pledging and Financial Constraints in China</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zijian%20Cheng">Zijian Cheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Frank%20Liu"> Frank Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yupu%20Sun"> Yupu Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The relationship between the intensity of share pledging activities and the level of financial constraint in publicly listed firms in China is examined in this paper. Empirical results show that the high financial constraint level may motivate insiders to use share pledging as an alternative funding source and an expropriation mechanism. Share collateralization can cause a subsequently more constrained financing condition. Evidence is found that share pledging made by the controlling shareholder is likely to mitigate financial constraints in the following year. Research findings are robust to alternative measures and an instrumental variable for dealing with endogeneity problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=share%20pledge" title="share pledge">share pledge</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20constraint" title=" financial constraint"> financial constraint</a>, <a href="https://publications.waset.org/abstracts/search?q=controlling%20shareholder" title=" controlling shareholder"> controlling shareholder</a>, <a href="https://publications.waset.org/abstracts/search?q=dividend%20policy" title=" dividend policy"> dividend policy</a> </p> <a href="https://publications.waset.org/abstracts/128185/share-pledging-and-financial-constraints-in-china" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128185.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">5332</span> A Critical Analysis of Cognitive Explanations of Afterlife Belief</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Biabanaki">Mahdi Biabanaki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Religion is present in all human societies and has been for tens of thousands of years. What is noteworthy is that although religious traditions vary in different societies, there are considerable similarities in their religious beliefs. In all human cultures, for example, there is a widespread belief in the afterlife. Cognitive science of Religion (CSR), an emerging branch of cognitive science, searches for the root of these widespread similarities and the widespread prevalence of beliefs such as beliefs in the afterlife in common mental structures among humans. Accordingly, the cognitive architecture of the human mind has evolved to produce such beliefs automatically and non-reflectively. For CSR researchers, belief in the afterlife is an intuitive belief resulting from the functioning of mental tools. Our purpose in this article is to extract and evaluate the cognitive explanations presented in the CSR field for explaining beliefs in the afterlife. Our research shows that there are two basic theories in this area of CSR, namely "intuitive dualism" and "simulation constraint" theory. We show that these two theories face four major challenges and limitations in explaining belief in the afterlife: inability to provide a causal explanation, inability to explain cultural/religious differences in afterlife belief, the lack of distinction between the natural and the rational foundations of belief in the afterlife and disregarding the supernatural foundations of the afterlife belief. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=afterlife" title="afterlife">afterlife</a>, <a href="https://publications.waset.org/abstracts/search?q=cognitive%20science%20of%20religion" title=" cognitive science of religion"> cognitive science of religion</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitive%20dualism" title=" intuitive dualism"> intuitive dualism</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation%20constraint" title=" simulation constraint"> simulation constraint</a> </p> <a href="https://publications.waset.org/abstracts/129437/a-critical-analysis-of-cognitive-explanations-of-afterlife-belief" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129437.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">213</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">5331</span> Constraint-Directed Techniques for Transport Scheduling with Capacity Restrictions of Automotive Manufacturing Components</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Martha%20Ndeley">Martha Ndeley</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Ikome"> John Ikome</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we expand the scope of constraint-directed techniques to deal with the case of transportation schedule with capacity restrictions where the scheduling problem includes alternative activities. That is, not only does the scheduling problem consist of determining when an activity is to be executed, but also determining which set of alternative activities is to be executed at all level of transportation from input to output. Such problems encompass both alternative resource problems and alternative process plan problems. We formulate a constraint-based representation of alternative activities to model problems containing such choices. We then extend existing constraint-directed scheduling heuristic commitment techniques and propagators to reason directly about the fact that an activity does not necessarily have to exist in a final transportation schedule without being completed. Tentative results show that an algorithm using a novel texture-based heuristic commitment technique propagators achieves the best overall performance of the techniques tested. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=production" title="production">production</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation"> transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated" title=" integrated"> integrated</a> </p> <a href="https://publications.waset.org/abstracts/50638/constraint-directed-techniques-for-transport-scheduling-with-capacity-restrictions-of-automotive-manufacturing-components" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50638.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">362</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">5330</span> Size Reduction of Images Using Constraint Optimization Approach for Machine Communications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chee%20Sun%20Won">Chee Sun Won</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the size reduction of images for machine-to-machine communications. Here, the salient image regions to be preserved include the image patches of the key-points such as corners and blobs. Based on a saliency image map from the key-points and their image patches, an axis-aligned grid-size optimization is proposed for the reduction of image size. To increase the size-reduction efficiency the aspect ratio constraint is relaxed in the constraint optimization framework. The proposed method yields higher matching accuracy after the size reduction than the conventional content-aware image size-reduction methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20compression" title="image compression">image compression</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20matching" title=" image matching"> image matching</a>, <a href="https://publications.waset.org/abstracts/search?q=key-point%20detection%20and%20description" title=" key-point detection and description"> key-point detection and description</a>, <a href="https://publications.waset.org/abstracts/search?q=machine-to-machine%20communication" title=" machine-to-machine communication"> machine-to-machine communication</a> </p> <a href="https://publications.waset.org/abstracts/67605/size-reduction-of-images-using-constraint-optimization-approach-for-machine-communications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67605.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">418</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">5329</span> Coarse Grid Computational Fluid Dynamics Fire Simulations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wolfram%20Jahn">Wolfram Jahn</a>, <a href="https://publications.waset.org/abstracts/search?q=Jose%20Manuel%20Munita"> Jose Manuel Munita</a> </p> <p class="card-text"><strong>Abstract:</strong></p> While computational fluid dynamics (CFD) simulations of fire scenarios are commonly used in the design of buildings, less attention has been given to the use of CFD simulations as an operational tool for the fire services. The reason of this lack of attention lies mainly in the fact that CFD simulations typically take large periods of time to complete, and their results would thus not be available in time to be of use during an emergency. Firefighters often face uncertain conditions when entering a building to attack a fire. They would greatly benefit from a technology based on predictive fire simulations, able to assist their decision-making process. The principal constraint to faster CFD simulations is the fine grid necessary to solve accurately the physical processes that govern a fire. This paper explores the possibility of overcoming this constraint and using coarse grid CFD simulations for fire scenarios, and proposes a methodology to use the simulation results in a meaningful way that can be used by the fire fighters during an emergency. Data from real scale compartment fire tests were used to compare CFD fire models with different grid arrangements, and empirical correlations were obtained to interpolate data points into the grids. The results show that the strongly predominant effect of the heat release rate of the fire on the fluid dynamics allows for the use of coarse grids with relatively low overall impact of simulation results. Simulations with an acceptable level of accuracy could be run in real time, thus making them useful as a forecasting tool for emergency response purposes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CFD" title="CFD">CFD</a>, <a href="https://publications.waset.org/abstracts/search?q=fire%20simulations" title=" fire simulations"> fire simulations</a>, <a href="https://publications.waset.org/abstracts/search?q=emergency%20response" title=" emergency response"> emergency response</a>, <a href="https://publications.waset.org/abstracts/search?q=forecast" title=" forecast"> forecast</a> </p> <a href="https://publications.waset.org/abstracts/50382/coarse-grid-computational-fluid-dynamics-fire-simulations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50382.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">318</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">5328</span> Enhanced Constraint-Based Optical Network (ECON) for Enhancing OSNR</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20R.%20Kavitha">G. R. Kavitha</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20S.%20Indumathi"> T. S. Indumathi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the constantly rising demands of the multimedia services, the requirements of long haul transport network are constantly changing in the area of optical network. Maximum data transmission using optimization of the communication channel poses the biggest challenge. Although there has been a constant focus on this area from the past decade, there was no evidence of a significant result that has been accomplished. Hence, after reviewing some potential design of optical network from literatures, it was understood that optical signal to noise ratio was one of the elementary attributes that can define the performance of the optical network. In this paper, we propose a framework termed as ECON (Enhanced Constraint-based Optical Network) that primarily optimize the optical signal to noise ratio using ROADM. The simulation is performed in Matlab and optical signal to noise ratio is extracted considering the system matrix. The outcome of the proposed study shows that optimized OSNR as compared to the existing studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=component" title="component">component</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20network" title=" optical network"> optical network</a>, <a href="https://publications.waset.org/abstracts/search?q=reconfigurable%20optical%20add-drop%20multiplexer" title=" reconfigurable optical add-drop multiplexer"> reconfigurable optical add-drop multiplexer</a>, <a href="https://publications.waset.org/abstracts/search?q=optical%20signal-to-noise%20ratio" title=" optical signal-to-noise ratio"> optical signal-to-noise ratio</a> </p> <a href="https://publications.waset.org/abstracts/17847/enhanced-constraint-based-optical-network-econ-for-enhancing-osnr" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17847.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">488</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">5327</span> Use of Simulation in Medical Education: Role and Challenges</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raneem%20Osama%20Salem">Raneem Osama Salem</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayesha%20Nuzhat"> Ayesha Nuzhat</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatimah%20Nasser%20Al%20Shehri"> Fatimah Nasser Al Shehri</a>, <a href="https://publications.waset.org/abstracts/search?q=Nasser%20Al%20Hamdan"> Nasser Al Hamdan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Recently, most medical schools around the globe are using simulation for teaching and assessing students’ clinical skills and competence. There are many obstacles that could face students and faculty when simulation sessions are introduced into undergraduate curriculum. Objective: The aim of this study is to obtain the opinion of undergraduate medical students and our faculty regarding the role of simulation in undergraduate curriculum, the simulation modalities used, and perceived barriers in implementing stimulation sessions. Methods: To address the role of simulation, modalities used, and perceived challenges to implementation of simulation sessions, a self-administered pilot tested questionnaire with 18 items using a 5 point Likert scale was distributed. Participants included undergraduate male medical students (n=125) and female students (n=70) as well as the faculty members (n=14). Result: Various learning outcomes are achieved and improved through the technology enhanced simulation sessions such as communication skills, diagnostic skills, procedural skills, self-confidence, and integration of basic and clinical sciences. The use of high fidelity simulators, simulated patients and task trainers was more desirable by our students and faculty for teaching and learning as well as an evaluation tool. According to most of the students,' institutional support in terms of resources, staff and duration of sessions was adequate. However, motivation to participate in the sessions and provision of adequate feedback by the staff was a constraint. Conclusion: The use of simulation laboratory is of great benefit to the students and a great teaching tool for the staff to ensure students learning of the various skills. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=simulators" title="simulators">simulators</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20students" title=" medical students"> medical students</a>, <a href="https://publications.waset.org/abstracts/search?q=skills" title=" skills"> skills</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20patients" title=" simulated patients"> simulated patients</a>, <a href="https://publications.waset.org/abstracts/search?q=performance" title=" performance"> performance</a>, <a href="https://publications.waset.org/abstracts/search?q=challenges" title=" challenges"> challenges</a>, <a href="https://publications.waset.org/abstracts/search?q=skill%20laboratory" title=" skill laboratory"> skill laboratory</a> </p> <a href="https://publications.waset.org/abstracts/6844/use-of-simulation-in-medical-education-role-and-challenges" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6844.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">407</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">5326</span> Analysis of Information Sharing and Capacity Constraint on Backlog Bullwhip Effect in Two Level Supply Chain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Matloub%20Hussaina">Matloub Hussaina </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the impact of information sharing and capacity constraints on backlog bullwhip effect of Automatic Pipe Line Inventory and Order Based Production Control System (APIOBPCS). System dynamic simulation using iThink Software has been applied. It has been found that smooth ordering by Tier 1 can be achieved when Tier 1 has medium capacity constraints. Simulation experiments also show that information sharing helps to reduce 50% of backlog bullwhip effect in capacitated supply chains. This knowledge is of value per se, giving supply chain operations managers and designers a practical way in to controlling the backlog bullwhip effect. Future work should investigate the total cost implications of capacity constraints and safety stocks in multi-echelon supply chain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20dynamics" title="supply chain dynamics">supply chain dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20sharing" title=" information sharing"> information sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=capacity%20constraints" title=" capacity constraints"> capacity constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=APIOBPCS" title=" APIOBPCS"> APIOBPCS</a> </p> <a href="https://publications.waset.org/abstracts/12702/analysis-of-information-sharing-and-capacity-constraint-on-backlog-bullwhip-effect-in-two-level-supply-chain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12702.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">318</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">5325</span> Extended Constraint Mask Based One-Bit Transform for Low-Complexity Fast Motion Estimation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=O%C4%9Fuzhan%20Urhan">Oğuzhan Urhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, an improved motion estimation (ME) approach based on weighted constrained one-bit transform is proposed for block-based ME employed in video encoders. Binary ME approaches utilize low bit-depth representation of the original image frames with a Boolean exclusive-OR based hardware efficient matching criterion to decrease computational burden of the ME stage. Weighted constrained one-bit transform (WC‑1BT) based approach improves the performance of conventional C-1BT based ME employing 2-bit depth constraint mask instead of a 1-bit depth mask. In this work, the range of constraint mask is further extended to increase ME performance of WC-1BT approach. Experiments reveal that the proposed method provides better ME accuracy compared existing similar ME methods in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fast%20motion%20estimation%3B%20low-complexity%20motion%20estimation" title="fast motion estimation; low-complexity motion estimation">fast motion estimation; low-complexity motion estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20coding" title=" video coding"> video coding</a> </p> <a href="https://publications.waset.org/abstracts/76760/extended-constraint-mask-based-one-bit-transform-for-low-complexity-fast-motion-estimation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76760.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">316</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">5324</span> An Improved Genetic Algorithm for Traveling Salesman Problem with Precedence Constraint</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20F.%20F.%20Ab%20Rashid">M. F. F. Ab Rashid</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20N.%20Mohd%20Rose"> A. N. Mohd Rose</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20M.%20Z.%20Nik%20Mohamed"> N. M. Z. Nik Mohamed</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20S.%20Wan%20Harun"> W. S. Wan Harun</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20A.%20Che%20Ghani"> S. A. Che Ghani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm. <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=sequencing" title=" sequencing"> sequencing</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=precedence%20constraint" title=" precedence constraint"> precedence constraint</a> </p> <a href="https://publications.waset.org/abstracts/15486/an-improved-genetic-algorithm-for-traveling-salesman-problem-with-precedence-constraint" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15486.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">560</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">5323</span> A Survey on Compression Methods for Table Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Gharbi">N. Gharbi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Constraint Satisfaction problems are mathematical problems that are often used to model many real-world problems for which we look if there exists a solution satisfying all its constraints. Table constraints are important for modeling parts of many problems since they list all combinations of allowed or forbidden values. However, they admit practical limitations because they are sometimes too large to be represented in a direct way. In this paper, we present a survey of the different categories of the proposed approaches to compress table constraints in order to reduce both space and time complexities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20programming" title="constraint programming">constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=compression" title=" compression"> compression</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=table%20constraints" title=" table constraints"> table constraints</a> </p> <a href="https://publications.waset.org/abstracts/49933/a-survey-on-compression-methods-for-table-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49933.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">325</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">5322</span> Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Divyesh%20Patel">Divyesh Patel</a>, <a href="https://publications.waset.org/abstracts/search?q=Tanuja%20Srivastava"> Tanuja Srivastava</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20tomography" title="discrete tomography">discrete tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=exactly-1-4-adjacency" title=" exactly-1-4-adjacency"> exactly-1-4-adjacency</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=binary%20matrices" title=" binary matrices"> binary matrices</a> </p> <a href="https://publications.waset.org/abstracts/8505/reconstruction-of-binary-matrices-satisfying-neighborhood-constraints-by-simulated-annealing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8505.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">406</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">5321</span> 156vdc to 110vac Sinusoidal Inverter Simulation and Implementation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Phinyo%20Mueangmeesap">Phinyo Mueangmeesap</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes about pure sinusoidal inverter simulation and implementation from high voltage DC (156 Vdc). This simulation is to study and improve the efficiency of the inverter. By reducing the loss of power from boost converter in current inverter. The simulation is done by using the H-bridge circuit with pulse width modulate (PWM) signal and low-pass filter circuit. To convert the DC into AC. This paper used the PSCad for simulation. The result of simulation can be used to create prototype inverter by converting 156 Vdc to 110Vac. The inverter gives the output signal similar to the output from a simulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=inverter%20simulation" title="inverter simulation">inverter simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=PWM%20signal" title=" PWM signal"> PWM signal</a>, <a href="https://publications.waset.org/abstracts/search?q=single-phase%20inverter" title=" single-phase inverter"> single-phase inverter</a>, <a href="https://publications.waset.org/abstracts/search?q=sinusoidal%20inverter" title=" sinusoidal inverter"> sinusoidal inverter</a> </p> <a href="https://publications.waset.org/abstracts/58872/156vdc-to-110vac-sinusoidal-inverter-simulation-and-implementation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58872.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">412</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">5320</span> The Characteristics of the Fragments from Cylindrical Casing with One of End Caps Fully Constrained</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yueguang%20Gao">Yueguang Gao</a>, <a href="https://publications.waset.org/abstracts/search?q=Qi%20Huang"> Qi Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shunshan%20Feng"> Shunshan Feng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to study the process and characteristic of the fragments in the warhead with one end cap under full constraint condition, we established a cylindrical casing with two end caps which one of which was fully constrained using the simulation analysis. The result showed that the fragmentation of cylindrical casing with one end full constrained has its own characteristic. The Mach stem was generated when the detonation wave propagated to the fully constrained end cap under the condition of one end detonation, working on unreactive explosives and causing the nearby fragment subjected to nearly 2.5 times the normal pressure to obtain a higher speed. The cylindrical casing first ruptured at the contact surface with the fully constrained end, and then at the end cover of the initiating end, and then the rupture extends to the whole cylindrical casing. The detonation products started to leak out from the rupture. Driving fragments to fly and forming two dense flying areas. The analysis of this paper can provide a reference for the optimal design of this kind of warhead. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fragment" title="fragment">fragment</a>, <a href="https://publications.waset.org/abstracts/search?q=cylindrical%20casing" title=" cylindrical casing"> cylindrical casing</a>, <a href="https://publications.waset.org/abstracts/search?q=detonation%20waves" title=" detonation waves"> detonation waves</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20simulation" title=" numerical simulation"> numerical simulation</a> </p> <a href="https://publications.waset.org/abstracts/133630/the-characteristics-of-the-fragments-from-cylindrical-casing-with-one-of-end-caps-fully-constrained" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133630.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">124</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">5319</span> Structural Design Optimization of Reinforced Thin-Walled Vessels under External Pressure Using Simulation and Machine Learning Classification Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lydia%20Novozhilova">Lydia Novozhilova</a>, <a href="https://publications.waset.org/abstracts/search?q=Vladimir%20Urazhdin"> Vladimir Urazhdin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An optimization problem for reinforced thin-walled vessels under uniform external pressure is considered. The conventional approaches to optimization generally start with pre-defined geometric parameters of the vessels, and then employ analytic or numeric calculations and/or experimental testing to verify functionality, such as stability under the projected conditions. The proposed approach consists of two steps. First, the feasibility domain will be identified in the multidimensional parameter space. Every point in the feasibility domain defines a design satisfying both geometric and functional constraints. Second, an objective function defined in this domain is formulated and optimized. The broader applicability of the suggested methodology is maximized by implementing the Support Vector Machines (SVM) classification algorithm of machine learning for identification of the feasible design region. Training data for SVM classifier is obtained using the Simulation package of SOLIDWORKS®. Based on the data, the SVM algorithm produces a curvilinear boundary separating admissible and not admissible sets of design parameters with maximal margins. Then optimization of the vessel parameters in the feasibility domain is performed using the standard algorithms for the constrained optimization. As an example, optimization of a ring-stiffened closed cylindrical thin-walled vessel with semi-spherical caps under high external pressure is implemented. As a functional constraint, von Mises stress criterion is used but any other stability constraint admitting mathematical formulation can be incorporated into the proposed approach. Suggested methodology has a good potential for reducing design time for finding optimal parameters of thin-walled vessels under uniform external pressure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=design%20parameters" title="design parameters">design parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=feasibility%20domain" title=" feasibility domain"> feasibility domain</a>, <a href="https://publications.waset.org/abstracts/search?q=von%20Mises%20stress%20criterion" title=" von Mises stress criterion"> von Mises stress criterion</a>, <a href="https://publications.waset.org/abstracts/search?q=Support%20Vector%20Machine%20%28SVM%29%20classifier" title=" Support Vector Machine (SVM) classifier"> Support Vector Machine (SVM) classifier</a> </p> <a href="https://publications.waset.org/abstracts/70305/structural-design-optimization-of-reinforced-thin-walled-vessels-under-external-pressure-using-simulation-and-machine-learning-classification-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70305.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">327</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">5318</span> The Design and Modeling of Intelligent Learners Assistance System (ILASS)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jelili%20Kunle%20Adedeji">Jelili Kunle Adedeji</a>, <a href="https://publications.waset.org/abstracts/search?q=Toeb%20Akorede%20Akinbola"> Toeb Akorede Akinbola</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of vehicle mishap as a result of miscalculation, recklessness, or malfunction of some part in a vehicle is acknowledged to be a global issue. In most of the cases, it results into death or life injuries, all over the world; the issue becomes a nightmare to the stakeholders on how to curb mishaps on our roads due to these endemic factors. Hence this research typically examined the design of a device, specifically for learners that can lead to a society of intelligent vehicles (traffic) without withdrawing the driving authority from them, unlike pre-existing systems. Though ILASS shears a lot of principle with existing advance drivers assistance systems, yet there are two fundamental differences between ILASS system and existing systems. Firstly ILASS is meant to accept continuous input from the throttle at all time such that the devices will not constraint the driving process unnecessarily and ensure a change of speed at any point in time. Secondly, it made use of a variable threshold distance between the host vehicle and front vehicle which can be set by the host driver under the constraint of road maintenance agency, who communicates the minimum possible threshold for a different lane to the host vehicle. The results obtained from the simulation of the ILASS system concluded that ILASS is a good solution to road accidents, particularly road accident which occurs as a result of driving at high speed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=front-vehicle" title="front-vehicle">front-vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=host-speed" title=" host-speed"> host-speed</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold-distance" title=" threshold-distance"> threshold-distance</a>, <a href="https://publications.waset.org/abstracts/search?q=ILASS" title=" ILASS"> ILASS</a> </p> <a href="https://publications.waset.org/abstracts/89957/the-design-and-modeling-of-intelligent-learners-assistance-system-ilass" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89957.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">181</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">5317</span> Rating and Generating Sudoku Puzzles Based on Constraint Satisfaction Problems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bahare%20Fatemi">Bahare Fatemi</a>, <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Mehran%20Kazemi"> Seyed Mehran Kazemi</a>, <a href="https://publications.waset.org/abstracts/search?q=Nazanin%20Mehrasa"> Nazanin Mehrasa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sudoku is a logic-based combinatorial puzzle game which people in different ages enjoy playing it. The challenging and addictive nature of this game has made it a ubiquitous game. Most magazines, newspapers, puzzle books, etc. publish lots of Sudoku puzzles every day. These puzzles often come in different levels of difficulty so that all people, from beginner to expert, can play the game and enjoy it. Generating puzzles with different levels of difficulty is a major concern of Sudoku designers. There are several works in the literature which propose ways of generating puzzles having a desirable level of difficulty. In this paper, we propose a method based on constraint satisfaction problems to evaluate the difficulty of the Sudoku puzzles. Then, we propose a hill climbing method to generate puzzles with different levels of difficulty. Whereas other methods are usually capable of generating puzzles with only few number of difficulty levels, our method can be used to generate puzzles with arbitrary number of different difficulty levels. We test our method by generating puzzles with different levels of difficulty and having a group of 15 people solve all the puzzles and recording the time they spend for each puzzle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20satisfaction%20problem" title="constraint satisfaction problem">constraint satisfaction problem</a>, <a href="https://publications.waset.org/abstracts/search?q=generating%20Sudoku%20puzzles" title=" generating Sudoku puzzles"> generating Sudoku puzzles</a>, <a href="https://publications.waset.org/abstracts/search?q=hill%20climbing" title=" hill climbing"> hill climbing</a> </p> <a href="https://publications.waset.org/abstracts/8625/rating-and-generating-sudoku-puzzles-based-on-constraint-satisfaction-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8625.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">402</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">5316</span> Verification of a Simple Model for Rolling Isolation System Response</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aarthi%20Sridhar">Aarthi Sridhar</a>, <a href="https://publications.waset.org/abstracts/search?q=Henri%20Gavin"> Henri Gavin</a>, <a href="https://publications.waset.org/abstracts/search?q=Karah%20Kelly"> Karah Kelly</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Rolling Isolation Systems (RISs) are simple and effective means to mitigate earthquake hazards to equipment in critical and precious facilities, such as hospitals, network collocation facilities, supercomputer centers, and museums. The RIS works by isolating components acceleration the inertial forces felt by the subsystem. The RIS consists of two platforms with counter-facing concave surfaces (dishes) in each corner. Steel balls lie inside the dishes and allow the relative motion between the top and bottom platform. Formerly, a mathematical model for the dynamics of RISs was developed using Lagrange’s equations (LE) and experimentally validated. A new mathematical model was developed using Gauss’s Principle of Least Constraint (GPLC) and verified by comparing impulse response trajectories of the GPLC model and the LE model in terms of the peak displacements and accelerations of the top platform. Mathematical models for the RIS are tedious to derive because of the non-holonomic rolling constraints imposed on the system. However, using Gauss’s Principle of Least constraint to find the equations of motion removes some of the obscurity and yields a system that can be easily extended. Though the GPLC model requires more state variables, the equations of motion are far simpler. The non-holonomic constraint is enforced in terms of accelerations and therefore requires additional constraint stabilization methods in order to avoid the possibility that numerical integration methods can cause the system to go unstable. The GPLC model allows the incorporation of more physical aspects related to the RIS, such as contribution of the vertical velocity of the platform to the kinetic energy and the mass of the balls. This mathematical model for the RIS is a tool to predict the motion of the isolation platform. The ability to statistically quantify the expected responses of the RIS is critical in the implementation of earthquake hazard mitigation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=earthquake%20hazard%20mitigation" title="earthquake hazard mitigation">earthquake hazard mitigation</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake%20isolation" title=" earthquake isolation"> earthquake isolation</a>, <a href="https://publications.waset.org/abstracts/search?q=Gauss%E2%80%99s%20Principle%20of%20Least%20Constraint" title=" Gauss’s Principle of Least Constraint"> Gauss’s Principle of Least Constraint</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20dynamics" title=" nonlinear dynamics"> nonlinear dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=rolling%20isolation%20system" title=" rolling isolation system"> rolling isolation system</a> </p> <a href="https://publications.waset.org/abstracts/81063/verification-of-a-simple-model-for-rolling-isolation-system-response" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81063.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">250</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=10">10</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=simulation%20constraint&page=178">178</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=179">179</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=simulation%20constraint&page=2" 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>