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: maximum clique problem</title> <meta name="description" content="Search results for: maximum clique problem"> <meta name="keywords" content="maximum clique problem"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="maximum clique problem" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="maximum clique problem"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 10971</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: maximum clique problem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10971</span> An Optimization Model for Maximum Clique Problem Based on Semidefinite Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Derkaoui%20Orkia">Derkaoui Orkia</a>, <a href="https://publications.waset.org/abstracts/search?q=Lehireche%20Ahmed"> Lehireche Ahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The topic of this article is to exploring the potentialities of a powerful optimization technique, namely Semidefinite Programming, for solving NP-hard problems. This approach provides tight relaxations of combinatorial and quadratic problems. In this work, we solve the maximum clique problem using this relaxation. The clique problem is the computational problem of finding cliques in a graph. It is widely acknowledged for its many applications in real-world problems. The numerical results show that it is possible to find a maximum clique in polynomial time, using an algorithm based on semidefinite programming. We implement a primal-dual interior points algorithm to solve this problem based on semidefinite programming. The semidefinite relaxation of this problem can be solved in polynomial time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20programming" title="semidefinite programming">semidefinite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem" title=" maximum clique problem"> maximum clique problem</a>, <a href="https://publications.waset.org/abstracts/search?q=primal-dual%20interior%20point%20method" title=" primal-dual interior point method"> primal-dual interior point method</a>, <a href="https://publications.waset.org/abstracts/search?q=relaxation" title=" relaxation"> relaxation</a> </p> <a href="https://publications.waset.org/abstracts/73224/an-optimization-model-for-maximum-clique-problem-based-on-semidefinite-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73224.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">222</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10970</span> The Effect of Research Unit Clique-Diversity and Power Structure on Performance and Originality</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yue%20Yang">Yue Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Qiang%20Wu"> Qiang Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Xingyu%20Gao"> Xingyu Gao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> "Organized research units" have always been an important part of academia. According to the type of organization, there are public research units, university research units, and corporate research units. Existing research has explored the research unit in some depth from several perspectives. However, there is a research gap on the closer interaction between the three from a network perspective and the impact of this interaction on their performance as well as originality. Cliques are a special kind of structure under the concept of cohesive subgroups in the field of social networks, representing particularly tightly knit teams in a network. This study develops the concepts of the diversity of clique types and the diversity of clique geography based on cliques, starting from the diversity of collaborative activities characterized by them. Taking research units as subjects and assigning values to their power in cliques based on occupational age, we explore the impact of clique diversity and clique power on their performance as well as originality and the moderating role of clique relationship strength and structural holes in them. By collecting 9094 articles published in the field of quantum communication at WoSCC over the 15 years 2007-2021, we processed them to construct annual collaborative networks between a total of 533 research units and measured the network characteristic variables using Ucinet. It was found that the type and geographic diversity of cliques promoted the performance and originality of the research units, and the strength of clique relationships positively moderated the positive effect of the diversity of clique types on performance and negatively affected the promotional relationship between the geographic diversity of cliques and performance. It also negatively affected the positive effects of clique-type diversity and clique-geography diversity on originality. Structural holes positively moderated the facilitating effect of both types of factional diversity on performance and originality. Clique power promoted the performance of the research unit, but unfavorably affected its performance on novelty. Faction relationship strength facilitated the relationship between faction rights and performance and showed negative insignificance for clique power and originality. Structural holes positively moderated the effect of clique power on performance and originality. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=research%20unit" title="research unit">research unit</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20networks" title=" social networks"> social networks</a>, <a href="https://publications.waset.org/abstracts/search?q=clique%20structure" title=" clique structure"> clique structure</a>, <a href="https://publications.waset.org/abstracts/search?q=clique%20power" title=" clique power"> clique power</a>, <a href="https://publications.waset.org/abstracts/search?q=diversity" title=" diversity"> diversity</a> </p> <a href="https://publications.waset.org/abstracts/181497/the-effect-of-research-unit-clique-diversity-and-power-structure-on-performance-and-originality" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/181497.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">59</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">10969</span> Clique and Clan Analysis of Patient-Sharing Physician Collaborations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahadat%20Uddin">Shahadat Uddin</a>, <a href="https://publications.waset.org/abstracts/search?q=Md%20Ekramul%20Hossain"> Md Ekramul Hossain</a>, <a href="https://publications.waset.org/abstracts/search?q=Arif%20Khan"> Arif Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The collaboration among physicians during episodes of care for a hospitalised patient has a significant contribution towards effective health outcome. This research aims at improving this health outcome by analysing the attributes of patient-sharing physician collaboration network (PCN) on hospital data. To accomplish this goal, we present a research framework that explores the impact of several types of attributes (such as clique and clan) of PCN on hospitalisation cost and hospital length of stay. We use electronic health insurance claim dataset to construct and explore PCNs. Each PCN is categorised as ‘low’ and ‘high’ in terms of hospitalisation cost and length of stay. The results from the proposed model show that the clique and clan of PCNs affect the hospitalisation cost and length of stay. The clique and clan of PCNs show the difference between ‘low’ and ‘high’ PCNs in terms of hospitalisation cost and length of stay. The findings and insights from this research can potentially help the healthcare stakeholders to better formulate the policy in order to improve quality of care while reducing cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clique" title="clique">clique</a>, <a href="https://publications.waset.org/abstracts/search?q=clan" title=" clan"> clan</a>, <a href="https://publications.waset.org/abstracts/search?q=electronic%20health%20records" title=" electronic health records"> electronic health records</a>, <a href="https://publications.waset.org/abstracts/search?q=physician%20collaboration" title=" physician collaboration"> physician collaboration</a> </p> <a href="https://publications.waset.org/abstracts/99741/clique-and-clan-analysis-of-patient-sharing-physician-collaborations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99741.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">140</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">10968</span> Heuristic for Scheduling Correlated Parallel Machine to Minimize Maximum Lateness and Total Weighed Completion Time</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yang-Kuei%20Lin">Yang-Kuei Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Yun-Xi%20Zhang"> Yun-Xi Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research focuses on the bicriteria correlated parallel machine scheduling problem. The two objective functions considered in this problem are to minimize maximum lateness and total weighted completion time. We first present a mixed integer programming (MIP) model that can find the entire efficient frontier for the studied problem. Next, we have proposed a bicriteria heuristic that can find non-dominated solutions for the studied problem. The performance of the proposed bicriteria heuristic is compared with the efficient frontier generated by solving the MIP model. Computational results indicate that the proposed bicriteria heuristic can solve the problem efficiently and find a set of diverse solutions that are uniformly distributed along the efficient frontier. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bicriteria" title="bicriteria">bicriteria</a>, <a href="https://publications.waset.org/abstracts/search?q=correlated%20parallel%20machines" title=" correlated parallel machines"> correlated parallel machines</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/108546/heuristic-for-scheduling-correlated-parallel-machine-to-minimize-maximum-lateness-and-total-weighed-completion-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108546.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">141</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">10967</span> Determination of the Minimum Time and the Optimal Trajectory of a Moving Robot Using Picard's Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abbes%20Lounis">Abbes Lounis</a>, <a href="https://publications.waset.org/abstracts/search?q=Kahina%20Louadj"> Kahina Louadj</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Aidene"> Mohamed Aidene</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an optimal control problem applied to a robot; the problem is to determine a command which makes it possible to reach a final state from a given initial state in record time. The approach followed to solve this optimization problem with constraints on the control starts by presenting the equations of motion of the dynamic system then by applying Pontryagin's maximum principle (PMP) to determine the optimal control, and Picard's successive approximation method combined with the shooting method to solve the resulting differential system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=robotics" title="robotics">robotics</a>, <a href="https://publications.waset.org/abstracts/search?q=Pontryagin%27s%20Maximum%20Principle" title=" Pontryagin's Maximum Principle"> Pontryagin's Maximum Principle</a>, <a href="https://publications.waset.org/abstracts/search?q=PMP" title=" PMP"> PMP</a>, <a href="https://publications.waset.org/abstracts/search?q=Picard%27s%20method" title=" Picard's method"> Picard's method</a>, <a href="https://publications.waset.org/abstracts/search?q=shooting%20method" title=" shooting method"> shooting method</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20differential%20systems" title=" non-linear differential systems"> non-linear differential systems</a> </p> <a href="https://publications.waset.org/abstracts/130157/determination-of-the-minimum-time-and-the-optimal-trajectory-of-a-moving-robot-using-picards-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130157.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">254</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">10966</span> Design of Non-uniform Circular Antenna Arrays Using Firefly Algorithm for Side Lobe Level Reduction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gopi%20Ram">Gopi Ram</a>, <a href="https://publications.waset.org/abstracts/search?q=Durbadal%20Mandal"> Durbadal Mandal</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajib%20Kar"> Rajib Kar</a>, <a href="https://publications.waset.org/abstracts/search?q=Sakti%20Prasad%20Ghoshal"> Sakti Prasad Ghoshal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A design problem of non-uniform circular antenna arrays for maximum reduction of both the side lobe level (SLL) and first null beam width (FNBW) is dealt with. This problem is modeled as a simple optimization problem. The method of Firefly algorithm (FFA) is used to determine an optimal set of current excitation weights and antenna inter-element separations that provide radiation pattern with maximum SLL reduction and much improvement on FNBW as well. Circular array antenna laid on x-y plane is assumed. FFA is applied on circular arrays of 8-, 10-, and 12- elements. Various simulation results are presented and hence performances of side lobe and FNBW are analyzed. Experimental results show considerable reductions of both the SLL and FNBW with respect to those of the uniform case and some standard algorithms GA, PSO, and SA applied to the same problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=circular%20arrays" title="circular arrays">circular arrays</a>, <a href="https://publications.waset.org/abstracts/search?q=first%20null%20beam%20width" title=" first null beam width"> first null beam width</a>, <a href="https://publications.waset.org/abstracts/search?q=side%20lobe%20level" title=" side lobe level"> side lobe level</a>, <a href="https://publications.waset.org/abstracts/search?q=FFA" title=" FFA"> FFA</a> </p> <a href="https://publications.waset.org/abstracts/4066/design-of-non-uniform-circular-antenna-arrays-using-firefly-algorithm-for-side-lobe-level-reduction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4066.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">10965</span> The Hospitals Residents Problem with Bounded Length Preference List under Social Stability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ashish%20Shrivastava">Ashish Shrivastava</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Pandu%20Rangan"> C. Pandu Rangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider The Hospitals Residents problem with Social Stability (HRSS), where hospitals and residents can communicate only through the underlying social network. Those residents and hospitals which don not have any social connection between them can not communicate and hence they cannot be a social blocking pair with respect to a socially stable matching in an instance of hospitals residents problem with social stability. In large scale matching like NRMP or Scottish medical matching scheme etc. where set of agents, as well as length of preference lists, are very large, social stability is a useful notion in which members of a blocking pair could block a matching if and only if they know the existence of each other. Thus the notion of social stability in hospitals residents problem allows us to increase the cardinality of the matching without taking care of those blocking pairs which are not socially connected to each other. We know that finding a maximum cardinality socially stable matching, in an instance, of HRSS is NP-hard. This motivates us to solve this problem with bounded length preference lists on one side. In this paper, we have presented a polynomial time algorithm to compute maximum cardinality socially stable matching in a HRSS instance where residents can give at most two length and hospitals can give unbounded length preference list. Preference lists of residents and hospitals will be strict in nature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matching%20under%20preference" title="matching under preference">matching under preference</a>, <a href="https://publications.waset.org/abstracts/search?q=socially%20stable%20matching" title=" socially stable matching"> socially stable matching</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20hospital%20residents%20problem" title=" the hospital residents problem"> the hospital residents problem</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20stable%20marriage%20problem" title=" the stable marriage problem"> the stable marriage problem</a> </p> <a href="https://publications.waset.org/abstracts/57888/the-hospitals-residents-problem-with-bounded-length-preference-list-under-social-stability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57888.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">277</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">10964</span> An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20Wang">Y. Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is <em>O</em>(<em>CN</em><sub>max</sub><em>n</em><sup>2</sup>) where <em>C</em> is the iterations, <em>N</em><sub>max</sub> is the maximum number of frequency quadrilaterals containing each edge and <em>n</em> is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5<em>n</em> edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20quadrilateral" title="frequency quadrilateral">frequency quadrilateral</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm"> iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse%20graph" title=" sparse graph"> sparse graph</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a> </p> <a href="https://publications.waset.org/abstracts/82737/an-improved-method-to-compute-sparse-graphs-for-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82737.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">233</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">10963</span> Effect of the Poisson’s Ratio on the Behavior of Epoxy Microbeam</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Tahmasebipour">Mohammad Tahmasebipour</a>, <a href="https://publications.waset.org/abstracts/search?q=Hosein%20Salarpour"> Hosein Salarpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Researchers suggest that variations in Poisson’s ratio affect the behavior of Timoshenko micro beam. Therefore, in this study, two epoxy Timoshenko micro beams with different dimensions were modeled using the finite element method considering all boundary conditions and initial conditions that govern the problem. The effect of Poisson’s ratio on the resonant frequency, maximum deflection, and maximum rotation of the micro beams was examined. The analyses suggest that an increased Poisson’s ratio reduces the maximum rotation and the maximum rotation and increases the resonant frequency. Results were consistent with those obtained using the couple stress, classical, and strain gradient elasticity theories. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microbeam" title="microbeam">microbeam</a>, <a href="https://publications.waset.org/abstracts/search?q=microsensor" title=" microsensor"> microsensor</a>, <a href="https://publications.waset.org/abstracts/search?q=epoxy" title=" epoxy"> epoxy</a>, <a href="https://publications.waset.org/abstracts/search?q=poisson%E2%80%99s%20ratio" title=" poisson’s ratio"> poisson’s ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20behavior" title=" dynamic behavior"> dynamic behavior</a>, <a href="https://publications.waset.org/abstracts/search?q=static%20behavior" title=" static behavior"> static behavior</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a> </p> <a href="https://publications.waset.org/abstracts/28163/effect-of-the-poissons-ratio-on-the-behavior-of-epoxy-microbeam" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28163.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">460</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10962</span> Simple and Concise Maximum Power Control Circuit for PV Power Generation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Keiju%20Matsui">Keiju Matsui</a>, <a href="https://publications.waset.org/abstracts/search?q=Mikio%20Yasubayashi"> Mikio Yasubayashi</a>, <a href="https://publications.waset.org/abstracts/search?q=Masayoshi%20Umeno"> Masayoshi Umeno</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Consumption of energy is increasing every year, and yet does not the decline at all. The main energy source is fossil fuels such as petroleum and natural gas. Since it is the finite resources, they will be exhausted someday. Moreover, to make the fossil fuel an energy source causes an environment problem. In such way, one solution of the problems is the solar battery that is remarkable as one of the alternative energies. Under such circumstances, in this paper, we propose a novel maximum power control circuit for photovoltaic power generation system with simple and fast-response operation. In addition to an application to the solar battery, since this control system is possible to operate with simple circuit and fast-response, the polar value control like the maximum or the minimum value tracking for general application could be easily realized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=maximum%20power%20control" title="maximum power control">maximum power control</a>, <a href="https://publications.waset.org/abstracts/search?q=inter-connection" title=" inter-connection"> inter-connection</a>, <a href="https://publications.waset.org/abstracts/search?q=photovoltaic%20power%20generation" title=" photovoltaic power generation"> photovoltaic power generation</a>, <a href="https://publications.waset.org/abstracts/search?q=PI%20controller" title=" PI controller"> PI controller</a>, <a href="https://publications.waset.org/abstracts/search?q=multiplier" title=" multiplier"> multiplier</a>, <a href="https://publications.waset.org/abstracts/search?q=exclusive-or" title=" exclusive-or"> exclusive-or</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20system" title=" power system"> power system</a> </p> <a href="https://publications.waset.org/abstracts/2577/simple-and-concise-maximum-power-control-circuit-for-pv-power-generation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2577.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">441</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">10961</span> Job Shop Scheduling: Classification, Constraints and Objective Functions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Majid%20Abdolrazzagh-Nezhad">Majid Abdolrazzagh-Nezhad</a>, <a href="https://publications.waset.org/abstracts/search?q=Salwani%20Abdullah"> Salwani Abdullah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The job-shop scheduling problem (JSSP) is an important decision facing those involved in the fields of industry, economics and management. This problem is a class of combinational optimization problem known as the NP-hard problem. JSSPs deal with a set of machines and a set of jobs with various predetermined routes through the machines, where the objective is to assemble a schedule of jobs that minimizes certain criteria such as makespan, maximum lateness, and total weighted tardiness. Over the past several decades, interest in meta-heuristic approaches to address JSSPs has increased due to the ability of these approaches to generate solutions which are better than those generated from heuristics alone. This article provides the classification, constraints and objective functions imposed on JSSPs that are available in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=job-shop%20scheduling" title="job-shop scheduling">job-shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=constraints" title=" constraints"> constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=objective%20functions" title=" objective functions"> objective functions</a> </p> <a href="https://publications.waset.org/abstracts/58284/job-shop-scheduling-classification-constraints-and-objective-functions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58284.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">10960</span> Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Swapnil%20Gupta">Swapnil Gupta</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Pandu%20Rangan"> C. Pandu Rangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A uniquely restricted matching is defined to be a matching M whose matched vertices induces a sub-graph which has only one perfect matching. In this paper, we make progress on the open question of the status of this problem on interval graphs (graphs obtained as the intersection graph of intervals on a line). We give an algorithm to compute maximum cardinality uniquely restricted matchings on certain sub-classes of interval graphs. We consider two sub-classes of interval graphs, the former contained in the latter, and give O(|E|^2) time algorithms for both of them. It is to be noted that both sub-classes are incomparable to proper interval graphs (graphs obtained as the intersection graph of intervals in which no interval completely contains another interval), on which the problem can be solved in polynomial time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uniquely%20restricted%20matching" title="uniquely restricted matching">uniquely restricted matching</a>, <a href="https://publications.waset.org/abstracts/search?q=interval%20graph" title=" interval graph"> interval graph</a>, <a href="https://publications.waset.org/abstracts/search?q=matching" title=" matching"> matching</a>, <a href="https://publications.waset.org/abstracts/search?q=induced%20matching" title=" induced matching"> induced matching</a>, <a href="https://publications.waset.org/abstracts/search?q=witness%20counting" title=" witness counting"> witness counting</a> </p> <a href="https://publications.waset.org/abstracts/45203/computing-maximum-uniquely-restricted-matchings-in-restricted-interval-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45203.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">389</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10959</span> Survey Paper on Graph Coloring Problem and Its Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Prateek%20Chharia">Prateek Chharia</a>, <a href="https://publications.waset.org/abstracts/search?q=Biswa%20Bhusan%20Ghosh"> Biswa Bhusan Ghosh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph coloring is one of the prominent concepts in graph coloring. It can be defined as a coloring of the various regions of the graph such that all the constraints are fulfilled. In this paper various graphs coloring approaches like greedy coloring, Heuristic search for maximum independent set and graph coloring using edge table is described. Graph coloring can be used in various real time applications like student time tabling generation, Sudoku as a graph coloring problem, GSM phone network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20coloring" title="graph coloring">graph coloring</a>, <a href="https://publications.waset.org/abstracts/search?q=greedy%20coloring" title=" greedy coloring"> greedy coloring</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20search" title=" heuristic search"> heuristic search</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20table" title=" edge table"> edge table</a>, <a href="https://publications.waset.org/abstracts/search?q=sudoku%20as%20a%20graph%20coloring%20problem" title=" sudoku as a graph coloring problem"> sudoku as a graph coloring problem</a> </p> <a href="https://publications.waset.org/abstracts/19691/survey-paper-on-graph-coloring-problem-and-its-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19691.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">539</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">10958</span> Preliminary Results on a Maximum Mean Discrepancy Approach for Seizure Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boumediene%20Hamzi">Boumediene Hamzi</a>, <a href="https://publications.waset.org/abstracts/search?q=Turky%20N.%20AlOtaiby"> Turky N. AlOtaiby</a>, <a href="https://publications.waset.org/abstracts/search?q=Saleh%20AlShebeili"> Saleh AlShebeili</a>, <a href="https://publications.waset.org/abstracts/search?q=Arwa%20AlAnqary"> Arwa AlAnqary</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We introduce a data-driven method for seizure detection drawing on recent progress in Machine Learning. The method is based on embedding probability measures in a high (or infinite) dimensional reproducing kernel Hilbert space (RKHS) where the Maximum Mean Discrepancy (MMD) is computed. The MMD is metric between probability measures that are computed as the difference between the means of probability measures after being embedded in an RKHS. Working in RKHS provides a convenient, general functional-analytical framework for theoretical understanding of data. We apply this approach to the problem of seizure detection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=kernel%20methods" title="kernel methods">kernel methods</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20mean%20discrepancy" title=" maximum mean discrepancy"> maximum mean discrepancy</a>, <a href="https://publications.waset.org/abstracts/search?q=seizure%20detection" title=" seizure detection"> seizure detection</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a> </p> <a href="https://publications.waset.org/abstracts/83558/preliminary-results-on-a-maximum-mean-discrepancy-approach-for-seizure-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83558.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">238</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">10957</span> Maximum Likelihood Estimation Methods on a Two-Parameter Rayleigh Distribution under Progressive Type-Ii Censoring</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Fundi%20Murithi">Daniel Fundi Murithi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data from economic, social, clinical, and industrial studies are in some way incomplete or incorrect due to censoring. Such data may have adverse effects if used in the estimation problem. We propose the use of Maximum Likelihood Estimation (MLE) under a progressive type-II censoring scheme to remedy this problem. In particular, maximum likelihood estimates (MLEs) for the location (µ) and scale (λ) parameters of two Parameter Rayleigh distribution are realized under a progressive type-II censoring scheme using the Expectation-Maximization (EM) and the Newton-Raphson (NR) algorithms. These algorithms are used comparatively because they iteratively produce satisfactory results in the estimation problem. The progressively type-II censoring scheme is used because it allows the removal of test units before the termination of the experiment. Approximate asymptotic variances and confidence intervals for the location and scale parameters are derived/constructed. The efficiency of EM and the NR algorithms is compared given root mean squared error (RMSE), bias, and the coverage rate. The simulation study showed that in most sets of simulation cases, the estimates obtained using the Expectation-maximization algorithm had small biases, small variances, narrower/small confidence intervals width, and small root of mean squared error compared to those generated via the Newton-Raphson (NR) algorithm. Further, the analysis of a real-life data set (data from simple experimental trials) showed that the Expectation-Maximization (EM) algorithm performs better compared to Newton-Raphson (NR) algorithm in all simulation cases under the progressive type-II censoring scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=expectation-maximization%20algorithm" title="expectation-maximization algorithm">expectation-maximization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20likelihood%20estimation" title=" maximum likelihood estimation"> maximum likelihood estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=Newton-Raphson%20method" title=" Newton-Raphson method"> Newton-Raphson method</a>, <a href="https://publications.waset.org/abstracts/search?q=two-parameter%20Rayleigh%20distribution" title=" two-parameter Rayleigh distribution"> two-parameter Rayleigh distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=progressive%20type-II%20censoring" title=" progressive type-II censoring"> progressive type-II censoring</a> </p> <a href="https://publications.waset.org/abstracts/122112/maximum-likelihood-estimation-methods-on-a-two-parameter-rayleigh-distribution-under-progressive-type-ii-censoring" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122112.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">163</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10956</span> An Evolutionary Multi-Objective Optimization for Airport Gate Assignment Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyedmirsajad%20Mokhtarimousavi">Seyedmirsajad Mokhtarimousavi</a>, <a href="https://publications.waset.org/abstracts/search?q=Danial%20Talebi"> Danial Talebi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamidreza%20Asgari"> Hamidreza Asgari </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Gate Assignment Problem (GAP) is one of the most substantial issues in airport operation. In principle, GAP intends to maintain the maximum capacity of the airport through the best possible allocation of the resources (gates) in order to reach the optimum outcome. The problem involves a wide range of dependent and independent resources and their limitations, which add to the complexity of GAP from both theoretical and practical perspective. In this study, GAP was mathematically formulated as a three-objective problem. The preliminary goal of multi-objective formulation was to address a higher number of objectives that can be simultaneously optimized and therefore increase the practical efficiency of the final solution. The problem is solved by applying the second version of Non-dominated Sorting Genetic Algorithm (NSGA-II). Results showed that the proposed mathematical model could address most of major criteria in the decision-making process in airport management in terms of minimizing both airport/airline cost and passenger walking distance time. Moreover, the proposed approach could properly find acceptable possible answers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=airport%20management" title="airport management">airport management</a>, <a href="https://publications.waset.org/abstracts/search?q=gate%20assignment%20problem" title=" gate assignment problem"> gate assignment problem</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20modeling" title=" mathematical modeling"> mathematical modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=NSGA-II" title=" NSGA-II"> NSGA-II</a> </p> <a href="https://publications.waset.org/abstracts/63467/an-evolutionary-multi-objective-optimization-for-airport-gate-assignment-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63467.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">299</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">10955</span> Upon One Smoothing Problem in Project Management</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimitri%20Golenko-Ginzburg">Dimitri Golenko-Ginzburg</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A CPM network project with deterministic activity durations, in which activities require homogenous resources with fixed capacities, is considered. The problem is to determine the optimal schedule of starting times for all network activities within their maximal allowable limits (in order not to exceed the network's critical time) to minimize the maximum required resources for the project at any point in time. In case when a non-critical activity may start only at discrete moments with the pregiven time span, the problem becomes NP-complete and an optimal solution may be obtained via a look-over algorithm. For the case when a look-over requires much computational time an approximate algorithm is suggested. The algorithm's performance ratio, i.e., the relative accuracy error, is determined. Experimentation has been undertaken to verify the suggested algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=resource%20smoothing%20problem" title="resource smoothing problem">resource smoothing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=CPM%20network" title=" CPM network"> CPM network</a>, <a href="https://publications.waset.org/abstracts/search?q=lookover%20algorithm" title=" lookover algorithm"> lookover algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=lexicographical%20order" title=" lexicographical order"> lexicographical order</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20algorithm" title=" approximate algorithm"> approximate algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=accuracy%20estimate" title=" accuracy estimate"> accuracy estimate</a> </p> <a href="https://publications.waset.org/abstracts/15779/upon-one-smoothing-problem-in-project-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15779.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">302</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">10954</span> Effect of Silicon in Mitigating Cadmium Toxicity in Maize</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghulam%20Hasan%20Abbasi">Ghulam Hasan Abbasi</a>, <a href="https://publications.waset.org/abstracts/search?q=Moazzam%20Jamil"> Moazzam Jamil</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Anwar-Ul-Haq"> M. Anwar-Ul-Haq</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Heavy metals are significant pollutants in environment and their toxicity is a problem for survival of living things while Silicon (Si) is one of the most ubiquitous macroelements, performing an essential function in healing plants in response to environmental stresses. A hydroponic experiment was conducted to investigate the role of exogenous application of silicon under cadmium stress in six different maize hybrids with five treatments comprising of control, 7.5 µM Cd + 5 mM Si, 7.5 µM Cd + 10 mM Si, 15 µM Cd + 5 mM Si and 15 µM Cd + 10 mM Si. Results revealed that treatments of plants with 10mM Si application under both 7.5µM Cd and 15 µM Cd stress resulted in maximum improvement in plant morphological attributes (root and shoot length, root and shoot fresh and dry weight, leaf area and relative water contents) and antioxidant enzymes (POD and CAT) relative to 5 mM Si application in all maize hybrids. Results regarding Cd concentrations showed that Cd was more retained in roots followed by shoots and then leaves and maximum reduction in Cd uptake was observed at 10mM Si application. Maize hybrid 6525 showed maximum growth and least concentration of Cd whereas maize hybrid 1543 showed the minimum growth and maximum Cd concentration among all maize hybrids. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=antioxidant" title="antioxidant">antioxidant</a>, <a href="https://publications.waset.org/abstracts/search?q=cadmium" title=" cadmium"> cadmium</a>, <a href="https://publications.waset.org/abstracts/search?q=maize" title=" maize"> maize</a>, <a href="https://publications.waset.org/abstracts/search?q=silicon" title=" silicon"> silicon</a> </p> <a href="https://publications.waset.org/abstracts/35284/effect-of-silicon-in-mitigating-cadmium-toxicity-in-maize" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35284.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">518</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">10953</span> Optimization of Roster Construction In Sports</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elijah%20Cavan">Elijah Cavan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Major League Sports (MLB, NBA, NHL, NFL), it is the Front Office Staff (FOS) who make decisions about who plays for their respective team. The FOS bear the brunt of the responsibility for acquiring players through drafting, trading and signing players in free agency while typically contesting with maximum roster salary constraints. The players themselves are volatile assets of these teams- their value fluctuates with age and performance. A simple comparison can be made when viewing players as assets. The problem here is similar to that of optimizing your investment portfolio. The The goal is ultimately to maximize your periodic returns while tolerating a fixed risk (degree of uncertainty/ potential loss). Each franchise may value assets differently, and some may only tolerate lower risk levels- these are examples of factors that introduce additional constraints into the model. In this talk, we will detail the mathematical formulation of this problem as a constrained optimization problem- which can be solved with classical machine learning methods but is also well posed as a problem to be solved on quantum computers <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20mathematics" title=" financial mathematics"> financial mathematics</a>, <a href="https://publications.waset.org/abstracts/search?q=sports%20analytics" title=" sports analytics"> sports analytics</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a> </p> <a href="https://publications.waset.org/abstracts/150014/optimization-of-roster-construction-in-sports" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150014.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">122</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">10952</span> Benders Decomposition Approach to Solve the Hybrid Flow Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebrahim%20Asadi-Gangraj">Ebrahim Asadi-Gangraj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hybrid flow shop scheduling problem (HFS) contains sequencing in a flow shop where, at any stage, there exist one or more related or unrelated parallel machines. This production system is a common manufacturing environment in many real industries, such as the steel manufacturing, ceramic tile manufacturing, and car assembly industries. In this research, a mixed integer linear programming (MILP) model is presented for the hybrid flow shop scheduling problem, in which, the objective consists of minimizing the maximum completion time (makespan). For this purpose, a Benders Decomposition (BD) method is developed to solve the research problem. The proposed approach is tested on some test problems, small to moderate scale. The experimental results show that the Benders decomposition approach can solve the hybrid flow shop scheduling problem in a reasonable time, especially for small and moderate-size test problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hybrid%20flow%20shop" title="hybrid flow shop">hybrid flow shop</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Benders%20decomposition" title=" Benders decomposition"> Benders decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a> </p> <a href="https://publications.waset.org/abstracts/106041/benders-decomposition-approach-to-solve-the-hybrid-flow-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106041.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">10951</span> On the Construction of Lightweight Circulant Maximum Distance Separable Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qinyi%20Mei">Qinyi Mei</a>, <a href="https://publications.waset.org/abstracts/search?q=Li-Ping%20Wang"> Li-Ping Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> MDS matrices are of great significance in the design of block ciphers and hash functions. In the present paper, we investigate the problem of constructing MDS matrices which are both lightweight and low-latency. We propose a new method of constructing lightweight MDS matrices using circulant matrices which can be implemented efficiently in hardware. Furthermore, we provide circulant MDS matrices with as few bit XOR operations as possible for the classical dimensions 4 × 4, 8 × 8 over the space of linear transformations over finite field F42 . In contrast to previous constructions of MDS matrices, our constructions have achieved fewer XORs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linear%20diffusion%20layer" title="linear diffusion layer">linear diffusion layer</a>, <a href="https://publications.waset.org/abstracts/search?q=circulant%20matrix" title=" circulant matrix"> circulant matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=lightweight" title=" lightweight"> lightweight</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20distance%20separable%20%28MDS%29%20matrix" title="maximum distance separable (MDS) matrix">maximum distance separable (MDS) matrix</a> </p> <a href="https://publications.waset.org/abstracts/64109/on-the-construction-of-lightweight-circulant-maximum-distance-separable-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64109.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">410</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">10950</span> Optimum Design of Helical Gear System on Basis of Maximum Power Transmission Capability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yasaman%20Esfandiari">Yasaman Esfandiari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mechanical engineering has always dealt with amplification of the input power in power trains. One of the ways to achieve this goal is to use gears to change the amplitude and direction of the torque and the speed. However, the gears should be optimally designed to best achieve these objectives. In this study, helical gear systems are optimized to achieve maximum power. Material selection, space restriction, available facilities for manufacturing, the probability of tooth breakage, and tooth wear are taken into account and governing equations are derived. Finally, a Matlab code was generated to solve the optimization problem and the results are verified. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=design" title="design">design</a>, <a href="https://publications.waset.org/abstracts/search?q=gears" title=" gears"> gears</a>, <a href="https://publications.waset.org/abstracts/search?q=Matlab" title=" Matlab"> Matlab</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/55864/optimum-design-of-helical-gear-system-on-basis-of-maximum-power-transmission-capability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55864.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">240</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">10949</span> Power Efficiency Characteristics of Magnetohydrodynamic Thermodynamic Gas Cycle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahmoud%20Huleihil">Mahmoud Huleihil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, the performance of a thermodynamic gas cycle of magnetohydrodynamic (MHD) power generation is considered and presented in terms of power efficiency curves. The dissipation mechanisms considered include: fluid friction modeled by means of the isentropic efficiency of the compressor, heat transfer leakage directly from the hot reservoir to the cold heat reservoir, and constant velocity of the MHD generator. The study demonstrates that power and efficiency vanish at the extremes of both slow and fast operating conditions. These points are demonstrated on power efficiency curves and the locus of efficiency at maximum power and the locus of maximum efficiency. Qualitatively, the considered loss mechanisms have a similar effect on the efficiency at maximum power operation and on maximum efficiency operation, thus these efficiencies are reduced, even for small values of the loss mechanisms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=magnetohydrodynamic%20generator" title="magnetohydrodynamic generator">magnetohydrodynamic generator</a>, <a href="https://publications.waset.org/abstracts/search?q=electrical%20efficiency" title=" electrical efficiency"> electrical efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20power" title=" maximum power"> maximum power</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20efficiency" title=" maximum efficiency"> maximum efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=heat%20engine" title=" heat engine"> heat engine</a> </p> <a href="https://publications.waset.org/abstracts/103498/power-efficiency-characteristics-of-magnetohydrodynamic-thermodynamic-gas-cycle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103498.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">245</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10948</span> Solving the Transportation Problem for Warehouses and Dealers in Bangalore City</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Aditya">S. Aditya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20T.%20Nideesh"> K. T. Nideesh</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Guruprasad"> N. Guruprasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Being a subclass of linear programing problem, the Transportation Problem is a classic Operations Research problem where the objective is to determine the schedule for transporting goods from source to destination in a way that minimizes the shipping cost while satisfying supply and demand constraints. In this paper, we are representing the transportation problem for various warehouses along with various dealers situated in Bangalore city to reduce the transportation cost incurred by them as of now. The problem is solved by obtaining the Initial Basic feasible Solution through various methods and further proceeding to obtain optimal cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=NW%20method" title="NW method">NW method</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20utilization" title=" optimum utilization"> optimum utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20problem" title=" transportation problem"> transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Vogel%E2%80%99s%20approximation%20method" title=" Vogel’s approximation method"> Vogel’s approximation method</a> </p> <a href="https://publications.waset.org/abstracts/19160/solving-the-transportation-problem-for-warehouses-and-dealers-in-bangalore-city" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19160.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">437</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">10947</span> Optimization Analysis of Controlled Cooling Process for H-Shape Steam Beams</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jiin-Yuh%20Jang">Jiin-Yuh Jang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yu-Feng%20Gan"> Yu-Feng Gan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to improve the comprehensive mechanical properties of the steel, the cooling rate, and the temperature distribution must be controlled in the cooling process. A three-dimensional numerical model for the prediction of the heat transfer coefficient distribution of H-beam in the controlled cooling process was performed in order to obtain the uniform temperature distribution and minimize the maximum stress and the maximum deformation after the controlled cooling. An algorithm developed with a simplified conjugated-gradient method was used as an optimizer to optimize the heat transfer coefficient distribution. The numerical results showed that, for the case of air cooling 5 seconds followed by water cooling 6 seconds with uniform the heat transfer coefficient, the cooling rate is 15.5 (℃/s), the maximum temperature difference is 85℃, the maximum the stress is 125 MPa, and the maximum deformation is 1.280 mm. After optimize the heat transfer coefficient distribution in control cooling process with the same cooling time, the cooling rate is increased to 20.5 (℃/s), the maximum temperature difference is decreased to 52℃, the maximum stress is decreased to 82MPa and the maximum deformation is decreased to 1.167mm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=controlled%20cooling" title="controlled cooling">controlled cooling</a>, <a href="https://publications.waset.org/abstracts/search?q=H-Beam" title=" H-Beam"> H-Beam</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=thermal%20stress" title=" thermal stress "> thermal stress </a> </p> <a href="https://publications.waset.org/abstracts/62779/optimization-analysis-of-controlled-cooling-process-for-h-shape-steam-beams" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62779.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">370</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">10946</span> Improved Multi-Objective Particle Swarm Optimization Applied to Design Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kapse%20Swapnil">Kapse Swapnil</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Shankar"> K. Shankar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Aiming at optimizing the weight and deflection of cantilever beam subjected to maximum stress and maximum deflection, Multi-objective Particle Swarm Optimization (MOPSO) with Utopia Point based local search is implemented. Utopia point is used to govern the search towards the Pareto Optimal set. The elite candidates obtained during the iterations are stored in an archive according to non-dominated sorting and also the archive is truncated based on least crowding distance. Local search is also performed on elite candidates and the most diverse particle is selected as the global best. This method is implemented on standard test functions and it is observed that the improved algorithm gives better convergence and diversity as compared to NSGA-II in fewer iterations. Implementation on practical structural problem shows that in 5 to 6 iterations, the improved algorithm converges with better diversity as evident by the improvement of cantilever beam on an average of 0.78% and 9.28% in the weight and deflection respectively compared to NSGA-II. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Utopia%20point" title="Utopia point">Utopia point</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20particle%20swarm%20optimization" title=" multi-objective particle swarm optimization"> multi-objective particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a>, <a href="https://publications.waset.org/abstracts/search?q=cantilever%20beam" title=" cantilever beam"> cantilever beam</a> </p> <a href="https://publications.waset.org/abstracts/65174/improved-multi-objective-particle-swarm-optimization-applied-to-design-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65174.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">519</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10945</span> A Variable Neighborhood Search with Tabu Conditions for the Roaming Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Masoud%20Shahmanzari">Masoud Shahmanzari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to present a Variable Neighborhood Search (VNS) with Tabu Search (TS) conditions for the Roaming Salesman Problem (RSP). The RSP is a special case of the well-known traveling salesman problem (TSP) where a set of cities with time-dependent rewards and a set of campaign days are given. Each city can be visited on any day and a subset of cities can be visited multiple times. The goal is to determine an optimal campaign schedule consist of daily open/closed tours that visit some cities and maximizes the total net benefit while respecting daily maximum tour duration constraints and the necessity to return campaign base frequently. This problem arises in several real-life applications and particularly in election logistics where depots are not fixed. We formulate the problem as a mixed integer linear programming (MILP), in which we capture as many real-world aspects of the RSP as possible. We also present a hybrid metaheuristic algorithm based on a VNS with TS conditions. The initial feasible solution is constructed via a new matheuristc approach based on the decomposition of the original problem. Next, this solution is improved in terms of the collected rewards using the proposed local search procedure. We consider a set of 81 cities in Turkey and a campaign of 30 days as our largest instance. Computational results on real-world instances show that the developed algorithm could find near-optimal solutions effectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=election%20logistics" title=" election logistics"> election logistics</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a> </p> <a href="https://publications.waset.org/abstracts/162992/a-variable-neighborhood-search-with-tabu-conditions-for-the-roaming-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162992.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">92</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">10944</span> Maximum Power Point Tracking Using Fuzzy Logic Control for a Stand-Alone PV System with PI Controller for Battery Charging Based on Evolutionary Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20A.%20Moustafa%20Hassan">Mohamed A. Moustafa Hassan</a>, <a href="https://publications.waset.org/abstracts/search?q=Omnia%20S%20.S.%20Hussian"> Omnia S .S. Hussian</a>, <a href="https://publications.waset.org/abstracts/search?q=Hany%20M.%20Elsaved"> Hany M. Elsaved</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper introduces the application of Fuzzy Logic Controller (FLC) to extract the Maximum Power Point Tracking (MPPT) from the PV panel. In addition, the proportional integral (PI) controller is used to be the strategy for battery charge control according to acceptable performance criteria. The parameters of the PI controller have been tuned via Modified Adaptive Accelerated Coefficient Particle Swarm Optimization (MAACPSO) technique. The simulation results, using MATLAB/Simulink tools, show that the FLC technique has advantages for use in the MPPT problem, as it provides a fast response under changes in environmental conditions such as radiation and temperature. In addition, the use of PI controller based on MAACPSO results in a good performance in terms of controlling battery charging with constant voltage and current to execute rapid charging. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=battery%20charging" title="battery charging">battery charging</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic%20control" title=" fuzzy logic control"> fuzzy logic control</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20power%20point%20tracking" title=" maximum power point tracking"> maximum power point tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=PV%20system" title=" PV system"> PV system</a>, <a href="https://publications.waset.org/abstracts/search?q=PI%20controller" title=" PI controller"> PI controller</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20technique" title=" evolutionary technique"> evolutionary technique</a> </p> <a href="https://publications.waset.org/abstracts/109686/maximum-power-point-tracking-using-fuzzy-logic-control-for-a-stand-alone-pv-system-with-pi-controller-for-battery-charging-based-on-evolutionary-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109686.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">166</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">10943</span> Effect of Nitrogen and Gibberellic Acid at Different Level and their Interaction on Calendula</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pragnyashree%20Mishra">Pragnyashree Mishra</a>, <a href="https://publications.waset.org/abstracts/search?q=Shradhanjali%20Mohapatra"> Shradhanjali Mohapatra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present investigation is carried out to know the effect of foliar feeding of nitrogen and gibberellic acid on vegetative growth, flowering behaviour and yield of calendula variety ‘Golden Emporer’. The experiment was laid out in RBD in rabi season of 2013-14. There are 16 treatments are taken at different level such as nitrogen (at 0%,1%,2%,3%) and GA3 (at 50 ppm,100ppm,150 ppm). Among them maximum height at bud initiation stage was obtained at 3% nitrogen (27.00 cm) and at 150 ppm GA3 (26.5 cm), fist flowering was obtained at 3% nitrogen(60.00 days) and at 150 ppm GA3 (63.75 days), maximum flower stalk length was obtained at 3% nitrogen(3.50 cm) and at 150 ppm GA3 (5.42 cm),maximum duration of flowering was obtained at 3% nitrogen(46.00 days) and at 150 ppm GA3 (46.50days), maximum number of flower was obtained at 3% nitrogen (89.00per plant) and at 150 ppm GA3 (83.50 per plant), maximum flower weight was obtained at 3% nitrogen(1.25 gm per flower) and at 150 ppm GA3 (1.50 gm per flower), maximum yield was was obtained at 3% nitrogen (110.00 gm per plant) and at 150 ppm GA3 (105.00gm per plant) and minimum of all character was obtained when 0% nitrogen0 ppm GA3. All interaction between nitrogen and GA3 was found in significant except the yield . <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=calendula" title="calendula">calendula</a>, <a href="https://publications.waset.org/abstracts/search?q=golden%20emporer" title=" golden emporer"> golden emporer</a>, <a href="https://publications.waset.org/abstracts/search?q=GA3" title=" GA3"> GA3</a>, <a href="https://publications.waset.org/abstracts/search?q=nitrogen%20and%20gibberellic%20acid" title=" nitrogen and gibberellic acid "> nitrogen and gibberellic acid </a> </p> <a href="https://publications.waset.org/abstracts/19334/effect-of-nitrogen-and-gibberellic-acid-at-different-level-and-their-interaction-on-calendula" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19334.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">464</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">10942</span> Real Time Monitoring and Control of Proton Exchange Membrane Fuel Cell in Cognitive Radio Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Prakash%20Thapa">Prakash Thapa</a>, <a href="https://publications.waset.org/abstracts/search?q=Gye%20Choon%20Park"> Gye Choon Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Sung%20Gi%20Kwon"> Sung Gi Kwon</a>, <a href="https://publications.waset.org/abstracts/search?q=Jin%20Lee"> Jin Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The generation of electric power from a proton exchange membrane (PEM) fuel cell is influenced by temperature, pressure, humidity, flow rate of reactant gaseous and partial flooding of membrane electrode assembly (MEA). Among these factors, temperature and cathode flooding are the most affecting parameters on the performance of fuel cell. This paper describes the detail design and effect of these parameters on PEM fuel cell. Performance of all parameters was monitored, analyzed and controlled by using 5KWatt PEM fuel cell. In the real-time data communication for remote monitoring and control of PEM fuel cell, a normalized least mean square algorithm in cognitive radio environment is used. By the use of this method, probability of energy signal detection will be maximum which solved the frequency shortage problem. So the monitoring system hanging out and slow speed problem will be solved. Also from the control unit, all parameters are controlled as per the system requirement. As a result, PEM fuel cell generates maximum electricity with better performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=proton%20exchange%20membrane%20%28PEM%29%20fuel%20cell" title="proton exchange membrane (PEM) fuel cell">proton exchange membrane (PEM) fuel cell</a>, <a href="https://publications.waset.org/abstracts/search?q=pressure" title=" pressure"> pressure</a>, <a href="https://publications.waset.org/abstracts/search?q=temperature%20and%20humidity%20sensor%20%28PTH%29" title=" temperature and humidity sensor (PTH)"> temperature and humidity sensor (PTH)</a>, <a href="https://publications.waset.org/abstracts/search?q=efficiency%20curve" title=" efficiency curve"> efficiency curve</a>, <a href="https://publications.waset.org/abstracts/search?q=cognitive%20radio%20network%20%28CRN%29" title=" cognitive radio network (CRN)"> cognitive radio network (CRN)</a> </p> <a href="https://publications.waset.org/abstracts/84275/real-time-monitoring-and-control-of-proton-exchange-membrane-fuel-cell-in-cognitive-radio-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84275.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">459</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=maximum%20clique%20problem&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=365">365</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=366">366</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>