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: minimization</title> <meta name="description" content="Search results for: minimization"> <meta name="keywords" content="minimization"> <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="minimization" 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="minimization"> <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> 291</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: minimization</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">291</span> Discrete Swarm with Passive Congregation for Cost Minimization of the Multiple Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tarek%20Aboueldahab">Tarek Aboueldahab</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20Farag"> Hanan Farag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cost minimization of Multiple Vehicle Routing Problem becomes a critical issue in the field of transportation because it is NP-hard optimization problem and the search space is complex. Many researches use the hybridization of artificial intelligence (AI) models to solve this problem; however, it can not guarantee to reach the best solution due to the difficulty of searching the whole search space. To overcome this problem, we introduce the hybrid model of Discrete Particle Swarm Optimization (DPSO) with a passive congregation which enable searching the whole search space to compromise between both local and global search. The practical experiment shows that our model obviously outperforms other hybrid models in cost minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title="cost minimization">cost minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-vehicle%20routing%20problem" title=" multi-vehicle routing problem"> multi-vehicle routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20congregation" title=" passive congregation"> passive congregation</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20swarm" title=" discrete swarm"> discrete swarm</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20congregation" title=" passive congregation"> passive congregation</a> </p> <a href="https://publications.waset.org/abstracts/157025/discrete-swarm-with-passive-congregation-for-cost-minimization-of-the-multiple-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157025.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">98</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">290</span> Minimization Entropic Applied to Rotary Dryers to Reduce the Energy Consumption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=I.%20O.%20Nascimento">I. O. Nascimento</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20T.%20Manzi"> J. T. Manzi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The drying process is an important operation in the chemical industry and it is widely used in the food, grain industry and fertilizer industry. However, for demanding a considerable consumption of energy, such a process requires a deep energetic analysis in order to reduce operating costs. This paper deals with thermodynamic optimization applied to rotary dryers based on the entropy production minimization, aiming at to reduce the energy consumption. To do this, the mass, energy and entropy balance was used for developing a relationship that represents the rate of entropy production. The use of the Second Law of Thermodynamics is essential because it takes into account constraints of nature. Since the entropy production rate is minimized, optimals conditions of operations can be established and the process can obtain a substantial gain in energy saving. The minimization strategy had been led using classical methods such as Lagrange multipliers and implemented in the MATLAB platform. As expected, the preliminary results reveal a significant energy saving by the application of the optimal parameters found by the procedure of the entropy minimization It is important to say that this method has shown easy implementation and low cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=thermodynamic%20optimization" title="thermodynamic optimization">thermodynamic optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=drying" title=" drying"> drying</a>, <a href="https://publications.waset.org/abstracts/search?q=entropy%20minimization" title=" entropy minimization"> entropy minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=modeling%20dryers" title=" modeling dryers"> modeling dryers</a> </p> <a href="https://publications.waset.org/abstracts/45815/minimization-entropic-applied-to-rotary-dryers-to-reduce-the-energy-consumption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45815.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">258</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">289</span> Discrete Breeding Swarm for Cost Minimization of Parallel 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=Tarek%20Aboueldahab">Tarek Aboueldahab</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20Farag"> Hanan Farag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Parallel Job Shop Scheduling Problem (JSP) is a multi-objective and multi constrains NP- optimization problem. Traditional Artificial Intelligence techniques have been widely used; however, they could be trapped into the local minimum without reaching the optimum solution, so we propose a hybrid Artificial Intelligence model (AI) with Discrete Breeding Swarm (DBS) added to traditional Artificial Intelligence to avoid this trapping. This model is applied in the cost minimization of the Car Sequencing and Operator Allocation (CSOA) problem. The practical experiment shows that our model outperforms other techniques in cost minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20job%20shop%20scheduling%20problem" title="parallel job shop scheduling problem">parallel job shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20breeding%20swarm" title=" discrete breeding swarm"> discrete breeding swarm</a>, <a href="https://publications.waset.org/abstracts/search?q=car%20sequencing%20and%20operator%20allocation" title=" car sequencing and operator allocation"> car sequencing and operator allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title=" cost minimization"> cost minimization</a> </p> <a href="https://publications.waset.org/abstracts/132701/discrete-breeding-swarm-for-cost-minimization-of-parallel-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132701.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">187</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">288</span> Synthesis of Balanced 3-RRR Planar Parallel Manipulators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arakelian%20Vigen">Arakelian Vigen</a>, <a href="https://publications.waset.org/abstracts/search?q=Geng%20Jing"> Geng Jing</a>, <a href="https://publications.waset.org/abstracts/search?q=Le%20Baron%20Jean-Paul"> Le Baron Jean-Paul</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper deals with the design of parallel manipulators with balanced inertia forces and moments. The balancing of the resultant of the inertia forces of 3-RRR planar parallel manipulators is carried out through mass redistribution and centre of mass acceleration minimization. The proposed balancing technique is achieved in two steps: at first, optimal redistribution of the masses of input links is accomplished, which ensures the similarity of the end-effector trajectory and the manipulator’s common centre of mass trajectory, then, optimal trajectory planning of the end-effector by 'bang-bang' profile is reached. In such a way, the minimization of the magnitude of the acceleration of the centre of mass of the manipulator brings about a minimization of shaking force. To minimize the resultant of the inertia moments (shaking moment), the active balancing via inertia flywheel is applied. However, in this case, the active balancing is quite different from previous applications because it provides only a partial cancellation of the shaking moment due to the incomplete balancing of shaking force. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20balancing" title="dynamic balancing">dynamic balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=inertia%20force%20minimization" title=" inertia force minimization"> inertia force minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=inertia%20moment%20minimization" title=" inertia moment minimization"> inertia moment minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=3-RRR%20planar%20parallel%20manipulator" title=" 3-RRR planar parallel manipulator"> 3-RRR planar parallel manipulator</a> </p> <a href="https://publications.waset.org/abstracts/70145/synthesis-of-balanced-3-rrr-planar-parallel-manipulators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70145.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">287</span> Evaluation of Minimization of Moment Ratio Method by Physical Modeling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amin%20Eslami">Amin Eslami</a>, <a href="https://publications.waset.org/abstracts/search?q=Jafar%20Bolouri%20Bazaz"> Jafar Bolouri Bazaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Under active stress conditions, a rigid cantilever retaining wall tends to rotate about a pivot point located within the embedded depth of the wall. For purely granular and cohesive soils, a methodology was previously reported called minimization of moment ratio to determine the location of the pivot point of rotation. The usage of this new methodology is to estimate the rotational stability safety factor. Moreover, the degree of improvement required in a backfill to get a desired safety factor can be estimated by the concept of the shear strength demand. In this article, the accuracy of this method for another type of cantilever walls called Contiguous Bored Pile (CBP) retaining wall is evaluated by using physical modeling technique. Based on observations, the results of moment ratio minimization method are in good agreement with the results of the carried out physical modeling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cantilever%20retaining%20wall" title="cantilever retaining wall">cantilever retaining wall</a>, <a href="https://publications.waset.org/abstracts/search?q=physical%20modeling" title=" physical modeling"> physical modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=minimization%20of%20moment%20ratio%20method" title=" minimization of moment ratio method"> minimization of moment ratio method</a>, <a href="https://publications.waset.org/abstracts/search?q=pivot%20point" title=" pivot point "> pivot point </a> </p> <a href="https://publications.waset.org/abstracts/26383/evaluation-of-minimization-of-moment-ratio-method-by-physical-modeling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26383.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">331</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">286</span> Using of Particle Swarm Optimization for Loss Minimization of Vector-Controlled Induction Motors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20Rashtchi">V. Rashtchi</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Bizhani"> H. Bizhani</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20R.%20Tatari"> F. R. Tatari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a new online loss minimization for an induction motor drive. Among the many loss minimization algorithms (LMAs) for an induction motor, a particle swarm optimization (PSO) has the advantages of fast response and high accuracy. However, the performance of the PSO and other optimization algorithms depend on the accuracy of the modeling of the motor drive and losses. In the development of the loss model, there is always a trade off between accuracy and complexity. This paper presents a new online optimization to determine an optimum flux level for the efficiency optimization of the vector-controlled induction motor drive. An induction motor (IM) model in d-q coordinates is referenced to the rotor magnetizing current. This transformation results in no leakage inductance on the rotor side, thus the decomposition into d-q components in the steady-state motor model can be utilized in deriving the motor loss model. The suggested algorithm is simple for implementation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=induction%20machine" title="induction machine">induction machine</a>, <a href="https://publications.waset.org/abstracts/search?q=loss%20minimization" title=" loss minimization"> loss minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetizing%20current" title=" magnetizing current"> magnetizing current</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/15437/using-of-particle-swarm-optimization-for-loss-minimization-of-vector-controlled-induction-motors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15437.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">632</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">285</span> An Improved Approach to Solve Two-Level Hierarchical Time Minimization Transportation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kalpana%20Dahiya">Kalpana Dahiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses a two-level hierarchical time minimization transportation problem, which is an important class of transportation problems arising in industries. This problem has been studied by various researchers, and a number of polynomial time iterative algorithms are available to find its solution. All the existing algorithms, though efficient, have some shortcomings. The current study proposes an alternate solution algorithm for the problem that is more efficient in terms of computational time than the existing algorithms. The results justifying the underlying theory of the proposed algorithm are given. Further, a detailed comparison of the computational behaviour of all the algorithms for randomly generated instances of this problem of different sizes validates the efficiency of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20optimization" title="global optimization">global optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20optimization" title=" hierarchical optimization"> hierarchical optimization</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=concave%20minimization" title=" concave minimization"> concave minimization</a> </p> <a href="https://publications.waset.org/abstracts/122713/an-improved-approach-to-solve-two-level-hierarchical-time-minimization-transportation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122713.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">284</span> Online Robust Model Predictive Control for Linear Fractional Transformation Systems Using Linear Matrix Inequalities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Peyman%20Sindareh%20Esfahani">Peyman Sindareh Esfahani</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeffery%20Kurt%20Pieper"> Jeffery Kurt Pieper</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the problem of robust model predictive control (MPC) for discrete-time linear systems in linear fractional transformation form with structured uncertainty and norm-bounded disturbance is investigated. The problem of minimization of the cost function for MPC design is converted to minimization of the worst case of the cost function. Then, this problem is reduced to minimization of an upper bound of the cost function subject to a terminal inequality satisfying the <em>l</em><sub>2</sub>-norm of the closed loop system. The characteristic of the linear fractional transformation system is taken into account, and by using some mathematical tools, the robust predictive controller design problem is turned into a linear matrix inequality minimization problem. Afterwards, a formulation which includes an integrator to improve the performance of the proposed robust model predictive controller in steady state condition is studied. The validity of the approaches is illustrated through a robust control benchmark problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linear%20fractional%20transformation" title="linear fractional transformation">linear fractional transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20matrix%20inequality" title=" linear matrix inequality"> linear matrix inequality</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20model%20predictive%20control" title=" robust model predictive control"> robust model predictive control</a>, <a href="https://publications.waset.org/abstracts/search?q=state%20feedback%20control" title=" state feedback control"> state feedback control</a> </p> <a href="https://publications.waset.org/abstracts/69466/online-robust-model-predictive-control-for-linear-fractional-transformation-systems-using-linear-matrix-inequalities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69466.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">395</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">283</span> Proximal Method of Solving Split System of Minimization Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anteneh%20Getachew%20Gebrie">Anteneh Getachew Gebrie</a>, <a href="https://publications.waset.org/abstracts/search?q=Rabian%20Wangkeeree"> Rabian Wangkeeree</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper is to introduce iterative algorithm solving split system of minimization problem given as a task of ﬁnding a common minimizer point of ﬁnite family of proper, lower semicontinuous convex functions and whose image under a bounded linear operator is also common minimizer point of another ﬁnite family of proper, lower semicontinuous convex functions. We obtain strong convergence of the sequence generated by our algorithm under some suitable conditions on the parameters. The iterative schemes are developed with a way of selecting the step sizes such that the information of operator norm is not necessary. Some applications and numerical experiment is given to analyse the eﬃciency of our algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hilbert%20Space" title="Hilbert Space">Hilbert Space</a>, <a href="https://publications.waset.org/abstracts/search?q=minimization%20problems" title=" minimization problems"> minimization problems</a>, <a href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate" title=" Moreau-Yosida approximate"> Moreau-Yosida approximate</a>, <a href="https://publications.waset.org/abstracts/search?q=split%20feasibility%20problem" title=" split feasibility problem"> split feasibility problem</a> </p> <a href="https://publications.waset.org/abstracts/119147/proximal-method-of-solving-split-system-of-minimization-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/119147.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">144</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">282</span> A Priority Based Imbalanced Time Minimization Assignment Problem: An Iterative Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ekta%20Jain">Ekta Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalpana%20Dahiya"> Kalpana Dahiya</a>, <a href="https://publications.waset.org/abstracts/search?q=Vanita%20Verma"> Vanita Verma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses a priority based imbalanced time minimization assignment problem dealing with the allocation of n jobs to m < n persons in which the project is carried out in two stages, viz. Stage-I and Stage-II. Stage-I consists of n1 ( < m) primary jobs and Stage-II consists of remaining (n-n1) secondary jobs which are commenced only after primary jobs are finished. Each job is to be allocated to exactly one person, and each person has to do at least one job. It is assumed that nature of the Stage-I jobs is such that one person can do exactly one primary job whereas a person can do more than one secondary job in Stage-II. In a particular stage, all persons start doing the jobs simultaneously, but if a person is doing more than one job, he does them one after the other in any order. The aim of the proposed study is to find the feasible assignment which minimizes the total time for the two stage execution of the project. For this, an iterative algorithm is proposed, which at each iteration, solves a constrained imbalanced time minimization assignment problem to generate a pair of Stage-I and Stage-II times. For solving this constrained problem, an algorithm is developed in the current paper. Later, alternate combinations based method to solve the priority based imbalanced problem is also discussed and a comparative study is carried out. Numerical illustrations are provided in support of the theory. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assignment" title="assignment">assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=imbalanced" title=" imbalanced"> imbalanced</a>, <a href="https://publications.waset.org/abstracts/search?q=priority" title=" priority"> priority</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20minimization" title=" time minimization"> time minimization</a> </p> <a href="https://publications.waset.org/abstracts/75198/a-priority-based-imbalanced-time-minimization-assignment-problem-an-iterative-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75198.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">234</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">281</span> MapReduce Logistic Regression Algorithms with RHadoop</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Byung%20Ho%20Jung">Byung Ho Jung</a>, <a href="https://publications.waset.org/abstracts/search?q=Dong%20Hoon%20Lim"> Dong Hoon Lim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Logistic regression is a statistical method for analyzing a dataset in which there are one or more independent variables that determine an outcome. Logistic regression is used extensively in numerous disciplines, including the medical and social science fields. In this paper, we address the problem of estimating parameters in the logistic regression based on MapReduce framework with RHadoop that integrates R and Hadoop environment applicable to large scale data. There exist three learning algorithms for logistic regression, namely Gradient descent method, Cost minimization method and Newton-Rhapson's method. The Newton-Rhapson's method does not require a learning rate, while gradient descent and cost minimization methods need to manually pick a learning rate. The experimental results demonstrated that our learning algorithms using RHadoop can scale well and efficiently process large data sets on commodity hardware. We also compared the performance of our Newton-Rhapson's method with gradient descent and cost minimization methods. The results showed that our newton's method appeared to be the most robust to all data tested. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <a href="https://publications.waset.org/abstracts/search?q=logistic%20regression" title=" logistic regression"> logistic regression</a>, <a href="https://publications.waset.org/abstracts/search?q=MapReduce" title=" MapReduce"> MapReduce</a>, <a href="https://publications.waset.org/abstracts/search?q=RHadoop" title=" RHadoop"> RHadoop</a> </p> <a href="https://publications.waset.org/abstracts/41569/mapreduce-logistic-regression-algorithms-with-rhadoop" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41569.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">284</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">280</span> Steepest Descent Method with New Step Sizes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bib%20Paruhum%20Silalahi">Bib Paruhum Silalahi</a>, <a href="https://publications.waset.org/abstracts/search?q=Djihad%20Wungguli"> Djihad Wungguli</a>, <a href="https://publications.waset.org/abstracts/search?q=Sugi%20Guritman"> Sugi Guritman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Steepest descent method is a simple gradient method for optimization. This method has a slow convergence in heading to the optimal solution, which occurs because of the zigzag form of the steps. Barzilai and Borwein modified this algorithm so that it performs well for problems with large dimensions. Barzilai and Borwein method results have sparked a lot of research on the method of steepest descent, including alternate minimization gradient method and Yuan method. Inspired by previous works, we modified the step size of the steepest descent method. We then compare the modification results against the Barzilai and Borwein method, alternate minimization gradient method and Yuan method for quadratic function cases in terms of the iterations number and the running time. The average results indicate that the steepest descent method with the new step sizes provide good results for small dimensions and able to compete with the results of Barzilai and Borwein method and the alternate minimization gradient method for large dimensions. The new step sizes have faster convergence compared to the other methods, especially for cases with large dimensions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=steepest%20descent" title="steepest descent">steepest descent</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20search" title=" line search"> line search</a>, <a href="https://publications.waset.org/abstracts/search?q=iteration" title=" iteration"> iteration</a>, <a href="https://publications.waset.org/abstracts/search?q=running%20time" title=" running time"> running time</a>, <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title=" unconstrained optimization"> unconstrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a> </p> <a href="https://publications.waset.org/abstracts/29734/steepest-descent-method-with-new-step-sizes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29734.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">540</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">279</span> Cubical Representation of Prime and Essential Prime Implicants of Boolean Functions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saurabh%20Rawat">Saurabh Rawat</a>, <a href="https://publications.waset.org/abstracts/search?q=Anushree%20Sah"> Anushree Sah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> K Maps are generally and ideally, thought to be simplest form for obtaining solution of Boolean equations. Cubical Representation of Boolean equations is an alternate pick to incur a solution, otherwise to be meted out with Truth Tables, Boolean Laws, and different traits of Karnaugh Maps. Largest possible k- cubes that exist for a given function are equivalent to its prime implicants. A technique of minimization of Logic functions is tried to be achieved through cubical methods. The main purpose is to make aware and utilise the advantages of cubical techniques in minimization of Logic functions. All this is done with an aim to achieve minimal cost solution.r <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=K-maps" title="K-maps">K-maps</a>, <a href="https://publications.waset.org/abstracts/search?q=don%E2%80%99t%20care%20conditions" title=" don’t care conditions"> don’t care conditions</a>, <a href="https://publications.waset.org/abstracts/search?q=Boolean%20equations" title=" Boolean equations"> Boolean equations</a>, <a href="https://publications.waset.org/abstracts/search?q=cubes" title=" cubes"> cubes</a> </p> <a href="https://publications.waset.org/abstracts/6866/cubical-representation-of-prime-and-essential-prime-implicants-of-boolean-functions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6866.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">278</span> A Model for Solid Transportation Problem with Three Hierarchical Objectives under Uncertain Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wajahat%20Ali">Wajahat Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Shakeel%20Javaid"> Shakeel Javaid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we have developed a mathematical programming model for a solid transportation problem with three objective functions arranged in hierarchical order. The mathematical programming models with more than one objective function to be solved in hierarchical order is termed as a multi-level programming model. Our study explores a Multi-Level Solid Transportation Problem with Uncertain Parameters (MLSTPWU). The proposed MLSTPWU model consists of three objective functions, viz. minimization of transportation cost, minimization of total transportation time, and minimization of deterioration during transportation. These three objective functions are supposed to be solved by decision-makers at three consecutive levels. Three constraint functions are added to the model, restricting the total availability, total demand, and capacity of modes of transportation. All the parameters involved in the model are assumed to be uncertain in nature. A solution method based on fuzzy logic is also discussed to obtain the compromise solution for the proposed model. Further, a simulated numerical example is discussed to establish the efficiency and applicability of the proposed model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=solid%20transportation%20problem" title="solid transportation problem">solid transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-level%20programming" title=" multi-level programming"> multi-level programming</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20variable" title=" uncertain variable"> uncertain variable</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20environment" title=" uncertain environment"> uncertain environment</a> </p> <a href="https://publications.waset.org/abstracts/162056/a-model-for-solid-transportation-problem-with-three-hierarchical-objectives-under-uncertain-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162056.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">83</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">277</span> Computer Modeling and Plant-Wide Dynamic Simulation for Industrial Flare Minimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sujing%20Wang">Sujing Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Song%20Wang"> Song Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jian%20Zhang"> Jian Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Qiang%20Xu"> Qiang Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Flaring emissions during abnormal operating conditions such as plant start-ups, shut-downs, and upsets in chemical process industries (CPI) are usually significant. Flare minimization can help to save raw material and energy for CPI plants, and to improve local environmental sustainability. In this paper, a systematic methodology based on plant-wide dynamic simulation is presented for CPI plant flare minimizations under abnormal operating conditions. Since off-specification emission sources are inevitable during abnormal operating conditions, to significantly reduce flaring emission in a CPI plant, they must be either recycled to the upstream process for online reuse, or stored somewhere temporarily for future reprocessing, when the CPI plant manufacturing returns to stable operation. Thus, the off-spec products could be reused instead of being flared. This can be achieved through the identification of viable design and operational strategies during normal and abnormal operations through plant-wide dynamic scheduling, simulation, and optimization. The proposed study includes three stages of simulation works: (i) developing and validating a steady-state model of a CPI plant; (ii) transiting the obtained steady-state plant model to the dynamic modeling environment; and refining and validating the plant dynamic model; and (iii) developing flare minimization strategies for abnormal operating conditions of a CPI plant via a validated plant-wide dynamic model. This cost-effective methodology has two main merits: (i) employing large-scale dynamic modeling and simulations for industrial flare minimization, which involves various unit models for modeling hundreds of CPI plant facilities; (ii) dealing with critical abnormal operating conditions of CPI plants such as plant start-up and shut-down. Two virtual case studies on flare minimizations for start-up operation (over 50% of emission savings) and shut-down operation (over 70% of emission savings) of an ethylene plant have been employed to demonstrate the efficacy of the proposed study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flare%20minimization" title="flare minimization">flare minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=large-scale%20modeling%20and%20simulation" title=" large-scale modeling and simulation"> large-scale modeling and simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=plant%20shut-down" title=" plant shut-down"> plant shut-down</a>, <a href="https://publications.waset.org/abstracts/search?q=plant%20start-up" title=" plant start-up"> plant start-up</a> </p> <a href="https://publications.waset.org/abstracts/49832/computer-modeling-and-plant-wide-dynamic-simulation-for-industrial-flare-minimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49832.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">320</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">276</span> In-Situ Sludge Minimization Using Integrated Moving Bed Biofilm Reactor for Industrial Wastewater Treatment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vijay%20Sodhi">Vijay Sodhi</a>, <a href="https://publications.waset.org/abstracts/search?q=Charanjit%20Singh"> Charanjit Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Neelam%20Sodhi"> Neelam Sodhi</a>, <a href="https://publications.waset.org/abstracts/search?q=Puneet%20P.%20S.%20Cheema"> Puneet P. S. Cheema</a>, <a href="https://publications.waset.org/abstracts/search?q=Reena%20Sharma"> Reena Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Mithilesh%20K.%20Jha"> Mithilesh K. Jha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The management and secure disposal of the biosludge generated from widely commercialized conventional activated sludge (CAS) treatments become a potential environmental issue. Thus, a sustainable technological upgradation to the CAS for sludge yield minimization has recently been gained serious attention of the scientific community. A number of recently reported studies effectively addressed the remedial technological advancements that in monopoly limited to the municipal wastewater. Moreover, the critical review of the literature signifies side-stream sludge minimization as a complex task to maintain. In this work, therefore, a hybrid moving bed biofilm reactor (MBBR) configuration (named as AMOMOX process) for in-situ minimization of the excess biosludge generated from high organic strength tannery wastewater has been demonstrated. The AMOMOX collectively stands for anoxic MBBR (as AM), aerobic MBBR (OM) and an oxic CAS (OX). The AMOMOX configuration involved a combined arrangement of an anoxic MBBR and oxic MBBR coupled with the aerobic CAS. The AMOMOX system was run in parallel with an identical CAS reactor. Both system configurations were fed with same influent to judge the real-time operational changes. For the AMOMOX process, the strict maintenance of operational strategies resulted about 95% removal of NH4-N and SCOD from tannery wastewater. Here, the nourishment of filamentous microbiota and purposeful promotion of cell-lysis effectively sustained sludge yield (Yobs) lowering upto 0.51 kgVSS/kgCOD. As a result, the volatile sludge scarcity apparent in the AMOMOX system succeeded upto 47% reduction of the excess biosludge. The corroborated was further supported by FE-SEM imaging and thermogravimetric analysis. However, the detection of microbial strains habitat underlying extended SRT (23-26 days) of the AMOMOX system would be the matter of further research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=tannery%20wastewater" title="tannery wastewater">tannery wastewater</a>, <a href="https://publications.waset.org/abstracts/search?q=moving%20bed%20biofilm%20reactor" title=" moving bed biofilm reactor"> moving bed biofilm reactor</a>, <a href="https://publications.waset.org/abstracts/search?q=sludhe%20yield" title=" sludhe yield"> sludhe yield</a>, <a href="https://publications.waset.org/abstracts/search?q=sludge%20minimization" title=" sludge minimization"> sludge minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=solids%20retention%20time" title=" solids retention time"> solids retention time</a> </p> <a href="https://publications.waset.org/abstracts/167992/in-situ-sludge-minimization-using-integrated-moving-bed-biofilm-reactor-for-industrial-wastewater-treatment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167992.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">71</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">275</span> Analysis of Collision Avoidance System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Gayathri%20Devi">N. Gayathri Devi</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Batri"> K. Batri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The advent of technology has increased the traffic hazards and the road accidents take place. Collision detection system in automobile aims at reducing or mitigating the severity of an accident. This project aims at avoiding Vehicle head on collision by means of collision detection algorithm. This collision detection algorithm predicts the collision and the avoidance or minimization have to be done within few seconds on confirmation. Under critical situation collision minimization is made possible by turning the vehicle to the desired turn radius so that collision impact can be reduced. In order to avoid the collision completely, the turning of the vehicle should be achieved at reduced speed in order to maintain the stability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=collision%20avoidance%20system" title="collision avoidance system">collision avoidance system</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20to%20collision" title=" time to collision"> time to collision</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20to%20turn" title=" time to turn"> time to turn</a>, <a href="https://publications.waset.org/abstracts/search?q=turn%20radius" title=" turn radius"> turn radius</a> </p> <a href="https://publications.waset.org/abstracts/30106/analysis-of-collision-avoidance-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30106.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">548</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">274</span> A Family of Distributions on Learnable Problems without Uniform Convergence</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C%C3%A9sar%20Garza">César Garza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In supervised binary classification and regression problems, it is well-known that learnability is equivalent to a uniform convergence of the hypothesis class, and if a problem is learnable, it is learnable by empirical risk minimization. For the general learning setting of unsupervised learning tasks, there are non-trivial learning problems where uniform convergence does not hold. We present here the task of learning centers of mass with an extra feature that “activates” some of the coordinates over the unit ball in a Hilbert space. We show that the learning problem is learnable under a stable RLM rule. We introduce a family of distributions over the domain space with some mild restrictions for which the sample complexity of uniform convergence for these problems must grow logarithmically with the dimension of the Hilbert space. If we take this dimension to infinity, we obtain a learnable problem for which the uniform convergence property fails for a vast family of distributions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=statistical%20learning%20theory" title="statistical learning theory">statistical learning theory</a>, <a href="https://publications.waset.org/abstracts/search?q=learnability" title=" learnability"> learnability</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20convergence" title=" uniform convergence"> uniform convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a>, <a href="https://publications.waset.org/abstracts/search?q=regularized%20loss%20minimization" title=" regularized loss minimization"> regularized loss minimization</a> </p> <a href="https://publications.waset.org/abstracts/151038/a-family-of-distributions-on-learnable-problems-without-uniform-convergence" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151038.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">129</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">273</span> Internet of Things: Route Search Optimization Applying Ant Colony Algorithm and Theory of Computer Science</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tushar%20Bhardwaj">Tushar Bhardwaj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Internet of Things (IoT) possesses a dynamic network where the network nodes (mobile devices) are added and removed constantly and randomly, hence the traffic distribution in the network is quite variable and irregular. The basic but very important part in any network is route searching. We have many conventional route searching algorithms like link-state, and distance vector algorithms but they are restricted to the static point to point network topology. In this paper we propose a model that uses the Ant Colony Algorithm for route searching. It is dynamic in nature and has positive feedback mechanism that conforms to the route searching. We have also embedded the concept of Non-Deterministic Finite Automata [NDFA] minimization to reduce the network to increase the performance. Results show that Ant Colony Algorithm gives the shortest path from the source to destination node and NDFA minimization reduces the broadcasting storm effectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=routing" title="routing">routing</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20algorithm" title=" ant colony algorithm"> ant colony algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=NDFA" title=" NDFA"> NDFA</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a> </p> <a href="https://publications.waset.org/abstracts/1965/internet-of-things-route-search-optimization-applying-ant-colony-algorithm-and-theory-of-computer-science" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1965.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">444</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">272</span> OMTHD Strategy in Asymmetrical Seven-Level Inverter for High Power Induction Motor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Taleb">Rachid Taleb</a>, <a href="https://publications.waset.org/abstracts/search?q=M%E2%80%99hamed%20Helaimi"> M’hamed Helaimi</a>, <a href="https://publications.waset.org/abstracts/search?q=Djilali%20Benyoucef"> Djilali Benyoucef</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Derrouazin"> Ahmed Derrouazin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multilevel inverters are well used in high power electronic applications because of their ability to generate a very good quality of waveforms, reducing switching frequency, and their low voltage stress across the power devices. This paper presents the Optimal Minimization of the Total Harmonic Distortion (OMTHD) strategy of a uniform step asymmetrical seven-level inverter (USA7LI). The OMTHD approach is compared to the well-known sinusoidal pulse-width modulation (SPWM) strategy. Simulation results demonstrate the better performances and technical advantages of the OMTHD controller in feeding a High Power Induction Motor (HPIM). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uniform%20step%20asymmetrical%20seven-level%20inverter%20%28USA7LI%29" title="uniform step asymmetrical seven-level inverter (USA7LI)">uniform step asymmetrical seven-level inverter (USA7LI)</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20minimization%20of%20the%20THD%20%28OMTHD%29" title=" optimal minimization of the THD (OMTHD)"> optimal minimization of the THD (OMTHD)</a>, <a href="https://publications.waset.org/abstracts/search?q=sinusoidal%20PWM%20%28SPWM%29" title=" sinusoidal PWM (SPWM)"> sinusoidal PWM (SPWM)</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20power%20induction%20motor%20%28HPIM%29" title=" high power induction motor (HPIM)"> high power induction motor (HPIM)</a> </p> <a href="https://publications.waset.org/abstracts/27589/omthd-strategy-in-asymmetrical-seven-level-inverter-for-high-power-induction-motor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27589.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">589</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">271</span> An Improved Total Variation Regularization Method for Denoising Magnetocardiography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yanping%20Liao">Yanping Liao</a>, <a href="https://publications.waset.org/abstracts/search?q=Congcong%20He"> Congcong He</a>, <a href="https://publications.waset.org/abstracts/search?q=Ruigang%20Zhao"> Ruigang Zhao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The application of magnetocardiography signals to detect cardiac electrical function is a new technology developed in recent years. The magnetocardiography signal is detected with Superconducting Quantum Interference Devices (SQUID) and has considerable advantages over electrocardiography (ECG). It is difficult to extract Magnetocardiography (MCG) signal which is buried in the noise, which is a critical issue to be resolved in cardiac monitoring system and MCG applications. In order to remove the severe background noise, the Total Variation (TV) regularization method is proposed to denoise MCG signal. The approach transforms the denoising problem into a minimization optimization problem and the Majorization-minimization algorithm is applied to iteratively solve the minimization problem. However, traditional TV regularization method tends to cause step effect and lacks constraint adaptability. In this paper, an improved TV regularization method for denoising MCG signal is proposed to improve the denoising precision. The improvement of this method is mainly divided into three parts. First, high-order TV is applied to reduce the step effect, and the corresponding second derivative matrix is used to substitute the first order. Then, the positions of the non-zero elements in the second order derivative matrix are determined based on the peak positions that are detected by the detection window. Finally, adaptive constraint parameters are defined to eliminate noises and preserve signal peak characteristics. Theoretical analysis and experimental results show that this algorithm can effectively improve the output signal-to-noise ratio and has superior performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20parameters" title="constraint parameters">constraint parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=derivative%20matrix" title=" derivative matrix"> derivative matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetocardiography" title=" magnetocardiography"> magnetocardiography</a>, <a href="https://publications.waset.org/abstracts/search?q=regular%20term" title=" regular term"> regular term</a>, <a href="https://publications.waset.org/abstracts/search?q=total%20variation" title=" total variation"> total variation</a> </p> <a href="https://publications.waset.org/abstracts/108358/an-improved-total-variation-regularization-method-for-denoising-magnetocardiography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108358.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">153</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">270</span> Stochastic Programming and C-Somga: Animal Ration Formulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pratiksha%20Saxena">Pratiksha Saxena</a>, <a href="https://publications.waset.org/abstracts/search?q=Dipti%20Singh"> Dipti Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Neha%20Khanna"> Neha Khanna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A self-organizing migrating genetic algorithm(C-SOMGA) is developed for animal diet formulation. This paper presents animal diet formulation using stochastic and genetic algorithm. Tri-objective models for cost minimization and shelf life maximization are developed. These objectives are achieved by combination of stochastic programming and C-SOMGA. Stochastic programming is used to introduce nutrient variability for animal diet. Self-organizing migrating genetic algorithm provides exact and quick solution and presents an innovative approach towards successful application of soft computing technique in the area of animal diet formulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=animal%20feed%20ration" title="animal feed ration">animal feed ration</a>, <a href="https://publications.waset.org/abstracts/search?q=feed%20formulation" title=" feed formulation"> feed formulation</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=self-migrating%20genetic%20algorithm" title=" self-migrating genetic algorithm"> self-migrating genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=C-SOMGA%20technique" title=" C-SOMGA technique"> C-SOMGA technique</a>, <a href="https://publications.waset.org/abstracts/search?q=shelf%20life%20maximization" title=" shelf life maximization"> shelf life maximization</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title=" cost minimization"> cost minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=nutrient%20maximization" title=" nutrient maximization"> nutrient maximization</a> </p> <a href="https://publications.waset.org/abstracts/35795/stochastic-programming-and-c-somga-animal-ration-formulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35795.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">442</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">269</span> Sparse-View CT Reconstruction Based on Nonconvex L1 − L2 Regularizations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Pour%20Yazdanpanah">Ali Pour Yazdanpanah</a>, <a href="https://publications.waset.org/abstracts/search?q=Farideh%20Foroozandeh%20Shahraki"> Farideh Foroozandeh Shahraki</a>, <a href="https://publications.waset.org/abstracts/search?q=Emma%20Regentova"> Emma Regentova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The reconstruction from sparse-view projections is one of important problems in computed tomography (CT) limited by the availability or feasibility of obtaining of a large number of projections. Traditionally, convex regularizers have been exploited to improve the reconstruction quality in sparse-view CT, and the convex constraint in those problems leads to an easy optimization process. However, convex regularizers often result in a biased approximation and inaccurate reconstruction in CT problems. Here, we present a nonconvex, Lipschitz continuous and non-smooth regularization model. The CT reconstruction is formulated as a nonconvex constrained L1 − L2 minimization problem and solved through a difference of convex algorithm and alternating direction of multiplier method which generates a better result than L0 or L1 regularizers in the CT reconstruction. We compare our method with previously reported high performance methods which use convex regularizers such as TV, wavelet, curvelet, and curvelet+TV (CTV) on the test phantom images. The results show that there are benefits in using the nonconvex regularizer in the sparse-view CT reconstruction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computed%20tomography" title="computed tomography">computed tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=non-convex" title=" non-convex"> non-convex</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse-view%20reconstruction" title=" sparse-view reconstruction"> sparse-view reconstruction</a>, <a href="https://publications.waset.org/abstracts/search?q=L1-L2%20minimization" title=" L1-L2 minimization"> L1-L2 minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=difference%20of%20convex%20functions" title=" difference of convex functions"> difference of convex functions</a> </p> <a href="https://publications.waset.org/abstracts/70473/sparse-view-ct-reconstruction-based-on-nonconvex-l1-l2-regularizations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70473.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">316</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">268</span> Loss Minimization by Distributed Generation Allocation in Radial Distribution System Using Crow Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Nageswara%20Rao">M. Nageswara Rao</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20S.%20N.%20K.%20Chaitanya"> V. S. N. K. Chaitanya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Amarendranath"> K. Amarendranath</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an optimal allocation and sizing of Distributed Generation (DG) in Radial Distribution Network (RDN) for total power loss minimization and enhances the voltage profile of the system. The two main important part of this study first is to find optimal allocation and second is optimum size of DG. The locations of DGs are identified by Analytical expressions and crow search algorithm has been employed to determine the optimum size of DG. In this study, the DG has been placed on single and multiple allocations.CSA is a meta-heuristic algorithm inspired by the intelligent behavior of the crows. Crows stores their excess food in different locations and memorizes those locations to retrieve it when it is needed. They follow each other to do thievery to obtain better food source. This analysis is tested on IEEE 33 bus and IEEE 69 bus under MATLAB environment and the results are compared with existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytical%20expression" title="analytical expression">analytical expression</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20generation" title=" distributed generation"> distributed generation</a>, <a href="https://publications.waset.org/abstracts/search?q=crow%20search%20algorithm" title=" crow search algorithm"> crow search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20loss" title=" power loss"> power loss</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20profile" title=" voltage profile"> voltage profile</a> </p> <a href="https://publications.waset.org/abstracts/104210/loss-minimization-by-distributed-generation-allocation-in-radial-distribution-system-using-crow-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104210.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">235</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">267</span> Review and Analysis of Sustainable-Based Risk Management in Humanitarian Supply Chains</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marinko%20Maslaric">Marinko Maslaric</a>, <a href="https://publications.waset.org/abstracts/search?q=Maja%20Jokic"> Maja Jokic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When searching for fast and long term responses, sustainable logistics and supply chain applications have developed irrefutable theories and hypotheses towards market requirements. Nevertheless, there are certain misunderstandings on how the implementation of sustainability principles (social, economical, and environmental) and concepts should work in practice, more specifically, within a humanitarian supply chain management context. This paper will focus on the review and analysis of risk management concepts in humanitarian supply chain in order to identify their compliance with sustainable principles. In this direction, the study will look for strategies that suggest: minimization of environmental impacts throughout the reduction of resources consumption, depreciation of logistics costs, including supply chain ones, minimization of transportation and service costs, elaboration of quality performance of supply chain and logistics, and reduction of supply chain delivery time. On the side of meeting all defense, trades and humanitarian logistics needs, the research will be aligned to UN Sustainable Development Goals, standards, and performances. It will start with relevant strategies for identification of risk indicators and it will end with suggestion of valuable strategic approaches for their minimization or total prevention. Finally, a content analysis will propose a suitable methodological structure for the creation of most sustainable strategy in risk management of humanitarian supply chain. Content analysis will accompany thorough, consistent and methodical approach of literature review for potential disaster risk management plan. Thereupon, the propositions of this research will look for contemporary literature gaps, with respect to operate the literature analysis and to suggest the appropriate sustained risk low master plan. The indicated is here to secure the high quality of logistics practices in hazardous events. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=humanitarian%20logistics" title="humanitarian logistics">humanitarian logistics</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainability" title=" sustainability"> sustainability</a>, <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20risk" title=" supply chain risk"> supply chain risk</a>, <a href="https://publications.waset.org/abstracts/search?q=risk%20management%20plan" title=" risk management plan"> risk management plan</a> </p> <a href="https://publications.waset.org/abstracts/87243/review-and-analysis-of-sustainable-based-risk-management-in-humanitarian-supply-chains" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87243.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">239</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">266</span> Quick Sequential Search Algorithm Used to Decode High-Frequency Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20M.%20Siddeq">Mohammed M. Siddeq</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20H.%20Rasheed"> Mohammed H. Rasheed</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20M.%20Salih"> Omar M. Salih</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcos%20A.%20Rodrigues"> Marcos A. Rodrigues</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research proposes a data encoding and decoding method based on the Matrix Minimization algorithm. This algorithm is applied to high-frequency coefficients for compression/encoding. The algorithm starts by converting every three coefficients to a single value; this is accomplished based on three different keys. The decoding/decompression uses a search method called QSS (Quick Sequential Search) Decoding Algorithm presented in this research based on the sequential search to recover the exact coefficients. In the next step, the decoded data are saved in an auxiliary array. The basic idea behind the auxiliary array is to save all possible decoded coefficients; this is because another algorithm, such as conventional sequential search, could retrieve encoded/compressed data independently from the proposed algorithm. The experimental results showed that our proposed decoding algorithm retrieves original data faster than conventional sequential search algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20minimization%20algorithm" title="matrix minimization algorithm">matrix minimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=decoding%20sequential%20search%20algorithm" title=" decoding sequential search algorithm"> decoding sequential search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20compression" title=" image compression"> image compression</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=DWT" title=" DWT"> DWT</a> </p> <a href="https://publications.waset.org/abstracts/151394/quick-sequential-search-algorithm-used-to-decode-high-frequency-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151394.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">149</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">265</span> Improved Acoustic Source Sensing and Localization Based On Robot Locomotion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20Ramu%20Reddy">V. Ramu Reddy</a>, <a href="https://publications.waset.org/abstracts/search?q=Parijat%20Deshpande"> Parijat Deshpande</a>, <a href="https://publications.waset.org/abstracts/search?q=Ranjan%20Dasgupta"> Ranjan Dasgupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents different methodology for an acoustic source sensing and localization in an unknown environment. The developed methodology includes an acoustic based sensing and localization system, a converging target localization based on the recursive direction of arrival (DOA) error minimization, and a regressive obstacle avoidance function. Our method is able to augment the existing proven localization techniques and improve results incrementally by utilizing robot locomotion and is capable of converging to a position estimate with greater accuracy using fewer measurements. The results also evinced the DOA error minimization at each iteration, improvement in time for reaching the destination and the efficiency of this target localization method as gradually converging to the real target position. Initially, the system is tested using Kinect mounted on turntable with DOA markings which serve as a ground truth and then our approach is validated using a FireBird VI (FBVI) mobile robot on which Kinect is used to obtain bearing information. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=acoustic%20source%20localization" title="acoustic source localization">acoustic source localization</a>, <a href="https://publications.waset.org/abstracts/search?q=acoustic%20sensing" title=" acoustic sensing"> acoustic sensing</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20direction%20of%20arrival" title=" recursive direction of arrival"> recursive direction of arrival</a>, <a href="https://publications.waset.org/abstracts/search?q=robot%20locomotion" title=" robot locomotion"> robot locomotion</a> </p> <a href="https://publications.waset.org/abstracts/43889/improved-acoustic-source-sensing-and-localization-based-on-robot-locomotion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43889.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">492</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">264</span> Optimization and Retrofitting for an Egyptian Refinery Water Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Mousa">Mohamed Mousa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sacristies in the supply of freshwater, strict regulations on discharging wastewater and the support to encourage sustainable development by water minimization techniques leads to raise the interest of water reusing, regeneration, and recycling. Water is considered a vital element in chemical industries. In this study, an optimization model will be developed to determine the optimal design of refinery’s water network system via source interceptor sink that involves several network alternatives, then a Mixed-Integer Non-Linear programming (MINLP) was used to obtain the optimal network superstructure based on flowrates, the concentration of contaminants, etc. The main objective of the model is to reduce the fixed cost of piping installation interconnections, reducing the operating cots of all streams within the refiner’s water network, and minimize the concentration of pollutants to comply with the environmental regulations. A real case study for one of the Egyptian refineries was studied by GAMS / BARON global optimization platform, and the water network had been retrofitted and optimized, leading to saving around 195 m³/ hr. of freshwater with a total reduction reaches to 26 %. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=freshwater%20minimization" title="freshwater minimization">freshwater minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=modelling" title=" modelling"> modelling</a>, <a href="https://publications.waset.org/abstracts/search?q=GAMS" title=" GAMS"> GAMS</a>, <a href="https://publications.waset.org/abstracts/search?q=BARON" title=" BARON"> BARON</a>, <a href="https://publications.waset.org/abstracts/search?q=water%20network%20design" title=" water network design"> water network design</a>, <a href="https://publications.waset.org/abstracts/search?q=wastewater%20reudction" title=" wastewater reudction"> wastewater reudction</a> </p> <a href="https://publications.waset.org/abstracts/139312/optimization-and-retrofitting-for-an-egyptian-refinery-water-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139312.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">232</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">263</span> Curvature Based-Methods for Automatic Coarse and Fine Registration in Dimensional Metrology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rindra%20Rantoson">Rindra Rantoson</a>, <a href="https://publications.waset.org/abstracts/search?q=Hichem%20Nouira"> Hichem Nouira</a>, <a href="https://publications.waset.org/abstracts/search?q=Nabil%20Anwer"> Nabil Anwer</a>, <a href="https://publications.waset.org/abstracts/search?q=Charyar%20Mehdi-Souzani"> Charyar Mehdi-Souzani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multiple measurements by means of various data acquisition systems are generally required to measure the shape of freeform workpieces for accuracy, reliability and holisticity. The obtained data are aligned and fused into a common coordinate system within a registration technique involving coarse and fine registrations. Standardized iterative methods have been established for fine registration such as Iterative Closest Points (ICP) and its variants. For coarse registration, no conventional method has been adopted yet despite a significant number of techniques which have been developed in the literature to supply an automatic rough matching between data sets. Two main issues are addressed in this paper: the coarse registration and the fine registration. For coarse registration, two novel automated methods based on the exploitation of discrete curvatures are presented: an enhanced Hough Transformation (HT) and an improved Ransac Transformation. The use of curvature features in both methods aims to reduce computational cost. For fine registration, a new variant of ICP method is proposed in order to reduce registration error using curvature parameters. A specific distance considering the curvature similarity has been combined with Euclidean distance to define the distance criterion used for correspondences searching. Additionally, the objective function has been improved by combining the point-to-point (P-P) minimization and the point-to-plane (P-Pl) minimization with automatic weights. These ones are determined from the preliminary calculated curvature features at each point of the workpiece surface. The algorithms are applied on simulated and real data performed by a computer tomography (CT) system. The obtained results reveal the benefit of the proposed novel curvature-based registration methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20curvature" title="discrete curvature">discrete curvature</a>, <a href="https://publications.waset.org/abstracts/search?q=RANSAC%20transformation" title=" RANSAC transformation"> RANSAC transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=hough%20transformation" title=" hough transformation"> hough transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=coarse%20registration" title=" coarse registration"> coarse registration</a>, <a href="https://publications.waset.org/abstracts/search?q=ICP%20variant" title=" ICP variant"> ICP variant</a>, <a href="https://publications.waset.org/abstracts/search?q=point-to-point%20and%20point-to-plane%20minimization%20combination" title=" point-to-point and point-to-plane minimization combination"> point-to-point and point-to-plane minimization combination</a>, <a href="https://publications.waset.org/abstracts/search?q=computer%20tomography" title=" computer tomography"> computer tomography</a> </p> <a href="https://publications.waset.org/abstracts/36575/curvature-based-methods-for-automatic-coarse-and-fine-registration-in-dimensional-metrology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36575.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">424</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">262</span> Multi-Objective Multi-Mode Resource-Constrained Project Scheduling Problem by Preemptive Fuzzy Goal Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Busaba%20Phurksaphanrat">Busaba Phurksaphanrat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research proposes a pre-emptive fuzzy goal programming model for multi-objective multi-mode resource constrained project scheduling problem. The objectives of the problem are minimization of the total time and the total cost of the project. Objective in a multi-mode resource-constrained project scheduling problem is often a minimization of make-span. However, both time and cost should be considered at the same time with different level of important priorities. Moreover, all elements of cost functions in a project are not included in the conventional cost objective function. Incomplete total project cost causes an error in finding the project scheduling time. In this research, pre-emptive fuzzy goal programming is presented to solve the multi-objective multi-mode resource constrained project scheduling problem. It can find the compromise solution of the problem. Moreover, it is also flexible in adjusting to find a variety of alternative solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-mode%20resource%20constrained%20project%20scheduling%20problem" title="multi-mode resource constrained project scheduling problem">multi-mode resource constrained project scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20set" title=" fuzzy set"> fuzzy set</a>, <a href="https://publications.waset.org/abstracts/search?q=goal%20programming" title=" goal programming"> goal programming</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-emptive%20fuzzy%20goal%20programming" title=" pre-emptive fuzzy goal programming"> pre-emptive fuzzy goal programming</a> </p> <a href="https://publications.waset.org/abstracts/5799/multi-objective-multi-mode-resource-constrained-project-scheduling-problem-by-preemptive-fuzzy-goal-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5799.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">435</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=minimization&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimization&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>