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: concave minimization</title> <meta name="description" content="Search results for: concave minimization"> <meta name="keywords" content="concave 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="concave 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="concave 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> 321</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: concave minimization</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">321</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">320</span> Comparison of the Boundary Element Method and the Method of Fundamental Solutions for Analysis of Potential and Elasticity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Zenhari">S. Zenhari</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20R.%20Hematiyan"> M. R. Hematiyan</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Khosravifard"> A. Khosravifard</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20R.%20Feizi"> M. R. Feizi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The boundary element method (BEM) and the method of fundamental solutions (MFS) are well-known fundamental solution-based methods for solving a variety of problems. Both methods are boundary-type techniques and can provide accurate results. In comparison to the finite element method (FEM), which is a domain-type method, the BEM and the MFS need less manual effort to solve a problem. The aim of this study is to compare the accuracy and reliability of the BEM and the MFS. This comparison is made for 2D potential and elasticity problems with different boundary and loading conditions. In the comparisons, both convex and concave domains are considered. Both linear and quadratic elements are employed for boundary element analysis of the examples. The discretization of the problem domain in the BEM, i.e., converting the boundary of the problem into boundary elements, is relatively simple; however, in the MFS, obtaining appropriate locations of collocation and source points needs more attention to obtain reliable solutions. The results obtained from the presented examples show that both methods lead to accurate solutions for convex domains, whereas the BEM is more suitable than the MFS for concave domains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=boundary%20element%20method" title="boundary element method">boundary element method</a>, <a href="https://publications.waset.org/abstracts/search?q=method%20of%20fundamental%20solutions" title=" method of fundamental solutions"> method of fundamental solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=elasticity" title=" elasticity"> elasticity</a>, <a href="https://publications.waset.org/abstracts/search?q=potential%20problem" title=" potential problem"> potential problem</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20domain" title=" convex domain"> convex domain</a>, <a href="https://publications.waset.org/abstracts/search?q=concave%20domain" title=" concave domain"> concave domain</a> </p> <a href="https://publications.waset.org/abstracts/163380/comparison-of-the-boundary-element-method-and-the-method-of-fundamental-solutions-for-analysis-of-potential-and-elasticity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163380.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">90</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">319</span> Optimum Design of Combine Threshing Cylinder for Soybean Harvest</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Choi%20Duckkyu">Choi Duckkyu</a>, <a href="https://publications.waset.org/abstracts/search?q=Choi%20Yong"> Choi Yong</a>, <a href="https://publications.waset.org/abstracts/search?q=Kang%20Taegyoung"> Kang Taegyoung</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun%20Hyeonjong"> Jun Hyeonjong</a>, <a href="https://publications.waset.org/abstracts/search?q=Choi%20Ilsu"> Choi Ilsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyun%20Changsik"> Hyun Changsik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study was carried out to develop a soybean combine thresher that enables to reduce the damage rate of soybean threshing and the rate of unthreshing. The combine threshing cylinder was developed with 6 circular axis at each end and fixed with disc plates. It was attached to the prototype combine thresher. A combine thresher that has a cylinder with circular rod type threshing pegs was used for a comparative test. A series of comparative tests were conducted using dae-won soybean. The test of the soybean thresher was performed at the cylinder speeds of 210, 240, 270 and 300 rpm, and with the concave clearance of 10, 13 and 16 mm. The separating positions of soybean after threshing were researched on a separate box with 4 sections. The soybean positions of front, center, rear and rear outside, of 59.5%, 30.6%, 7.8% and 2.2% respectively, were obtained. At the cylinder speeds from 210 rpm to 300 rpm, the damage rate of soybean was increased from 0.1% to 4.2% correspondingly to speeds. The unthreshed rate of soybean under the same condition was increased from 0.9% to 4.1% correspondingly to speeds. 0.7% of the damage rate and 1.5% of the unthreshed rate was achieved at the cylinder speed of 240 rpm and with the concave clearance of 10 mm. For Daewon soybean, an optimum cylinder speed of 240 rpm and the concave clearance of 10 mm were identified. These results will be useful for the design, construction, and operation of soybean threshing harvesters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=soybean%20harvest" title="soybean harvest">soybean harvest</a>, <a href="https://publications.waset.org/abstracts/search?q=combine%20threshing" title=" combine threshing"> combine threshing</a>, <a href="https://publications.waset.org/abstracts/search?q=threshing%20cylinder" title=" threshing cylinder"> threshing cylinder</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20design" title=" optimum design"> optimum design</a> </p> <a href="https://publications.waset.org/abstracts/23993/optimum-design-of-combine-threshing-cylinder-for-soybean-harvest" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23993.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">530</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">318</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">317</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">316</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">188</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">315</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">314</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">313</span> Polarization Dependent Flexible GaN Film Nanogenerators and Electroluminescence Properties</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jeong%20Min%20Baik">Jeong Min Baik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present that the electroluminescence (EL) properties and electrical output power of flexible N-face p-type GaN thin films can be tuned by strain-induced piezo-potential generated across the metal-semiconductor-metal structures. Under different staining conditions (convex and concave bending modes), the transport properties of the GaN films can be changed due to the spontaneous polarization of the films. The I-V characteristics with the bending modes show that the convex bending can increase the current across the films by the decrease in the barrier height at the metal-semiconductor contact, increasing the EL intensity of the P-N junction. At convex bending, it is also shown that the flexible p-type GaN films can generate an output voltage of up to 1.0 V, while at concave bending, 0.4 V. The change of the band bending with the crystal polarity of GaN films was investigated using high-resolution photoemission spectroscopy. This study has great significance on the practical applications of GaN in optoelectronic devices and nanogenerators under a working environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=GaN" title="GaN">GaN</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible" title=" flexible"> flexible</a>, <a href="https://publications.waset.org/abstracts/search?q=laser%20lift-off" title=" laser lift-off"> laser lift-off</a>, <a href="https://publications.waset.org/abstracts/search?q=nanogenerator" title=" nanogenerator"> nanogenerator</a> </p> <a href="https://publications.waset.org/abstracts/13583/polarization-dependent-flexible-gan-film-nanogenerators-and-electroluminescence-properties" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13583.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">419</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">312</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">633</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">311</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">310</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">309</span> Study on Shifting Properties of CVT Rubber V-belt</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Natsuki%20Tsuda">Natsuki Tsuda</a>, <a href="https://publications.waset.org/abstracts/search?q=Kiyotaka%20Obunai"> Kiyotaka Obunai</a>, <a href="https://publications.waset.org/abstracts/search?q=Kazuya%20Okubo"> Kazuya Okubo</a>, <a href="https://publications.waset.org/abstracts/search?q=Hideyuki%20Tashiro"> Hideyuki Tashiro</a>, <a href="https://publications.waset.org/abstracts/search?q=Yoshinori%20Yamaji"> Yoshinori Yamaji</a>, <a href="https://publications.waset.org/abstracts/search?q=Hideyuki%20Kato"> Hideyuki Kato</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this study is to investigate the effect of belt stiffness on the performance of the CVT unit, such as the required pulley thrust force and the ratio coverage. The CVT unit consists of the V-grooved pulleys and the rubber CVT belt. The width of the driving pulley groove was controlled by the stepper motor, while that of the driven pulley was controlled by the hydraulic pressure. The generated mechanical power on the motor was transmitted from the driving axis to the driven axis through the CVT unit. The rotational speed and the transmitting torque of both axes were measured by the tachometers and the torque meters attached with these axes, respectively. The transmitted, mechanical power was absorbed by the magnetic powder brake. The thrust force acting on both pulleys and the force between both shafts were measured by the load cell. The back face profile of the rubber CVT belt along with width direction was measured by the 2-dimensional laser displacement meter. This paper found that when the stiffness of the rubber CVT belt in the belt width direction was reduced, the thrust force required for shifting was reduced. Moreover, when the stiffness of the rubber CVT belt in the belt width direction was reduced, the ratio coverage of the CVT unit was reduced. Due to the decrement of stiffness in belt width direction, the excessive concave deformation of belt in pulley groove was confirmed. Because of this excessive concave deformation, apparent wrapping radius of belt would have been reduced. Proposed model could be effectively estimated the difference of ratio coverage due to concave deformation. The proposed model could also be utilized for designing the rubber CVT belt with optimal bending stiffness in width direction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CVT" title="CVT">CVT</a>, <a href="https://publications.waset.org/abstracts/search?q=countinuously%20variable%20transmission" title=" countinuously variable transmission"> countinuously variable transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=rubber" title=" rubber"> rubber</a>, <a href="https://publications.waset.org/abstracts/search?q=belt%20stiffness" title=" belt stiffness"> belt stiffness</a>, <a href="https://publications.waset.org/abstracts/search?q=transmission" title=" transmission"> transmission</a> </p> <a href="https://publications.waset.org/abstracts/146641/study-on-shifting-properties-of-cvt-rubber-v-belt" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/146641.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">142</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">308</span> Parental Drinking and Risky Alcohol Related Behaviors: Predicting Binge Drinking Trajectories and Their Influence on Impaired Driving among College Students</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shiran%20Bord">Shiran Bord</a>, <a href="https://publications.waset.org/abstracts/search?q=Assaf%20Oshri"> Assaf Oshri</a>, <a href="https://publications.waset.org/abstracts/search?q=Matthew%20W.%20Carlson"> Matthew W. Carlson</a>, <a href="https://publications.waset.org/abstracts/search?q=Sihong%20Liu"> Sihong Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Alcohol-impaired driving (AID) and binge drinking are major health concerns among college students. Although the link between binge drinking and AID is well established, knowledge regarding binge drinking patterns, the factors influencing binge drinking, and the associations between consumption patterns and alcohol-related risk behaviors is lacking. Aims: To examine heterogeneous trajectories of binge drinking during college and tests factors that might predict class membership as well as class membership outcomes. Methods: Data were obtained from a sample of 1,265 college students (Mage = 18.5, SD = .66) as part of the Longitudinal Study of Violence Against Women (N = 1,265; 59.3% female; 69.2% white). Analyses were completed in three stages. First, a growth curve analysis was conducted to identify trajectories of binge drinking over time. Second, growth curve mixture modeling analyses were pursued to assess unobserved growth trajectories of binge drinking without predictors. Lastly, parental drinking variables were added to the model as predictors of class membership, and AID and being a passenger of a drunk driver were added to the model as outcomes. Results: Three binge drinking trajectories were identified: high-convex, medium concave and low-increasing. Parental drinking was associated with being in high-convex and medium-concave classes. Compared to the low-increasing class, the high convex and medium concave classes reported more AID and being a passenger of a drunk driver more frequently. Conclusions: Parental drinking may affect children’s later engagement in AID. Efforts should focus on parents' education regarding the consequences of parental modeling of alcohol consumption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=alcohol%20impaired%20driving" title="alcohol impaired driving">alcohol impaired driving</a>, <a href="https://publications.waset.org/abstracts/search?q=alcohol%20consumption" title=" alcohol consumption"> alcohol consumption</a>, <a href="https://publications.waset.org/abstracts/search?q=binge%20drinking" title=" binge drinking"> binge drinking</a>, <a href="https://publications.waset.org/abstracts/search?q=college%20students" title=" college students"> college students</a>, <a href="https://publications.waset.org/abstracts/search?q=parental%20modeling" title=" parental modeling"> parental modeling</a> </p> <a href="https://publications.waset.org/abstracts/66974/parental-drinking-and-risky-alcohol-related-behaviors-predicting-binge-drinking-trajectories-and-their-influence-on-impaired-driving-among-college-students" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66974.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">280</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">307</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">306</span> Morphological Characteristics and Development of the Estuary Area of Lam River, Vietnam</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hai%20Nguyen%20Tien">Hai Nguyen Tien</a> </p> <p class="card-text"><strong>Abstract:</strong></p> On the basis of the structure of alluvial sediments explained by echo sounding data and remote sensing images, the following results can be given: The estuary of Lam river (from Ben Thuy bridge to Cua Hoi) is divided into 3 channel (location is calculated according to the river bank on the Nghe An province) : i) channel I (from Ben Thuy bridge to Hung Hoa) is the branching river; ii) channel II (from Hung Hoa to Nghi Thai is a channel develops in a meandering direction with a concave side toward Ha Tinh province; iii) channel III, from Nghi Thai to Cua Hoi is a channel develops in a meandering direction with a concave side toward Nghe An province. This estuary area is formed in the period from after the sea level dropped below 0m (current water level) to the present: i) Chanel II developed moving towards Ha Tinh provnce; ii) Chanel III developed moving towards Nghe An province; iii) In chanel I, a second river branch is formed because the flow of river cuts through the Hong Lam- Hong Nhat mudflat, at the same time creating an island. Morphological characteristics of the estuary area of Lam River are the main result of erosion and deposition activities corresponding to two water levels: low water level below 0 m and water level 0 m (current water level). Characteristics of the sediment layers on the riverbed in the estuary can be used to determine the sea levels in Late Holocene–Present. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lam%20River" title="Lam River">Lam River</a>, <a href="https://publications.waset.org/abstracts/search?q=development" title=" development"> development</a>, <a href="https://publications.waset.org/abstracts/search?q=Cua%20Hoi" title=" Cua Hoi"> Cua Hoi</a>, <a href="https://publications.waset.org/abstracts/search?q=river%20morphology" title=" river morphology"> river morphology</a> </p> <a href="https://publications.waset.org/abstracts/130853/morphological-characteristics-and-development-of-the-estuary-area-of-lam-river-vietnam" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130853.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">126</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">305</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">304</span> Design and Assessment of Base Isolated Structures under Spectrum-Compatible Bidirectional Earthquakes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marco%20Furinghetti">Marco Furinghetti</a>, <a href="https://publications.waset.org/abstracts/search?q=Alberto%20Pavese"> Alberto Pavese</a>, <a href="https://publications.waset.org/abstracts/search?q=Michele%20Rinaldi"> Michele Rinaldi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Concave Surface Slider devices have been more and more used in real applications for seismic protection of both bridge and building structures. Several research activities have been carried out, in order to investigate the lateral response of such a typology of devices, and a reasonably high level of knowledge has been reached. If radial analysis is performed, the frictional force is always aligned with respect to the restoring force, whereas under bidirectional seismic events, a bi-axial interaction of the directions of motion occurs, due to the step-wise projection of the main frictional force, which is assumed to be aligned to the trajectory of the isolator. Nonetheless, if non-linear time history analyses have to be performed, standard codes provide precise rules for the definition of an averagely spectrum-compatible set of accelerograms in radial conditions, whereas for bidirectional motions different combinations of the single components spectra can be found. Moreover, nowadays software for the adjustment of natural accelerograms are available, which lead to a higher quality of spectrum-compatibility and to a smaller dispersion of results for radial motions. In this endeavor a simplified design procedure is defined, for building structures, base-isolated by means of Concave Surface Slider devices. Different case study structures have been analyzed. In a first stage, the capacity curve has been computed, by means of non-linear static analyses on the fixed-base structures: inelastic fiber elements have been adopted and different direction angles of lateral forces have been studied. Thanks to these results, a linear elastic Finite Element Model has been defined, characterized by the same global stiffness of the linear elastic branch of the non-linear capacity curve. Then, non-linear time history analyses have been performed on the base-isolated structures, by applying seven bidirectional seismic events. The spectrum-compatibility of bidirectional earthquakes has been studied, by considering different combinations of single components and adjusting single records: thanks to the proposed procedure, results have shown a small dispersion and a good agreement in comparison to the assumed design values. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=concave%20surface%20slider" title="concave surface slider">concave surface slider</a>, <a href="https://publications.waset.org/abstracts/search?q=spectrum-compatibility" title=" spectrum-compatibility"> spectrum-compatibility</a>, <a href="https://publications.waset.org/abstracts/search?q=bidirectional%20earthquake" title=" bidirectional earthquake"> bidirectional earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=base%20isolation" title=" base isolation"> base isolation</a> </p> <a href="https://publications.waset.org/abstracts/64725/design-and-assessment-of-base-isolated-structures-under-spectrum-compatible-bidirectional-earthquakes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64725.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">292</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">303</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">302</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">301</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">300</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">299</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">298</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">297</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">296</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">295</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">294</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">293</span> Investigation of External Pressure Coefficients on Large Antenna Parabolic Reflector Using Computational Fluid Dynamics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Varun%20K">Varun K</a>, <a href="https://publications.waset.org/abstracts/search?q=Pramod%20B.%20Balareddy"> Pramod B. Balareddy </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Estimation of wind forces plays a significant role in the in the design of large antenna parabolic reflectors. Reflector surface accuracies are very sensitive to the gain of the antenna system at higher frequencies. Hence accurate estimation of wind forces becomes important, which is primary input for design and analysis of the reflector system. In the present work, numerical simulation of wind flow using Computational Fluid Dynamics (CFD) software is used to investigate the external pressure coefficients. An extensive comparative study has been made between the CFD results and the published wind tunnel data for different wind angle of attacks (α) acting over concave to convex surfaces respectively. Flow simulations using CFD are carried out to estimate the coefficients of Drag, Lift and Moment for the parabolic reflector. Coefficients of pressures (Cp) over the front and the rear face of the reflector are extracted over surface of the reflector to study the net pressure variations. These resultant pressure variations are compared with the published wind tunnel data for different angle of attacks. It was observed from the CFD simulations, both convex and concave face of reflector system experience a band of pressure variations for the positive and negative angle of attacks respectively. In the published wind tunnel data, Pressure variations over convex surfaces are assumed to be uniform and vice versa. Chordwise and spanwise pressure variations were calculated and compared with the published experimental data. In the present work, it was observed that the maximum pressure coefficients for α ranging from +30° to -90° and α=+90° was lower. For α ranging from +45° to +75°, maximum pressure coefficients were higher as compared to wind tunnel data. This variation is due to non-uniform pressure distribution observed over front and back faces of reflector. Variations in Cd, Cl and Cm over α=+90° to α=-90° was in close resemblance with the experimental data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=angle%20of%20attack" title="angle of attack">angle of attack</a>, <a href="https://publications.waset.org/abstracts/search?q=drag%20coefficient" title=" drag coefficient"> drag coefficient</a>, <a href="https://publications.waset.org/abstracts/search?q=lift%20coefficient" title=" lift coefficient"> lift coefficient</a>, <a href="https://publications.waset.org/abstracts/search?q=pressure%20coefficient" title=" pressure coefficient"> pressure coefficient</a> </p> <a href="https://publications.waset.org/abstracts/87780/investigation-of-external-pressure-coefficients-on-large-antenna-parabolic-reflector-using-computational-fluid-dynamics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87780.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">257</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">292</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> <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=concave%20minimization&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=concave%20minimization&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>