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: minimal path</title> <meta name="description" content="Search results for: minimal path"> <meta name="keywords" content="minimal path"> <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="minimal path" 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="minimal path"> <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> 2066</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: minimal path</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2066</span> Joint Path and Push Planning among Moveable Obstacles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Victor%20Emeli">Victor Emeli</a>, <a href="https://publications.waset.org/abstracts/search?q=Akansel%20Cosgun"> Akansel Cosgun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper explores the navigation among movable obstacles (NAMO) problem and proposes joint path and push planning: which path to take and in what direction the obstacles should be pushed at, given a start and goal position. We present a planning algorithm for selecting a path and the obstacles to be pushed, where a rapidly-exploring random tree (RRT)-based heuristic is employed to calculate a minimal collision path. When it is necessary to apply a pushing force to slide an obstacle out of the way, the planners leverage means-end analysis through a dynamic physics simulation to determine the sequence of linear pushes to clear the necessary space. Simulation experiments show that our approach finds solutions in higher clutter percentages (up to 49%) compared to the straight-line push planner (37%) and RRT without pushing (18%). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=motion%20planning" title="motion planning">motion planning</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title=" path planning"> path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=push%20planning" title=" push planning"> push planning</a>, <a href="https://publications.waset.org/abstracts/search?q=robot%20navigation" title=" robot navigation"> robot navigation</a> </p> <a href="https://publications.waset.org/abstracts/128403/joint-path-and-push-planning-among-moveable-obstacles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128403.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">164</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">2065</span> Sperm Flagellum Center-Line Tracing in 4D Stacks Using an Iterative Minimal Path Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paul%20Hernandez-Herrera">Paul Hernandez-Herrera</a>, <a href="https://publications.waset.org/abstracts/search?q=Fernando%20Montoya"> Fernando Montoya</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20Manuel%20Rendon"> Juan Manuel Rendon</a>, <a href="https://publications.waset.org/abstracts/search?q=Alberto%20Darszon"> Alberto Darszon</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20Corkidi"> Gabriel Corkidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Intracellular calcium ([Ca2+]i) regulates sperm motility. The analysis of [Ca2+]i has been traditionally achieved in two dimensions while the real movement of the cell takes place in three spatial dimensions. Due to optical limitations (high speed cell movement and low light emission) important data concerning the three dimensional movement of these flagellated cells had been neglected. Visualizing [Ca2+]i in 3D is not a simple matter since it requires complex fluorescence microscopy techniques where the resulting images have very low intensity and consequently low SNR (Signal to Noise Ratio). In 4D sequences, this problem is magnified since the flagellum oscillates (for human sperm) at least at an average frequency of 15 Hz. In this paper, a novel approach to extract the flagellum’s center-line in 4D stacks is presented. For this purpose, an iterative algorithm based on the fast-marching method is proposed to extract the flagellum’s center-line. Quantitative and qualitative results are presented in a 4D stack to demonstrate the ability of the proposed algorithm to trace the flagellum’s center-line. The method reached a precision and recall of 0.96 as compared with a semi-manual method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flagellum" title="flagellum">flagellum</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20path" title=" minimal path"> minimal path</a>, <a href="https://publications.waset.org/abstracts/search?q=segmentation" title=" segmentation"> segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=sperm" title=" sperm"> sperm</a> </p> <a href="https://publications.waset.org/abstracts/55433/sperm-flagellum-center-line-tracing-in-4d-stacks-using-an-iterative-minimal-path-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55433.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">283</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">2064</span> Top-K Shortest Distance as a Similarity Measure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrey%20Lebedev">Andrey Lebedev</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilya%20Dmitrenok"> Ilya Dmitrenok</a>, <a href="https://publications.waset.org/abstracts/search?q=JooYoung%20Lee"> JooYoung Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Leonard%20Johard"> Leonard Johard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Top-k shortest path routing problem is an extension of finding the shortest path in a given network. Shortest path is one of the most essential measures as it reveals the relations between two nodes in a network. However, in many real world networks, whose diameters are small, top-k shortest path is more interesting as it contains more information about the network topology. Many variations to compute top-k shortest paths have been studied. In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Then, we also propose a top-k distance based graph matching algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20matching" title="graph matching">graph matching</a>, <a href="https://publications.waset.org/abstracts/search?q=link%20prediction" title=" link prediction"> link prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=shortest%20path" title=" shortest path"> shortest path</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity" title=" similarity"> similarity</a> </p> <a href="https://publications.waset.org/abstracts/63488/top-k-shortest-distance-as-a-similarity-measure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63488.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">358</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">2063</span> Soap Film Enneper Minimal Surface Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yee%20Hooi%20Min">Yee Hooi Min</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohdnasir%20Abdul%20Hadi"> Mohdnasir Abdul Hadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tensioned membrane structure in the form of Enneper minimal surface can be considered as a sustainable development for the green environment and technology, it also can be used to support the effectiveness used of energy and the structure. Soap film in the form of Enneper minimal surface model has been studied. The combination of shape and internal forces for the purpose of stiffness and strength is an important feature of membrane surface. For this purpose, form-finding using soap film model has been carried out for Enneper minimal surface models with variables u=v=0.6 and u=v=1.0. Enneper soap film models with variables u=v=0.6 and u=v=1.0 provides an alternative choice for structural engineers to consider the tensioned membrane structure in the form of Enneper minimal surface applied in the building industry. It is expected to become an alternative building material to be considered by the designer. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Enneper" title="Enneper">Enneper</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20surface" title=" minimal surface"> minimal surface</a>, <a href="https://publications.waset.org/abstracts/search?q=soap%20film" title=" soap film"> soap film</a>, <a href="https://publications.waset.org/abstracts/search?q=tensioned%20membrane%20structure" title=" tensioned membrane structure"> tensioned membrane structure</a> </p> <a href="https://publications.waset.org/abstracts/20780/soap-film-enneper-minimal-surface-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20780.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">553</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">2062</span> A Review on Comparative Analysis of Path Planning and Collision Avoidance Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Divya%20Agarwal">Divya Agarwal</a>, <a href="https://publications.waset.org/abstracts/search?q=Pushpendra%20S.%20Bharti"> Pushpendra S. Bharti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Autonomous mobile robots (AMR) are expected as smart tools for operations in every automation industry. Path planning and obstacle avoidance is the backbone of AMR as robots have to reach their goal location avoiding obstacles while traversing through optimized path defined according to some criteria such as distance, time or energy. Path planning can be classified into global and local path planning where environmental information is known and unknown/partially known, respectively. A number of sensors are used for data collection. A number of algorithms such as artificial potential field (APF), rapidly exploring random trees (RRT), bidirectional RRT, Fuzzy approach, Purepursuit, A* algorithm, vector field histogram (VFH) and modified local path planning algorithm, etc. have been used in the last three decades for path planning and obstacle avoidance for AMR. This paper makes an attempt to review some of the path planning and obstacle avoidance algorithms used in the field of AMR. The review includes comparative analysis of simulation and mathematical computations of path planning and obstacle avoidance algorithms using MATLAB 2018a. From the review, it could be concluded that different algorithms may complete the same task (i.e. with a different set of instructions) in less or more time, space, effort, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title="path planning">path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title=" obstacle avoidance"> obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=autonomous%20mobile%20robots" title=" autonomous mobile robots"> autonomous mobile robots</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithms" title=" algorithms"> algorithms</a> </p> <a href="https://publications.waset.org/abstracts/93693/a-review-on-comparative-analysis-of-path-planning-and-collision-avoidance-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93693.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">232</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2061</span> An Improved Lower Bound for Minimal-Area Convex Cover for Closed Unit Curves</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Som-Am">S. Som-Am</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Grechuk"> B. Grechuk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Moser’s worm problem is the unsolved problem in geometry which asks for the minimal area of a convex region on the plane which can cover all curves of unit length, assuming that curves may be rotated and translated to fit inside the region. We study a version of this problem asking for a minimal convex cover for closed unit curves. By combining geometric methods with numerical box’s search algorithm, we show that any such cover should have an area at least 0.0975. This improves the best previous lower bound of 0.096694. In fact, we show that the minimal area of convex hull of circle, equilateral triangle, and rectangle of perimeter 1 is between 0.0975 and 0.09763. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moser%E2%80%99s%20worm%20problem" title="Moser’s worm problem">Moser’s worm problem</a>, <a href="https://publications.waset.org/abstracts/search?q=closed%20arcs" title=" closed arcs"> closed arcs</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20cover" title=" convex cover"> convex cover</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal-area%20cover" title=" minimal-area cover"> minimal-area cover</a> </p> <a href="https://publications.waset.org/abstracts/92526/an-improved-lower-bound-for-minimal-area-convex-cover-for-closed-unit-curves" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92526.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">211</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2060</span> Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lana%20Dalawr%20Jalal">Lana Dalawr Jalal </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses the problem of ofﬂine path planning for Unmanned Aerial Vehicles (UAVs) in complex three-dimensional environment with obstacles, which is modelled by 3D Cartesian grid system. Path planning for UAVs require the computational intelligence methods to move aerial vehicles along the flight path effectively to target while avoiding obstacles. In this paper Modified Particle Swarm Optimization (MPSO) algorithm is applied to generate the optimal collision free 3D flight path for UAV. The simulations results clearly demonstrate effectiveness of the proposed algorithm in guiding UAV to the final destination by providing optimal feasible path quickly and effectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title="obstacle avoidance">obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=three-dimensional%20path%20planning%20unmanned%20aerial%20vehicles" title=" three-dimensional path planning unmanned aerial vehicles"> three-dimensional path planning unmanned aerial vehicles</a> </p> <a href="https://publications.waset.org/abstracts/26160/three-dimensional-off-line-path-planning-for-unmanned-aerial-vehicle-using-modified-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26160.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">2059</span> Path Planning for Orchard Robot Using Occupancy Grid Map in 2D Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Satyam%20Raikwar">Satyam Raikwar</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Herlitzius"> Thomas Herlitzius</a>, <a href="https://publications.waset.org/abstracts/search?q=Jens%20Fehrmann"> Jens Fehrmann</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, the autonomous navigation of orchard and field robots is an emerging technology of the mobile robotics in agriculture. One of the core aspects of autonomous navigation builds upon path planning, which is still a crucial issue. Generally, for simple representation, the path planning for a mobile robot is performed in a two-dimensional space, which creates a path between the start and goal point. This paper presents the automatic path planning approach for robots used in orchards and vineyards using occupancy grid maps with field consideration. The orchards and vineyards are usually structured environment and their topology is assumed to be constant over time; therefore, in this approach, an RGB image of a field is used as a working environment. These images undergone different image processing operations and then discretized into two-dimensional grid matrices. The individual grid or cell of these grid matrices represents the occupancy of the space, whether it is free or occupied. The grid matrix represents the robot workspace for motion and path planning. After the grid matrix is described, a probabilistic roadmap (PRM) path algorithm is used to create the obstacle-free path over these occupancy grids. The path created by this method was successfully verified in the test area. Furthermore, this approach is used in the navigation of the orchard robot. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=orchard%20robots" title="orchard robots">orchard robots</a>, <a href="https://publications.waset.org/abstracts/search?q=automatic%20path%20planning" title=" automatic path planning"> automatic path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=occupancy%20grid" title=" occupancy grid"> occupancy grid</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20roadmap" title=" probabilistic roadmap"> probabilistic roadmap</a> </p> <a href="https://publications.waset.org/abstracts/110023/path-planning-for-orchard-robot-using-occupancy-grid-map-in-2d-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110023.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">155</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">2058</span> Independence and Path Independence on Cayley Digraphs of Left Groups and Right Groups</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nuttawoot%20Nupo">Nuttawoot Nupo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sayan%20Panma"> Sayan Panma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A semigroup S is said to be a left (right) zero semigroup if S satisfies the equation xy=x (xy=y) for all x,y in S. In addition, the semigroup S is called a left (right) group if S is isomorphic to the direct product of a group and a left (right) zero semigroup. The Cayley digraph Cay(S,A) of a semigroup S with a connection set A is defined to be a digraph with the vertex set S and the arc set E(Cay(S,A))={(x,xa) | x∈S, a∈A} where A is any subset of S. All sets in this research are assumed to be finite. Let D be a digraph together with a vertex set V and an arc set E. Let u and v be two different vertices in V and I a nonempty subset of V. The vertices u and v are said to be independent if (u,v)∉E and (v,u)∉E. The set I is called an independent set of D if any two different vertices in I are independent. The independence number of D is the maximum cardinality of an independent set of D. Moreover, the vertices u and v are said to be path independent if there is no dipath from u to v and there is no dipath from v to u. The set I is called a path independent set of D if any two different vertices in I are path independent. The path independence number of D is the maximum cardinality of a path independent set of D. In this research, we describe a lower bound and an upper bound of the independence number of Cayley digraphs of left groups and right groups. Some examples corresponding to those bounds are illustrated here. Furthermore, the exact value of the path independence number of Cayley digraphs of left groups and right groups are also presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cayley%20digraphs" title="Cayley digraphs">Cayley digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=independence%20number" title=" independence number"> independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=left%20groups" title=" left groups"> left groups</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20independence%20number" title=" path independence number"> path independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=right%20groups" title=" right groups"> right groups</a> </p> <a href="https://publications.waset.org/abstracts/59306/independence-and-path-independence-on-cayley-digraphs-of-left-groups-and-right-groups" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59306.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">231</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">2057</span> Optimizing Network Latency with Fast Path Assignment for Incoming Flows</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qing%20Lyu">Qing Lyu</a>, <a href="https://publications.waset.org/abstracts/search?q=Hang%20Zhu"> Hang Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Various flows in the network require to go through different types of middlebox. The improper placement of network middlebox and path assignment for flows could greatly increase the network latency and also decrease the performance of network. Minimizing the total end to end latency of all the ows requires to assign path for the incoming flows. In this paper, the flow path assignment problem in regard to the placement of various kinds of middlebox is studied. The flow path assignment problem is formulated to a linear programming problem, which is very time consuming. On the other hand, a naive greedy algorithm is studied. Which is very fast but causes much more latency than the linear programming algorithm. At last, the paper presents a heuristic algorithm named FPA, which takes bottleneck link information and estimated bandwidth occupancy into consideration, and achieves near optimal latency in much less time. Evaluation results validate the effectiveness of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flow%20path" title="flow path">flow path</a>, <a href="https://publications.waset.org/abstracts/search?q=latency" title=" latency"> latency</a>, <a href="https://publications.waset.org/abstracts/search?q=middlebox" title=" middlebox"> middlebox</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a> </p> <a href="https://publications.waset.org/abstracts/103177/optimizing-network-latency-with-fast-path-assignment-for-incoming-flows" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103177.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">207</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">2056</span> Copula-Based Estimation of Direct and Indirect Effects in Path Analysis Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alam%20Ali">Alam Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashok%20Kumar%20Pathak"> Ashok Kumar Pathak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Path analysis is a statistical technique used to evaluate the direct and indirect effects of variables in path models. One or more structural regression equations are used to estimate a series of parameters in path models to find the better fit of data. However, sometimes the assumptions of classical regression models, such as ordinary least squares (OLS), are violated by the nature of the data, resulting in insignificant direct and indirect effects of exogenous variables. This article aims to explore the effectiveness of a copula-based regression approach as an alternative to classical regression, specifically when variables are linked through an elliptical copula. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=path%20analysis" title="path analysis">path analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=copula-based%20regression%20models" title=" copula-based regression models"> copula-based regression models</a>, <a href="https://publications.waset.org/abstracts/search?q=direct%20and%20indirect%20effects" title=" direct and indirect effects"> direct and indirect effects</a>, <a href="https://publications.waset.org/abstracts/search?q=k-fold%20cross%20validation%20technique" title=" k-fold cross validation technique"> k-fold cross validation technique</a> </p> <a href="https://publications.waset.org/abstracts/186900/copula-based-estimation-of-direct-and-indirect-effects-in-path-analysis-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186900.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">41</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">2055</span> Eliminating Cutter-Path Deviation For Five-Axis Nc Machining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alan%20C.%20Lin">Alan C. Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Tsong%20Der%20Lin"> Tsong Der Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study proposes a deviation control method to add interpolation points to numerical control (NC) codes of five-axis machining in order to achieve the required machining accuracy. Specific research issues include: (1) converting machining data between the CL (cutter location) domain and the NC domain, (2) calculating the deviation between the deviated path and the linear path, (3) finding interpolation points, and (4) determining tool orientations for the interpolation points. System implementation with practical examples will also be included to highlight the applicability of the proposed methodology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CAD%2FCAM" title="CAD/CAM">CAD/CAM</a>, <a href="https://publications.waset.org/abstracts/search?q=cutter%20path" title=" cutter path"> cutter path</a>, <a href="https://publications.waset.org/abstracts/search?q=five-axis%20machining" title=" five-axis machining"> five-axis machining</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20control" title=" numerical control"> numerical control</a> </p> <a href="https://publications.waset.org/abstracts/30394/eliminating-cutter-path-deviation-for-five-axis-nc-machining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30394.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">424</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2054</span> Critical Path Segments Method for Scheduling Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sherif%20M.%20Hafez">Sherif M. Hafez</a>, <a href="https://publications.waset.org/abstracts/search?q=Remon%20F.%20Aziz"> Remon F. Aziz</a>, <a href="https://publications.waset.org/abstracts/search?q=May%20S.%20A.%20Elalim"> May S. A. Elalim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Project managers today rely on scheduling tools based on the Critical Path Method (CPM) to determine the overall project duration and the activities’ float times which lead to greater efficiency in planning and control of projects. CPM was useful for scheduling construction projects, but researchers had highlighted a number of serious drawbacks that limit its use as a decision support tool and lacks the ability to clearly record and represent detailed information. This paper discusses the drawbacks of CPM as a scheduling technique and presents a modified critical path method (CPM) model which is called critical path segments (CPS). The CPS scheduling mechanism addresses the problems of CPM in three ways: decomposing the activity duration of separated but connected time segments; all relationships among activities are converted into finish–to–start relationship; and analysis and calculations are made with forward path. Sample cases are included to illustrate the shortages in CPM, CPS full analysis and calculations are explained in details, and how schedules can be handled better with the CPS technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=construction%20management" title="construction management">construction management</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20path%20method" title=" critical path method"> critical path method</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20path%20segments" title=" critical path segments"> critical path segments</a>, <a href="https://publications.waset.org/abstracts/search?q=forward%20pass" title=" forward pass"> forward pass</a>, <a href="https://publications.waset.org/abstracts/search?q=float" title=" float"> float</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20control" title=" project control"> project control</a> </p> <a href="https://publications.waset.org/abstracts/17760/critical-path-segments-method-for-scheduling-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17760.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">352</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">2053</span> Understanding Relationships between Listening to Music and Pronunciation Learning: An Investigation Based upon Japanese EFL Learners' Self-Evaluation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hirokatsu%20Kawashima">Hirokatsu Kawashima</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In an attempt to elucidate relationships between listening to music and pronunciation learning, a classroom-based investigation was conducted with Japanese EFL learners (n=45). The subjects were instructed to listen to English songs they liked on YouTube, especially paying attention to phonologically similar vowel and consonant minimal pair words (e.g., live and leave). This kind of activity, which included taking notes, was regularly carried out in the classroom, and the same kind of task was given to the subjects as homework in order to reinforce the in-class activity. The duration of these activities was eight weeks, after which the program was evaluated on a 9-point scale (1: the lowest and 9: the highest) by learners’ self-evaluation. The main questions for this evaluation included 1) how good the learners had been at pronouncing vowel and consonant minimal pair words originally, 2) how often they had listened to songs good for pronouncing vowel and consonant minimal pair words, 3) how frequently they had moved their mouths to vowel and consonant minimal pair words of English songs, and 4) how much they thought the program would support and enhance their pronunciation learning of phonologically similar vowel and consonant minimal pair words. It has been found, for example, A) that the evaluation of this program is by no means low (Mean: 6.51 and SD: 1.23), suggesting that listening to music may support and enhance pronunciation learning, and B) that listening to consonant minimal pair words in English songs and moving the mouth to them are more related to the program’s evaluation (r =.69, p=.00 and r =.55, p=.00, respectively) than listening to vowel minimal pair words in English songs and moving the mouth to them (r =.45, p=.00 and r =.39, p=.01, respectively). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=minimal%20pair" title="minimal pair">minimal pair</a>, <a href="https://publications.waset.org/abstracts/search?q=music" title=" music"> music</a>, <a href="https://publications.waset.org/abstracts/search?q=pronunciation" title=" pronunciation"> pronunciation</a>, <a href="https://publications.waset.org/abstracts/search?q=song" title=" song"> song</a> </p> <a href="https://publications.waset.org/abstracts/7949/understanding-relationships-between-listening-to-music-and-pronunciation-learning-an-investigation-based-upon-japanese-efl-learners-self-evaluation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7949.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">318</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2052</span> Effect of Phonological Complexity in Children with Specific Language Impairment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Irfana%20M.">Irfana M.</a>, <a href="https://publications.waset.org/abstracts/search?q=Priyandi%20Kabasi"> Priyandi Kabasi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Children with specific language impairment (SLI) have difficulty acquiring and using language despite having all the requirements of cognitive skills to support language acquisition. These children have normal non-verbal intelligence, hearing, and oral-motor skills, with no history of social/emotional problems or significant neurological impairment. Nevertheless, their language acquisition lags behind their peers. Phonological complexity can be considered to be the major factor that causes the inaccurate production of speech in this population. However, the implementation of various ranges of complex phonological stimuli in the treatment session of SLI should be followed for a better prognosis of speech accuracy. Hence there is a need to study the levels of phonological complexity. The present study consisted of 7 individuals who were diagnosed with SLI and 10 developmentally normal children. All of them were Hindi speakers with both genders and their age ranged from 4 to 5 years. There were 4 sets of stimuli; among them were minimal contrast vs maximal contrast nonwords, minimal coarticulation vs maximal coarticulation nonwords, minimal contrast vs maximal contrast words and minimal coarticulation vs maximal coarticulation words. Each set contained 10 stimuli and participants were asked to repeat each stimulus. Results showed that production of maximal contrast was significantly accurate, followed by minimal coarticulation, minimal contrast and maximal coarticulation. A similar trend was shown for both word and non-word categories of stimuli. The phonological complexity effect was evident in the study for each participant group. Moreover, present study findings can be implemented for the management of SLI, specifically for the selection of stimuli. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coarticulation" title="coarticulation">coarticulation</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20contrast" title=" minimal contrast"> minimal contrast</a>, <a href="https://publications.waset.org/abstracts/search?q=phonological%20complexity" title=" phonological complexity"> phonological complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=specific%20language%20impairment" title=" specific language impairment"> specific language impairment</a> </p> <a href="https://publications.waset.org/abstracts/146147/effect-of-phonological-complexity-in-children-with-specific-language-impairment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/146147.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">2051</span> Nonparametric Path Analysis with Truncated Spline Approach in Modeling Rural Poverty in Indonesia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Usriatur%20Rohma">Usriatur Rohma</a>, <a href="https://publications.waset.org/abstracts/search?q=Adji%20Achmad%20Rinaldo%20Fernandes"> Adji Achmad Rinaldo Fernandes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nonparametric path analysis is a statistical method that does not rely on the assumption that the curve is known. The purpose of this study is to determine the best nonparametric truncated spline path function between linear and quadratic polynomial degrees with 1, 2, and 3-knot points and to determine the significance of estimating the best nonparametric truncated spline path function in the model of the effect of population migration and agricultural economic growth on rural poverty through the variable unemployment rate using the t-test statistic at the jackknife resampling stage. The data used in this study are secondary data obtained from statistical publications. The results showed that the best model of nonparametric truncated spline path analysis is quadratic polynomial degree with 3-knot points. In addition, the significance of the best-truncated spline nonparametric path function estimation using jackknife resampling shows that all exogenous variables have a significant influence on the endogenous variables. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonparametric%20path%20analysis" title="nonparametric path analysis">nonparametric path analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=truncated%20spline" title=" truncated spline"> truncated spline</a>, <a href="https://publications.waset.org/abstracts/search?q=linear" title=" linear"> linear</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic" title=" quadratic"> quadratic</a>, <a href="https://publications.waset.org/abstracts/search?q=rural%20poverty" title=" rural poverty"> rural poverty</a>, <a href="https://publications.waset.org/abstracts/search?q=jackknife%20resampling" title=" jackknife resampling"> jackknife resampling</a> </p> <a href="https://publications.waset.org/abstracts/186676/nonparametric-path-analysis-with-truncated-spline-approach-in-modeling-rural-poverty-in-indonesia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186676.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">46</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">2050</span> Analysis of Path Nonparametric Truncated Spline Maximum Cubic Order in Farmers Loyalty Modeling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adji%20Achmad%20Rinaldo%20Fernandes">Adji Achmad Rinaldo Fernandes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Path analysis tests the relationship between variables through cause and effect. Before conducting further tests on path analysis, the assumption of linearity must be met. If the shape of the relationship is not linear and the shape of the curve is unknown, then use a nonparametric approach, one of which is a truncated spline. The purpose of this study is to estimate the function and get the best model on the nonparametric truncated spline path of linear, quadratic, and cubic orders with 1 and 2-knot points and determine the significance of the best function estimator in modeling farmer loyalty through the jackknife resampling method. This study uses secondary data through questionnaires to farmers in Sumbawa Regency who use SP-36 subsidized fertilizer products as many as 100 respondents. Based on the results of the analysis, it is known that the best-truncated spline nonparametric path model is the quadratic order of 2 knots with a coefficient of determination of 85.50%; the significance of the best-truncated spline nonparametric path estimator shows that all exogenous variables have a significant effect on endogenous variables. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonparametric%20path%20analysis" title="nonparametric path analysis">nonparametric path analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=farmer%20loyalty" title=" farmer loyalty"> farmer loyalty</a>, <a href="https://publications.waset.org/abstracts/search?q=jackknife%20resampling" title=" jackknife resampling"> jackknife resampling</a>, <a href="https://publications.waset.org/abstracts/search?q=truncated%20spline" title=" truncated spline"> truncated spline</a> </p> <a href="https://publications.waset.org/abstracts/186760/analysis-of-path-nonparametric-truncated-spline-maximum-cubic-order-in-farmers-loyalty-modeling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186760.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">46</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">2049</span> Generalized Central Paths for Convex Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li-Zhi%20Liao">Li-Zhi Liao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The central path has played the key role in the interior point method. However, the convergence of the central path may not be true even in some convex programming problems with linear constraints. In this paper, the generalized central paths are introduced for convex programming. One advantage of the generalized central paths is that the paths will always converge to some optimal solutions of the convex programming problem for any initial interior point. Some additional theoretical properties for the generalized central paths will be also reported. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=central%20path" title="central path">central path</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20programming" title=" convex programming"> convex programming</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path" title=" generalized central path"> generalized central path</a>, <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20method" title=" interior point method"> interior point method</a> </p> <a href="https://publications.waset.org/abstracts/58039/generalized-central-paths-for-convex-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58039.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">327</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2048</span> Construction Project Planning Using Fuzzy Critical Path Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Omar%20M.%20Aldenali">Omar M. Aldenali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Planning is one of the most important phases of the management science and network planning, which represents the project activities relationship. Critical path is one of the project management techniques used to plan and control the execution of a project activities. The objective of this paper is to implement a fuzzy logic approach to arrange network planning on construction projects. This method is used to finding out critical path in the fuzzy construction project network. The trapezoidal fuzzy numbers are used to represent the activity construction project times. A numerical example that represents a house construction project is introduced. The critical path method is implemented on the fuzzy construction network activities, and the results showed that this method significantly affects the completion time of the construction projects. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=construction%20project" title="construction project">construction project</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20path" title=" critical path"> critical path</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20network%20project" title=" fuzzy network project"> fuzzy network project</a>, <a href="https://publications.waset.org/abstracts/search?q=planning" title=" planning"> planning</a> </p> <a href="https://publications.waset.org/abstracts/111693/construction-project-planning-using-fuzzy-critical-path-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/111693.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">143</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">2047</span> Graphical Theoretical Construction of Discrete time Share Price Paths from Matroid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Min%20Wang">Min Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Sergey%20Utev"> Sergey Utev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The lessons from the 2007-09 global financial crisis have driven scientific research, which considers the design of new methodologies and financial models in the global market. The quantum mechanics approach was introduced in the unpredictable stock market modeling. One famous quantum tool is Feynman path integral method, which was used to model insurance risk by Tamturk and Utev and adapted to formalize the path-dependent option pricing by Hao and Utev. The research is based on the path-dependent calculation method, which is motivated by the Feynman path integral method. The path calculation can be studied in two ways, one way is to label, and the other is computational. Labeling is a part of the representation of objects, and generating functions can provide many different ways of representing share price paths. In this paper, the recent works on graphical theoretical construction of individual share price path via matroid is presented. Firstly, a study is done on the knowledge of matroid, relationship between lattice path matroid and Tutte polynomials and ways to connect points in the lattice path matroid and Tutte polynomials is suggested. Secondly, It is found that a general binary tree can be validly constructed from a connected lattice path matroid rather than general lattice path matroid. Lastly, it is suggested that there is a way to represent share price paths via a general binary tree, and an algorithm is developed to construct share price paths from general binary trees. A relationship is also provided between lattice integer points and Tutte polynomials of a transversal matroid. Use this way of connection together with the algorithm, a share price path can be constructed from a given connected lattice path matroid. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20construction" title="combinatorial construction">combinatorial construction</a>, <a href="https://publications.waset.org/abstracts/search?q=graphical%20representation" title=" graphical representation"> graphical representation</a>, <a href="https://publications.waset.org/abstracts/search?q=matroid" title=" matroid"> matroid</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20calculation" title=" path calculation"> path calculation</a>, <a href="https://publications.waset.org/abstracts/search?q=share%20price" title=" share price"> share price</a>, <a href="https://publications.waset.org/abstracts/search?q=Tutte%20polynomial" title=" Tutte polynomial "> Tutte polynomial </a> </p> <a href="https://publications.waset.org/abstracts/118431/graphical-theoretical-construction-of-discrete-time-share-price-paths-from-matroid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118431.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">138</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">2046</span> Retraction Free Motion Approach and Its Application in Automated Robotic Edge Finishing and Inspection Processes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Nemer">M. Nemer</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20I.%20Konukseven"> E. I. Konukseven</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a motion generation algorithm for a six Degrees of Freedom (DoF) robotic hand in a static environment is presented. The purpose of developing this method is to be used in the path generation of the end-effector for edge finishing and inspection processes by utilizing the CAD model of the considered workpiece. Nonetheless, the proposed algorithm may be extended to be applicable for other similar manufacturing processes. A software package programmed in the application programming interface (API) of SolidWorks generates tool path data for the robot. The proposed method significantly simplifies the given problem, resulting in a reduction in the CPU time needed to generate the path, and offers an efficient overall solution. The ABB IRB2000 robot is chosen for executing the generated tool path. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CAD-based%20tools" title="CAD-based tools">CAD-based tools</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20deburring" title=" edge deburring"> edge deburring</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20scanning" title=" edge scanning"> edge scanning</a>, <a href="https://publications.waset.org/abstracts/search?q=offline%20programming" title=" offline programming"> offline programming</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20generation" title=" path generation"> path generation</a> </p> <a href="https://publications.waset.org/abstracts/57270/retraction-free-motion-approach-and-its-application-in-automated-robotic-edge-finishing-and-inspection-processes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57270.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">2045</span> Path-Spin to Spin-Spin Hybrid Quantum Entanglement: A Conversion Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Indranil%20Bayal">Indranil Bayal</a>, <a href="https://publications.waset.org/abstracts/search?q=Pradipta%20Panchadhyayee"> Pradipta Panchadhyayee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Path-spin hybrid entanglement generated and confined in a single spin-1/2 particle is converted to spin-spin hybrid interparticle entanglement, which finds its important applications in quantum information processing. This protocol uses beam splitter, spin flipper, spin measurement, classical channel, unitary transformations, etc., and requires no collective operation on the pair of particles whose spin variables share complete entanglement after the accomplishment of the protocol. The specialty of the protocol lies in the fact that the path-spin entanglement is transferred between spin degrees of freedom of two separate particles initially possessed by a single party. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=entanglement" title="entanglement">entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=path-spin%20entanglement" title=" path-spin entanglement"> path-spin entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=spin-spin%20entanglement" title=" spin-spin entanglement"> spin-spin entanglement</a>, <a href="https://publications.waset.org/abstracts/search?q=CNOT%20operation" title=" CNOT operation"> CNOT operation</a> </p> <a href="https://publications.waset.org/abstracts/142538/path-spin-to-spin-spin-hybrid-quantum-entanglement-a-conversion-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142538.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">198</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">2044</span> An Algorithm to Find Fractional Edge Domination Number and Upper Fractional Edge Domination Number of an Intuitionistic Fuzzy Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karunambigai%20Mevani%20Govindasamy">Karunambigai Mevani Govindasamy</a>, <a href="https://publications.waset.org/abstracts/search?q=Sathishkumar%20Ayyappan"> Sathishkumar Ayyappan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we formulate the algorithm to find out the dominating function parameters of Intuitionistic Fuzzy Graphs(IFG). The methodology we adopted here is converting any physical problem into an IFG, and that has been transformed into Intuitionistic Fuzzy Matrix. Using Linear Program Solver software (LiPS), we found the defined parameters for the given IFG. We obtained these parameters for a path and cycle IFG. This study can be extended to other varieties of IFG. In particular, we obtain the definition of edge dominating function, minimal edge dominating function, fractional edge domination number (γ_if^') and upper fractional edge domination number (Γ_if^') of an intuitionistic fuzzy graph. Also, we formulated an algorithm which is appropriate to work on LiPS to find fractional edge domination number and upper fractional edge domination number of an IFG. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractional%20edge%20domination%20number" title="fractional edge domination number">fractional edge domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitionistic%20fuzzy%20cycle" title=" intuitionistic fuzzy cycle"> intuitionistic fuzzy cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitionistic%20fuzzy%20graph" title=" intuitionistic fuzzy graph"> intuitionistic fuzzy graph</a>, <a href="https://publications.waset.org/abstracts/search?q=intuitionistic%20fuzzy%20path" title=" intuitionistic fuzzy path"> intuitionistic fuzzy path</a> </p> <a href="https://publications.waset.org/abstracts/112004/an-algorithm-to-find-fractional-edge-domination-number-and-upper-fractional-edge-domination-number-of-an-intuitionistic-fuzzy-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112004.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">174</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">2043</span> The Effect of Critical Activity on Critical Path and Project Duration in Precedence Diagram Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Nisar">J. Nisar</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Halim"> S. Halim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between activity in Precedence Diagram Method (PDM) provides a more flexible schedule than traditional Critical Path Method (CPM). But, changing the duration of critical activities in the PDM network will have an anomalous effect on the critical path and the project completion date. In this study, we classified the critical activities in two groups i.e., 1. activity on single critical path and 2. activity on multi-critical paths, and six classes i.e., normal, reverse, neutral, perverse, decrease-reverse and increase-normal, based on their effects on project duration in PDM. Furthermore, we determined the maximum float of time by which the duration each type of critical activities can be changed without effecting the project duration. This study would help the project manager to clearly understand the behavior of each critical activity on critical path, and he/she would be able to change the project duration by shortening or lengthening activities based on project budget and project deadline. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=construction%20management" title="construction management">construction management</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20path%20method" title=" critical path method"> critical path method</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20scheduling%20network" title=" project scheduling network"> project scheduling network</a>, <a href="https://publications.waset.org/abstracts/search?q=precedence%20diagram%20method" title=" precedence diagram method"> precedence diagram method</a> </p> <a href="https://publications.waset.org/abstracts/97001/the-effect-of-critical-activity-on-critical-path-and-project-duration-in-precedence-diagram-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97001.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">2042</span> Integer Programming Model for the Network Design Problem with Facility Dependent Shortest Path Routing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Taehan%20Lee">Taehan Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider a network design problem which has shortest routing restriction based on the values determined by the installed facilities on each arc. In conventional multicommodity network design problem, a commodity can be routed through any possible path when the capacity is available. But, we consider a problem in which the commodity between two nodes must be routed on a path which has shortest metric value and the link metric value is determined by the installed facilities on the link. By this routing restriction, the problem has a distinct characteristic. We present an integer programming formulation containing the primal-dual optimality conditions to the shortest path routing. We give some computational results for the model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multicommodity%20network%20design" title=" multicommodity network design"> multicommodity network design</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=shortest%20path" title=" shortest path"> shortest path</a> </p> <a href="https://publications.waset.org/abstracts/51447/integer-programming-model-for-the-network-design-problem-with-facility-dependent-shortest-path-routing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51447.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">420</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">2041</span> Services-Oriented Model for the Regulation of Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Bendahmane">Mohamed Bendahmane</a>, <a href="https://publications.waset.org/abstracts/search?q=Brahim%20Elfalaki"> Brahim Elfalaki</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Benattou"> Mohammed Benattou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the major sources of learners' professional difficulties is their heterogeneity. Whether on cognitive, social, cultural or emotional level, learners being part of the same group have many differences. These differences do not allow to apply the same learning process at all learners. Thus, an optimal learning path for one, is not necessarily the same for the other. We present in this paper a model-oriented service to offer to each learner a personalized learning path to acquire the targeted skills. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=learning%20path" title="learning path">learning path</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20service" title=" web service"> web service</a>, <a href="https://publications.waset.org/abstracts/search?q=trace%20analysis" title=" trace analysis"> trace analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=personalization" title=" personalization"> personalization</a> </p> <a href="https://publications.waset.org/abstracts/50834/services-oriented-model-for-the-regulation-of-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50834.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">356</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">2040</span> Nonparametric Path Analysis with a Truncated Spline Approach in Modeling Waste Management Behavior Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adji%20Achmad%20Rinaldo%20Fernandes">Adji Achmad Rinaldo Fernandes</a>, <a href="https://publications.waset.org/abstracts/search?q=Usriatur%20Rohma"> Usriatur Rohma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nonparametric path analysis is a statistical method that does not rely on the assumption that the curve is known. The purpose of this study is to determine the best truncated spline nonparametric path function between linear and quadratic polynomial degrees with 1, 2, and 3 knot points and to determine the significance of estimating the best truncated spline nonparametric path function in the model of the effect of perceived benefits and perceived convenience on behavior to convert waste into economic value through the intention variable of changing people's mindset about waste using the t test statistic at the jackknife resampling stage. The data used in this study are primary data obtained from research grants. The results showed that the best model of nonparametric truncated spline path analysis is quadratic polynomial degree with 3 knot points. In addition, the significance of the best truncated spline nonparametric path function estimation using jackknife resampling shows that all exogenous variables have a significant influence on the endogenous variables. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonparametric%20path%20analysis" title="nonparametric path analysis">nonparametric path analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=truncated%20spline" title=" truncated spline"> truncated spline</a>, <a href="https://publications.waset.org/abstracts/search?q=linear" title=" linear"> linear</a>, <a href="https://publications.waset.org/abstracts/search?q=kuadratic" title=" kuadratic"> kuadratic</a>, <a href="https://publications.waset.org/abstracts/search?q=behavior%20to%20turn%20waste%20into%20economic%20value" title=" behavior to turn waste into economic value"> behavior to turn waste into economic value</a>, <a href="https://publications.waset.org/abstracts/search?q=jackknife%20resampling" title=" jackknife resampling"> jackknife resampling</a> </p> <a href="https://publications.waset.org/abstracts/188223/nonparametric-path-analysis-with-a-truncated-spline-approach-in-modeling-waste-management-behavior-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/188223.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">47</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">2039</span> Quantum Mechanism Approach for Non-Ruin Probability and Comparison of Path Integral Method and Stochastic Simulations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmet%20Kaya">Ahmet Kaya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum mechanism is one of the most important approaches to calculating non-ruin probability. We apply standard Dirac notation to model given Hamiltonians. By using the traditional method and eigenvector basis, non-ruin probability is found for several examples. Also, non-ruin probability is calculated for two different Hamiltonian by using the tensor product. Finally, the path integral method is applied to the examples and comparison is made for stochastic simulations and path integral calculation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20physics" title="quantum physics">quantum physics</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20system" title=" Hamiltonian system"> Hamiltonian system</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20integral" title=" path integral"> path integral</a>, <a href="https://publications.waset.org/abstracts/search?q=tensor%20product" title=" tensor product"> tensor product</a>, <a href="https://publications.waset.org/abstracts/search?q=ruin%20probability" title=" ruin probability"> ruin probability</a> </p> <a href="https://publications.waset.org/abstracts/56920/quantum-mechanism-approach-for-non-ruin-probability-and-comparison-of-path-integral-method-and-stochastic-simulations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56920.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">334</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">2038</span> The Use of Ward Linkage in Cluster Integration with a Path Analysis Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adji%20Achmad%20Rinaldo%20Fernandes">Adji Achmad Rinaldo Fernandes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Path analysis is an analytical technique to study the causal relationship between independent and dependent variables. In this study, the integration of Clusters in the Ward Linkage method was used in a variety of clusters with path analysis. The variables used are character (x₁), capacity (x₂), capital (x₃), collateral (x₄), and condition of economy (x₄) to on time pay (y₂) through the variable willingness to pay (y₁). The purpose of this study was to compare the Ward Linkage method cluster integration in various clusters with path analysis to classify willingness to pay (y₁). The data used are primary data from questionnaires filled out by customers of Bank X, using purposive sampling. The measurement method used is the average score method. The results showed that the Ward linkage method cluster integration with path analysis on 2 clusters is the best method, by comparing the coefficient of determination. Variable character (x₁), capacity (x₂), capital (x₃), collateral (x₄), and condition of economy (x₅) to on time pay (y₂) through willingness to pay (y₁) can be explained by 58.3%, while the remaining 41.7% is explained by variables outside the model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cluster%20integration" title="cluster integration">cluster integration</a>, <a href="https://publications.waset.org/abstracts/search?q=linkage" title=" linkage"> linkage</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20analysis" title=" path analysis"> path analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=compliant%20paying%20behavior" title=" compliant paying behavior"> compliant paying behavior</a> </p> <a href="https://publications.waset.org/abstracts/135016/the-use-of-ward-linkage-in-cluster-integration-with-a-path-analysis-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/135016.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">186</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">2037</span> Number of Necessary Parameters for Parametrization of Stabilizing Controllers for two times two RHinf Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kazuyoshi%20Mori">Kazuyoshi Mori</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider the number of parameters for the parametrization of stabilizing controllers for RHinf systems with size 2 × 2. Fortunately, any plant of this model can admit doubly coprime factorization. Thus we can use the Youla parameterization to parametrize the stabilizing contollers . However, Youla parameterization does not give itself the minimal number of parameters. This paper shows that the minimal number of parameters is four. As a result, we show that the Youla parametrization naturally gives the parameterization of stabilizing controllers with minimal numbers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RHinfo" title="RHinfo">RHinfo</a>, <a href="https://publications.waset.org/abstracts/search?q=parameterization" title=" parameterization"> parameterization</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20parameters" title=" number of parameters"> number of parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-input" title=" multi-input"> multi-input</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-output%20systems" title=" multi-output systems"> multi-output systems</a> </p> <a href="https://publications.waset.org/abstracts/33703/number-of-necessary-parameters-for-parametrization-of-stabilizing-controllers-for-two-times-two-rhinf-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33703.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">407</span> </span> </div> </div> <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=minimal%20path&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&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=minimal%20path&page=68">68</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&page=69">69</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=minimal%20path&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>