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: node MCU</title> <meta name="description" content="Search results for: node MCU"> <meta name="keywords" content="node MCU"> <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="node MCU" 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="node MCU"> <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> 483</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: node MCU</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">483</span> A Graph Theoretic Algorithm for Bandwidth Improvement in Computer Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Karaata">Mehmet Karaata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given two distinct vertices (nodes) source s and target t of a graph G = (V, E), the two node-disjoint paths problem is to identify two node-disjoint paths between s ∈ V and t ∈ V . Two paths are node-disjoint if they have no common intermediate vertices. In this paper, we present an algorithm with O(m)-time complexity for finding two node-disjoint paths between s and t in arbitrary graphs where m is the number of edges. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=disjoint%20paths" title="disjoint paths">disjoint paths</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20systems" title=" distributed systems"> distributed systems</a>, <a href="https://publications.waset.org/abstracts/search?q=fault-tolerance" title=" fault-tolerance"> fault-tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20routing" title=" network routing"> network routing</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a> </p> <a href="https://publications.waset.org/abstracts/52361/a-graph-theoretic-algorithm-for-bandwidth-improvement-in-computer-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52361.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">442</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">482</span> Internal Node Stabilization for Voltage Sense Amplifiers in Multi-Channel Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanghoon%20Park">Sanghoon Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Ki-Jin%20Kim"> Ki-Jin Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Kwang-Ho%20Ahn"> Kwang-Ho Ahn</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses the undesirable charge transfer by the parasitic capacitances of the input transistors in a voltage sense amplifier. Due to its intrinsic rail-to-rail voltage transition, the input sides are inevitably disturbed. It can possible disturb the stabilities of the reference voltage levels. Moreover, it becomes serious in multi-channel systems by altering them for other channels, and so degrades the linearity of the systems. In order to alleviate the internal node voltage transition, the internal node stabilization technique is proposed by utilizing an additional biasing circuit. It achieves 47% and 43% improvements for node stabilization and input referred disturbance, respectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=voltage%20sense%20amplifier" title="voltage sense amplifier">voltage sense amplifier</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20transition" title=" voltage transition"> voltage transition</a>, <a href="https://publications.waset.org/abstracts/search?q=node%20stabilization" title=" node stabilization"> node stabilization</a>, <a href="https://publications.waset.org/abstracts/search?q=biasing%20circuits" title=" biasing circuits"> biasing circuits</a> </p> <a href="https://publications.waset.org/abstracts/6878/internal-node-stabilization-for-voltage-sense-amplifiers-in-multi-channel-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6878.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">479</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">481</span> Stabilization Technique for Multi-Inputs Voltage Sense Amplifiers in Node Sharing Converters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanghoon%20Park">Sanghoon Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Ki-Jin%20Kim"> Ki-Jin Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Kwang-Ho%20Ahn"> Kwang-Ho Ahn</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses the undesirable charge transfer through the parasitic capacitances of the input transistors in a multi-inputs voltage sense amplifier. Its intrinsic rail-to-rail voltage transitions at the output nodes inevitably disturb the input sides through the capacitive coupling between the outputs and inputs. Then, it can possible degrade the stabilities of the reference voltage levels. Moreover, it becomes more serious in multi-channel systems by altering them for other channels, and so degrades the linearity of the overall systems. In order to alleviate the internal node voltage transition, the internal node stabilization techniques are proposed. It achieves 45% and 40% improvements for node stabilization and input referred disturbance, respectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=voltage%20sense%20amplifier" title="voltage sense amplifier">voltage sense amplifier</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-inputs" title=" multi-inputs"> multi-inputs</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20transition" title=" voltage transition"> voltage transition</a>, <a href="https://publications.waset.org/abstracts/search?q=node%20stabilization" title=" node stabilization"> node stabilization</a>, <a href="https://publications.waset.org/abstracts/search?q=biasing%20circuits" title=" biasing circuits"> biasing circuits</a> </p> <a href="https://publications.waset.org/abstracts/23974/stabilization-technique-for-multi-inputs-voltage-sense-amplifiers-in-node-sharing-converters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23974.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">565</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">480</span> Relay Node Selection Algorithm for Cooperative Communications in Wireless Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sunmyeng%20Kim">Sunmyeng Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> IEEE 802.11a/b/g standards support multiple transmission rates. Even though the use of multiple transmission rates increase the WLAN capacity, this feature leads to the performance anomaly problem. Cooperative communication was introduced to relieve the performance anomaly problem. Data packets are delivered to the destination much faster through a relay node with high rate than through direct transmission to the destination at low rate. In the legacy cooperative protocols, a source node chooses a relay node only based on the transmission rate. Therefore, they are not so feasible in multi-flow environments since they do not consider the effect of other flows. To alleviate the effect, we propose a new relay node selection algorithm based on the transmission rate and channel contention level. Performance evaluation is conducted using simulation, and shows that the proposed protocol significantly outperforms the previous protocol in terms of throughput and delay. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communications" title="cooperative communications">cooperative communications</a>, <a href="https://publications.waset.org/abstracts/search?q=MAC%20protocol" title=" MAC protocol"> MAC protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=relay%20node" title=" relay node"> relay node</a>, <a href="https://publications.waset.org/abstracts/search?q=WLAN" title=" WLAN"> WLAN</a> </p> <a href="https://publications.waset.org/abstracts/7034/relay-node-selection-algorithm-for-cooperative-communications-in-wireless-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7034.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">331</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">479</span> Utilize 5G Mobile Connection as a Node in the Proof of Authority Blockchain Used for Microtransaction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Frode%20van%20der%20Laak">Frode van der Laak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper contributes to the feasibility of using a 5G mobile connection as a node for a Proof of Authority (PoA) blockchain, which is used for microtransactions at the same time. It uses the phone number identity of the users that are linked to the crypto wallet address. It also proposed a consensus protocol based on Proof-of-Authority (PoA) blockchain; PoA is a permission blockchain where consensus is achieved through a set of designated authority rather than through mining, as is the case with a Proof of Work (PoW) blockchain. This report will first explain the concept of a PoA blockchain and how it works. It will then discuss the potential benefits and challenges of using a 5G mobile connection as a node in such a blockchain, and finally, the main open problem statement and proposed solutions with the requirements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=5G" title="5G">5G</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile" title=" mobile"> mobile</a>, <a href="https://publications.waset.org/abstracts/search?q=connection" title=" connection"> connection</a>, <a href="https://publications.waset.org/abstracts/search?q=node" title=" node"> node</a>, <a href="https://publications.waset.org/abstracts/search?q=PoA" title=" PoA"> PoA</a>, <a href="https://publications.waset.org/abstracts/search?q=blockchain" title=" blockchain"> blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=microtransaction" title=" microtransaction"> microtransaction</a> </p> <a href="https://publications.waset.org/abstracts/158556/utilize-5g-mobile-connection-as-a-node-in-the-proof-of-authority-blockchain-used-for-microtransaction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/158556.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">96</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">478</span> Evaluation of 18F Fluorodeoxyglucose Positron Emission Tomography, MRI, and Ultrasound in the Assessment of Axillary Lymph Node Metastases in Patients with Early Stage Breast Cancer</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wooseok%20Byon">Wooseok Byon</a>, <a href="https://publications.waset.org/abstracts/search?q=Eunyoung%20Kim"> Eunyoung Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Junseong%20Kwon"> Junseong Kwon</a>, <a href="https://publications.waset.org/abstracts/search?q=Byung%20Joo%20Song"> Byung Joo Song</a>, <a href="https://publications.waset.org/abstracts/search?q=Chan%20Heun%20Park"> Chan Heun Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Purpose: 18F Fluorodeoxyglucose Positron Emission Tomography (FDG-PET) is a noninvasive imaging modality that can identify nodal metastases in women with primary breast cancer. The aim of this study was to compare the accuracy of FDG-PET with MRI and sonography scanning to determine axillary lymph node status in patients with breast cancer undergoing sentinel lymph node biopsy or axillary lymph node dissection. Patients and Methods: Between January and December 2012, ninety-nine patients with breast cancer and clinically negative axillary nodes were evaluated. All patients underwent FDG-PET, MRI, ultrasound followed by sentinel lymph node biopsy (SLNB) or axillary lymph node dissection (ALND). Results: Using axillary lymph node assessment as the gold standard, the sensitivity and specificity of FDG-PET were 51.4% (95% CI, 41.3% to 65.6%) and 92.2% (95% CI, 82.7% to 97.4%) respectively. The sensitivity and specificity of MRI and ultrasound were 57.1% (95% CI, 39.4% to 73.7%), 67.2% (95% CI, 54.3% to 78.4%) and 42.86% (95% CI, 26.3% to 60.7%), 92.2% (95% CI, 82.7% to 97.4%). Stratification according to hormone receptor status showed an increase in specificity when negative (FDG-PET: 42.3% to 77.8%, MRI 50% to 77.8%, ultrasound 34.6% to 66.7%). Also, positive HER2 status was associated with an increase in specificity (FDG-PET: 42.9% to 85.7%, MRI 50% to 85.7%, ultrasound 35.7% to 71.4%). Conclusions: The sensitivity and specificity of FDG-PET compared with MRI and ultrasound was high. However, FDG-PET is not sufficiently accurate to appropriately identify lymph node metastases. This study suggests that FDG-PET scanning cannot replace histologic staging in early-stage breast cancer, but might have a role in evaluating axillary lymph node status in hormone receptor negative or HER-2 overexpressing subtypes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=axillary%20lymph%20node%20metastasis" title="axillary lymph node metastasis">axillary lymph node metastasis</a>, <a href="https://publications.waset.org/abstracts/search?q=FDG-PET" title=" FDG-PET"> FDG-PET</a>, <a href="https://publications.waset.org/abstracts/search?q=MRI" title=" MRI"> MRI</a>, <a href="https://publications.waset.org/abstracts/search?q=ultrasound" title=" ultrasound"> ultrasound</a> </p> <a href="https://publications.waset.org/abstracts/17970/evaluation-of-18f-fluorodeoxyglucose-positron-emission-tomography-mri-and-ultrasound-in-the-assessment-of-axillary-lymph-node-metastases-in-patients-with-early-stage-breast-cancer" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17970.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">375</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">477</span> Finite Element Analysis of Thermally-Induced Bistable Plate Using Four Plate Elements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jixiao%20Tao">Jixiao Tao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaoqiao%20He"> Xiaoqiao He</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present study deals with the finite element (FE) analysis of thermally-induced bistable plate using various plate elements. The quadrilateral plate elements include the 4-node conforming plate element based on the classical laminate plate theory (CLPT), the 4-node and 9-node Mindlin plate element based on the first-order shear deformation laminated plate theory (FSDT), and a displacement-based 4-node quadrilateral element (RDKQ-NL20). Using the von-Karman’s large deflection theory and the total Lagrangian (TL) approach, the nonlinear FE governing equations for plate under thermal load are derived. Convergence analysis for four elements is first conducted. These elements are then used to predict the stable shapes of thermally-induced bistable plate. Numerical test shows that the plate element based on FSDT, namely the 4-node and 9-node Mindlin, and the RDKQ-NL20 plate element can predict two stable cylindrical shapes while the 4-node conforming plate predicts a saddles shape. Comparing the simulation results with ABAQUS, the RDKQ-NL20 element shows the best accuracy among all the elements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bistable" title="Bistable">Bistable</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a>, <a href="https://publications.waset.org/abstracts/search?q=geometrical%20nonlinearity" title=" geometrical nonlinearity"> geometrical nonlinearity</a>, <a href="https://publications.waset.org/abstracts/search?q=quadrilateral%20plate%20elements" title=" quadrilateral plate elements"> quadrilateral plate elements</a> </p> <a href="https://publications.waset.org/abstracts/124454/finite-element-analysis-of-thermally-induced-bistable-plate-using-four-plate-elements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124454.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">220</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">476</span> Research on Dynamic Practical Byzantine Fault Tolerance Consensus Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cao%20Xiaopeng">Cao Xiaopeng</a>, <a href="https://publications.waset.org/abstracts/search?q=Shi%20Linkai"> Shi Linkai </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The practical Byzantine fault-tolerant algorithm does not add nodes dynamically. It is limited in practical application. In order to add nodes dynamically, Dynamic Practical Byzantine Fault Tolerance Algorithm (DPBFT) was proposed. Firstly, a new node sends request information to other nodes in the network. The nodes in the network decide their identities and requests. Then the nodes in the network reverse connect to the new node and send block information of the current network. The new node updates information. Finally, the new node participates in the next round of consensus, changes the view and selects the master node. This paper abstracts the decision of nodes into the undirected connected graph. The final consistency of the graph is used to prove that the proposed algorithm can adapt to the network dynamically. Compared with the PBFT algorithm, DPBFT has better fault tolerance and lower network bandwidth. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=practical%20byzantine" title="practical byzantine">practical byzantine</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title=" fault tolerance"> fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=blockchain" title=" blockchain"> blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=consensus%20algorithm" title=" consensus algorithm"> consensus algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=consistency%20analysis" title=" consistency analysis"> consistency analysis</a> </p> <a href="https://publications.waset.org/abstracts/128883/research-on-dynamic-practical-byzantine-fault-tolerance-consensus-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128883.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">130</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">475</span> Node Pair Selection Scheme in Relay-Aided Communication Based on Stable Marriage Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tetsuki%20Taniguchi">Tetsuki Taniguchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Yoshio%20Karasawa"> Yoshio Karasawa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes a node pair selection scheme in relay-aided multiple source multiple destination communication system based on stable marriage problem. A general case is assumed in which all of source, relay and destination nodes are equipped with multiantenna and carry out multistream transmission. Based on several metrics introduced from inter-node channel condition, the preference order is determined about all source-relay and relay-destination relations, and then the node pairs are determined using Gale-Shapley algorithm. The computer simulations show that the effectiveness of node pair selection is larger in multihop communication. Some additional aspects which are different from relay-less case are also investigated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relay" title="relay">relay</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20input%20multiple%20output%20%28MIMO%29" title=" multiple input multiple output (MIMO)"> multiple input multiple output (MIMO)</a>, <a href="https://publications.waset.org/abstracts/search?q=multiuser" title=" multiuser"> multiuser</a>, <a href="https://publications.waset.org/abstracts/search?q=amplify%20and%20forward" title=" amplify and forward"> amplify and forward</a>, <a href="https://publications.waset.org/abstracts/search?q=stable%20marriage%20problem" title=" stable marriage problem"> stable marriage problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Gale-Shapley%20algorithm" title=" Gale-Shapley algorithm"> Gale-Shapley algorithm</a> </p> <a href="https://publications.waset.org/abstracts/10192/node-pair-selection-scheme-in-relay-aided-communication-based-on-stable-marriage-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10192.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">397</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">474</span> Extending ACOSOG Z0011 to Encompass Mastectomy Patients: A Retrospective Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ruqayya%20Naheed%20Khan">Ruqayya Naheed Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Awais%20Amjad%20Malik"> Awais Amjad Malik</a>, <a href="https://publications.waset.org/abstracts/search?q=Awais%20Naeem"> Awais Naeem</a>, <a href="https://publications.waset.org/abstracts/search?q=Amina%20Khan"> Amina Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Asad%20Parvaiz"> Asad Parvaiz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: Axillary nodal status in breast cancer patients is a paramount prognosticator, next to primary tumor size and grade. It has been well established that patients with negative sentinel lymph node biopsy can safely avoid axillary lymph node dissection. A positive sentinel lymph node has traditionally required subsequent axillary dissection. According to ACOSOG Z11 trial, patients who underwent axillary dissection with 3 or more positive sentinel nodes or opted for observation in case of negative sentinel lymph node, did not find any difference in Overall Survival (OS) and Disease Free Survival (DFS). The Z11 trial included patients who underwent breast conserving surgery and excluded patients with mastectomies. The purpose of this study is to determine whether Z0011 can be applied to mastectomy patients as well in 1-3 positive sentinel lymph nodes and avoid unnecessary ALND. Methods: A retrospective review was conducted at Shaukat Khanam Memorial Cancer Hospital Pakistan from Jan 2015 to Dec 2017 including patients who were treated for invasive breast cancer and required upfront mastectomy. They were clinically node negative, so sentinel lymph node biopsy was performed. Patients underwent ALND with positive sentinel lymph node. A total of 156 breast cancer patients with mastectomies were reviewed. Results: 95% of the patients were female while 3% were male. Average age was 44 years. There was no difference in race, comorbidities, histology, T stage, N stage, and overall stage, use of adjuvant chemotherapy and radiation therapy. 64 patients underwent ALND for positive lymph node while 92 patients were spared of axillary dissection due to negative sentinel lymph node biopsy. Out of 64 patients, 38 patients (59%) had only 1 lymph node positive which was the sentinel node. 18 patients (28%) had 2 lymph nodes positive including the sentinel node while only 8 patients (13%) had 3 or more positive nodes. Conclusion: Keeping in mind the complications related to ALND, above results clearly show that ALND could have been avoided in 87% of patients in the setting of adjuvant radiation, possibly avoiding the morbidity associated with axillary lymphadenectomy although a prospective randomized trial needs to confirm these results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mastectomy" title="mastectomy">mastectomy</a>, <a href="https://publications.waset.org/abstracts/search?q=sentinel%20lymph%20node%20biopsy" title=" sentinel lymph node biopsy"> sentinel lymph node biopsy</a>, <a href="https://publications.waset.org/abstracts/search?q=axillary%20lymph%20node%20dissection" title=" axillary lymph node dissection"> axillary lymph node dissection</a>, <a href="https://publications.waset.org/abstracts/search?q=breast%20cancer" title=" breast cancer"> breast cancer</a> </p> <a href="https://publications.waset.org/abstracts/101008/extending-acosog-z0011-to-encompass-mastectomy-patients-a-retrospective-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/101008.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">195</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">473</span> A Wireless Sensor Network Protocol for a Car Parking Space Monitoring System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jung-Ho%20Moon">Jung-Ho Moon</a>, <a href="https://publications.waset.org/abstracts/search?q=Myung-Gon%20Yoon"> Myung-Gon Yoon</a>, <a href="https://publications.waset.org/abstracts/search?q=Tae%20Kwon%20Ha"> Tae Kwon Ha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a wireless sensor network protocol for a car parking monitoring system. A wireless sensor network for the purpose is composed of multiple sensor nodes, a sink node, a gateway, and a server. Each of the sensor nodes is equipped with a 3-axis AMR sensor and deployed in the center of a parking space. The sensor node reads its sensor values periodically and transmits the data to the sink node if the current and immediate past sensor values show a difference exceeding a threshold value. The operations of the sink and sensor nodes are described in detail along with flow diagrams. The protocol allows a low-duty cycle operation of the sensor nodes and a flexible adjustment of the threshold value used by the sensor nodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=car%20parking%20monitoring" title="car parking monitoring">car parking monitoring</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor%20node" title=" sensor node"> sensor node</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20protocol" title=" network protocol"> network protocol</a> </p> <a href="https://publications.waset.org/abstracts/11153/a-wireless-sensor-network-protocol-for-a-car-parking-space-monitoring-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11153.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">538</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">472</span> Node Insertion in Coalescence Hidden-Variable Fractal Interpolation Surface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Srijanani%20Anurag%20Prasad">Srijanani Anurag Prasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Coalescence Hidden-variable Fractal Interpolation Surface (CHFIS) was built by combining interpolation data from the Iterated Function System (IFS). The interpolation data in a CHFIS comprises a row and/or column of uncertain values when a single point is entered. Alternatively, a row and/or column of additional points are placed in the given interpolation data to demonstrate the node added CHFIS. There are three techniques for inserting new points that correspond to the row and/or column of nodes inserted, and each method is further classified into four types based on the values of the inserted nodes. As a result, numerous forms of node insertion can be found in a CHFIS. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractal" title="fractal">fractal</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolation" title=" interpolation"> interpolation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterated%20function%20system" title=" iterated function system"> iterated function system</a>, <a href="https://publications.waset.org/abstracts/search?q=coalescence" title=" coalescence"> coalescence</a>, <a href="https://publications.waset.org/abstracts/search?q=node%20insertion" title=" node insertion"> node insertion</a>, <a href="https://publications.waset.org/abstracts/search?q=knot%20insertion" title=" knot insertion"> knot insertion</a> </p> <a href="https://publications.waset.org/abstracts/148593/node-insertion-in-coalescence-hidden-variable-fractal-interpolation-surface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148593.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">100</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">471</span> A Car Parking Monitoring System Using a Line-Topology Wireless Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dae%20Il%20Kim">Dae Il Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jungho%20Moon"> Jungho Moon</a>, <a href="https://publications.waset.org/abstracts/search?q=Tae%20Yun%20Chung"> Tae Yun Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a car parking monitoring system using a wireless sensor network. The presented sensor network has a line-shaped topology and adopts a TDMA-based protocol for allowing multi-hop communications. Sensor nodes are deployed in the ground of an outdoor parking lot in such a way that a sensor node monitors a parking space. Each sensor node detects the availability of the associated parking space and transmits the detection result to a sink node via intermediate sensor nodes existing between the source sensor node and the sink node. We evaluate the feasibility of the presented sensor network and the TDMA-based communication protocol through experiments using 11 sensor nodes deployed in a real parking lot. The result shows that the presented car parking monitoring system is robust to changes in the communication environments and efficient for monitoring parking spaces of outdoor parking lots. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-hop%20communication" title="multi-hop communication">multi-hop communication</a>, <a href="https://publications.waset.org/abstracts/search?q=parking%20monitoring%20system" title=" parking monitoring system"> parking monitoring system</a>, <a href="https://publications.waset.org/abstracts/search?q=TDMA" title=" TDMA"> TDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a> </p> <a href="https://publications.waset.org/abstracts/61438/a-car-parking-monitoring-system-using-a-line-topology-wireless-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61438.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">303</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">470</span> Orphan Node Inclusion Protocol for Wireless Sensor Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sandeep%20Singh%20Waraich">Sandeep Singh Waraich</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless sensor network (WSN ) consists of a large number of sensor nodes. The disparity in their energy consumption usually lead to the loss of equilibrium in wireless sensor network which may further results in an energy hole problem in wireless network. In this paper, we have considered the inclusion of orphan nodes which usually remain unutilized as intermediate nodes in multi-hop routing. The Orphan Node Inclusion (ONI) Protocol lets the cluster member to bring the orphan nodes into their clusters, thereby saving important resources and increasing network lifetime in critical applications of WSN. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title="wireless sensor network">wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=orphan%20node" title=" orphan node"> orphan node</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=ONI%20protocol" title=" ONI protocol"> ONI protocol</a> </p> <a href="https://publications.waset.org/abstracts/52358/orphan-node-inclusion-protocol-for-wireless-sensor-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52358.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">469</span> Efficient Single Relay Selection Scheme for Cooperative Communication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sung-Bok%20Choi">Sung-Bok Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyun-Jun%20Shin"> Hyun-Jun Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a single relay selection scheme in cooperative communication. Decode and forward scheme is considered when a source node wants to cooperate with a single relay for data transmission. To use the proposed single relay selection scheme, the source node make a little different pattern signal which is not complex pattern and broadcasts it. The proposed scheme does not require the channel state information between the source node and candidates of the relay during the relay selection. Therefore, it is able to be used in many fields. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relay%20selection" title="relay selection">relay selection</a>, <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication" title=" cooperative communication"> cooperative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=df" title=" df"> df</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20codes" title=" channel codes"> channel codes</a> </p> <a href="https://publications.waset.org/abstracts/3523/efficient-single-relay-selection-scheme-for-cooperative-communication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3523.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">670</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">468</span> Optimal Design of Reference Node Placement for Wireless Indoor Positioning Systems in Multi-Floor Building</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kittipob%20Kondee">Kittipob Kondee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chutima%20Prommak"> Chutima Prommak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an optimization technique that can be used to optimize the placements of reference nodes and improve the location determination performance for the multi-floor building. The proposed technique is based on Simulated Annealing algorithm (SA) and is called MSMR-M. The performance study in this work is based on simulation. We compare other node-placement techniques found in the literature with the optimal node-placement solutions obtained from our optimization. The results show that using the optimal node-placement obtained by our proposed technique can improve the positioning error distances up to 20% better than those of the other techniques. The proposed technique can provide an average error distance within 1.42 meters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=indoor%20positioning%20system" title="indoor positioning system">indoor positioning system</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20system%20design" title=" optimization system design"> optimization system design</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-floor%20building" title=" multi-floor building"> multi-floor building</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/9947/optimal-design-of-reference-node-placement-for-wireless-indoor-positioning-systems-in-multi-floor-building" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9947.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">246</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">467</span> Development and Range Testing of a LoRaWAN System in an Urban Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20R.%20Harris">N. R. Harris</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Curry"> J. Curry</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes the construction and operation of an experimental LoRaWAN network surrounding the University of Southampton in the United Kingdom. Following successful installation, an experimental node design is built and characterised, with particular emphasis on radio range. Several configurations are investigated, including different data rates, and varying heights of node. It is concluded that although range can be great (over 8 km in this case), environmental topology is critical. However, shorter range implementations, up to about 2 km in an urban environment, are relatively insensitive although care is still needed. The example node and the relatively simple base station reported demonstrate that LoraWan can be a very low cost and practical solution to Internet of Things type applications for distributed monitoring systems with sensors spread over distances of several km. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=long-range" title="long-range">long-range</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless" title=" wireless"> wireless</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor" title=" sensor"> sensor</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a> </p> <a href="https://publications.waset.org/abstracts/82766/development-and-range-testing-of-a-lorawan-system-in-an-urban-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82766.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">137</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">466</span> In vitro Culture of Stem Node Segments of Maerua crassifolia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abobaker%20Abrahem%20M.%20Saad">Abobaker Abrahem M. Saad</a>, <a href="https://publications.waset.org/abstracts/search?q=Asma%20Abudasalam"> Asma Abudasalam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The stem node segments were cultured on Murashige and Skoog (MS) medium. In the case of using MS+ Zeatin (1 mg/l), small shoot buds were formed directly in 70% of explants after 15 days, their length range between 0.1 to 0.3 cm after two weeks and reached 0.3 cm in length and three shoots in numbers after 4 weeks. When those small shoots were sub cultured on the same medium, they increased in length, number and reached 0.4 cm with 4 shoots, 0.4 cm with 5 shoots after six, eight and ten weeks respectively. In the case of using MS free hormones, MS+IAA (0.2mg/l) +BA (0.5mg/l), MS + kin(0.5mg/l), MS + kin (3mg/l) and MS +NAA (3mg/l) +BA (1mg/l), no sign of responses were noticed and only change in color in some cases. Different types of parenchyma cells and many layers of thick wall sclerenchyma cells were observed on MS+BA (1mg/l). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maerua" title="Maerua">Maerua</a>, <a href="https://publications.waset.org/abstracts/search?q=stem%20node" title=" stem node"> stem node</a>, <a href="https://publications.waset.org/abstracts/search?q=shoots" title=" shoots"> shoots</a>, <a href="https://publications.waset.org/abstracts/search?q=buds" title=" buds"> buds</a>, <a href="https://publications.waset.org/abstracts/search?q=In%20vitro" title=" In vitro"> In vitro</a> </p> <a href="https://publications.waset.org/abstracts/59982/in-vitro-culture-of-stem-node-segments-of-maerua-crassifolia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59982.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">312</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">465</span> Axillary Evaluation with Targeted Axillary Dissection Using Ultrasound-Visible Clips after Neoadjuvant Chemotherapy for Patients with Node-Positive Breast Cancer</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Naomi%20Sakamoto">Naomi Sakamoto</a>, <a href="https://publications.waset.org/abstracts/search?q=Eisuke%20Fukuma"> Eisuke Fukuma</a>, <a href="https://publications.waset.org/abstracts/search?q=Mika%20Nashimoto"> Mika Nashimoto</a>, <a href="https://publications.waset.org/abstracts/search?q=Yoshitomo%20Koshida"> Yoshitomo Koshida</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Selective localization of the metastatic lymph node with clip and removal of clipped nodes with sentinel lymph node (SLN), known as targeted axillary dissection (TAD), reduced false-negative rates (FNR) of SLN biopsy (SLNB) after neoadjuvant chemotherapy (NAC). For the patients who achieved nodal pathologic complete response (pCR), accurate staging of axilla by TAD lead to omit axillary lymph node dissection (ALND), decreasing postoperative arm morbidity without a negative effect on overall survival. This study aimed to investigate the ultrasound (US) identification rate and success removal rate of two kinds of ultrasound-visible clips placed in metastatic lymph nodes during TAD procedure. Methods: This prospective study was conducted using patients with clinically T1-3, N1, 2, M0 breast cancer undergoing NAC followed by surgery. A US-visible clip was placed in the suspicious lymph node under US guidance before neoadjuvant chemotherapy. Before surgery, US examination was performed to evaluate the detection rate of clipped node. During the surgery, the clipped node was removed using several localization techniques, including hook-wire localization, dye-injection, or fluorescence technique, followed by a dual-technique SLNB and resection of palpable nodes if present. For the fluorescence technique, after injection of 0.1-0.2 mL of indocyanine green dye (ICG) into the clipped node, ICG fluorescent imaging was performed using the Photodynamic Eye infrared camera (Hamamatsu Photonics k. k., Shizuoka, Japan). For the dye injection method, 0.1-0.2 mL of pyoktanin blue dye was injected into the clipped node. Results: A total of 29 patients were enrolled. Hydromark™ breast biopsy site markers (Hydromark, T3 shape; Devicor Medical Japan, Tokyo, Japan) was used in 15patients, whereas a UltraCor™ Twirl™ breast marker (Twirl; C.R. Bard, Inc, NJ, USA) was placed in 14 patients. US identified the clipped node marked with the UltraCore Twirl in 100% (14/14) and with the Hydromark in 93.3% (14/15, p = ns). Success removal of clipped node marked with the UltraCore Twirl was achieved in 100% (14/14), whereas the node marked with the Hydromark was removed in 80% (12/15) (p = ns). Conclusions: The ultrasound identification rate differed between the two types of ultrasound-visible clips, which also affected the success removal rate of clipped nodes. Labelling the positive node with a US-highly-visible clip allowed successful TAD. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=breast%20cancer" title="breast cancer">breast cancer</a>, <a href="https://publications.waset.org/abstracts/search?q=neoadjuvant%20chemotherapy" title=" neoadjuvant chemotherapy"> neoadjuvant chemotherapy</a>, <a href="https://publications.waset.org/abstracts/search?q=targeted%20axillary%20dissection" title=" targeted axillary dissection"> targeted axillary dissection</a>, <a href="https://publications.waset.org/abstracts/search?q=breast%20tissue%20marker" title=" breast tissue marker"> breast tissue marker</a>, <a href="https://publications.waset.org/abstracts/search?q=clip" title=" clip"> clip</a> </p> <a href="https://publications.waset.org/abstracts/177380/axillary-evaluation-with-targeted-axillary-dissection-using-ultrasound-visible-clips-after-neoadjuvant-chemotherapy-for-patients-with-node-positive-breast-cancer" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177380.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">66</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">464</span> Data Rate Based Grouping Scheme for Cooperative Communications in Wireless LANs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sunmyeng%20Kim">Sunmyeng Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> IEEE 802.11a/b/g standards provide multiple transmission rates, which can be changed dynamically according to the channel condition.Cooperative communications we reintroduced to improve the overallperformance of wireless LANs with the help of relay nodes with higher transmission rates. The cooperative communications are based on the fact that the transmission is much faster when sending data packets to a destination node through a relay node with higher transmission rate, rather than sending data directly to the destination node at low transmission rate. To apply the cooperative communications in wireless LAN, several MAC protocols have been proposed. Some of them can result in collisions among relay nodes in a dense network. In order to solve this problem, we propose a new protocol. Relay nodes are grouped based on their transmission rates. And then, relay nodes only in the highest group try to get channel access. Performance evaluation is conducted using simulation, and shows that the proposed protocol significantly outperforms the previous protocol in terms of throughput and collision probability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communications" title="cooperative communications">cooperative communications</a>, <a href="https://publications.waset.org/abstracts/search?q=MAC%20protocol" title=" MAC protocol"> MAC protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=relay%20node" title=" relay node"> relay node</a>, <a href="https://publications.waset.org/abstracts/search?q=WLAN" title=" WLAN"> WLAN</a> </p> <a href="https://publications.waset.org/abstracts/26280/data-rate-based-grouping-scheme-for-cooperative-communications-in-wireless-lans" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26280.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">466</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">463</span> Minimization of Denial of Services Attacks in Vehicular Adhoc Networking by Applying Different Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amjad%20Khan">Amjad Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The security of Vehicular ad hoc networking is of great importance as it involves serious life threats. Thus to provide secure communication amongst Vehicles on road, the conventional security system is not enough. It is necessary to prevent the network resources from wastage and give them protection against malicious nodes so that to ensure the data bandwidth availability to the legitimate nodes of the network. This work is related to provide a non conventional security system by introducing some constraints to minimize the DoS (Denial of services) especially data and bandwidth. The data packets received by a node in the network will pass through a number of tests and if any of the test fails, the node will drop those data packets and will not forward it anymore. Also if a node claims to be the nearest node for forwarding emergency messages then the sender can effectively identify the true or false status of the claim by using these constraints. Consequently the DoS(Denial of Services) attack is minimized by the instant availability of data without wasting the network resources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=black%20hole%20attack" title="black hole attack">black hole attack</a>, <a href="https://publications.waset.org/abstracts/search?q=grey%20hole%20attack" title=" grey hole attack"> grey hole attack</a>, <a href="https://publications.waset.org/abstracts/search?q=intransient%20traffic%20tempering" title=" intransient traffic tempering"> intransient traffic tempering</a>, <a href="https://publications.waset.org/abstracts/search?q=networking" title=" networking"> networking</a> </p> <a href="https://publications.waset.org/abstracts/14672/minimization-of-denial-of-services-attacks-in-vehicular-adhoc-networking-by-applying-different-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14672.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">462</span> Optimal Planning of Dispatchable Distributed Generators for Power Loss Reduction in Unbalanced Distribution Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahmoud%20M.%20Othman">Mahmoud M. Othman</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20G.%20Hegazy"> Y. G. Hegazy</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Y.%20Abdelaziz"> A. Y. Abdelaziz </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a novel heuristic algorithm that aims to determine the best size and location of distributed generators in unbalanced distribution networks. The proposed heuristic algorithm can deal with the planning cases where power loss is to be optimized without violating the system practical constraints. The distributed generation units in the proposed algorithm is modeled as voltage controlled node with the flexibility to be converted to constant power factor node in case of reactive power limit violation. The proposed algorithm is implemented in MATLAB and tested on the IEEE 37 -node feeder. The results obtained show the effectiveness of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20generation" title="distributed generation">distributed generation</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20approach" title=" heuristic approach"> heuristic approach</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=planning" title=" planning"> planning</a> </p> <a href="https://publications.waset.org/abstracts/31208/optimal-planning-of-dispatchable-distributed-generators-for-power-loss-reduction-in-unbalanced-distribution-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31208.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">524</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">461</span> A Novel PSO Based Decision Tree Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Farzan">Ali Farzan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Classification of data objects or patterns is a major part in most of Decision making systems. One of the popular and commonly used classification methods is Decision Tree (DT). It is a hierarchical decision making system by which a binary tree is constructed and starting from root, at each node some of the classes is rejected until reaching the leaf nods. Each leaf node is a representative of one specific class. Finding the splitting criteria in each node for constructing or training the tree is a major problem. Particle Swarm Optimization (PSO) has been adopted as a metaheuristic searching method for finding the best splitting criteria. Result of evaluating the proposed method over benchmark datasets indicates the higher accuracy of the new PSO based decision tree. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decision%20tree" title="decision tree">decision tree</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=splitting%20criteria" title=" splitting criteria"> splitting criteria</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a> </p> <a href="https://publications.waset.org/abstracts/32425/a-novel-pso-based-decision-tree-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32425.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">406</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">460</span> Survey on Securing the Optimized Link State Routing (OLSR) Protocol in Mobile Ad-hoc Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kimaya%20Subhash%20Gaikwad">Kimaya Subhash Gaikwad</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20B.%20Waykar"> S. B. Waykar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mobile ad-hoc network (MANET) is collection of various types of nodes. In MANET various protocols are used for communication. In OLSR protocol, a node is selected as multipoint relay (MPR) node which broadcast the messages. As the MANET is open kind of network any malicious node can easily enter into the network and affect the performance of the network. The performance of network mainly depends on the components which are taking part into the communication. If the proper nodes are not selected for the communication then the probability of network being attacked is more. Therefore, it is important to select the more reliable and secure components in the network. MANET does not have any filtering so that only selected nodes can be used for communication. The openness of the MANET makes it easier to attack the communication. The most of the attack are on the Quality of service (QoS) of the network. This paper gives the overview of the various attacks that are possible on OLSR protocol and some solutions. The papers focus mainly on the OLSR protocol. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=communication" title="communication">communication</a>, <a href="https://publications.waset.org/abstracts/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/abstracts/search?q=OLSR" title=" OLSR"> OLSR</a>, <a href="https://publications.waset.org/abstracts/search?q=QoS" title=" QoS"> QoS</a> </p> <a href="https://publications.waset.org/abstracts/43772/survey-on-securing-the-optimized-link-state-routing-olsr-protocol-in-mobile-ad-hoc-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43772.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">450</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">459</span> The Effects of External Daminozide (ALAR) Application on Nutrient Contents in Memecik Olive Trees</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sahriye%20Sonmez">Sahriye Sonmez</a>, <a href="https://publications.waset.org/abstracts/search?q=Salih%20Ulger"> Salih Ulger</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Kaplan"> Mustafa Kaplan</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Karhan"> Mustafa Karhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this study was to investigate the effects of external ALAR application on nutrients contents in leaf and node in ‘on (bearing)’ and ‘off (non-bearing)’ years in Memecik olive trees. For this purpose; 2000 mg L-1 ALAR was externally applied to Memecik olive trees, and leaf and node samples from olive trees were taken during the induction, initiation and differentiation periods in ‘on’ and ‘off’ years. Nutrients contents (N, P, K, Ca, Mg, Fe, Mn, Zn and Cu) in leaf and node samples were determined. The K, Ca, Mg, Fe, Mn, Zn and Cu contents were determined by atomic absorption spectrophotometry, Nitrogen by Kjeldahl procedure, and P by a spectrophotometric method. The results showed that the N, Ca, Mg, Fe, Mn, Zn and Cu contents in ‘on’ year were higher than ‘off’ year while the K contents in ‘on’ year were lower than ‘off ‘ year, but the P content was not different. The N, Ca, Mg, Fe and Mn contents in leaf samples were higher in the node samples except for K while the P, Zn and Cu contents were not different. The N, K, Ca, Fe, Mn, Zn and Cu contents were lowest during the initiation period while the P content was highest in this period. The Mg content was not different in all period. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bearing" title="bearing">bearing</a>, <a href="https://publications.waset.org/abstracts/search?q=differentiation%20period" title=" differentiation period"> differentiation period</a>, <a href="https://publications.waset.org/abstracts/search?q=induction%20period" title=" induction period"> induction period</a>, <a href="https://publications.waset.org/abstracts/search?q=initiation%20period" title=" initiation period"> initiation period</a>, <a href="https://publications.waset.org/abstracts/search?q=non%20bearing" title=" non bearing"> non bearing</a>, <a href="https://publications.waset.org/abstracts/search?q=olive" title=" olive"> olive</a> </p> <a href="https://publications.waset.org/abstracts/61328/the-effects-of-external-daminozide-alar-application-on-nutrient-contents-in-memecik-olive-trees" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61328.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">453</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">458</span> Genetic Algorithm Based Node Fault Detection and Recovery in Distributed Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Nalini">N. Nalini</a>, <a href="https://publications.waset.org/abstracts/search?q=Lokesh%20B.%20Bhajantri"> Lokesh B. Bhajantri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Distributed Sensor Networks, the sensor nodes are prone to failure due to energy depletion and some other reasons. In this regard, fault tolerance of network is essential in distributed sensor environment. Energy efficiency, network or topology control and fault-tolerance are the most important issues in the development of next-generation Distributed Sensor Networks (DSNs). This paper proposes a node fault detection and recovery using Genetic Algorithm (GA) in DSN when some of the sensor nodes are faulty. The main objective of this work is to provide fault tolerance mechanism which is energy efficient and responsive to network using GA, which is used to detect the faulty nodes in the network based on the energy depletion of node and link failure between nodes. The proposed fault detection model is used to detect faults at node level and network level faults (link failure and packet error). Finally, the performance parameters for the proposed scheme are evaluated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20sensor%20networks" title="distributed sensor networks">distributed sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detection%20and%20recovery" title=" fault detection and recovery"> fault detection and recovery</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20technology" title=" information technology"> information technology</a> </p> <a href="https://publications.waset.org/abstracts/8901/genetic-algorithm-based-node-fault-detection-and-recovery-in-distributed-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8901.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">452</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">457</span> Node Optimization in Wireless Sensor Network: An Energy Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20B.%20Kirankumar">Y. B. Kirankumar</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20D.%20Mallapur"> J. D. Mallapur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Sensor Network (WSN) is an emerging technology, which has great invention for various low cost applications both for mass public as well as for defence. The wireless sensor communication technology allows random participation of sensor nodes with particular applications to take part in the network, which results in most of the uncovered simulation area, where fewer nodes are located at far distances. The drawback of such network would be that the additional energy is spent by the nodes located in a pattern of dense location, using more number of nodes for a smaller distance of communication adversely in a region with less number of nodes and additional energy is again spent by the source node in order to transmit a packet to neighbours, thereby transmitting the packet to reach the destination. The proposed work is intended to develop Energy Efficient Node Placement Algorithm (EENPA) in order to place the sensor node efficiently in simulated area, where all the nodes are equally located on a radial path to cover maximum area at equidistance. The total energy consumed by each node compared to random placement of nodes is less by having equal burden on fewer nodes of far location, having distributed the nodes in whole of the simulation area. Calculating the network lifetime also proves to be efficient as compared to random placement of nodes, hence increasing the network lifetime, too. Simulation is been carried out in a qualnet simulator, results are obtained on par with random placement of nodes with EENP algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy" title="energy">energy</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20approach" title=" energy approach"> energy approach</a> </p> <a href="https://publications.waset.org/abstracts/6185/node-optimization-in-wireless-sensor-network-an-energy-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6185.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">312</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">456</span> IoT Based Smart Car Parking System Using Node Red</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Armel%20Asongu%20Nkembi">Armel Asongu Nkembi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Fawad"> Ahmad Fawad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we design a smart car parking system using the Node-Red interface, which enables the user to find the nearest parking area from his current location and gives the availability of parking slots in that respective parking area. The closest parking area is determined by sending an HTTP request to an API, and the shortest distance is computed using some mathematical formulations based on the coordinates retrieved. There is also the use of IR sensors to signal the availability or lack of available parking lots within any parking area. The aim is to reduce the time and effort needed to find empty parking lots and also avoid unnecessary traveling through filled parking lots in a parking area. Thus, it reduces fuel consumption, which in turn reduces carbon footprints in the atmosphere and, overall, makes the city much smarter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=node-red" title="node-red">node-red</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20parking%20system" title=" smart parking system"> smart parking system</a>, <a href="https://publications.waset.org/abstracts/search?q=API" title=" API"> API</a>, <a href="https://publications.waset.org/abstracts/search?q=http%20request" title=" http request"> http request</a>, <a href="https://publications.waset.org/abstracts/search?q=IR%20sensors" title=" IR sensors"> IR sensors</a>, <a href="https://publications.waset.org/abstracts/search?q=Internet%20of%20Things" title=" Internet of Things"> Internet of Things</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20city" title=" smart city"> smart city</a>, <a href="https://publications.waset.org/abstracts/search?q=parking%20lots." title=" parking lots."> parking lots.</a> </p> <a href="https://publications.waset.org/abstracts/186024/iot-based-smart-car-parking-system-using-node-red" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186024.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">455</span> Application of Rapidly Exploring Random Tree Star-Smart and G2 Quintic Pythagorean Hodograph Curves to the UAV Path Planning Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Luiz%20G.%20V%C3%A9ras">Luiz G. Véras</a>, <a href="https://publications.waset.org/abstracts/search?q=Felipe%20L.%20Medeiros"> Felipe L. Medeiros</a>, <a href="https://publications.waset.org/abstracts/search?q=Lamartine%20F.%20Guimar%C3%A3es"> Lamartine F. Guimarães</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work approaches the automatic planning of paths for Unmanned Aerial Vehicles (UAVs) through the application of the Rapidly Exploring Random Tree Star-Smart (RRT*-Smart) algorithm. RRT*-Smart is a sampling process of positions of a navigation environment through a tree-type graph. The algorithm consists of randomly expanding a tree from an initial position (root node) until one of its branches reaches the final position of the path to be planned. The algorithm ensures the planning of the shortest path, considering the number of iterations tending to infinity. When a new node is inserted into the tree, each neighbor node of the new node is connected to it, if and only if the extension of the path between the root node and that neighbor node, with this new connection, is less than the current extension of the path between those two nodes. RRT*-smart uses an intelligent sampling strategy to plan less extensive routes by spending a smaller number of iterations. This strategy is based on the creation of samples/nodes near to the convex vertices of the navigation environment obstacles. The planned paths are smoothed through the application of the method called quintic pythagorean hodograph curves. The smoothing process converts a route into a dynamically-viable one based on the kinematic constraints of the vehicle. This smoothing method models the hodograph components of a curve with polynomials that obey the Pythagorean Theorem. Its advantage is that the obtained structure allows computation of the curve length in an exact way, without the need for quadratural techniques for the resolution of integrals. <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=path%20smoothing" title=" path smoothing"> path smoothing</a>, <a href="https://publications.waset.org/abstracts/search?q=Pythagorean%20hodograph%20curve" title=" Pythagorean hodograph curve"> Pythagorean hodograph curve</a>, <a href="https://publications.waset.org/abstracts/search?q=RRT%2A-Smart" title=" RRT*-Smart"> RRT*-Smart</a> </p> <a href="https://publications.waset.org/abstracts/92814/application-of-rapidly-exploring-random-tree-star-smart-and-g2-quintic-pythagorean-hodograph-curves-to-the-uav-path-planning-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92814.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">166</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">454</span> Optimal Allocation of Multiple Emergency Resources for a Single Potential Accident Node: A Mixed Integer Linear Program</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yongjian%20Du">Yongjian Du</a>, <a href="https://publications.waset.org/abstracts/search?q=Jinhua%20Sun"> Jinhua Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Kim%20M.%20Liew"> Kim M. Liew</a>, <a href="https://publications.waset.org/abstracts/search?q=Huahua%20Xiao"> Huahua Xiao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Optimal allocation of emergency resources before a disaster is of great importance for emergency response. In reality, the pre-protection for a single critical node where accidents may occur is common. In this study, a model is developed to determine location and inventory decisions of multiple emergency resources among a set of candidate stations to minimize the total cost based on the constraints of budgetary and capacity. The total cost includes the economic accident loss which is accorded with probability distribution of time and the warehousing cost of resources which is increasing over time. A ratio is set to measure the degree of a storage station only serving the target node that becomes larger with the decrease of the distance between them. For the application of linear program, it is assumed that the length of travel time to the accident scene of emergency resources has a linear relationship with the economic accident loss. A computational experiment is conducted to illustrate how the proposed model works, and the results indicate its effectiveness and practicability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=emergency%20response" title="emergency response">emergency response</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20linear%20program" title=" integer linear program"> integer linear program</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20emergency%20resources" title=" multiple emergency resources"> multiple emergency resources</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-allocation%20decisions" title=" pre-allocation decisions"> pre-allocation decisions</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20potential%20accident%20node" title=" single potential accident node"> single potential accident node</a> </p> <a href="https://publications.waset.org/abstracts/107564/optimal-allocation-of-multiple-emergency-resources-for-a-single-potential-accident-node-a-mixed-integer-linear-program" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107564.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">153</span> </span> </div> </div> <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=node%20MCU&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&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=node%20MCU&page=16">16</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&page=17">17</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=node%20MCU&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>