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: Neumann problem</title> <meta name="description" content="Search results for: Neumann problem"> <meta name="keywords" content="Neumann problem"> <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="Neumann problem" 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="Neumann problem"> <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> 7192</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Neumann problem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7192</span> Differential Transform Method: Some Important Examples</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Jamil%20Amir">M. Jamil Amir</a>, <a href="https://publications.waset.org/abstracts/search?q=Rabia%20Iqbal"> Rabia Iqbal</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Yaseen"> M. Yaseen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we solve some differential equations analytically by using differential transform method. For this purpose, we consider four models of Laplace equation with two Dirichlet and two Neumann boundary conditions and K(2,2) equation and obtain the corresponding exact solutions. The obtained results show the simplicity of the method and massive reduction in calculations when one compares it with other iterative methods, available in literature. It is worth mentioning that here only a few number of iterations are required to reach the closed form solutions as series expansions of some known functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=differential%20transform%20method" title="differential transform method">differential transform method</a>, <a href="https://publications.waset.org/abstracts/search?q=laplace%20equation" title=" laplace equation"> laplace equation</a>, <a href="https://publications.waset.org/abstracts/search?q=Dirichlet%20boundary%20conditions" title=" Dirichlet boundary conditions"> Dirichlet boundary conditions</a>, <a href="https://publications.waset.org/abstracts/search?q=Neumann%20boundary%20conditions" title=" Neumann boundary conditions"> Neumann boundary conditions</a> </p> <a href="https://publications.waset.org/abstracts/18605/differential-transform-method-some-important-examples" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18605.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">537</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">7191</span> On Transferring of Transient Signals along Hollow Waveguide</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20Eroglu">E. Eroglu</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Semsit"> S. Semsit</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Sener"> E. Sener</a>, <a href="https://publications.waset.org/abstracts/search?q=U.S.%20Sener"> U.S. Sener</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Electromagnetics, there are three canonical boundary value problem with given initial conditions for the electromagnetic field sought, namely: Cavity Problem, Waveguide Problem, and External Problem. The Cavity Problem and Waveguide Problem were rigorously studied and new results were arised at original works in the past decades. In based on studies of an analytical time domain method Evolutionary Approach to Electromagnetics (EAE), electromagnetic field strength vectors produced by a time dependent source function are sought. The fields are took place in L2 Hilbert space. The source function that performs signal transferring, energy and surplus of energy has been demonstrated with all clarity. Depth of the method and ease of applications are emerged needs of gathering obtained results. Main discussion is about perfect electric conductor and hollow waveguide. Even if well studied time-domain modes problems are mentioned, specifically, the modes which have a hollow (i.e., medium-free) cross-section domain are considered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20approach%20to%20electromagnetics" title="evolutionary approach to electromagnetics">evolutionary approach to electromagnetics</a>, <a href="https://publications.waset.org/abstracts/search?q=time-domain%20waveguide%20mode" title=" time-domain waveguide mode"> time-domain waveguide mode</a>, <a href="https://publications.waset.org/abstracts/search?q=Neumann%20problem" title=" Neumann problem"> Neumann problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Dirichlet%20boundary%20value%20problem" title=" Dirichlet boundary value problem"> Dirichlet boundary value problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Klein-Gordon" title=" Klein-Gordon"> Klein-Gordon</a> </p> <a href="https://publications.waset.org/abstracts/42378/on-transferring-of-transient-signals-along-hollow-waveguide" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42378.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">329</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">7190</span> Topological Sensitivity Analysis for Reconstruction of the Inverse Source Problem from Boundary Measurement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maatoug%20Hassine">Maatoug Hassine</a>, <a href="https://publications.waset.org/abstracts/search?q=Mourad%20Hrizi"> Mourad Hrizi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider a geometric inverse source problem for the heat equation with Dirichlet and Neumann boundary data. We will reconstruct the exact form of the unknown source term from additional boundary conditions. Our motivation is to detect the location, the size and the shape of source support. We present a one-shot algorithm based on the Kohn-Vogelius formulation and the topological gradient method. The geometric inverse source problem is formulated as a topology optimization one. A topological sensitivity analysis is derived from a source function. Then, we present a non-iterative numerical method for the geometric reconstruction of the source term with unknown support using a level curve of the topological gradient. Finally, we give several examples to show the viability of our presented method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geometric%20inverse%20source%20problem" title="geometric inverse source problem">geometric inverse source problem</a>, <a href="https://publications.waset.org/abstracts/search?q=heat%20equation" title=" heat equation"> heat equation</a>, <a href="https://publications.waset.org/abstracts/search?q=topological%20optimization" title=" topological optimization"> topological optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=topological%20sensitivity" title=" topological sensitivity"> topological sensitivity</a>, <a href="https://publications.waset.org/abstracts/search?q=Kohn-Vogelius%20formulation" title=" Kohn-Vogelius formulation"> Kohn-Vogelius formulation</a> </p> <a href="https://publications.waset.org/abstracts/58295/topological-sensitivity-analysis-for-reconstruction-of-the-inverse-source-problem-from-boundary-measurement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58295.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">300</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">7189</span> Mathematical Modeling of the AMCs Cross-Contamination Removal in the FOUPs: Finite Element Formulation and Application in FOUP’s Decontamination</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Santatriniaina">N. Santatriniaina</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Deseure"> J. Deseure</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Q.%20Nguyen"> T. Q. Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Fontaine"> H. Fontaine</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Beitia"> C. Beitia</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Rakotomanana"> L. Rakotomanana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, with the increasing of the wafer's size and the decreasing of critical size of integrated circuit manufacturing in modern high-tech, microelectronics industry needs a maximum attention to challenge the contamination control. The move to 300 mm is accompanied by the use of Front Opening Unified Pods for wafer and his storage. In these pods an airborne cross contamination may occur between wafers and the pods. A predictive approach using modeling and computational methods is very powerful method to understand and qualify the AMCs cross contamination processes. This work investigates the required numerical tools which are employed in order to study the AMCs cross-contamination transfer phenomena between wafers and FOUPs. Numerical optimization and finite element formulation in transient analysis were established. Analytical solution of one dimensional problem was developed and the calibration process of physical constants was performed. The least square distance between the model (analytical 1D solution) and the experimental data are minimized. The behavior of the AMCs intransient analysis was determined. The model framework preserves the classical forms of the diffusion and convection-diffusion equations and yields to consistent form of the Fick's law. The adsorption process and the surface roughness effect were also traduced as a boundary condition using the switch condition Dirichlet to Neumann and the interface condition. The methodology is applied, first using the optimization methods with analytical solution to define physical constants, and second using finite element method including adsorption kinetic and the switch of Dirichlet to Neumann condition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AMCs" title="AMCs">AMCs</a>, <a href="https://publications.waset.org/abstracts/search?q=FOUP" title=" FOUP"> FOUP</a>, <a href="https://publications.waset.org/abstracts/search?q=cross-contamination" title=" cross-contamination"> cross-contamination</a>, <a href="https://publications.waset.org/abstracts/search?q=adsorption" title=" adsorption"> adsorption</a>, <a href="https://publications.waset.org/abstracts/search?q=diffusion" title=" diffusion"> diffusion</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20analysis" title=" numerical analysis"> numerical analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=wafers" title=" wafers"> wafers</a>, <a href="https://publications.waset.org/abstracts/search?q=Dirichlet%20to%20Neumann" title=" Dirichlet to Neumann"> Dirichlet to Neumann</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20elements%20methods" title=" finite elements methods"> finite elements methods</a>, <a href="https://publications.waset.org/abstracts/search?q=Fick%E2%80%99s%20law" title=" Fick’s law"> Fick’s law</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/7628/mathematical-modeling-of-the-amcs-cross-contamination-removal-in-the-foups-finite-element-formulation-and-application-in-foups-decontamination" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7628.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">506</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">7188</span> Numerical Computation of Sturm-Liouville Problem with Robin Boundary Condition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Theddeus%20T.%20Akano">Theddeus T. Akano</a>, <a href="https://publications.waset.org/abstracts/search?q=Omotayo%20A.%20Fakinlede"> Omotayo A. Fakinlede</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The modelling of physical phenomena, such as the earth’s free oscillations, the vibration of strings, the interaction of atomic particles, or the steady state flow in a bar give rise to Sturm-Liouville (SL) eigenvalue problems. The boundary applications of some systems like the convection-diffusion equation, electromagnetic and heat transfer problems requires the combination of Dirichlet and Neumann boundary conditions. Hence, the incorporation of Robin boundary condition in the analyses of Sturm-Liouville problem. This paper deals with the computation of the eigenvalues and eigenfunction of generalized Sturm-Liouville problems with Robin boundary condition using the finite element method. Numerical solutions of classical Sturm–Liouville problems are presented. The results show an agreement with the exact solution. High results precision is achieved with higher number of elements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sturm-Liouville%20problem" title="Sturm-Liouville problem">Sturm-Liouville problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Robin%20boundary%20condition" title=" Robin boundary condition"> Robin boundary condition</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvalue%20problems" title=" eigenvalue problems"> eigenvalue problems</a> </p> <a href="https://publications.waset.org/abstracts/37320/numerical-computation-of-sturm-liouville-problem-with-robin-boundary-condition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37320.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">7187</span> Limitation of Parallel Flow in Three-Dimensional Elongated Porous Domain Subjected to Cross Heat and Mass Flux</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Najwa%20Mimouni">Najwa Mimouni</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20Rahli"> Omar Rahli</a>, <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Bennacer"> Rachid Bennacer</a>, <a href="https://publications.waset.org/abstracts/search?q=Salah%20Chikh"> Salah Chikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present work 2D and 3D numerical simulations of double diffusion natural convection in an elongated enclosure filled with a binary fluid saturating a porous medium are carried out. In the formulation of the problem, the Boussinesq approximation is considered and cross Neumann boundary conditions are specified for heat and mass walls conditions. The numerical method is based on the control volume approach with the third order QUICK scheme. Full approximation storage (FAS) with full multigrid (FMG) method is used to solve the problem. For the explored large range of the controlling parameters, we clearly evidenced that the increase in the depth of the cavity i.e. the lateral aspect ratio has an important effect on the flow patterns. The 2D perfect parallel flows obtained for a small lateral aspect ratio are drastically destabilized by increasing the cavity lateral dimension. This yields a 3D fluid motion with a much more complicated flow pattern and the classically studied 2D parallel flows are impossible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bifurcation" title="bifurcation">bifurcation</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20convection" title=" natural convection"> natural convection</a>, <a href="https://publications.waset.org/abstracts/search?q=heat%20and%20mass%20transfer" title=" heat and mass transfer"> heat and mass transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20flow" title=" parallel flow"> parallel flow</a>, <a href="https://publications.waset.org/abstracts/search?q=porous%20media" title=" porous media"> porous media</a> </p> <a href="https://publications.waset.org/abstracts/50299/limitation-of-parallel-flow-in-three-dimensional-elongated-porous-domain-subjected-to-cross-heat-and-mass-flux" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50299.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">473</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">7186</span> Performance Degradation for the GLR Test-Statistics for Spatial Signal Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Olesya%20Bolkhovskaya">Olesya Bolkhovskaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexander%20Maltsev"> Alexander Maltsev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Antenna arrays are widely used in modern radio systems in sonar and communications. The solving of the detection problems of a useful signal on the background of noise is based on the GLRT method. There is a large number of problem which depends on the known a priori information. In this work, in contrast to the majority of already solved problems, it is used only difference spatial properties of the signal and noise for detection. We are analyzing the influence of the degree of non-coherence of signal and noise unhomogeneity on the performance characteristics of different GLRT statistics. The description of the signal and noise is carried out by means of the spatial covariance matrices C in the cases of different number of known information. The partially coherent signal is simulated as a plane wave with a random angle of incidence of the wave concerning a normal. Background noise is simulated as random process with uniform distribution function in each element. The results of investigation of degradation of performance characteristics for different cases are represented in this work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=GLRT" title="GLRT">GLRT</a>, <a href="https://publications.waset.org/abstracts/search?q=Neumann-Pearson%E2%80%99s%20criterion" title=" Neumann-Pearson’s criterion"> Neumann-Pearson’s criterion</a>, <a href="https://publications.waset.org/abstracts/search?q=Test-statistics" title=" Test-statistics"> Test-statistics</a>, <a href="https://publications.waset.org/abstracts/search?q=degradation" title=" degradation"> degradation</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20processing" title=" spatial processing"> spatial processing</a>, <a href="https://publications.waset.org/abstracts/search?q=multielement%20antenna%20array" title=" multielement antenna array"> multielement antenna array</a> </p> <a href="https://publications.waset.org/abstracts/1985/performance-degradation-for-the-glr-test-statistics-for-spatial-signal-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1985.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">385</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">7185</span> Solving the Transportation Problem for Warehouses and Dealers in Bangalore City</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Aditya">S. Aditya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20T.%20Nideesh"> K. T. Nideesh</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Guruprasad"> N. Guruprasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Being a subclass of linear programing problem, the Transportation Problem is a classic Operations Research problem where the objective is to determine the schedule for transporting goods from source to destination in a way that minimizes the shipping cost while satisfying supply and demand constraints. In this paper, we are representing the transportation problem for various warehouses along with various dealers situated in Bangalore city to reduce the transportation cost incurred by them as of now. The problem is solved by obtaining the Initial Basic feasible Solution through various methods and further proceeding to obtain optimal cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=NW%20method" title="NW method">NW method</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20utilization" title=" optimum utilization"> optimum utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20problem" title=" transportation problem"> transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Vogel%E2%80%99s%20approximation%20method" title=" Vogel’s approximation method"> Vogel’s approximation method</a> </p> <a href="https://publications.waset.org/abstracts/19160/solving-the-transportation-problem-for-warehouses-and-dealers-in-bangalore-city" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19160.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">438</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">7184</span> Using Convergent and Divergent Thinking in Creative Problem Solving in Mathematics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Keng%20Keh%20Lim">Keng Keh Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Zaleha%20Ismail"> Zaleha Ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Yudariah%20Mohammad%20Yusof"> Yudariah Mohammad Yusof</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to find out how students using convergent and divergent thinking in creative problem solving to solve mathematical problems creatively. Eight engineering undergraduates in a local university took part in this study. They were divided into two groups. They solved the mathematical problems with the use of creative problem solving skills. Their solutions were collected and analyzed to reveal all the processes of problem solving, namely: problem definition, ideas generation, ideas evaluation, ideas judgment, and solution implementation. The result showed that the students were able to solve the mathematical problem with the use of creative problem solving skills. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergent%20thinking" title="convergent thinking">convergent thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=divergent%20thinking" title=" divergent thinking"> divergent thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=creative%20problem%20solving" title=" creative problem solving"> creative problem solving</a>, <a href="https://publications.waset.org/abstracts/search?q=creativity" title=" creativity"> creativity</a> </p> <a href="https://publications.waset.org/abstracts/77631/using-convergent-and-divergent-thinking-in-creative-problem-solving-in-mathematics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77631.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">349</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">7183</span> Fuzzy Vehicle Routing Problem for Extreme Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20Sirbiladze">G. Sirbiladze</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Ghvaberidze"> B. Ghvaberidze</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Matsaberidze"> B. Matsaberidze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A fuzzy vehicle routing problem is considered in the possibilistic environment. A new criterion, maximization of expectation of reliability for movement on closed routes is constructed. The objective of the research is to implement a two-stage scheme for solution of this problem. Based on the algorithm of preferences on the first stage, the sample of so-called “promising” routes will be selected. On the second stage, for the selected promising routes new bi-criteria problem will be solved - minimization of total traveled distance and maximization of reliability of routes. The problem will be stated as a fuzzy-partitioning problem. Two possible solutions of this scheme are considered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problem" title="vehicle routing problem">vehicle routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20partitioning%20problem" title=" fuzzy partitioning problem"> fuzzy partitioning problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple-criteria%20optimization" title=" multiple-criteria optimization"> multiple-criteria optimization</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/9460/fuzzy-vehicle-routing-problem-for-extreme-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9460.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">547</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">7182</span> Partial Knowledge Transfer Between the Source Problem and the Target Problem in Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Terence%20Soule">Terence Soule</a>, <a href="https://publications.waset.org/abstracts/search?q=Tami%20Al%20Ghamdi"> Tami Al Ghamdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To study how the partial knowledge transfer may affect the Genetic Algorithm (GA) performance, we model the Transfer Learning (TL) process using GA as the model solver. The objective of the TL is to transfer the knowledge from one problem to another related problem. This process imitates how humans think in their daily life. In this paper, we proposed to study a case where the knowledge transferred from the S problem has less information than what the T problem needs. We sampled the transferred population using different strategies of TL. The results showed transfer part of the knowledge is helpful and speeds the GA process of finding a solution to the problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=transfer%20learning" title="transfer learning">transfer learning</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20transfer" title=" partial transfer"> partial transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20computation" title=" evolutionary computation"> evolutionary computation</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/147924/partial-knowledge-transfer-between-the-source-problem-and-the-target-problem-in-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147924.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">132</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">7181</span> Bee Colony Optimization Applied to the Bin Packing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kenza%20Aida%20Amara">Kenza Aida Amara</a>, <a href="https://publications.waset.org/abstracts/search?q=Bachir%20Djebbar"> Bachir Djebbar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We treat the two-dimensional bin packing problem which involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. This combinatorial problem is NP-hard. We propose a pretreatment for the oriented version of the problem that allows the valorization of the lost areas in the bins and the reduction of the size problem. A heuristic method based on the strategy first-fit adapted to this problem is presented. We present an approach of resolution by bee colony optimization. Computational results express a comparison of the number of bins used with and without pretreatment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bee%20colony%20optimization" title="bee colony optimization">bee colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=bin%20packing" title=" bin packing"> bin packing</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithm" title=" heuristic algorithm"> heuristic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=pretreatment" title=" pretreatment"> pretreatment</a> </p> <a href="https://publications.waset.org/abstracts/65005/bee-colony-optimization-applied-to-the-bin-packing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65005.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">634</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">7180</span> A Method for Solving a Bi-Objective Transportation Problem under Fuzzy Environment </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sukhveer%20Singh">Sukhveer Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Sandeep%20Singh"> Sandeep Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A bi-objective fuzzy transportation problem with the objectives to minimize the total fuzzy cost and fuzzy time of transportation without according priorities to them is considered. To the best of our knowledge, there is no method in the literature to find efficient solutions of the bi-objective transportation problem under uncertainty. In this paper, a bi-objective transportation problem in an uncertain environment has been formulated. An algorithm has been proposed to find efficient solutions of the bi-objective transportation problem under uncertainty. The proposed algorithm avoids the degeneracy and gives the optimal solution faster than other existing algorithms for the given uncertain transportation problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem" title="uncertain transportation problem">uncertain transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=efficient%20solution" title=" efficient solution"> efficient solution</a>, <a href="https://publications.waset.org/abstracts/search?q=ranking%20function" title=" ranking function"> ranking function</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20transportation%20problem" title=" fuzzy transportation problem"> fuzzy transportation problem</a> </p> <a href="https://publications.waset.org/abstracts/73312/a-method-for-solving-a-bi-objective-transportation-problem-under-fuzzy-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73312.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">525</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">7179</span> Cooperative Coevolution for Neuro-Evolution of Feed Forward Networks for Time Series Prediction Using Hidden Neuron Connections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ravneil%20Nand">Ravneil Nand</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cooperative coevolution uses problem decomposition methods to solve a larger problem. The problem decomposition deals with breaking down the larger problem into a number of smaller sub-problems depending on their method. Different problem decomposition methods have their own strengths and limitations depending on the neural network used and application problem. In this paper we are introducing a new problem decomposition method known as Hidden-Neuron Level Decomposition (HNL). The HNL method is competing with established problem decomposition method in time series prediction. The results show that the proposed approach has improved the results in some benchmark data sets when compared to the standalone method and has competitive results when compared to methods from literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooperative%20coevaluation" title="cooperative coevaluation">cooperative coevaluation</a>, <a href="https://publications.waset.org/abstracts/search?q=feed%20forward%20network" title=" feed forward network"> feed forward network</a>, <a href="https://publications.waset.org/abstracts/search?q=problem%20decomposition" title=" problem decomposition"> problem decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=neuron" title=" neuron"> neuron</a>, <a href="https://publications.waset.org/abstracts/search?q=synapse" title=" synapse"> synapse</a> </p> <a href="https://publications.waset.org/abstracts/29237/cooperative-coevolution-for-neuro-evolution-of-feed-forward-networks-for-time-series-prediction-using-hidden-neuron-connections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29237.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">335</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">7178</span> Solution of Nonlinear Fractional Programming Problem with Bounded Parameters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mrinal%20Jana">Mrinal Jana</a>, <a href="https://publications.waset.org/abstracts/search?q=Geetanjali%20Panda"> Geetanjali Panda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a methodology is developed to solve a nonlinear fractional programming problem in which the coefficients of the objective function and constraints are interval parameters. This model is transformed into a general optimization problem and relation between the original problem and the transformed problem is established. Finally the proposed methodology is illustrated through a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractional%20programming" title="fractional programming">fractional programming</a>, <a href="https://publications.waset.org/abstracts/search?q=interval%20valued%20function" title=" interval valued function"> interval valued function</a>, <a href="https://publications.waset.org/abstracts/search?q=interval%20inequalities" title=" interval inequalities"> interval inequalities</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20order%20relation" title=" partial order relation"> partial order relation</a> </p> <a href="https://publications.waset.org/abstracts/22261/solution-of-nonlinear-fractional-programming-problem-with-bounded-parameters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22261.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">7177</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">7176</span> The Dynamics of a 3D Vibrating and Rotating Disc Gyroscope </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Getachew%20T.%20Sedebo">Getachew T. Sedebo</a>, <a href="https://publications.waset.org/abstracts/search?q=Stephan%20V.%20Joubert"> Stephan V. Joubert</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20Y.%20Shatalov"> Michael Y. Shatalov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conventional configuration of the vibratory disc gyroscope is based on in-plane non-axisymmetric vibrations of the disc with a prescribed circumferential wave number. Due to the Bryan's effect, the vibrating pattern of the disc becomes sensitive to the axial component of inertial rotation of the disc. Rotation of the vibrating pattern relative to the disc is proportional to the inertial angular rate and is measured by sensors. In the present paper, the authors investigate a possibility of making a 3D sensor on the basis of both in-plane and bending vibrations of the disc resonator. We derive equations of motion for the disc vibratory gyroscope, where both in-plane and bending vibrations are considered. Hamiltonian variational principle is used in setting up equations of motion and the corresponding boundary conditions. The theory of thin shells with the linear elasticity principles is used in formulating the problem and also the disc is assumed to be isotropic and obeys Hooke's Law. The governing equation for a specific mode is converted to an ODE to determine the eigenfunction. The resulting ODE has exact solution as a linear combination of Bessel and Neumann functions. We demonstrate how to obtain an explicit solution and hence the eigenvalues and corresponding eigenfunctions for annular disc with fixed inner boundary and free outer boundary. Finally, the characteristics equations are obtained and the corresponding eigenvalues are calculated. The eigenvalues are used for the calculation of tuning conditions of the 3D disc vibratory gyroscope. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bryan%E2%80%99s%20effect" title="Bryan’s effect">Bryan’s effect</a>, <a href="https://publications.waset.org/abstracts/search?q=bending%20vibrations" title=" bending vibrations"> bending vibrations</a>, <a href="https://publications.waset.org/abstracts/search?q=disc%20gyroscope" title=" disc gyroscope"> disc gyroscope</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenfunctions" title=" eigenfunctions"> eigenfunctions</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvalues" title=" eigenvalues"> eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=tuning%20conditions" title=" tuning conditions"> tuning conditions</a> </p> <a href="https://publications.waset.org/abstracts/52286/the-dynamics-of-a-3d-vibrating-and-rotating-disc-gyroscope" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52286.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">323</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">7175</span> Explicit Iterative Scheme for Approximating a Common Solution of Generalized Mixed Equilibrium Problem and Fixed Point Problem for a Nonexpansive Semigroup in Hilbert Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Farid">Mohammad Farid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce and study an explicit iterative method based on hybrid extragradient method to approximate a common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converge strongly to the common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solution is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, extension and generalization of the previously known results in this area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20mixed%20equilibrium%20problem" title="generalized mixed equilibrium problem">generalized mixed equilibrium problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed-point%20problem" title=" fixed-point problem"> fixed-point problem</a>, <a href="https://publications.waset.org/abstracts/search?q=nonexpansive%20semigroup" title=" nonexpansive semigroup"> nonexpansive semigroup</a>, <a href="https://publications.waset.org/abstracts/search?q=variational%20inequality%20problem" title=" variational inequality problem"> variational inequality problem</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithms" title=" iterative algorithms"> iterative algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20extragradient%20method" title=" hybrid extragradient method"> hybrid extragradient method</a> </p> <a href="https://publications.waset.org/abstracts/14070/explicit-iterative-scheme-for-approximating-a-common-solution-of-generalized-mixed-equilibrium-problem-and-fixed-point-problem-for-a-nonexpansive-semigroup-in-hilbert-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14070.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">475</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">7174</span> Regret-Regression for Multi-Armed Bandit Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Deyadeen%20Ali%20Alshibani">Deyadeen Ali Alshibani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the literature, the multi-armed bandit problem as a statistical decision model of an agent trying to optimize his decisions while improving his information at the same time. There are several different algorithms models and their applications on this problem. In this paper, we evaluate the Regret-regression through comparing with Q-learning method. A simulation on determination of optimal treatment regime is presented in detail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal" title="optimal">optimal</a>, <a href="https://publications.waset.org/abstracts/search?q=bandit%20problem" title=" bandit problem"> bandit problem</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a> </p> <a href="https://publications.waset.org/abstracts/18593/regret-regression-for-multi-armed-bandit-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18593.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">453</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">7173</span> A Fuzzy Programming Approach for Solving Intuitionistic Fuzzy Linear Fractional Programming Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sujeet%20Kumar%20Singh">Sujeet Kumar Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Shiv%20Prasad%20Yadav"> Shiv Prasad Yadav</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper develops an approach for solving intuitionistic fuzzy linear fractional programming (IFLFP) problem where the cost of the objective function, the resources, and the technological coefficients are triangular intuitionistic fuzzy numbers. Here, the IFLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using fuzzy mathematical programming approach the transformed MOLFP problem is reduced into a single objective linear programming (LP) problem. The proposed procedure is illustrated through a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=triangular%20intuitionistic%20fuzzy%20number" title="triangular intuitionistic fuzzy number">triangular intuitionistic fuzzy number</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming%20problem" title=" linear programming problem"> linear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20objective%20linear%20programming%20problem" title=" multi objective linear programming problem"> multi objective linear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20mathematical%20programming" title=" fuzzy mathematical programming"> fuzzy mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20function" title=" membership function"> membership function</a> </p> <a href="https://publications.waset.org/abstracts/16411/a-fuzzy-programming-approach-for-solving-intuitionistic-fuzzy-linear-fractional-programming-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16411.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">566</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">7172</span> The Algorithm to Solve the Extend General Malfatti’s Problem in a Convex Circular Triangle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ching-Shoei%20Chiang">Ching-Shoei Chiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Malfatti’s Problem solves the problem of fitting 3 circles into a right triangle such that these 3 circles are tangent to each other, and each circle is also tangent to a pair of the triangle’s sides. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles inside the triangle with special tangency properties among circles and triangle sides; we call it extended general Malfatti’s problem. In the extended general Malfatti’s problem, call it Tri(Tn), where Tn is the triangle number, there are closed-form solutions for Tri(T₁) (inscribed circle) problem and Tri(T₂) (3 Malfatti’s circles) problem. These problems become more complex when n is greater than 2. In solving Tri(Tn) problem, n>2, algorithms have been proposed to solve these problems numerically. With a similar idea, this paper proposed an algorithm to find the radii of circles with the same tangency properties. Instead of the boundary of the triangle being a straight line, we use a convex circular arc as the boundary and try to find Tn circles inside this convex circular triangle with the same tangency properties among circles and boundary Carc. We call these problems the Carc(Tn) problems. The CPU time it takes for Carc(T16) problem, which finds 136 circles inside a convex circular triangle with specified tangency properties, is less than one second. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=circle%20packing" title="circle packing">circle packing</a>, <a href="https://publications.waset.org/abstracts/search?q=computer-aided%20geometric%20design" title=" computer-aided geometric design"> computer-aided geometric design</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20constraint%20solver" title=" geometric constraint solver"> geometric constraint solver</a>, <a href="https://publications.waset.org/abstracts/search?q=Malfatti%E2%80%99s%20problem" title=" Malfatti’s problem"> Malfatti’s problem</a> </p> <a href="https://publications.waset.org/abstracts/165851/the-algorithm-to-solve-the-extend-general-malfattis-problem-in-a-convex-circular-triangle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165851.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">110</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">7171</span> Ubiquitous Scaffold Learning Environment Using Problem-based Learning Activities to Enhance Problem-solving Skills and Context Awareness </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Noppadon%20Phumeechanya">Noppadon Phumeechanya</a>, <a href="https://publications.waset.org/abstracts/search?q=Panita%20Wannapiroon"> Panita Wannapiroon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this research is to design the ubiquitous scaffold learning environment using problem-based learning activities that enhance problem-solving skills and context awareness, and to evaluate the suitability of the ubiquitous scaffold learning environment using problem-based learning activities. We divide the research procedures into two phases. The first phase is to design the ubiquitous scaffold learning environment using problem-based learning activities, and the second is to evaluate the ubiquitous scaffold learning environment using problem-based learning activities. The sample group in this study consists of five experts selected using the purposive sampling method. We analyse data by arithmetic mean and standard deviation. The research findings are as follows; the ubiquitous scaffold learning environment using problem-based learning activities consists of three major steps, the first is preparation before learning. This prepares learners to acknowledge details and learn through u-LMS. The second is the learning process, where learning activities happen in the ubiquitous learning environment and learners learn online with scaffold systems for each step of problem solving. The third step is measurement and evaluation. The experts agree that the ubiquitous scaffold learning environment using problem-based learning activities is highly appropriate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ubiquitous%20learning%20environment%20scaffolding" title="ubiquitous learning environment scaffolding">ubiquitous learning environment scaffolding</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20activities" title=" learning activities"> learning activities</a>, <a href="https://publications.waset.org/abstracts/search?q=problem-based%20learning" title=" problem-based learning"> problem-based learning</a>, <a href="https://publications.waset.org/abstracts/search?q=problem-solving%20skills" title=" problem-solving skills"> problem-solving skills</a>, <a href="https://publications.waset.org/abstracts/search?q=context%20awareness" title=" context awareness"> context awareness</a> </p> <a href="https://publications.waset.org/abstracts/30647/ubiquitous-scaffold-learning-environment-using-problem-based-learning-activities-to-enhance-problem-solving-skills-and-context-awareness" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30647.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">498</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">7170</span> On the Optimality Assessment of Nano-Particle Size Spectrometry and Its Association to the Entropy Concept</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Shaygani">A. Shaygani</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Saifi"> R. Saifi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20S.%20Saidi"> M. S. Saidi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sani"> M. Sani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Particle size distribution, the most important characteristics of aerosols, is obtained through electrical characterization techniques. The dynamics of charged nano-particles under the influence of electric field in electrical mobility spectrometer (EMS) reveals the size distribution of these particles. The accuracy of this measurement is influenced by flow conditions, geometry, electric field and particle charging process, therefore by the transfer function (transfer matrix) of the instrument. In this work, a wire-cylinder corona charger was designed and the combined field-diffusion charging process of injected poly-disperse aerosol particles was numerically simulated as a prerequisite for the study of a multi-channel EMS. The result, a cloud of particles with non-uniform charge distribution, was introduced to the EMS. The flow pattern and electric field in the EMS were simulated using computational fluid dynamics (CFD) to obtain particle trajectories in the device and therefore to calculate the reported signal by each electrometer. According to the output signals (resulted from bombardment of particles and transferring their charges as currents), we proposed a modification to the size of detecting rings (which are connected to electrometers) in order to evaluate particle size distributions more accurately. Based on the capability of the system to transfer information contents about size distribution of the injected particles, we proposed a benchmark for the assessment of optimality of the design. This method applies the concept of Von Neumann entropy and borrows the definition of entropy from information theory (Shannon entropy) to measure optimality. Entropy, according to the Shannon entropy, is the ''average amount of information contained in an event, sample or character extracted from a data stream''. Evaluating the responses (signals) which were obtained via various configurations of detecting rings, the best configuration which gave the best predictions about the size distributions of injected particles, was the modified configuration. It was also the one that had the maximum amount of entropy. A reasonable consistency was also observed between the accuracy of the predictions and the entropy content of each configuration. In this method, entropy is extracted from the transfer matrix of the instrument for each configuration. Ultimately, various clouds of particles were introduced to the simulations and predicted size distributions were compared to the exact size distributions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aerosol%20nano-particle" title="aerosol nano-particle">aerosol nano-particle</a>, <a href="https://publications.waset.org/abstracts/search?q=CFD" title=" CFD"> CFD</a>, <a href="https://publications.waset.org/abstracts/search?q=electrical%20mobility%20spectrometer" title=" electrical mobility spectrometer"> electrical mobility spectrometer</a>, <a href="https://publications.waset.org/abstracts/search?q=von%20neumann%20entropy" title=" von neumann entropy"> von neumann entropy</a> </p> <a href="https://publications.waset.org/abstracts/28020/on-the-optimality-assessment-of-nano-particle-size-spectrometry-and-its-association-to-the-entropy-concept" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28020.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">343</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">7169</span> Young Children’s Use of Representations in Problem Solving </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kamariah%20Abu%20Bakar">Kamariah Abu Bakar</a>, <a href="https://publications.waset.org/abstracts/search?q=Jennifer%20Way"> Jennifer Way</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study investigated how young children (six years old) constructed and used representations in mathematics classroom; particularly in problem solving. The purpose of this study is to explore the ways children used representations in solving addition problems and to determine whether their representations can play a supportive role in understanding the problem situation and solving them correctly. Data collection includes observations, children’s artifact, photographs and conversation with children during task completion. The results revealed that children were able to construct and use various representations in solving problems. However, they have certain preferences in generating representations to support their problem solving. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=young%20children" title="young children">young children</a>, <a href="https://publications.waset.org/abstracts/search?q=representations" title=" representations"> representations</a>, <a href="https://publications.waset.org/abstracts/search?q=addition" title=" addition"> addition</a>, <a href="https://publications.waset.org/abstracts/search?q=problem%20solving" title=" problem solving"> problem solving</a> </p> <a href="https://publications.waset.org/abstracts/40756/young-childrens-use-of-representations-in-problem-solving" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40756.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">461</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">7168</span> Two-Stage Approach for Solving the Multi-Objective Optimization Problem on Combinatorial Configurations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Liudmyla%20Koliechkina">Liudmyla Koliechkina</a>, <a href="https://publications.waset.org/abstracts/search?q=Olena%20Dvirna"> Olena Dvirna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The statement of the multi-objective optimization problem on combinatorial configurations is formulated, and the approach to its solution is proposed. The problem is of interest as a combinatorial optimization one with many criteria, which is a model of many applied tasks. The approach to solving the multi-objective optimization problem on combinatorial configurations consists of two stages; the first is the reduction of the multi-objective problem to the single criterion based on existing multi-objective optimization methods, the second stage solves the directly replaced single criterion combinatorial optimization problem by the horizontal combinatorial method. This approach provides the optimal solution to the multi-objective optimization problem on combinatorial configurations, taking into account additional restrictions for a finite number of steps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20set" title="discrete set">discrete set</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20combinatorial%20optimization" title=" linear combinatorial optimization"> linear combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Pareto%20solutions" title=" Pareto solutions"> Pareto solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20permutation%20set" title=" partial permutation set"> partial permutation set</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20graph" title=" structural graph"> structural graph</a> </p> <a href="https://publications.waset.org/abstracts/133824/two-stage-approach-for-solving-the-multi-objective-optimization-problem-on-combinatorial-configurations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133824.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">167</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">7167</span> On Optimum Stratification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20G.%20M.%20Khan">M. G. M. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20D.%20Prasad"> V. D. Prasad</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20K.%20Rao"> D. K. Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=auxiliary%20variable" title="auxiliary variable">auxiliary variable</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique" title=" dynamic programming technique"> dynamic programming technique</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20problem" title=" nonlinear programming problem"> nonlinear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20stratification" title=" optimum stratification"> optimum stratification</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20distribution" title=" uniform distribution"> uniform distribution</a> </p> <a href="https://publications.waset.org/abstracts/6677/on-optimum-stratification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6677.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">333</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">7166</span> Genetic Algorithm for Solving the Flexible Job-Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guilherme%20Baldo%20Carlos">Guilherme Baldo Carlos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The flexible job-shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which can be applied to model several applications in a wide array of industries. This problem will have its importance increase due to the shift in the production mode that modern society is going through. The demands are increasing and for products personalized and customized. This work aims to apply a meta-heuristic called a genetic algorithm (GA) to solve this problem. A GA is a meta-heuristic inspired by the natural selection of Charles Darwin; it produces a population of individuals (solutions) and selects, mutates, and mates the individuals through generations in order to find a good solution for the problem. The results found indicate that the GA is suitable for FJSP solving. <p class="card-text"><strong>Keywords:</strong> <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=evolutionary%20algorithm" title=" evolutionary algorithm"> evolutionary algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible%20job-shop%20scheduling" title=" flexible job-shop scheduling"> flexible job-shop scheduling</a> </p> <a href="https://publications.waset.org/abstracts/132314/genetic-algorithm-for-solving-the-flexible-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132314.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">147</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">7165</span> Number Sense Proficiency and Problem Solving Performance of Grade Seven Students</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Laissa%20Mae%20Francisco">Laissa Mae Francisco</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Rolex%20Ingreso"> John Rolex Ingreso</a>, <a href="https://publications.waset.org/abstracts/search?q=Anna%20Krizel%20Menguito"> Anna Krizel Menguito</a>, <a href="https://publications.waset.org/abstracts/search?q=Criselda%20Robrigado"> Criselda Robrigado</a>, <a href="https://publications.waset.org/abstracts/search?q=Rej%20Maegan%20%20Tuazon"> Rej Maegan Tuazon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study aims to determine and describe the existing relationship between number sense proficiency and problem-solving performance of grade seven students from Victorino Mapa High School, Manila. A paper pencil exam containing of 50-item number sense test and 5-item problem-solving test which measures their number sense proficiency and problem-solving performance adapted from McIntosh, Reys, and Bana were used as the research instruments. The data obtained from this study were interpreted and analyzed using the Pearson – Product Moment Coefficient of Correlation to determine the relationship between the two variables. It was found out that students who were low in number sense proficiency tend to be the students with poor problem-solving performance and students with medium number sense proficiency are most likely to have an average problem-solving performance. Likewise, students with high number sense proficiency are those who do excellently in problem-solving performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=number%20sense" title="number sense">number sense</a>, <a href="https://publications.waset.org/abstracts/search?q=performance" title=" performance"> performance</a>, <a href="https://publications.waset.org/abstracts/search?q=problem%20solving" title=" problem solving"> problem solving</a>, <a href="https://publications.waset.org/abstracts/search?q=proficiency" title=" proficiency"> proficiency</a> </p> <a href="https://publications.waset.org/abstracts/59954/number-sense-proficiency-and-problem-solving-performance-of-grade-seven-students" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59954.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">438</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">7164</span> Incorporating Polya’s Problem Solving Process: A Polytechnic Mathematics Module Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pei%20Chin%20Lim">Pei Chin Lim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> School of Mathematics and Science of Singapore Polytechnic offers a Basic Mathematics module to students who did not pass GCE O-Level Additional Mathematics. These students are weaker in Mathematics. In particular, they struggle with word problems and tend to leave them blank in tests and examinations. In order to improve students’ problem-solving skills, the school redesigned the Basic Mathematics module to incorporate Polya’s problem-solving methodology. During tutorial lessons, students have to work through learning activities designed to raise their metacognitive awareness by following Polya’s problem-solving process. To assess the effectiveness of the redesign, students’ working for a challenging word problem in the mid-semester test were analyzed. Sixty-five percent of students attempted to understand the problem by making sketches. Twenty-eight percent of students went on to devise a plan and implement it. Only five percent of the students still left the question blank. These preliminary results suggest that with regular exposure to an explicit and systematic problem-solving approach, weak students’ problem-solving skills can potentially be improved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mathematics%20education" title="mathematics education">mathematics education</a>, <a href="https://publications.waset.org/abstracts/search?q=metacognition" title=" metacognition"> metacognition</a>, <a href="https://publications.waset.org/abstracts/search?q=problem%20solving" title=" problem solving"> problem solving</a>, <a href="https://publications.waset.org/abstracts/search?q=weak%20students" title=" weak students"> weak students</a> </p> <a href="https://publications.waset.org/abstracts/98195/incorporating-polyas-problem-solving-process-a-polytechnic-mathematics-module-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98195.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">162</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">7163</span> An Optimization Model for Maximum Clique Problem Based on Semidefinite Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Derkaoui%20Orkia">Derkaoui Orkia</a>, <a href="https://publications.waset.org/abstracts/search?q=Lehireche%20Ahmed"> Lehireche Ahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The topic of this article is to exploring the potentialities of a powerful optimization technique, namely Semidefinite Programming, for solving NP-hard problems. This approach provides tight relaxations of combinatorial and quadratic problems. In this work, we solve the maximum clique problem using this relaxation. The clique problem is the computational problem of finding cliques in a graph. It is widely acknowledged for its many applications in real-world problems. The numerical results show that it is possible to find a maximum clique in polynomial time, using an algorithm based on semidefinite programming. We implement a primal-dual interior points algorithm to solve this problem based on semidefinite programming. The semidefinite relaxation of this problem can be solved in polynomial time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20programming" title="semidefinite programming">semidefinite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem" title=" maximum clique problem"> maximum clique problem</a>, <a href="https://publications.waset.org/abstracts/search?q=primal-dual%20interior%20point%20method" title=" primal-dual interior point method"> primal-dual interior point method</a>, <a href="https://publications.waset.org/abstracts/search?q=relaxation" title=" relaxation"> relaxation</a> </p> <a href="https://publications.waset.org/abstracts/73224/an-optimization-model-for-maximum-clique-problem-based-on-semidefinite-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73224.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">222</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=Neumann%20problem&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&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=Neumann%20problem&page=239">239</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&page=240">240</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Neumann%20problem&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>