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: glide path ratio</title> <meta name="description" content="Search results for: glide path ratio"> <meta name="keywords" content="glide path ratio"> <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="glide path ratio" 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="glide path ratio"> <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> 5767</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: glide path ratio</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5767</span> Theoretical Research for Influence of Irradiation on Transient Creep of Metals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pavlo%20Selyshchev">Pavlo Selyshchev</a>, <a href="https://publications.waset.org/abstracts/search?q=Tetiana%20Didenko"> Tetiana Didenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Via formalism of the Complex systems and in the framework of the climb - glide model a theoretical approach to describe the influence of irradiation on transient creep of metals. We consider metal under such stress and conditions of irradiation at which creep is determined by dislocation motion that consists in climb and glide. It is shown that there are qualitatively different regimes of a creep as a result of irradiation. Simulation and analysis of this phenomenon are performed. The time dependence of creep rate of metal under an irradiation is theoretically obtained. The conditions of zero minimums of the creep-rate existence as well as the times of their appearance are determined. The changing of the position of creep-rate dips in the conditions of the temperature exposure change is investigated. The obtained results are compared with the experimentally observed dependence of the creep rate on time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=creep" title="creep">creep</a>, <a href="https://publications.waset.org/abstracts/search?q=climb%20and%20glide%20of%20dislocations" title=" climb and glide of dislocations"> climb and glide of dislocations</a>, <a href="https://publications.waset.org/abstracts/search?q=irradiation" title=" irradiation"> irradiation</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20feed-back" title=" non-linear feed-back"> non-linear feed-back</a>, <a href="https://publications.waset.org/abstracts/search?q=point%20defects" title=" point defects"> point defects</a> </p> <a href="https://publications.waset.org/abstracts/55261/theoretical-research-for-influence-of-irradiation-on-transient-creep-of-metals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55261.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">201</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">5766</span> Theoretical Approach to Kinetics of Transient Plasticity of Metals under Irradiation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pavlo%20Selyshchev">Pavlo Selyshchev</a>, <a href="https://publications.waset.org/abstracts/search?q=Tetiana%20Didenko"> Tetiana Didenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Within the framework of the obstacle radiation hardening and the dislocation climb-glide model a theoretical approach is developed to describe peculiarities of transient plasticity of metal under irradiation. It is considered nonlinear dynamics of accumulation of point defects (vacancies and interstitial atoms). We consider metal under such stress and conditions of irradiation at which creep is determined by dislocation motion: dislocations climb obstacles and glide between obstacles. It is shown that the rivalry between vacancy and interstitial fluxes to dislocation leads to fractures of plasticity time dependence. Simulation and analysis of this phenomenon are performed. Qualitatively different regimes of transient plasticity under irradiation are found. The fracture time is obtained. The theoretical results are compared with the experimental ones. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=climb%20and%20glide%20of%20dislocations" title="climb and glide of dislocations">climb and glide of dislocations</a>, <a href="https://publications.waset.org/abstracts/search?q=fractures%20of%20transient%20plasticity" title=" fractures of transient plasticity"> fractures of transient plasticity</a>, <a href="https://publications.waset.org/abstracts/search?q=irradiation" title=" irradiation"> irradiation</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20feed-back" title=" non-linear feed-back"> non-linear feed-back</a>, <a href="https://publications.waset.org/abstracts/search?q=point%20defects" title=" point defects"> point defects</a> </p> <a href="https://publications.waset.org/abstracts/55262/theoretical-approach-to-kinetics-of-transient-plasticity-of-metals-under-irradiation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55262.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">202</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">5765</span> Aerodynamic Effects of Ice and Its Influences on Flight Characteristics of Low Speed Unmanned Aerial Vehicles </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=I.%20McAndrew">I. McAndrew</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20L.%20Witcher"> K. L. Witcher</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Navarro"> E. Navarro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the theory and application of low-speed flight for unmanned aerial vehicles when subjected to surface environmental conditions such as ice on the leading edge and upper surface. A model was developed and tested in a wind tunnel to see how theory compares with practice at various speed including take-off, landing and operational applications where head winds substantially alter parameters. Furthermore, a comparison is drawn with maned operations and how that this subject is currently under-supported with accurate theory or knowledge for designers or operators to make informed decision or accommodate individual applications. The effects of ice formation for lift and drag are determined for a range of different angles of attacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aerodynamics" title="aerodynamics">aerodynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=environmental%20influences" title=" environmental influences"> environmental influences</a>, <a href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio" title=" glide path ratio"> glide path ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=unmanned%20vehicles" title=" unmanned vehicles"> unmanned vehicles</a> </p> <a href="https://publications.waset.org/abstracts/46883/aerodynamic-effects-of-ice-and-its-influences-on-flight-characteristics-of-low-speed-unmanned-aerial-vehicles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46883.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">330</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">5764</span> Optimal Path Motion of Positional Electric Drive</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Grigoryev">M. A. Grigoryev</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20N.%20Shishkov"> A. N. Shishkov</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20V.%20Savosteenko"> N. V. Savosteenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article identifies optimal path motion of positional electric drive, for example, the feed of cold pilgering mill. It is shown that triangle is the optimum shape of the speed curve, and the ratio of its sides depends on the type of load diagram, in particular from the influence of the main drive of pilgering mill, and is not dependent on the presence of backlash and elasticity in the system. This thesis is proved analytically, and confirmed the results are obtained by a mathematical model that take into account the influence of the main drive-to-drive feed. By statistical analysis of oscillograph traces obtained on the real object allowed to give recommendations on the optimal control of the electric drive feed cold pilgering mill 450. Based on the data that the load torque depends on by hit the pipe in rolls of pilgering mill, occurs in the interval (0,6…0,75) tc, the recommended ratio of start time to the braking time is 2:1. Optimized path motion allowed get up to 25% more RMS torque for the cycle that allowed increased the productivity of the mill. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20curve%20speed" title="optimal curve speed">optimal curve speed</a>, <a href="https://publications.waset.org/abstracts/search?q=positional%20electric%20drive" title=" positional electric drive"> positional electric drive</a>, <a href="https://publications.waset.org/abstracts/search?q=cold%20pilgering%20mill%20450" title=" cold pilgering mill 450"> cold pilgering mill 450</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion" title=" optimal path motion"> optimal path motion</a> </p> <a href="https://publications.waset.org/abstracts/46141/optimal-path-motion-of-positional-electric-drive" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46141.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">5763</span> Survey: Topology Hiding in Multipath Routing Protocol in MANET</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akshay%20Suhas%20Phalke">Akshay Suhas Phalke</a>, <a href="https://publications.waset.org/abstracts/search?q=Manohar%20S.%20Chaudhari"> Manohar S. Chaudhari </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have discussed the multipath routing with its variants. Our purpose is to discuss the different types of the multipath routing mechanism. Here we also put the taxonomy of the multipath routing. Multipath routing is used for the alternate path routing, reliable transmission of data and for better utilization of network resources. We also discussed the multipath routing for topology hiding such as TOHIP. In multipath routing, different parameters such as energy efficiency, packet delivery ratio, shortest path routing, fault tolerance play an important role. We have discussed a number of multipath routing protocol based on different parameters lastly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-path%20routing" title="multi-path routing">multi-path routing</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=topology" title=" topology"> topology</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detection" title=" fault detection"> fault detection</a>, <a href="https://publications.waset.org/abstracts/search?q=trust" title=" trust"> trust</a> </p> <a href="https://publications.waset.org/abstracts/45654/survey-topology-hiding-in-multipath-routing-protocol-in-manet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45654.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">353</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">5762</span> Cluster-Based Multi-Path Routing Algorithm in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Si-Gwan%20Kim">Si-Gwan Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Small-size and low-power sensors with sensing, signal processing and wireless communication capabilities is suitable for the wireless sensor networks. Due to the limited resources and battery constraints, complex routing algorithms used for the ad-hoc networks cannot be employed in sensor networks. In this paper, we propose node-disjoint multi-path hexagon-based routing algorithms in wireless sensor networks. We suggest the details of the algorithm and compare it with other works. Simulation results show that the proposed scheme achieves better performance in terms of efficiency and message delivery ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clustering" title="clustering">clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-path" title=" multi-path"> multi-path</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20protocol" title=" routing protocol"> routing protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor%20network" title=" sensor network"> sensor network</a> </p> <a href="https://publications.waset.org/abstracts/42997/cluster-based-multi-path-routing-algorithm-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42997.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">403</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">5761</span> Comparison of Agree Method and Shortest Path Method for Determining the Flow Direction in Basin Morphometric Analysis: Case Study of Lower Tapi Basin, Western India</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaypalsinh%20Parmar">Jaypalsinh Parmar</a>, <a href="https://publications.waset.org/abstracts/search?q=Pintu%20Nakrani"> Pintu Nakrani</a>, <a href="https://publications.waset.org/abstracts/search?q=Bhaumik%20Shah"> Bhaumik Shah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital Elevation Model (DEM) is elevation data of the virtual grid on the ground. DEM can be used in application in GIS such as hydrological modelling, flood forecasting, morphometrical analysis and surveying etc.. For morphometrical analysis the stream flow network plays a very important role. DEM lacks accuracy and cannot match field data as it should for accurate results of morphometrical analysis. The present study focuses on comparing the Agree method and the conventional Shortest path method for finding out morphometric parameters in the flat region of the Lower Tapi Basin which is located in the western India. For the present study, open source SRTM (Shuttle Radar Topography Mission with 1 arc resolution) and toposheets issued by Survey of India (SOI) were used to determine the morphometric linear aspect such as stream order, number of stream, stream length, bifurcation ratio, mean stream length, mean bifurcation ratio, stream length ratio, length of overland flow, constant of channel maintenance and aerial aspect such as drainage density, stream frequency, drainage texture, form factor, circularity ratio, elongation ratio, shape factor and relief aspect such as relief ratio, gradient ratio and basin relief for 53 catchments of Lower Tapi Basin. Stream network was digitized from the available toposheets. Agree DEM was created by using the SRTM and stream network from the toposheets. The results obtained were used to demonstrate a comparison between the two methods in the flat areas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agree%20method" title="agree method">agree method</a>, <a href="https://publications.waset.org/abstracts/search?q=morphometric%20analysis" title=" morphometric analysis"> morphometric analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=lower%20Tapi%20basin" title=" lower Tapi basin"> lower Tapi basin</a>, <a href="https://publications.waset.org/abstracts/search?q=shortest%20path%20method" title=" shortest path method"> shortest path method</a> </p> <a href="https://publications.waset.org/abstracts/71574/comparison-of-agree-method-and-shortest-path-method-for-determining-the-flow-direction-in-basin-morphometric-analysis-case-study-of-lower-tapi-basin-western-india" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71574.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">239</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5760</span> Investigation of Compressive Strength of Fly Ash-Based Geopolymer Bricks with Hierarchical Bayesian Path Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ersin%20Sener">Ersin Sener</a>, <a href="https://publications.waset.org/abstracts/search?q=Ibrahim%20Demir"> Ibrahim Demir</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20Aykut%20Karaboga"> Hasan Aykut Karaboga</a>, <a href="https://publications.waset.org/abstracts/search?q=Kadir%20Kilinc"> Kadir Kilinc</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bayesian methods, which have very wide range of applications, are implemented to the data obtained from the production of F class fly ash-based geopolymer bricks’ experimental design. In this study, dependent variable is compressive strength, independent variables are treatment type (oven and steam), treatment time, molding time, temperature, water absorbtion ratio and density. The effect of independent variables on compressive strength is investigated. There is no difference among treatment types, but there is a correlation between independent variables. Therefore, hierarchical Bayesian path analysis is applied. In consequence of analysis we specified that treatment time, temperature and density effects on compressive strength is higher, molding time, and water absorbtion ratio is relatively low. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=experimental%20design" title="experimental design">experimental design</a>, <a href="https://publications.waset.org/abstracts/search?q=F%20class%20fly%20ash" title=" F class fly ash"> F class fly ash</a>, <a href="https://publications.waset.org/abstracts/search?q=geopolymer%20bricks" title=" geopolymer bricks"> geopolymer bricks</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20Bayesian%20path%20analysis" title=" hierarchical Bayesian path analysis"> hierarchical Bayesian path analysis</a> </p> <a href="https://publications.waset.org/abstracts/50683/investigation-of-compressive-strength-of-fly-ash-based-geopolymer-bricks-with-hierarchical-bayesian-path-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50683.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">387</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">5759</span> In silico Designing of Imidazo [4,5-b] Pyridine as a Probable Lead for Potent Decaprenyl Phosphoryl-β-D-Ribose 2′-Epimerase (DprE1) Inhibitors as Antitubercular Agents</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jineetkumar%20Gawad">Jineetkumar Gawad</a>, <a href="https://publications.waset.org/abstracts/search?q=Chandrakant%20Bonde"> Chandrakant Bonde</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tuberculosis (TB) is a major worldwide concern whose control has been exacerbated by HIV, the rise of multidrug-resistance (MDR-TB) and extensively drug resistance (XDR-TB) strains of Mycobacterium tuberculosis. The interest for newer and faster acting antitubercular drugs are more remarkable than any time. To search potent compounds is need and challenge for researchers. Here, we tried to design lead for inhibition of Decaprenyl phosphoryl-β-D-ribose 2′-epimerase (DprE1) enzyme. Arabinose is an essential constituent of mycobacterial cell wall. DprE1 is a flavoenzyme that converts decaprenylphosphoryl-D-ribose into decaprenylphosphoryl-2-keto-ribose, which is intermediate in biosynthetic pathway of arabinose. Latter, DprE2 converts keto-ribose into decaprenylphosphoryl-D-arabinose. We had a selection of 23 compounds from azaindole series for computational study, and they were drawn using marvisketch. Ligands were prepared using Maestro molecular modeling interface, Schrodinger, v10.5. Common pharmacophore hypotheses were developed by applying dataset thresholds to yield active and inactive set of compounds. There were 326 hypotheses were developed. On the basis of survival score, ADRRR (Survival Score: 5.453) was selected. Selected pharmacophore hypotheses were subjected to virtual screening results into 1000 hits. Hits were prepared and docked with protein 4KW5 (oxydoreductase inhibitor) was downloaded in .pdb format from RCSB Protein Data Bank. Protein was prepared using protein preparation wizard. Protein was preprocessed, the workspace was analyzed using force field OPLS 2005. Glide grid was generated by picking single atom in molecule. Prepared ligands were docked with prepared protein 4KW5 using Glide docking. After docking, on the basis of glide score top-five compounds were selected, (5223, 5812, 0661, 0662, and 2945) and the glide docking score (-8.928, -8.534, -8.412, -8.411, -8.351) respectively. There were interactions of ligand and protein, specifically HIS 132, LYS 418, TRY 230, ASN 385. Pi-pi stacking was observed in few compounds with basic Imidazo [4,5-b] pyridine ring. We had basic azaindole ring in parent compounds, but after glide docking, we received compounds with Imidazo [4,5-b] pyridine as a basic ring. That might be the new lead in the process of drug discovery. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DprE1%20inhibitors" title="DprE1 inhibitors">DprE1 inhibitors</a>, <a href="https://publications.waset.org/abstracts/search?q=in%20silico%20drug%20designing" title=" in silico drug designing"> in silico drug designing</a>, <a href="https://publications.waset.org/abstracts/search?q=imidazo%20%5B4" title=" imidazo [4"> imidazo [4</a>, <a href="https://publications.waset.org/abstracts/search?q=5-b%5D%20pyridine" title="5-b] pyridine">5-b] pyridine</a>, <a href="https://publications.waset.org/abstracts/search?q=lead" title=" lead"> lead</a>, <a href="https://publications.waset.org/abstracts/search?q=tuberculosis" title=" tuberculosis"> tuberculosis</a> </p> <a href="https://publications.waset.org/abstracts/90883/in-silico-designing-of-imidazo-45-b-pyridine-as-a-probable-lead-for-potent-decaprenyl-phosphoryl-v-d-ribose-2-epimerase-dpre1-inhibitors-as-antitubercular-agents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/90883.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">154</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">5758</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">5757</span> Quality of Service Based Routing Algorithm for Real Time Applications in MANETs Using Ant Colony and Fuzzy Logic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Farahnaz%20Karami">Farahnaz Karami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Routing is an important, challenging task in mobile ad hoc networks due to node mobility, lack of central control, unstable links, and limited resources. An ant colony has been found to be an attractive technique for routing in Mobile Ad Hoc Networks (MANETs). However, existing swarm intelligence based routing protocols find an optimal path by considering only one or two route selection metrics without considering correlations among such parameters making them unsuitable lonely for routing real time applications. Fuzzy logic combines multiple route selection parameters containing uncertain information or imprecise data in nature, but does not have multipath routing property naturally in order to provide load balancing. The objective of this paper is to design a routing algorithm using fuzzy logic and ant colony that can solve some of routing problems in mobile ad hoc networks, such as nodes energy consumption optimization to increase network lifetime, link failures rate reduction to increase packet delivery reliability and providing load balancing to optimize available bandwidth. In proposed algorithm, the path information will be given to fuzzy inference system by ants. Based on the available path information and considering the parameters required for quality of service (QoS), the fuzzy cost of each path is calculated and the optimal paths will be selected. NS2.35 simulation tools are used for simulation and the results are compared and evaluated with the newest QoS based algorithms in MANETs according to packet delivery ratio, end-to-end delay and routing overhead ratio criterions. The simulation results show significant improvement in the performance of these networks in terms of decreasing end-to-end delay, and routing overhead ratio, and also increasing packet delivery ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mobile%20ad%20hoc%20networks" title="mobile ad hoc networks">mobile ad hoc networks</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=quality%20of%20service" title=" quality of service"> quality of service</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony" title=" ant colony"> ant colony</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title=" fuzzy logic"> fuzzy logic</a> </p> <a href="https://publications.waset.org/abstracts/177059/quality-of-service-based-routing-algorithm-for-real-time-applications-in-manets-using-ant-colony-and-fuzzy-logic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177059.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">64</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">5756</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">5755</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">5754</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">5753</span> An Enhanced Connectivity Aware Routing Protocol for Vehicular Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmadu%20Maidorawa">Ahmadu Maidorawa</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamalrulnizam%20Abu%20Bakar"> Kamalrulnizam Abu Bakar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposed an Enhanced Connectivity Aware Routing (ECAR) protocol for Vehicular Ad hoc Network (VANET). The protocol uses a control broadcast to reduce the number of overhead packets needed in a route discovery process. It is also equipped with an alternative backup route that is used whenever a primary path to destination failed, which highly reduces the frequent launching and re-launching of the route discovery process that waste useful bandwidth and unnecessarily prolonging the average packet delay. NS2 simulation results show that the performance of ECAR protocol outperformed the original connectivity aware routing (CAR) protocol by reducing the average packet delay by 28%, control overheads by 27% and increased the packet delivery ratio by 22%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=alternative%20path" title="alternative path">alternative path</a>, <a href="https://publications.waset.org/abstracts/search?q=primary%20path" title=" primary path"> primary path</a>, <a href="https://publications.waset.org/abstracts/search?q=protocol" title=" protocol"> protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=VANET" title=" VANET"> VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicular%20ad%20hoc%20networks" title=" vehicular ad hoc networks"> vehicular ad hoc networks</a> </p> <a href="https://publications.waset.org/abstracts/15880/an-enhanced-connectivity-aware-routing-protocol-for-vehicular-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15880.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">402</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">5752</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">5751</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">5750</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">5749</span> Campus Living Environments that Contribute to Mental Health: A Path Analysis Based on Environmental Characteristics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Ren">Jing Ren</a>, <a href="https://publications.waset.org/abstracts/search?q=Guifeng%20Han"> Guifeng Han</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mental health of most college students in China is negative due to the multiple pressures of academics, life, and employment. The problem of psychological stress has been widely discussed and needs to be resolved immediately. Therefore, six typical green spaces in Chongqing University, China, were selected to explore the relationship between eight environmental characteristics and students' stress relief. A path analysis model is established using Amos26.0 to explain the paths for environmental characteristics influencing psychological stress relief. The results show that (1) tree species diversity (TSD) has a positive effect on stress relief, thus green coverage ratio (GCR), the proportion of water area (WAP), visual green index (VGI), and color richness (CR) have both positive and negative effects; (2) CR could reduce stress directly and indirectly, while GCR, TSD, WAP, and VGI could only reduce stress indirectly, and the most effective path is TSD→extent→stress relief; (3) CR can reduce stress more greatly for males than females, CR and VGI have better effects for art students than science students. The study can provide a theoretical reference for planning and designing campus living environments to improve students' mental health. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=public%20health" title="public health">public health</a>, <a href="https://publications.waset.org/abstracts/search?q=residential%20environment" title=" residential environment"> residential environment</a>, <a href="https://publications.waset.org/abstracts/search?q=space%20planning%20and%20management" title=" space planning and management"> space planning and management</a>, <a href="https://publications.waset.org/abstracts/search?q=mental%20health" title=" mental health"> mental health</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20analysis" title=" path analysis"> path analysis</a> </p> <a href="https://publications.waset.org/abstracts/175475/campus-living-environments-that-contribute-to-mental-health-a-path-analysis-based-on-environmental-characteristics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/175475.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">63</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">5748</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">5747</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">5746</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">5745</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">5744</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">5743</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">5742</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">5741</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">5740</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">5739</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">5738</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> <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=glide%20path%20ratio&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&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=glide%20path%20ratio&page=192">192</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&page=193">193</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=glide%20path%20ratio&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>